/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:38:06,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:38:06,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:38:06,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:38:06,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:38:06,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:38:06,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:38:06,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:38:06,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:38:06,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:38:06,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:38:06,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:38:06,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:38:06,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:38:06,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:38:06,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:38:06,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:38:06,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:38:06,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:38:06,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:38:06,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:38:06,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:38:06,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:38:06,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:38:06,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:38:06,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:38:06,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:38:06,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:38:06,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:38:06,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:38:06,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:38:06,863 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:38:06,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:38:06,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:38:06,866 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:38:06,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:38:06,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:38:06,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:38:06,867 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:38:06,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:38:06,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:38:06,869 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:38:06,883 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:38:06,883 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:38:06,884 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:38:06,884 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:38:06,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:38:06,885 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:38:06,885 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:38:06,885 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:38:06,885 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:38:06,886 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:38:06,886 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:38:06,886 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:38:06,886 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:38:06,886 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:38:06,886 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:38:06,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:38:06,887 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:38:06,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:38:06,887 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:38:06,887 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:38:06,887 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:38:06,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:38:06,888 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:38:06,888 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:38:06,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:38:06,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:38:06,889 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:38:06,889 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:38:06,889 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:38:07,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:38:07,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:38:07,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:38:07,070 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:38:07,070 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:38:07,071 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:38:07,139 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_ePYrjl/tmp/4aeab2ed67ba4755ab3e85ad0036fd55/FLAG5525a884a [2020-07-01 12:38:07,470 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:38:07,471 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:38:07,471 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:38:07,477 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_ePYrjl/tmp/4aeab2ed67ba4755ab3e85ad0036fd55/FLAG5525a884a [2020-07-01 12:38:07,877 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_ePYrjl/tmp/4aeab2ed67ba4755ab3e85ad0036fd55 [2020-07-01 12:38:07,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:38:07,889 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:38:07,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:38:07,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:38:07,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:38:07,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:38:07" (1/1) ... [2020-07-01 12:38:07,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c4c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:07, skipping insertion in model container [2020-07-01 12:38:07,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:38:07" (1/1) ... [2020-07-01 12:38:07,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:38:07,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:38:08,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:38:08,172 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:38:08,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:38:08,206 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:38:08,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08 WrapperNode [2020-07-01 12:38:08,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:38:08,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:38:08,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:38:08,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:38:08,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,227 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:38:08,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:38:08,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:38:08,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:38:08,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:38:08,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:38:08,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:38:08,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:38:08,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:38:08,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:38:08,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:38:08,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:38:08,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:38:08,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:38:08,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:38:08,669 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:38:08,670 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:38:08,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:38:08 BoogieIcfgContainer [2020-07-01 12:38:08,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:38:08,674 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:38:08,674 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:38:08,676 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:38:08,677 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:38:08" (1/1) ... [2020-07-01 12:38:08,693 INFO L313 BlockEncoder]: Initial Icfg 53 locations, 54 edges [2020-07-01 12:38:08,695 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:38:08,695 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:38:08,696 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:38:08,696 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:38:08,698 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:38:08,699 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:38:08,699 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:38:08,728 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:38:08,774 INFO L200 BlockEncoder]: SBE split 29 edges [2020-07-01 12:38:08,779 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:38:08,781 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:38:08,816 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 12:38:08,819 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:38:08,820 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:38:08,821 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:38:08,821 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:38:08,822 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:38:08,822 INFO L313 BlockEncoder]: Encoded RCFG 45 locations, 88 edges [2020-07-01 12:38:08,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:38:08 BasicIcfg [2020-07-01 12:38:08,823 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:38:08,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:38:08,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:38:08,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:38:08,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:38:07" (1/4) ... [2020-07-01 12:38:08,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21768215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:38:08, skipping insertion in model container [2020-07-01 12:38:08,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (2/4) ... [2020-07-01 12:38:08,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21768215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:38:08, skipping insertion in model container [2020-07-01 12:38:08,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:38:08" (3/4) ... [2020-07-01 12:38:08,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21768215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:38:08, skipping insertion in model container [2020-07-01 12:38:08,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:38:08" (4/4) ... [2020-07-01 12:38:08,831 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:38:08,842 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:38:08,850 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2020-07-01 12:38:08,863 INFO L251 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2020-07-01 12:38:08,887 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:38:08,887 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:38:08,887 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:38:08,887 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:38:08,888 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:38:08,888 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:38:08,888 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:38:08,888 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:38:08,904 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-07-01 12:38:08,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:38:08,910 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:08,911 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:38:08,911 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:08,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:08,917 INFO L82 PathProgramCache]: Analyzing trace with hash 115641, now seen corresponding path program 1 times [2020-07-01 12:38:08,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:08,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130958920] [2020-07-01 12:38:08,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:09,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:09,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130958920] [2020-07-01 12:38:09,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:09,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:38:09,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934898172] [2020-07-01 12:38:09,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:38:09,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:09,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:38:09,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:09,115 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2020-07-01 12:38:09,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:09,309 INFO L93 Difference]: Finished difference Result 88 states and 159 transitions. [2020-07-01 12:38:09,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:38:09,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:38:09,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:09,324 INFO L225 Difference]: With dead ends: 88 [2020-07-01 12:38:09,324 INFO L226 Difference]: Without dead ends: 45 [2020-07-01 12:38:09,328 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-01 12:38:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-01 12:38:09,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-01 12:38:09,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 73 transitions. [2020-07-01 12:38:09,369 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 73 transitions. Word has length 3 [2020-07-01 12:38:09,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:09,369 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 73 transitions. [2020-07-01 12:38:09,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:38:09,370 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 73 transitions. [2020-07-01 12:38:09,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:38:09,370 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:09,370 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:38:09,372 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:38:09,372 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:09,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:09,373 INFO L82 PathProgramCache]: Analyzing trace with hash 115424, now seen corresponding path program 1 times [2020-07-01 12:38:09,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:09,373 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708045215] [2020-07-01 12:38:09,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:09,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:09,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708045215] [2020-07-01 12:38:09,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:09,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:38:09,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548398219] [2020-07-01 12:38:09,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:38:09,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:09,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:38:09,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:09,460 INFO L87 Difference]: Start difference. First operand 45 states and 73 transitions. Second operand 3 states. [2020-07-01 12:38:09,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:09,585 INFO L93 Difference]: Finished difference Result 45 states and 73 transitions. [2020-07-01 12:38:09,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:38:09,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:38:09,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:09,588 INFO L225 Difference]: With dead ends: 45 [2020-07-01 12:38:09,588 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 12:38:09,589 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:09,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 12:38:09,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-01 12:38:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 12:38:09,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 69 transitions. [2020-07-01 12:38:09,595 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 69 transitions. Word has length 3 [2020-07-01 12:38:09,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:09,595 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 69 transitions. [2020-07-01 12:38:09,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:38:09,595 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2020-07-01 12:38:09,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:38:09,596 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:09,596 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:38:09,596 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:38:09,596 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:09,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:09,597 INFO L82 PathProgramCache]: Analyzing trace with hash 115426, now seen corresponding path program 1 times [2020-07-01 12:38:09,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:09,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168153323] [2020-07-01 12:38:09,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:09,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168153323] [2020-07-01 12:38:09,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:09,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:38:09,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440949678] [2020-07-01 12:38:09,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:38:09,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:09,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:38:09,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:09,648 INFO L87 Difference]: Start difference. First operand 43 states and 69 transitions. Second operand 3 states. [2020-07-01 12:38:09,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:09,773 INFO L93 Difference]: Finished difference Result 43 states and 69 transitions. [2020-07-01 12:38:09,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:38:09,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:38:09,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:09,774 INFO L225 Difference]: With dead ends: 43 [2020-07-01 12:38:09,775 INFO L226 Difference]: Without dead ends: 41 [2020-07-01 12:38:09,775 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:09,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-01 12:38:09,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-01 12:38:09,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 12:38:09,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 65 transitions. [2020-07-01 12:38:09,780 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 65 transitions. Word has length 3 [2020-07-01 12:38:09,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:09,781 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 65 transitions. [2020-07-01 12:38:09,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:38:09,781 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 65 transitions. [2020-07-01 12:38:09,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:38:09,781 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:09,781 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:38:09,782 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:38:09,782 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:09,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:09,782 INFO L82 PathProgramCache]: Analyzing trace with hash 3575803, now seen corresponding path program 1 times [2020-07-01 12:38:09,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:09,783 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296156300] [2020-07-01 12:38:09,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:09,823 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296156300] [2020-07-01 12:38:09,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:09,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:38:09,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573633166] [2020-07-01 12:38:09,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:38:09,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:09,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:38:09,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:09,825 INFO L87 Difference]: Start difference. First operand 41 states and 65 transitions. Second operand 3 states. [2020-07-01 12:38:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:09,950 INFO L93 Difference]: Finished difference Result 41 states and 65 transitions. [2020-07-01 12:38:09,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:38:09,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:38:09,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:09,951 INFO L225 Difference]: With dead ends: 41 [2020-07-01 12:38:09,952 INFO L226 Difference]: Without dead ends: 37 [2020-07-01 12:38:09,952 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:09,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-01 12:38:09,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-01 12:38:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 12:38:09,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 57 transitions. [2020-07-01 12:38:09,956 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 57 transitions. Word has length 4 [2020-07-01 12:38:09,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:09,957 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 57 transitions. [2020-07-01 12:38:09,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:38:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 57 transitions. [2020-07-01 12:38:09,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:38:09,957 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:09,958 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:38:09,958 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:38:09,958 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:09,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:09,958 INFO L82 PathProgramCache]: Analyzing trace with hash 3575805, now seen corresponding path program 1 times [2020-07-01 12:38:09,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:09,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208023314] [2020-07-01 12:38:09,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:10,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:10,014 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208023314] [2020-07-01 12:38:10,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:10,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:38:10,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068424359] [2020-07-01 12:38:10,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:38:10,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:10,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:38:10,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,016 INFO L87 Difference]: Start difference. First operand 37 states and 57 transitions. Second operand 3 states. [2020-07-01 12:38:10,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:10,107 INFO L93 Difference]: Finished difference Result 37 states and 57 transitions. [2020-07-01 12:38:10,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:38:10,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:38:10,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:10,109 INFO L225 Difference]: With dead ends: 37 [2020-07-01 12:38:10,109 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:38:10,109 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:38:10,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 12:38:10,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:38:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2020-07-01 12:38:10,114 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 4 [2020-07-01 12:38:10,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:10,114 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2020-07-01 12:38:10,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:38:10,114 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2020-07-01 12:38:10,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:38:10,115 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:10,115 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:38:10,115 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:38:10,115 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:10,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:10,116 INFO L82 PathProgramCache]: Analyzing trace with hash 110847217, now seen corresponding path program 1 times [2020-07-01 12:38:10,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:10,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609096760] [2020-07-01 12:38:10,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:10,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:10,153 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609096760] [2020-07-01 12:38:10,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:10,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:38:10,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259232638] [2020-07-01 12:38:10,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:38:10,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:10,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:38:10,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,155 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 3 states. [2020-07-01 12:38:10,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:10,206 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2020-07-01 12:38:10,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:38:10,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:38:10,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:10,207 INFO L225 Difference]: With dead ends: 37 [2020-07-01 12:38:10,207 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:38:10,208 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:38:10,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 12:38:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:38:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2020-07-01 12:38:10,212 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 5 [2020-07-01 12:38:10,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:10,213 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2020-07-01 12:38:10,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:38:10,213 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2020-07-01 12:38:10,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:38:10,214 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:10,214 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:38:10,214 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:38:10,214 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:10,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:10,215 INFO L82 PathProgramCache]: Analyzing trace with hash 110847218, now seen corresponding path program 1 times [2020-07-01 12:38:10,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:10,215 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675387105] [2020-07-01 12:38:10,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:10,258 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675387105] [2020-07-01 12:38:10,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:10,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:38:10,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679122507] [2020-07-01 12:38:10,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:38:10,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:10,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:38:10,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,259 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand 3 states. [2020-07-01 12:38:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:10,331 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2020-07-01 12:38:10,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:38:10,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:38:10,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:10,332 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:38:10,332 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:38:10,333 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:38:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-01 12:38:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-01 12:38:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2020-07-01 12:38:10,336 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 5 [2020-07-01 12:38:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:10,336 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2020-07-01 12:38:10,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:38:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2020-07-01 12:38:10,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:38:10,337 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:10,337 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:38:10,338 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:38:10,338 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:10,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:10,338 INFO L82 PathProgramCache]: Analyzing trace with hash 110847215, now seen corresponding path program 1 times [2020-07-01 12:38:10,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:10,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956013830] [2020-07-01 12:38:10,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:10,369 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956013830] [2020-07-01 12:38:10,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:10,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:38:10,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822529387] [2020-07-01 12:38:10,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:38:10,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:10,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:38:10,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,371 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2020-07-01 12:38:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:10,433 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2020-07-01 12:38:10,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:38:10,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:38:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:10,434 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:38:10,434 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 12:38:10,435 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 12:38:10,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-01 12:38:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:38:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2020-07-01 12:38:10,438 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 5 [2020-07-01 12:38:10,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:10,438 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-07-01 12:38:10,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:38:10,439 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2020-07-01 12:38:10,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:38:10,439 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:10,439 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:38:10,439 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:38:10,439 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:10,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:10,440 INFO L82 PathProgramCache]: Analyzing trace with hash -858705592, now seen corresponding path program 1 times [2020-07-01 12:38:10,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:10,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893460704] [2020-07-01 12:38:10,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:10,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:10,468 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893460704] [2020-07-01 12:38:10,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:10,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:38:10,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746285310] [2020-07-01 12:38:10,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:38:10,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:10,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:38:10,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,470 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 3 states. [2020-07-01 12:38:10,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:10,514 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2020-07-01 12:38:10,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:38:10,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:38:10,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:10,516 INFO L225 Difference]: With dead ends: 25 [2020-07-01 12:38:10,516 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 12:38:10,516 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 12:38:10,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-01 12:38:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 12:38:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-01 12:38:10,519 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 6 [2020-07-01 12:38:10,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:10,520 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-01 12:38:10,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:38:10,520 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-01 12:38:10,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:38:10,520 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:10,520 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:38:10,520 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:38:10,521 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:10,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:10,521 INFO L82 PathProgramCache]: Analyzing trace with hash -858705590, now seen corresponding path program 1 times [2020-07-01 12:38:10,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:10,521 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863857320] [2020-07-01 12:38:10,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:10,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:10,551 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863857320] [2020-07-01 12:38:10,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:10,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:38:10,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948687554] [2020-07-01 12:38:10,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:38:10,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:10,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:38:10,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,553 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2020-07-01 12:38:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:10,579 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2020-07-01 12:38:10,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:38:10,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:38:10,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:10,580 INFO L225 Difference]: With dead ends: 25 [2020-07-01 12:38:10,580 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 12:38:10,581 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 12:38:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-01 12:38:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 12:38:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2020-07-01 12:38:10,584 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 6 [2020-07-01 12:38:10,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:10,584 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2020-07-01 12:38:10,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:38:10,584 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-01 12:38:10,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:38:10,585 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:38:10,585 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:38:10,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:38:10,585 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:38:10,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:10,586 INFO L82 PathProgramCache]: Analyzing trace with hash -858705589, now seen corresponding path program 1 times [2020-07-01 12:38:10,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:10,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272155660] [2020-07-01 12:38:10,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:10,618 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272155660] [2020-07-01 12:38:10,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:10,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:38:10,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291190234] [2020-07-01 12:38:10,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:38:10,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:10,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:38:10,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,620 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 3 states. [2020-07-01 12:38:10,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:10,649 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-01 12:38:10,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:38:10,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:38:10,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:38:10,649 INFO L225 Difference]: With dead ends: 21 [2020-07-01 12:38:10,650 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:38:10,650 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:10,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:38:10,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:38:10,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:38:10,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:38:10,651 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2020-07-01 12:38:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:38:10,651 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:38:10,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:38:10,652 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:38:10,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:38:10,652 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 12:38:10,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:38:10,697 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 12:38:10,698 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 12:38:10,698 INFO L268 CegarLoopResult]: For program point L15-2(lines 15 19) no Hoare annotation was computed. [2020-07-01 12:38:10,698 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:38:10,698 INFO L264 CegarLoopResult]: At program point L15-4(lines 14 19) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (<= 1 |#StackHeapBarrier|) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= 0 ULTIMATE.start_test_fun_~z_ref~0.offset) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~z_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~z_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 12:38:10,698 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-01 12:38:10,699 INFO L268 CegarLoopResult]: For program point L15-5(lines 15 19) no Hoare annotation was computed. [2020-07-01 12:38:10,699 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:38:10,699 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:38:10,699 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:38:10,699 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:38:10,699 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:38:10,699 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:38:10,699 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:38:10,700 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:38:10,700 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:38:10,700 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:38:10,700 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:38:10,700 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 12:38:10,700 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 12:38:10,700 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:38:10,700 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:38:10,701 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:38:10,701 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:38:10,701 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:38:10,701 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:38:10,701 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 12:38:10,701 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 12:38:10,701 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 12:38:10,701 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:38:10,701 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:38:10,702 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:38:10,702 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:38:10,702 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:38:10,702 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:38:10,702 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:38:10,702 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 12:38:10,702 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:38:10,702 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-01 12:38:10,703 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:38:10,703 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:38:10,703 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:38:10,703 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:38:10,703 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:38:10,703 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:38:10,706 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:38:10,716 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:10,717 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:38:10,717 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:10,717 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:10,718 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:10,724 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:10,724 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:38:10,725 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:10,725 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:10,725 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:10,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:38:10 BasicIcfg [2020-07-01 12:38:10,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:38:10,728 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:38:10,728 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:38:10,732 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:38:10,733 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:38:10,733 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:38:07" (1/5) ... [2020-07-01 12:38:10,733 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ff6742d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:38:10, skipping insertion in model container [2020-07-01 12:38:10,733 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:38:10,734 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:38:08" (2/5) ... [2020-07-01 12:38:10,734 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ff6742d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:38:10, skipping insertion in model container [2020-07-01 12:38:10,734 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:38:10,734 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:38:08" (3/5) ... [2020-07-01 12:38:10,734 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ff6742d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:38:10, skipping insertion in model container [2020-07-01 12:38:10,735 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:38:10,735 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:38:08" (4/5) ... [2020-07-01 12:38:10,735 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ff6742d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:38:10, skipping insertion in model container [2020-07-01 12:38:10,735 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:38:10,735 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:38:10" (5/5) ... [2020-07-01 12:38:10,737 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:38:10,759 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:38:10,760 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:38:10,760 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:38:10,760 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:38:10,760 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:38:10,760 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:38:10,760 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:38:10,760 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:38:10,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states. [2020-07-01 12:38:10,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 12:38:10,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:38:10,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:38:10,777 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:38:10,777 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:10,777 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:38:10,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states. [2020-07-01 12:38:10,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 12:38:10,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:38:10,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:38:10,781 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:38:10,781 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:38:10,787 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue [84] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 17#L-1true [159] L-1-->L11: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (and (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 (select |v_#valid_7| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~z_1| |v_ULTIMATE.start_main_#t~nondet13_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= 0 (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (= |v_#length_1| (store (store (store (store |v_#length_5| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4)) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet12_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~z_1 |v_ULTIMATE.start_test_fun_#in~z_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~z_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_1, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~z=|v_ULTIMATE.start_test_fun_#in~z_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~ret14=|v_ULTIMATE.start_main_#t~ret14_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~z, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_~z_ref~0.base, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~z, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_~z_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_main_#t~ret14, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 39#L11true [85] L11-->L11-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (= 1 (select |v_#valid_8| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 35#L11-1true [78] L11-1-->L12: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (= 1 (select |v_#valid_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 21#L12true [105] L12-->L13: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_3) (= 1 (select |v_#valid_12| v_ULTIMATE.start_test_fun_~z_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~z_ref~0.base_3) v_ULTIMATE.start_test_fun_~z_ref~0.offset_3 v_ULTIMATE.start_test_fun_~z_3)) |v_#memory_int_5|)) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_3, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_test_fun_~z=v_ULTIMATE.start_test_fun_~z_3, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 43#L13true [116] L13-->L15-4: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_14| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0))) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} OutVars{#memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_14|} AuxVars[] AssignedVars[#memory_int] 40#L15-4true [2020-07-01 12:38:10,788 INFO L796 eck$LassoCheckResult]: Loop: 40#L15-4true [89] L15-4-->L15: Formula: (and (= 1 (select |v_#valid_16| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_14| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_14|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 26#L15true [75] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= 1 (select |v_#valid_18| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 46#L15-1true [94] L15-1-->L15-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_5) (= (select |v_#valid_20| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) 1) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~z_ref~0.base_6) v_ULTIMATE.start_test_fun_~z_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_5 4) (select |v_#length_18| v_ULTIMATE.start_test_fun_~z_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_20|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_6, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_11|, #length=|v_#length_18|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 44#L15-2true [93] L15-2-->L16: Formula: (< (+ |v_ULTIMATE.start_test_fun_#t~mem5_6| |v_ULTIMATE.start_test_fun_#t~mem4_6|) |v_ULTIMATE.start_test_fun_#t~mem6_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem6] 6#L16true [100] L16-->L16-1: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_20| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem7_2|) (= 1 (select |v_#valid_22| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_22|} OutVars{#valid=|v_#valid_22|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 3#L16-1true [223] L16-1-->L17: Formula: (and (= (store |v_#memory_int_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_24| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| 1))) |v_#memory_int_23|) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (= 1 (select |v_#valid_43| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11)) InVars {#valid=|v_#valid_43|, #memory_int=|v_#memory_int_24|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{#valid=|v_#valid_43|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 30#L17true [113] L17-->L17-1: Formula: (and (= 1 (select |v_#valid_26| v_ULTIMATE.start_test_fun_~z_ref~0.base_9)) (= (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~z_ref~0.base_9) v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_7 4) (select |v_#length_24| v_ULTIMATE.start_test_fun_~z_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_24|, ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_26|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_9, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_15|, #length=|v_#length_24|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 28#L17-1true [227] L17-1-->L18: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 4) (select |v_#length_39| v_ULTIMATE.start_test_fun_~z_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~z_ref~0.offset_11) (= (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~z_ref~0.base_15 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~z_ref~0.base_15) v_ULTIMATE.start_test_fun_~z_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| 1))) |v_#memory_int_28|) (= 1 (select |v_#valid_50| v_ULTIMATE.start_test_fun_~z_ref~0.base_15))) InVars {ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_29|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} OutVars{ULTIMATE.start_test_fun_~z_ref~0.base=v_ULTIMATE.start_test_fun_~z_ref~0.base_15, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_28|, #length=|v_#length_39|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~z_ref~0.offset=v_ULTIMATE.start_test_fun_~z_ref~0.offset_11} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 13#L18true [70] L18-->L18-1: Formula: (and (= 1 (select |v_#valid_30| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem9_2| (select (select |v_#memory_int_18| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_28| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_18|, #length=|v_#length_28|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 11#L18-1true [228] L18-1-->L15-4: Formula: (and (= 1 (select |v_#valid_51| v_ULTIMATE.start_test_fun_~c~0.base_19)) (= (store |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_31| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem9_6| 1))) |v_#memory_int_30|) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_40| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_31|, #length=|v_#length_40|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_30|, #length=|v_#length_40|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 40#L15-4true [2020-07-01 12:38:10,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:10,789 INFO L82 PathProgramCache]: Analyzing trace with hash -853164528, now seen corresponding path program 1 times [2020-07-01 12:38:10,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:10,790 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159014490] [2020-07-01 12:38:10,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:38:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:38:10,813 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159014490] [2020-07-01 12:38:10,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:38:10,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:38:10,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312849679] [2020-07-01 12:38:10,814 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:38:10,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:38:10,815 INFO L82 PathProgramCache]: Analyzing trace with hash 99442493, now seen corresponding path program 1 times [2020-07-01 12:38:10,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:38:10,815 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658895264] [2020-07-01 12:38:10,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:38:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:38:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:38:10,860 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:38:11,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:38:11,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:38:11,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:38:11,051 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2020-07-01 12:38:11,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:38:11,156 INFO L93 Difference]: Finished difference Result 45 states and 73 transitions. [2020-07-01 12:38:11,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:38:11,159 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:38:11,163 INFO L168 Benchmark]: Toolchain (without parser) took 3273.24 ms. Allocated memory was 514.9 MB in the beginning and 597.2 MB in the end (delta: 82.3 MB). Free memory was 438.6 MB in the beginning and 543.2 MB in the end (delta: -104.6 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:38:11,163 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:38:11,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.25 ms. Allocated memory was 514.9 MB in the beginning and 559.9 MB in the end (delta: 45.1 MB). Free memory was 438.6 MB in the beginning and 526.1 MB in the end (delta: -87.5 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:38:11,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.54 ms. Allocated memory is still 559.9 MB. Free memory was 526.1 MB in the beginning and 524.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:38:11,165 INFO L168 Benchmark]: Boogie Preprocessor took 25.41 ms. Allocated memory is still 559.9 MB. Free memory was 524.0 MB in the beginning and 522.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:38:11,166 INFO L168 Benchmark]: RCFGBuilder took 397.50 ms. Allocated memory is still 559.9 MB. Free memory was 522.7 MB in the beginning and 497.1 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:38:11,166 INFO L168 Benchmark]: BlockEncodingV2 took 148.67 ms. Allocated memory is still 559.9 MB. Free memory was 497.1 MB in the beginning and 483.5 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:38:11,167 INFO L168 Benchmark]: TraceAbstraction took 1903.69 ms. Allocated memory was 559.9 MB in the beginning and 585.6 MB in the end (delta: 25.7 MB). Free memory was 482.9 MB in the beginning and 409.8 MB in the end (delta: 73.1 MB). Peak memory consumption was 98.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:38:11,168 INFO L168 Benchmark]: BuchiAutomizer took 432.30 ms. Allocated memory was 585.6 MB in the beginning and 597.2 MB in the end (delta: 11.5 MB). Free memory was 409.8 MB in the beginning and 543.2 MB in the end (delta: -133.4 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:38:11,171 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 53 locations, 54 edges - StatisticsResult: Encoded RCFG 45 locations, 88 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 317.25 ms. Allocated memory was 514.9 MB in the beginning and 559.9 MB in the end (delta: 45.1 MB). Free memory was 438.6 MB in the beginning and 526.1 MB in the end (delta: -87.5 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.54 ms. Allocated memory is still 559.9 MB. Free memory was 526.1 MB in the beginning and 524.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.41 ms. Allocated memory is still 559.9 MB. Free memory was 524.0 MB in the beginning and 522.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 50.3 GB. * RCFGBuilder took 397.50 ms. Allocated memory is still 559.9 MB. Free memory was 522.7 MB in the beginning and 497.1 MB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 148.67 ms. Allocated memory is still 559.9 MB. Free memory was 497.1 MB in the beginning and 483.5 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1903.69 ms. Allocated memory was 559.9 MB in the beginning and 585.6 MB in the end (delta: 25.7 MB). Free memory was 482.9 MB in the beginning and 409.8 MB in the end (delta: 73.1 MB). Peak memory consumption was 98.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 432.30 ms. Allocated memory was 585.6 MB in the beginning and 597.2 MB in the end (delta: 11.5 MB). Free memory was 409.8 MB in the beginning and 543.2 MB in the end (delta: -133.4 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-07-01 12:38:11,181 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:11,181 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:38:11,181 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:11,182 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:11,182 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:11,183 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:11,183 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:38:11,183 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:11,184 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:38:11,184 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((1 == \valid[x_ref] && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 0 == z_ref) && 1 == \valid[y_ref]) && 1 == \valid[z_ref]) && 1 == \valid[c]) && 4 == unknown-#length-unknown[c]) && y_ref == 0) && 4 == unknown-#length-unknown[z_ref]) && 0 == x_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 28 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.7s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 54 SDtfs, 457 SDslu, 6 SDs, 0 SdLazy, 445 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 56 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 701 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:38:04.673 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_ePYrjl/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:38:11.408 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check