./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Sequence-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Sequence-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d628f3524885345eb9e2318f2d0dbb026e233c3bcc51319b2ad8fc1a71d35580 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-15 00:16:02,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:16:02,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-15 00:16:02,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:16:02,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:16:02,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:16:02,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:16:02,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:16:02,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:16:02,668 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:16:02,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:16:02,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:16:02,671 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:16:02,671 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:16:02,671 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:16:02,672 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:16:02,672 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:16:02,672 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:16:02,672 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:16:02,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:16:02,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:16:02,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:16:02,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:16:02,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:16:02,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:16:02,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:16:02,678 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:16:02,679 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:16:02,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:16:02,679 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:16:02,679 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:16:02,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:16:02,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:16:02,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:16:02,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:16:02,681 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:16:02,681 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d628f3524885345eb9e2318f2d0dbb026e233c3bcc51319b2ad8fc1a71d35580 [2024-10-15 00:16:03,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:16:03,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:16:03,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:16:03,047 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:16:03,048 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:16:03,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Sequence-alloca.i [2024-10-15 00:16:04,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:16:04,916 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:16:04,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Sequence-alloca.i [2024-10-15 00:16:04,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4a317b8/b2ba171e2d8e41a1b931a0194043d5f0/FLAGe349ca35d [2024-10-15 00:16:05,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b4a317b8/b2ba171e2d8e41a1b931a0194043d5f0 [2024-10-15 00:16:05,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:16:05,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:16:05,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:16:05,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:16:05,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:16:05,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:16:05" (1/1) ... [2024-10-15 00:16:05,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ffdbcdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:16:05, skipping insertion in model container [2024-10-15 00:16:05,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:16:05" (1/1) ... [2024-10-15 00:16:05,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:16:05,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:16:05,603 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:16:05,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:16:05,676 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:16:05,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:16:05 WrapperNode [2024-10-15 00:16:05,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:16:05,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:16:05,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:16:05,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:16:05,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:16:05" (1/1) ... [2024-10-15 00:16:05,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:16:05" (1/1) ... [2024-10-15 00:16:05,723 INFO L138 Inliner]: procedures = 109, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-10-15 00:16:05,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:16:05,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:16:05,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:16:05,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:16:05,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:16:05" (1/1) ... [2024-10-15 00:16:05,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:16:05" (1/1) ... [2024-10-15 00:16:05,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:16:05" (1/1) ... [2024-10-15 00:16:05,757 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [6, 4, 4]. 43 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 7 writes are split as follows [3, 2, 2]. [2024-10-15 00:16:05,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:16:05" (1/1) ... [2024-10-15 00:16:05,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:16:05" (1/1) ... [2024-10-15 00:16:05,763 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:16:05" (1/1) ... [2024-10-15 00:16:05,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:16:05" (1/1) ... [2024-10-15 00:16:05,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:16:05" (1/1) ... [2024-10-15 00:16:05,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:16:05" (1/1) ... [2024-10-15 00:16:05,771 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:16:05,772 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:16:05,773 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:16:05,773 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:16:05,774 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:16:05" (1/1) ... [2024-10-15 00:16:05,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:05,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:05,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:05,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-15 00:16:05,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 00:16:05,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-15 00:16:05,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-15 00:16:05,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 00:16:05,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-15 00:16:05,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-15 00:16:05,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-15 00:16:05,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 00:16:05,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:16:05,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:16:06,019 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:16:06,021 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:16:06,162 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-15 00:16:06,163 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:16:06,175 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:16:06,176 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 00:16:06,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:16:06 BoogieIcfgContainer [2024-10-15 00:16:06,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:16:06,178 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:16:06,178 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:16:06,183 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:16:06,184 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:16:06,184 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:16:05" (1/3) ... [2024-10-15 00:16:06,186 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@aeffdea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:16:06, skipping insertion in model container [2024-10-15 00:16:06,186 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:16:06,186 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:16:05" (2/3) ... [2024-10-15 00:16:06,186 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@aeffdea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:16:06, skipping insertion in model container [2024-10-15 00:16:06,187 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:16:06,187 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:16:06" (3/3) ... [2024-10-15 00:16:06,189 INFO L332 chiAutomizerObserver]: Analyzing ICFG java_Sequence-alloca.i [2024-10-15 00:16:06,268 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:16:06,268 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:16:06,268 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:16:06,270 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:16:06,270 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:16:06,270 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:16:06,270 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:16:06,270 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:16:06,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:06,298 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:16:06,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:06,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:06,304 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:16:06,304 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:16:06,304 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:16:06,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:06,306 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-15 00:16:06,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:06,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:06,308 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-15 00:16:06,308 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:16:06,316 INFO L745 eck$LassoCheckResult]: Stem: 12#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 4#L552-4true [2024-10-15 00:16:06,318 INFO L747 eck$LassoCheckResult]: Loop: 4#L552-4true call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 9#L552-1true assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 3#L552-3true call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 4#L552-4true [2024-10-15 00:16:06,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:06,324 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-15 00:16:06,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:06,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115338233] [2024-10-15 00:16:06,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:06,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:06,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:06,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:06,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:06,562 INFO L85 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2024-10-15 00:16:06,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:06,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570971793] [2024-10-15 00:16:06,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:06,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:06,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:06,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:06,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:06,598 INFO L85 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2024-10-15 00:16:06,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:06,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437926344] [2024-10-15 00:16:06,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:06,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:06,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:06,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:07,421 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:16:07,422 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:16:07,422 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:16:07,423 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:16:07,423 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:16:07,423 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:07,423 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:16:07,424 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:16:07,424 INFO L132 ssoRankerPreferences]: Filename of dumped script: java_Sequence-alloca.i_Iteration1_Lasso [2024-10-15 00:16:07,424 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:16:07,424 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:16:07,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:07,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:16:08,145 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:16:08,149 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:16:08,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:08,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:08,153 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:08,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-15 00:16:08,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:08,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:08,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:08,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:08,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:08,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:08,173 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:08,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:08,175 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:08,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:08,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:08,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:08,192 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:08,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-15 00:16:08,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:08,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:08,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:08,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:08,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:08,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:08,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:08,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:08,210 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:08,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-15 00:16:08,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:08,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:08,228 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:08,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-15 00:16:08,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:08,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:08,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:08,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:08,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:08,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:08,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:08,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:08,248 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:08,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:08,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:08,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:08,263 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:08,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-15 00:16:08,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:08,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:08,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:08,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:08,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:08,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:08,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:08,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:08,279 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:08,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:08,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:08,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:08,292 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:08,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-15 00:16:08,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:08,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:08,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:08,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:08,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:08,314 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:08,314 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:08,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:08,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-15 00:16:08,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:08,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:08,368 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:08,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-15 00:16:08,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:08,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:08,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:08,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:08,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:08,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:08,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:08,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:08,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-15 00:16:08,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:08,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:08,415 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:08,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-15 00:16:08,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:08,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:08,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:08,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:08,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:08,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:08,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:08,437 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:08,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:08,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:08,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:08,457 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:08,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-15 00:16:08,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:08,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:08,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:08,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:08,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:08,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:08,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:08,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:08,476 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:08,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-15 00:16:08,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:08,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:08,492 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:08,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-15 00:16:08,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:08,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:08,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:08,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:08,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:08,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:08,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:08,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:08,510 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:08,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-15 00:16:08,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:08,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:08,526 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:08,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-15 00:16:08,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:08,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:08,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:16:08,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:08,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:08,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:08,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:16:08,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:16:08,545 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:08,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:08,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:08,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:08,561 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:08,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-15 00:16:08,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:08,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:08,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:08,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:08,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:08,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:08,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:08,583 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:08,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:08,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:08,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:08,598 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:08,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-15 00:16:08,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:08,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:08,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:08,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:08,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:08,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:08,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:08,623 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:08,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-15 00:16:08,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:08,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:08,642 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:08,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-15 00:16:08,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:08,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:08,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:08,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:08,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:08,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:08,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:08,669 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:16:08,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-15 00:16:08,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:08,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:08,688 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:08,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-15 00:16:08,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:16:08,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:16:08,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:16:08,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:16:08,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:16:08,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:16:08,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:16:08,713 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:16:08,726 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-15 00:16:08,726 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-10-15 00:16:08,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:16:08,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:08,748 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-15 00:16:08,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-15 00:16:08,752 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:16:08,766 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:16:08,766 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:16:08,767 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1) = -2*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~i~0#1.base) ULTIMATE.start_main_~i~0#1.offset)_1 + 199 Supporting invariants [] [2024-10-15 00:16:08,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:08,832 INFO L156 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2024-10-15 00:16:08,844 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-15 00:16:08,845 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-15 00:16:08,845 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~i~0!base,]]] [2024-10-15 00:16:08,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:08,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:16:08,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:08,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:16:08,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:09,009 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-15 00:16:09,011 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:09,074 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 37 transitions. Complement of second has 10 states. [2024-10-15 00:16:09,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-15 00:16:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2024-10-15 00:16:09,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 2 letters. Loop has 3 letters. [2024-10-15 00:16:09,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:09,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 5 letters. Loop has 3 letters. [2024-10-15 00:16:09,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:09,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 2 letters. Loop has 6 letters. [2024-10-15 00:16:09,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:16:09,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2024-10-15 00:16:09,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:16:09,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 13 transitions. [2024-10-15 00:16:09,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-10-15 00:16:09,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-15 00:16:09,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2024-10-15 00:16:09,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:16:09,095 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-10-15 00:16:09,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2024-10-15 00:16:09,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-15 00:16:09,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:09,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2024-10-15 00:16:09,127 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-10-15 00:16:09,128 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-10-15 00:16:09,128 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:16:09,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2024-10-15 00:16:09,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:16:09,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:09,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:09,130 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-15 00:16:09,130 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:16:09,131 INFO L745 eck$LassoCheckResult]: Stem: 157#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 158#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 151#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 153#L552-1 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 154#L552-5 call write~int#1(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 155#L553-4 [2024-10-15 00:16:09,131 INFO L747 eck$LassoCheckResult]: Loop: 155#L553-4 call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 159#L553-1 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 156#L553-3 call main_#t~mem11#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 155#L553-4 [2024-10-15 00:16:09,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:09,133 INFO L85 PathProgramCache]: Analyzing trace with hash 28694795, now seen corresponding path program 1 times [2024-10-15 00:16:09,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:09,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684843773] [2024-10-15 00:16:09,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:09,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:09,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:16:09,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684843773] [2024-10-15 00:16:09,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684843773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:16:09,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:16:09,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:16:09,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978328848] [2024-10-15 00:16:09,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:16:09,314 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:16:09,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:09,315 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 1 times [2024-10-15 00:16:09,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:09,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421103794] [2024-10-15 00:16:09,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:09,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:09,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:09,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:09,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:16:09,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:16:09,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:16:09,431 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:09,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:16:09,465 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2024-10-15 00:16:09,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2024-10-15 00:16:09,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:16:09,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 14 transitions. [2024-10-15 00:16:09,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-15 00:16:09,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-15 00:16:09,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2024-10-15 00:16:09,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:16:09,468 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-10-15 00:16:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2024-10-15 00:16:09,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2024-10-15 00:16:09,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:09,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2024-10-15 00:16:09,470 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-10-15 00:16:09,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:16:09,471 INFO L425 stractBuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-10-15 00:16:09,471 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:16:09,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2024-10-15 00:16:09,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:16:09,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:09,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:09,474 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-15 00:16:09,475 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:16:09,475 INFO L745 eck$LassoCheckResult]: Stem: 191#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 192#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 185#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 186#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 183#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 184#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 187#L552-1 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 188#L552-5 call write~int#1(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 189#L553-4 [2024-10-15 00:16:09,475 INFO L747 eck$LassoCheckResult]: Loop: 189#L553-4 call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 193#L553-1 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 190#L553-3 call main_#t~mem11#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 189#L553-4 [2024-10-15 00:16:09,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:09,479 INFO L85 PathProgramCache]: Analyzing trace with hash 149879881, now seen corresponding path program 1 times [2024-10-15 00:16:09,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:09,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382370871] [2024-10-15 00:16:09,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:09,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:09,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:16:09,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382370871] [2024-10-15 00:16:09,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382370871] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:16:09,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050162758] [2024-10-15 00:16:09,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:09,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:16:09,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:09,777 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:16:09,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-15 00:16:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:09,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:16:09,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:09,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-15 00:16:09,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-15 00:16:09,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-15 00:16:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:09,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:16:09,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:09,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050162758] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:16:09,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:16:09,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2024-10-15 00:16:09,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789386633] [2024-10-15 00:16:09,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:16:09,968 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:16:09,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:09,969 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 2 times [2024-10-15 00:16:09,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:09,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356245197] [2024-10-15 00:16:09,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:09,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:09,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:09,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:10,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:16:10,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-15 00:16:10,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-15 00:16:10,068 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:10,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:16:10,126 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-10-15 00:16:10,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2024-10-15 00:16:10,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:16:10,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 22 states and 23 transitions. [2024-10-15 00:16:10,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-15 00:16:10,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-15 00:16:10,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2024-10-15 00:16:10,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:16:10,129 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-10-15 00:16:10,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2024-10-15 00:16:10,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-10-15 00:16:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.05) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-10-15 00:16:10,134 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-10-15 00:16:10,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-15 00:16:10,135 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-10-15 00:16:10,135 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:16:10,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 21 transitions. [2024-10-15 00:16:10,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:16:10,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:10,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:10,137 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1, 1] [2024-10-15 00:16:10,137 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:16:10,137 INFO L745 eck$LassoCheckResult]: Stem: 288#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 289#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 282#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 283#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 280#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 281#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 284#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 299#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 298#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 297#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 296#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 295#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 293#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 294#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 292#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 291#L552-1 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 285#L552-5 call write~int#1(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 286#L553-4 [2024-10-15 00:16:10,138 INFO L747 eck$LassoCheckResult]: Loop: 286#L553-4 call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 290#L553-1 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 287#L553-3 call main_#t~mem11#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 286#L553-4 [2024-10-15 00:16:10,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:10,138 INFO L85 PathProgramCache]: Analyzing trace with hash 446171019, now seen corresponding path program 2 times [2024-10-15 00:16:10,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:10,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53662675] [2024-10-15 00:16:10,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:10,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:10,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-15 00:16:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:10,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:16:10,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53662675] [2024-10-15 00:16:10,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53662675] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:16:10,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321750126] [2024-10-15 00:16:10,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:16:10,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:16:10,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:10,665 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:16:10,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-15 00:16:10,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:16:10,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:16:10,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 00:16:10,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:10,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-15 00:16:10,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-15 00:16:10,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:10,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:10,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:10,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-15 00:16:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:10,855 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:16:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:10,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321750126] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:16:10,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:16:10,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 19 [2024-10-15 00:16:10,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232635690] [2024-10-15 00:16:11,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:16:11,000 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:16:11,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:11,000 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 3 times [2024-10-15 00:16:11,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:11,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54057520] [2024-10-15 00:16:11,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:11,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:11,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:11,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:11,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:16:11,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-15 00:16:11,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2024-10-15 00:16:11,089 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. cyclomatic complexity: 3 Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:16:11,243 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2024-10-15 00:16:11,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 47 transitions. [2024-10-15 00:16:11,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:16:11,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 40 states and 41 transitions. [2024-10-15 00:16:11,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-15 00:16:11,249 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-15 00:16:11,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 41 transitions. [2024-10-15 00:16:11,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:16:11,250 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 41 transitions. [2024-10-15 00:16:11,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 41 transitions. [2024-10-15 00:16:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-10-15 00:16:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 37 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-10-15 00:16:11,256 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-10-15 00:16:11,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-15 00:16:11,257 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-10-15 00:16:11,259 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:16:11,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 39 transitions. [2024-10-15 00:16:11,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:16:11,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:11,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:11,261 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1, 1] [2024-10-15 00:16:11,262 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:16:11,263 INFO L745 eck$LassoCheckResult]: Stem: 484#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 485#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 478#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 479#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 476#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 477#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 480#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 513#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 512#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 511#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 510#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 509#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 508#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 507#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 506#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 505#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 504#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 503#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 502#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 501#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 500#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 499#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 498#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 497#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 496#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 495#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 494#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 493#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 492#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 491#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 489#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 490#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 488#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 487#L552-1 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 481#L552-5 call write~int#1(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 482#L553-4 [2024-10-15 00:16:11,263 INFO L747 eck$LassoCheckResult]: Loop: 482#L553-4 call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 486#L553-1 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 483#L553-3 call main_#t~mem11#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 482#L553-4 [2024-10-15 00:16:11,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:11,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1419508405, now seen corresponding path program 3 times [2024-10-15 00:16:11,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:11,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351581848] [2024-10-15 00:16:11,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:11,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:12,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:16:12,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351581848] [2024-10-15 00:16:12,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351581848] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:16:12,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978396353] [2024-10-15 00:16:12,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 00:16:12,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:16:12,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:12,754 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:16:12,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-15 00:16:13,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-15 00:16:13,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:16:13,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-15 00:16:13,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:13,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-15 00:16:13,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-15 00:16:13,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:13,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:13,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:13,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:13,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:13,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:13,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:13,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:13,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:13,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-15 00:16:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:13,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:16:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:13,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978396353] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:16:13,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:16:13,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14, 14] total 37 [2024-10-15 00:16:13,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953973552] [2024-10-15 00:16:13,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:16:13,541 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:16:13,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:13,542 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 4 times [2024-10-15 00:16:13,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:13,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598938649] [2024-10-15 00:16:13,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:13,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:13,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:13,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:13,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:16:13,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-15 00:16:13,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=766, Unknown=0, NotChecked=0, Total=1332 [2024-10-15 00:16:13,627 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. cyclomatic complexity: 3 Second operand has 37 states, 37 states have (on average 2.4054054054054053) internal successors, (89), 37 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:14,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:16:14,027 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2024-10-15 00:16:14,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 89 transitions. [2024-10-15 00:16:14,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:16:14,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 76 states and 77 transitions. [2024-10-15 00:16:14,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-15 00:16:14,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-15 00:16:14,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 77 transitions. [2024-10-15 00:16:14,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:16:14,033 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 77 transitions. [2024-10-15 00:16:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 77 transitions. [2024-10-15 00:16:14,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-10-15 00:16:14,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 73 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2024-10-15 00:16:14,038 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 75 transitions. [2024-10-15 00:16:14,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-15 00:16:14,039 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 75 transitions. [2024-10-15 00:16:14,039 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:16:14,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 75 transitions. [2024-10-15 00:16:14,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:16:14,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:14,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:14,042 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 22, 22, 1, 1, 1, 1] [2024-10-15 00:16:14,042 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:16:14,043 INFO L745 eck$LassoCheckResult]: Stem: 878#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 879#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 872#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 873#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 870#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 871#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 874#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 943#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 942#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 941#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 940#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 939#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 938#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 937#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 936#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 935#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 934#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 933#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 932#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 931#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 930#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 929#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 928#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 927#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 926#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 925#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 924#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 923#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 922#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 921#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 920#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 919#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 918#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 917#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 916#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 915#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 914#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 913#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 912#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 911#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 910#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 909#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 908#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 907#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 906#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 905#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 904#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 903#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 902#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 901#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 900#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 899#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 898#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 897#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 896#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 895#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 894#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 893#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 892#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 891#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 890#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 889#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 888#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 887#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 886#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 885#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 883#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 884#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 882#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 881#L552-1 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 875#L552-5 call write~int#1(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 876#L553-4 [2024-10-15 00:16:14,043 INFO L747 eck$LassoCheckResult]: Loop: 876#L553-4 call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 880#L553-1 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 877#L553-3 call main_#t~mem11#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 876#L553-4 [2024-10-15 00:16:14,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:14,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1124348107, now seen corresponding path program 4 times [2024-10-15 00:16:14,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:14,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226908846] [2024-10-15 00:16:14,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:14,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:18,139 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:18,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:16:18,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226908846] [2024-10-15 00:16:18,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226908846] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:16:18,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322612692] [2024-10-15 00:16:18,140 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 00:16:18,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:16:18,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:18,142 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:16:18,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-15 00:16:18,584 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 00:16:18,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:16:18,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-10-15 00:16:18,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:16:18,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-15 00:16:18,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-15 00:16:18,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-15 00:16:18,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-15 00:16:18,903 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:18,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:16:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:19,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322612692] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:16:19,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:16:19,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 26, 26] total 73 [2024-10-15 00:16:19,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121045173] [2024-10-15 00:16:19,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:16:19,882 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:16:19,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:19,883 INFO L85 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 5 times [2024-10-15 00:16:19,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:19,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508281990] [2024-10-15 00:16:19,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:19,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:19,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:16:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:16:19,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:16:19,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:16:19,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-10-15 00:16:19,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2282, Invalid=2974, Unknown=0, NotChecked=0, Total=5256 [2024-10-15 00:16:19,980 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. cyclomatic complexity: 3 Second operand has 73 states, 73 states have (on average 2.5342465753424657) internal successors, (185), 73 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:21,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:16:21,058 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2024-10-15 00:16:21,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 172 states and 173 transitions. [2024-10-15 00:16:21,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:16:21,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 172 states to 148 states and 149 transitions. [2024-10-15 00:16:21,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-15 00:16:21,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-15 00:16:21,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 149 transitions. [2024-10-15 00:16:21,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:16:21,069 INFO L218 hiAutomatonCegarLoop]: Abstraction has 148 states and 149 transitions. [2024-10-15 00:16:21,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 149 transitions. [2024-10-15 00:16:21,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2024-10-15 00:16:21,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 146 states have (on average 1.0068493150684932) internal successors, (147), 145 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 00:16:21,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2024-10-15 00:16:21,080 INFO L240 hiAutomatonCegarLoop]: Abstraction has 146 states and 147 transitions. [2024-10-15 00:16:21,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-10-15 00:16:21,083 INFO L425 stractBuchiCegarLoop]: Abstraction has 146 states and 147 transitions. [2024-10-15 00:16:21,083 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 00:16:21,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 147 transitions. [2024-10-15 00:16:21,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-15 00:16:21,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:16:21,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:16:21,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [47, 46, 46, 1, 1, 1, 1] [2024-10-15 00:16:21,089 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-15 00:16:21,089 INFO L745 eck$LassoCheckResult]: Stem: 1668#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1669#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_~i~0#1.base, main_~i~0#1.offset, main_~j~0#1.base, main_~j~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~i~0#1.base, main_~i~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~j~0#1.base, main_~j~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call write~int#0(0, main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#2(0, main_~i~0#1.base, main_~i~0#1.offset, 4); 1662#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1663#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1660#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1661#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1664#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1805#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1804#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1803#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1802#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1801#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1800#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1799#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1798#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1797#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1796#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1795#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1794#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1793#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1792#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1791#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1790#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1789#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1788#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1787#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1786#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1785#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1784#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1783#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1782#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1781#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1780#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1779#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1778#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1777#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1776#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1775#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1774#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1773#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1772#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1771#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1770#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1769#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1768#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1767#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1766#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1765#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1764#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1763#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1762#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1761#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1760#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1759#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1758#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1757#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1756#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1755#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1754#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1753#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1752#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1751#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1750#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1749#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1748#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1747#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1746#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1745#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1744#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1743#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1742#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1741#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1740#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1739#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1738#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1737#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1736#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1735#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1734#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1733#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1732#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1731#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1730#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1729#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1728#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1727#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1726#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1725#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1724#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1723#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1722#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1721#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1720#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1719#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1718#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1717#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1716#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1715#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1714#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1713#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1712#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1711#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1710#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1709#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1708#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1707#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1706#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1705#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1704#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1703#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1702#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1701#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1700#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1699#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1698#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1697#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1696#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1695#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1694#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1693#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1692#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1691#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1690#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1689#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1688#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1687#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1686#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1685#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1684#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1683#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1682#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1681#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1680#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1679#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1678#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1677#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1676#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1675#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1673#L552-1 assume !!(main_#t~mem5#1 < 100);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem6#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1674#L552-3 call main_#t~mem7#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4);main_#t~post8#1 := main_#t~mem7#1;call write~int#2(1 + main_#t~post8#1, main_~i~0#1.base, main_~i~0#1.offset, 4);havoc main_#t~mem7#1;havoc main_#t~post8#1; 1672#L552-4 call main_#t~mem5#1 := read~int#2(main_~i~0#1.base, main_~i~0#1.offset, 4); 1671#L552-1 assume !(main_#t~mem5#1 < 100);havoc main_#t~mem5#1; 1665#L552-5 call write~int#1(5, main_~j~0#1.base, main_~j~0#1.offset, 4); 1666#L553-4 [2024-10-15 00:16:21,090 INFO L747 eck$LassoCheckResult]: Loop: 1666#L553-4 call main_#t~mem9#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4); 1670#L553-1 assume !!(main_#t~mem9#1 < 21);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int#0(main_~c~0#1.base, main_~c~0#1.offset, 4);call write~int#0(1 + main_#t~mem10#1, main_~c~0#1.base, main_~c~0#1.offset, 4); 1667#L553-3 call main_#t~mem11#1 := read~int#1(main_~j~0#1.base, main_~j~0#1.offset, 4);call write~int#1(3 + main_#t~mem11#1, main_~j~0#1.base, main_~j~0#1.offset, 4);havoc main_#t~mem11#1; 1666#L553-4 [2024-10-15 00:16:21,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:16:21,090 INFO L85 PathProgramCache]: Analyzing trace with hash 209012683, now seen corresponding path program 5 times [2024-10-15 00:16:21,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:16:21,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820739124] [2024-10-15 00:16:21,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:16:21,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:16:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:16:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 00:16:33,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:16:33,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820739124] [2024-10-15 00:16:33,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820739124] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:16:33,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751463906] [2024-10-15 00:16:33,184 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-15 00:16:33,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:16:33,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:16:33,185 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 00:16:33,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process