./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-examples/standard_vararg_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/array-examples/standard_vararg_ground.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 28ac72543f751666908cbd68a77fa11ffe4dd886016c3996df45b97bb42d5078 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:11:24,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:11:24,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:11:24,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:11:24,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:11:24,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:11:24,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:11:24,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:11:24,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:11:24,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:11:24,096 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:11:24,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:11:24,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:11:24,097 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:11:24,097 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:11:24,098 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:11:24,098 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:11:24,098 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:11:24,099 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:11:24,099 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:11:24,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:11:24,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:11:24,100 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:11:24,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:11:24,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:11:24,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:11:24,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:11:24,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:11:24,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:11:24,102 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:11:24,103 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:11:24,103 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:11:24,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:11:24,103 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:11:24,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:11:24,104 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:11:24,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:11:24,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:11:24,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:11:24,105 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:11:24,105 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 28ac72543f751666908cbd68a77fa11ffe4dd886016c3996df45b97bb42d5078 [2024-11-17 08:11:24,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:11:24,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:11:24,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:11:24,329 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:11:24,329 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:11:24,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_vararg_ground.i [2024-11-17 08:11:25,629 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:11:25,774 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:11:25,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_vararg_ground.i [2024-11-17 08:11:25,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4314686ec/ec7cc54bd8724344a58b96761557cd40/FLAG2c5cbb0a5 [2024-11-17 08:11:25,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4314686ec/ec7cc54bd8724344a58b96761557cd40 [2024-11-17 08:11:25,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:11:25,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:11:25,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:11:25,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:11:25,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:11:25,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:11:25" (1/1) ... [2024-11-17 08:11:25,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f431a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:25, skipping insertion in model container [2024-11-17 08:11:25,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:11:25" (1/1) ... [2024-11-17 08:11:25,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:11:25,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:11:25,994 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:11:26,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:11:26,035 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:11:26,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:26 WrapperNode [2024-11-17 08:11:26,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:11:26,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:11:26,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:11:26,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:11:26,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:26" (1/1) ... [2024-11-17 08:11:26,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:26" (1/1) ... [2024-11-17 08:11:26,077 INFO L138 Inliner]: procedures = 16, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 54 [2024-11-17 08:11:26,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:11:26,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:11:26,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:11:26,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:11:26,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:26" (1/1) ... [2024-11-17 08:11:26,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:26" (1/1) ... [2024-11-17 08:11:26,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:26" (1/1) ... [2024-11-17 08:11:26,111 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-17 08:11:26,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:26" (1/1) ... [2024-11-17 08:11:26,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:26" (1/1) ... [2024-11-17 08:11:26,124 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:26" (1/1) ... [2024-11-17 08:11:26,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:26" (1/1) ... [2024-11-17 08:11:26,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:26" (1/1) ... [2024-11-17 08:11:26,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:26" (1/1) ... [2024-11-17 08:11:26,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:11:26,131 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:11:26,131 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:11:26,131 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:11:26,132 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:26" (1/1) ... [2024-11-17 08:11:26,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:26,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:26,193 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-11-17 08:11:26,199 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-11-17 08:11:26,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:11:26,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:11:26,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 08:11:26,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 08:11:26,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 08:11:26,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 08:11:26,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:11:26,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:11:26,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 08:11:26,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 08:11:26,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 08:11:26,299 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:11:26,300 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:11:26,381 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: call ULTIMATE.dealloc(main_~#aa~0#1.base, main_~#aa~0#1.offset);havoc main_~#aa~0#1.base, main_~#aa~0#1.offset; [2024-11-17 08:11:26,386 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-17 08:11:26,386 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:11:26,400 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:11:26,400 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:11:26,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:11:26 BoogieIcfgContainer [2024-11-17 08:11:26,401 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:11:26,401 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:11:26,402 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:11:26,404 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:11:26,405 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:11:26,405 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:11:25" (1/3) ... [2024-11-17 08:11:26,406 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6bf0c3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:11:26, skipping insertion in model container [2024-11-17 08:11:26,406 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:11:26,406 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:26" (2/3) ... [2024-11-17 08:11:26,406 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6bf0c3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:11:26, skipping insertion in model container [2024-11-17 08:11:26,406 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:11:26,406 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:11:26" (3/3) ... [2024-11-17 08:11:26,407 INFO L332 chiAutomizerObserver]: Analyzing ICFG standard_vararg_ground.i [2024-11-17 08:11:26,444 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:11:26,444 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:11:26,444 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:11:26,444 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:11:26,444 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:11:26,444 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:11:26,445 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:11:26,445 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:11:26,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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-11-17 08:11:26,459 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-11-17 08:11:26,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:26,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:26,462 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:11:26,463 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:26,463 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:11:26,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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-11-17 08:11:26,464 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-11-17 08:11:26,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:26,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:26,464 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:11:26,464 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:26,468 INFO L745 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); 14#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 17#L20-1true [2024-11-17 08:11:26,468 INFO L747 eck$LassoCheckResult]: Loop: 17#L20-1true assume true; 15#L20-2true assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 17#L20-1true [2024-11-17 08:11:26,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:26,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1984, now seen corresponding path program 1 times [2024-11-17 08:11:26,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:26,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927798912] [2024-11-17 08:11:26,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:26,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:26,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:26,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:26,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:26,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1888, now seen corresponding path program 1 times [2024-11-17 08:11:26,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:26,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366166589] [2024-11-17 08:11:26,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:26,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:26,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:26,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:26,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:26,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1907551, now seen corresponding path program 1 times [2024-11-17 08:11:26,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:26,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549379264] [2024-11-17 08:11:26,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:26,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:26,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:26,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:26,892 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:11:26,893 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:11:26,893 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:11:26,893 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:11:26,893 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:11:26,894 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:26,894 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:11:26,894 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:11:26,894 INFO L132 ssoRankerPreferences]: Filename of dumped script: standard_vararg_ground.i_Iteration1_Lasso [2024-11-17 08:11:26,894 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:11:26,894 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:11:26,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:26,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:26,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:26,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:26,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:26,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:26,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:27,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:27,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:27,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:27,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:27,260 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:11:27,271 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:11:27,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:27,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:27,276 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-11-17 08:11:27,280 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-11-17 08:11:27,281 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-11-17 08:11:27,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:27,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:27,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:27,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:27,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:27,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:27,300 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:27,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-17 08:11:27,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:27,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:27,320 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-11-17 08:11:27,321 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-11-17 08:11:27,322 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-11-17 08:11:27,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:27,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:27,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:27,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:27,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:27,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:27,340 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:27,360 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-11-17 08:11:27,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:27,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:27,364 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-11-17 08:11:27,375 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-11-17 08:11:27,377 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-11-17 08:11:27,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:27,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:27,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:27,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:27,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:27,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:27,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:27,393 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:27,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-17 08:11:27,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:27,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:27,408 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-11-17 08:11:27,413 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-11-17 08:11:27,415 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-11-17 08:11:27,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:27,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:27,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:27,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:27,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:27,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:27,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:27,428 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:27,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-17 08:11:27,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:27,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:27,440 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-11-17 08:11:27,444 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-11-17 08:11:27,445 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-11-17 08:11:27,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:27,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:27,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:27,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:27,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:27,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:27,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:27,457 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:27,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:27,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:27,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:27,470 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-11-17 08:11:27,474 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-11-17 08:11:27,475 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-11-17 08:11:27,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:27,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:27,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:27,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:27,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:27,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:27,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:27,488 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:27,499 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-11-17 08:11:27,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:27,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:27,501 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-11-17 08:11:27,506 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-11-17 08:11:27,506 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-11-17 08:11:27,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:27,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:27,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:27,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:27,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:27,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:27,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:27,521 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:27,531 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-11-17 08:11:27,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:27,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:27,536 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-11-17 08:11:27,537 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-11-17 08:11:27,538 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-11-17 08:11:27,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:27,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:27,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:27,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:27,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:27,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:27,557 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:27,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:27,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:27,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:27,573 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-11-17 08:11:27,574 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-11-17 08:11:27,575 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-11-17 08:11:27,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:27,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:27,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:27,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:27,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:27,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:27,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:27,588 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:27,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:27,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:27,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:27,601 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-11-17 08:11:27,602 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-11-17 08:11:27,603 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-11-17 08:11:27,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:27,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:27,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:27,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:27,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:27,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:27,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:27,629 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-11-17 08:11:27,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:27,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:27,632 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-11-17 08:11:27,632 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-11-17 08:11:27,633 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-11-17 08:11:27,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:27,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:27,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:27,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:27,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:27,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:27,649 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:27,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-17 08:11:27,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:27,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:27,664 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-11-17 08:11:27,665 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-11-17 08:11:27,667 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-11-17 08:11:27,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:27,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:27,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:27,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:27,680 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:27,680 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:27,686 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:27,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:27,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:27,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:27,698 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-11-17 08:11:27,699 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-11-17 08:11:27,701 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-11-17 08:11:27,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:27,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:27,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:27,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:27,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:27,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:27,717 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:27,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:27,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:27,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:27,730 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-11-17 08:11:27,730 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-11-17 08:11:27,731 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-11-17 08:11:27,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:27,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:27,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:27,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:27,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:27,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:27,746 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:27,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-17 08:11:27,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:27,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:27,759 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-11-17 08:11:27,760 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-11-17 08:11:27,761 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-11-17 08:11:27,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:27,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:27,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:27,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:27,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:27,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:27,782 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:11:27,797 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-17 08:11:27,798 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-17 08:11:27,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:27,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:27,830 INFO L229 MonitoredProcess]: Starting monitored process 17 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-11-17 08:11:27,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-17 08:11:27,832 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:11:27,844 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:11:27,845 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:11:27,845 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#aa~0#1.base)_1) = -8*ULTIMATE.start_main_~i~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#aa~0#1.base)_1 Supporting invariants [] [2024-11-17 08:11:27,856 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-11-17 08:11:27,876 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-17 08:11:27,889 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:11:27,894 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:11:27,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:27,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:11:27,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:27,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:11:27,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:28,044 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-17 08:11:28,046 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-11-17 08:11:28,070 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 36 states and 50 transitions. Complement of second has 6 states. [2024-11-17 08:11:28,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-17 08:11:28,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-11-17 08:11:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2024-11-17 08:11:28,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-17 08:11:28,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:28,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-17 08:11:28,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:28,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-17 08:11:28,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:28,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. [2024-11-17 08:11:28,080 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-17 08:11:28,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 17 states and 23 transitions. [2024-11-17 08:11:28,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-17 08:11:28,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-17 08:11:28,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2024-11-17 08:11:28,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:28,083 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-11-17 08:11:28,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2024-11-17 08:11:28,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-17 08:11:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-11-17 08:11:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2024-11-17 08:11:28,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-11-17 08:11:28,101 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-11-17 08:11:28,101 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:11:28,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2024-11-17 08:11:28,102 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-17 08:11:28,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:28,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:28,102 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-17 08:11:28,102 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:28,102 INFO L745 eck$LassoCheckResult]: Stem: 108#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); 109#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 118#L20-1 assume true; 119#L20-2 assume !(main_~i~0#1 < 100000); 120#L20 havoc main_~i~0#1; 113#L25 [2024-11-17 08:11:28,103 INFO L747 eck$LassoCheckResult]: Loop: 113#L25 assume true;call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 114#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 113#L25 [2024-11-17 08:11:28,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:28,103 INFO L85 PathProgramCache]: Analyzing trace with hash 59134043, now seen corresponding path program 1 times [2024-11-17 08:11:28,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:28,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063702217] [2024-11-17 08:11:28,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:28,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:28,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:28,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:28,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063702217] [2024-11-17 08:11:28,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063702217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:11:28,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:11:28,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:11:28,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76265084] [2024-11-17 08:11:28,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:11:28,164 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:11:28,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:28,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1664, now seen corresponding path program 1 times [2024-11-17 08:11:28,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:28,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489351614] [2024-11-17 08:11:28,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:28,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:28,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:28,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:28,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:28,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:11:28,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:11:28,222 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-11-17 08:11:28,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:28,232 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2024-11-17 08:11:28,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2024-11-17 08:11:28,233 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:11:28,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 15 states and 17 transitions. [2024-11-17 08:11:28,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-17 08:11:28,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-17 08:11:28,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2024-11-17 08:11:28,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:28,235 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-17 08:11:28,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2024-11-17 08:11:28,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-11-17 08:11:28,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 13 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-11-17 08:11:28,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-11-17 08:11:28,238 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-17 08:11:28,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:11:28,243 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-17 08:11:28,243 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:11:28,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2024-11-17 08:11:28,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:11:28,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:28,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:28,245 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-11-17 08:11:28,245 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:28,245 INFO L745 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); 148#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 151#L20-1 assume true; 155#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 156#L20-1 assume true; 153#L20-2 assume !(main_~i~0#1 < 100000); 154#L20 havoc main_~i~0#1; 157#L25 [2024-11-17 08:11:28,245 INFO L747 eck$LassoCheckResult]: Loop: 157#L25 assume true;call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 158#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 157#L25 [2024-11-17 08:11:28,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:28,245 INFO L85 PathProgramCache]: Analyzing trace with hash 993305692, now seen corresponding path program 1 times [2024-11-17 08:11:28,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:28,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822581715] [2024-11-17 08:11:28,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:28,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:28,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:28,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:28,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822581715] [2024-11-17 08:11:28,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822581715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:28,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685650757] [2024-11-17 08:11:28,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:28,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:28,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:28,290 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-11-17 08:11:28,291 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-11-17 08:11:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:28,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 08:11:28,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:28,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:28,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:11:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:28,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685650757] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:11:28,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:11:28,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-17 08:11:28,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606303489] [2024-11-17 08:11:28,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:11:28,352 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:11:28,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:28,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1664, now seen corresponding path program 2 times [2024-11-17 08:11:28,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:28,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038488405] [2024-11-17 08:11:28,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:28,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:28,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:28,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:28,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:28,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 08:11:28,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-17 08:11:28,391 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-11-17 08:11:28,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:28,415 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2024-11-17 08:11:28,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2024-11-17 08:11:28,415 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:11:28,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 21 states and 23 transitions. [2024-11-17 08:11:28,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-17 08:11:28,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-17 08:11:28,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2024-11-17 08:11:28,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:28,416 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-11-17 08:11:28,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2024-11-17 08:11:28,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-17 08:11:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 19 states have internal predecessors, (22), 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-11-17 08:11:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-17 08:11:28,418 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-17 08:11:28,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 08:11:28,418 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-17 08:11:28,419 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:11:28,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2024-11-17 08:11:28,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:11:28,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:28,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:28,419 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1] [2024-11-17 08:11:28,419 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:28,419 INFO L745 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); 234#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 235#L20-1 assume true; 245#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 246#L20-1 assume true; 239#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 240#L20-1 assume true; 250#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 249#L20-1 assume true; 248#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 247#L20-1 assume true; 237#L20-2 assume !(main_~i~0#1 < 100000); 238#L20 havoc main_~i~0#1; 241#L25 [2024-11-17 08:11:28,420 INFO L747 eck$LassoCheckResult]: Loop: 241#L25 assume true;call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 242#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 241#L25 [2024-11-17 08:11:28,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:28,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1902774561, now seen corresponding path program 2 times [2024-11-17 08:11:28,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:28,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724057415] [2024-11-17 08:11:28,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:28,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:28,514 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:28,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:28,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724057415] [2024-11-17 08:11:28,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724057415] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:28,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814210937] [2024-11-17 08:11:28,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:11:28,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:28,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:28,516 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-11-17 08:11:28,517 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-11-17 08:11:28,561 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:11:28,562 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:11:28,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:11:28,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:28,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:11:28,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-17 08:11:28,670 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:28,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814210937] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:11:28,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:11:28,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-17 08:11:28,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683295765] [2024-11-17 08:11:28,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:11:28,671 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:11:28,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:28,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1664, now seen corresponding path program 3 times [2024-11-17 08:11:28,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:28,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852831698] [2024-11-17 08:11:28,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:28,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:28,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:28,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:28,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:28,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 08:11:28,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-17 08:11:28,707 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 5 Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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-11-17 08:11:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:28,725 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2024-11-17 08:11:28,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 41 transitions. [2024-11-17 08:11:28,726 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:11:28,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 33 states and 35 transitions. [2024-11-17 08:11:28,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-17 08:11:28,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-17 08:11:28,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 35 transitions. [2024-11-17 08:11:28,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:28,727 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-11-17 08:11:28,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 35 transitions. [2024-11-17 08:11:28,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-11-17 08:11:28,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.0625) internal successors, (34), 31 states have internal predecessors, (34), 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-11-17 08:11:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-11-17 08:11:28,729 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-11-17 08:11:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 08:11:28,729 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-11-17 08:11:28,729 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:11:28,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 34 transitions. [2024-11-17 08:11:28,730 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:11:28,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:28,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:28,731 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 1, 1, 1, 1] [2024-11-17 08:11:28,731 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:28,731 INFO L745 eck$LassoCheckResult]: Stem: 378#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); 379#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 382#L20-1 assume true; 392#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 393#L20-1 assume true; 386#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 387#L20-1 assume true; 409#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 408#L20-1 assume true; 407#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 406#L20-1 assume true; 405#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 404#L20-1 assume true; 403#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 402#L20-1 assume true; 401#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 400#L20-1 assume true; 399#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 398#L20-1 assume true; 397#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 396#L20-1 assume true; 395#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 394#L20-1 assume true; 384#L20-2 assume !(main_~i~0#1 < 100000); 385#L20 havoc main_~i~0#1; 388#L25 [2024-11-17 08:11:28,731 INFO L747 eck$LassoCheckResult]: Loop: 388#L25 assume true;call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 389#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 388#L25 [2024-11-17 08:11:28,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:28,731 INFO L85 PathProgramCache]: Analyzing trace with hash 889504037, now seen corresponding path program 3 times [2024-11-17 08:11:28,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:28,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913837380] [2024-11-17 08:11:28,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:28,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:28,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:28,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913837380] [2024-11-17 08:11:28,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913837380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:28,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313555586] [2024-11-17 08:11:28,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 08:11:28,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:28,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:28,912 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-11-17 08:11:28,914 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-11-17 08:11:29,002 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-17 08:11:29,002 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:11:29,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 08:11:29,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:29,035 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:29,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:11:29,208 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:29,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313555586] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:11:29,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:11:29,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-17 08:11:29,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82708444] [2024-11-17 08:11:29,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:11:29,208 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:11:29,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:29,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1664, now seen corresponding path program 4 times [2024-11-17 08:11:29,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:29,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227405428] [2024-11-17 08:11:29,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:29,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:29,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:29,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:29,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:29,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-17 08:11:29,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-17 08:11:29,239 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. cyclomatic complexity: 5 Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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-11-17 08:11:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:29,269 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2024-11-17 08:11:29,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 71 transitions. [2024-11-17 08:11:29,270 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:11:29,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 57 states and 59 transitions. [2024-11-17 08:11:29,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-17 08:11:29,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-17 08:11:29,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 59 transitions. [2024-11-17 08:11:29,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:29,271 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 59 transitions. [2024-11-17 08:11:29,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 59 transitions. [2024-11-17 08:11:29,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2024-11-17 08:11:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 55 states have internal predecessors, (58), 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-11-17 08:11:29,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2024-11-17 08:11:29,273 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 58 transitions. [2024-11-17 08:11:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-17 08:11:29,274 INFO L425 stractBuchiCegarLoop]: Abstraction has 56 states and 58 transitions. [2024-11-17 08:11:29,274 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:11:29,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 58 transitions. [2024-11-17 08:11:29,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:11:29,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:29,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:29,275 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 22, 1, 1, 1, 1] [2024-11-17 08:11:29,275 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:29,275 INFO L745 eck$LassoCheckResult]: Stem: 653#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); 654#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 655#L20-1 assume true; 665#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 666#L20-1 assume true; 659#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 660#L20-1 assume true; 706#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 705#L20-1 assume true; 704#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 703#L20-1 assume true; 702#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 701#L20-1 assume true; 700#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 699#L20-1 assume true; 698#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 697#L20-1 assume true; 696#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 695#L20-1 assume true; 694#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 693#L20-1 assume true; 692#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 691#L20-1 assume true; 690#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 689#L20-1 assume true; 688#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 687#L20-1 assume true; 686#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 685#L20-1 assume true; 684#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 683#L20-1 assume true; 682#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 681#L20-1 assume true; 680#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 679#L20-1 assume true; 678#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 677#L20-1 assume true; 676#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 675#L20-1 assume true; 674#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 673#L20-1 assume true; 672#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 671#L20-1 assume true; 670#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 669#L20-1 assume true; 668#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 667#L20-1 assume true; 657#L20-2 assume !(main_~i~0#1 < 100000); 658#L20 havoc main_~i~0#1; 661#L25 [2024-11-17 08:11:29,276 INFO L747 eck$LassoCheckResult]: Loop: 661#L25 assume true;call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 662#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 661#L25 [2024-11-17 08:11:29,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:29,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1070475953, now seen corresponding path program 4 times [2024-11-17 08:11:29,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:29,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677126277] [2024-11-17 08:11:29,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:29,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:29,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:29,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677126277] [2024-11-17 08:11:29,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677126277] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:29,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007156603] [2024-11-17 08:11:29,730 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 08:11:29,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:29,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:29,736 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-11-17 08:11:29,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-17 08:11:29,815 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 08:11:29,815 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:11:29,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-17 08:11:29,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:29,889 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:29,889 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:11:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:30,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007156603] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:11:30,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:11:30,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2024-11-17 08:11:30,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991196038] [2024-11-17 08:11:30,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:11:30,540 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:11:30,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:30,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1664, now seen corresponding path program 5 times [2024-11-17 08:11:30,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:30,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290955852] [2024-11-17 08:11:30,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:30,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:30,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:30,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:30,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:30,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-17 08:11:30,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-11-17 08:11:30,586 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. cyclomatic complexity: 5 Second operand has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 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-11-17 08:11:30,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:30,652 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2024-11-17 08:11:30,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 131 transitions. [2024-11-17 08:11:30,653 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:11:30,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 105 states and 107 transitions. [2024-11-17 08:11:30,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-17 08:11:30,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-17 08:11:30,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 107 transitions. [2024-11-17 08:11:30,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:30,655 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105 states and 107 transitions. [2024-11-17 08:11:30,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 107 transitions. [2024-11-17 08:11:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-11-17 08:11:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 103 states have internal predecessors, (106), 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-11-17 08:11:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2024-11-17 08:11:30,659 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 106 transitions. [2024-11-17 08:11:30,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-17 08:11:30,659 INFO L425 stractBuchiCegarLoop]: Abstraction has 104 states and 106 transitions. [2024-11-17 08:11:30,660 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:11:30,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 106 transitions. [2024-11-17 08:11:30,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:11:30,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:30,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:30,662 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [47, 46, 1, 1, 1, 1] [2024-11-17 08:11:30,662 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:30,663 INFO L745 eck$LassoCheckResult]: Stem: 1176#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); 1177#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 1180#L20-1 assume true; 1190#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1191#L20-1 assume true; 1184#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1185#L20-1 assume true; 1279#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1278#L20-1 assume true; 1277#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1276#L20-1 assume true; 1275#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1274#L20-1 assume true; 1273#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1272#L20-1 assume true; 1271#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1270#L20-1 assume true; 1269#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1268#L20-1 assume true; 1267#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1266#L20-1 assume true; 1265#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1264#L20-1 assume true; 1263#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1262#L20-1 assume true; 1261#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1260#L20-1 assume true; 1259#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1258#L20-1 assume true; 1257#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1256#L20-1 assume true; 1255#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1254#L20-1 assume true; 1253#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1252#L20-1 assume true; 1251#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1250#L20-1 assume true; 1249#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1248#L20-1 assume true; 1247#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1246#L20-1 assume true; 1245#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1244#L20-1 assume true; 1243#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1242#L20-1 assume true; 1241#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1240#L20-1 assume true; 1239#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1238#L20-1 assume true; 1237#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1236#L20-1 assume true; 1235#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1234#L20-1 assume true; 1233#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1232#L20-1 assume true; 1231#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1230#L20-1 assume true; 1229#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1228#L20-1 assume true; 1227#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1226#L20-1 assume true; 1225#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1224#L20-1 assume true; 1223#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1222#L20-1 assume true; 1221#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1220#L20-1 assume true; 1219#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1218#L20-1 assume true; 1217#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1216#L20-1 assume true; 1215#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1214#L20-1 assume true; 1213#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1212#L20-1 assume true; 1211#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1210#L20-1 assume true; 1209#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1208#L20-1 assume true; 1207#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1206#L20-1 assume true; 1205#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1204#L20-1 assume true; 1203#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1202#L20-1 assume true; 1201#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1200#L20-1 assume true; 1199#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1198#L20-1 assume true; 1197#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1196#L20-1 assume true; 1195#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1194#L20-1 assume true; 1193#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1192#L20-1 assume true; 1182#L20-2 assume !(main_~i~0#1 < 100000); 1183#L20 havoc main_~i~0#1; 1186#L25 [2024-11-17 08:11:30,663 INFO L747 eck$LassoCheckResult]: Loop: 1186#L25 assume true;call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 1187#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1186#L25 [2024-11-17 08:11:30,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:30,663 INFO L85 PathProgramCache]: Analyzing trace with hash -37072439, now seen corresponding path program 5 times [2024-11-17 08:11:30,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:30,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295963020] [2024-11-17 08:11:30,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:30,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:32,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:32,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:32,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295963020] [2024-11-17 08:11:32,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295963020] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:32,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373761279] [2024-11-17 08:11:32,110 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 08:11:32,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:32,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:32,112 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:32,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-17 08:12:09,548 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-11-17 08:12:09,548 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:12:09,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-17 08:12:09,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:12:09,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:12:09,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:12:11,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:12:11,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373761279] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:12:11,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:12:11,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2024-11-17 08:12:11,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284196435] [2024-11-17 08:12:11,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:12:11,986 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:12:11,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:11,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1664, now seen corresponding path program 6 times [2024-11-17 08:12:11,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:11,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5599780] [2024-11-17 08:12:11,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:11,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:11,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:11,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:12,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:12:12,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-11-17 08:12:12,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2024-11-17 08:12:12,029 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. cyclomatic complexity: 5 Second operand has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 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-11-17 08:12:12,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:12:12,163 INFO L93 Difference]: Finished difference Result 249 states and 251 transitions. [2024-11-17 08:12:12,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 249 states and 251 transitions. [2024-11-17 08:12:12,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:12:12,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 249 states to 201 states and 203 transitions. [2024-11-17 08:12:12,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2024-11-17 08:12:12,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2024-11-17 08:12:12,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 203 transitions. [2024-11-17 08:12:12,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:12:12,166 INFO L218 hiAutomatonCegarLoop]: Abstraction has 201 states and 203 transitions. [2024-11-17 08:12:12,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states and 203 transitions. [2024-11-17 08:12:12,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2024-11-17 08:12:12,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 200 states have (on average 1.01) internal successors, (202), 199 states have internal predecessors, (202), 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-11-17 08:12:12,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 202 transitions. [2024-11-17 08:12:12,172 INFO L240 hiAutomatonCegarLoop]: Abstraction has 200 states and 202 transitions. [2024-11-17 08:12:12,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-17 08:12:12,173 INFO L425 stractBuchiCegarLoop]: Abstraction has 200 states and 202 transitions. [2024-11-17 08:12:12,173 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:12:12,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 202 transitions. [2024-11-17 08:12:12,174 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:12:12,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:12:12,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:12:12,179 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [95, 94, 1, 1, 1, 1] [2024-11-17 08:12:12,179 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:12:12,179 INFO L745 eck$LassoCheckResult]: Stem: 2207#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); 2208#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_~i~0#1, main_#t~mem3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~post6#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 2209#L20-1 assume true; 2219#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2220#L20-1 assume true; 2213#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2214#L20-1 assume true; 2404#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2403#L20-1 assume true; 2402#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2401#L20-1 assume true; 2400#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2399#L20-1 assume true; 2398#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2397#L20-1 assume true; 2396#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2395#L20-1 assume true; 2394#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2393#L20-1 assume true; 2392#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2391#L20-1 assume true; 2390#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2389#L20-1 assume true; 2388#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2387#L20-1 assume true; 2386#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2385#L20-1 assume true; 2384#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2383#L20-1 assume true; 2382#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2381#L20-1 assume true; 2380#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2379#L20-1 assume true; 2378#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2377#L20-1 assume true; 2376#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2375#L20-1 assume true; 2374#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2373#L20-1 assume true; 2372#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2371#L20-1 assume true; 2370#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2369#L20-1 assume true; 2368#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2367#L20-1 assume true; 2366#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2365#L20-1 assume true; 2364#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2363#L20-1 assume true; 2362#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2361#L20-1 assume true; 2360#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2359#L20-1 assume true; 2358#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2357#L20-1 assume true; 2356#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2355#L20-1 assume true; 2354#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2353#L20-1 assume true; 2352#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2351#L20-1 assume true; 2350#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2349#L20-1 assume true; 2348#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2347#L20-1 assume true; 2346#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2345#L20-1 assume true; 2344#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2343#L20-1 assume true; 2342#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2341#L20-1 assume true; 2340#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2339#L20-1 assume true; 2338#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2337#L20-1 assume true; 2336#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2335#L20-1 assume true; 2334#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2333#L20-1 assume true; 2332#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2331#L20-1 assume true; 2330#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2329#L20-1 assume true; 2328#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2327#L20-1 assume true; 2326#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2325#L20-1 assume true; 2324#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2323#L20-1 assume true; 2322#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2321#L20-1 assume true; 2320#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2319#L20-1 assume true; 2318#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2317#L20-1 assume true; 2316#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2315#L20-1 assume true; 2314#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2313#L20-1 assume true; 2312#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2311#L20-1 assume true; 2310#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2309#L20-1 assume true; 2308#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2307#L20-1 assume true; 2306#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2305#L20-1 assume true; 2304#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2303#L20-1 assume true; 2302#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2301#L20-1 assume true; 2300#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2299#L20-1 assume true; 2298#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2297#L20-1 assume true; 2296#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2295#L20-1 assume true; 2294#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2293#L20-1 assume true; 2292#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2291#L20-1 assume true; 2290#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2289#L20-1 assume true; 2288#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2287#L20-1 assume true; 2286#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2285#L20-1 assume true; 2284#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2283#L20-1 assume true; 2282#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2281#L20-1 assume true; 2280#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2279#L20-1 assume true; 2278#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2277#L20-1 assume true; 2276#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2275#L20-1 assume true; 2274#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2273#L20-1 assume true; 2272#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2271#L20-1 assume true; 2270#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2269#L20-1 assume true; 2268#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2267#L20-1 assume true; 2266#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2265#L20-1 assume true; 2264#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2263#L20-1 assume true; 2262#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2261#L20-1 assume true; 2260#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2259#L20-1 assume true; 2258#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2257#L20-1 assume true; 2256#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2255#L20-1 assume true; 2254#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2253#L20-1 assume true; 2252#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2251#L20-1 assume true; 2250#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2249#L20-1 assume true; 2248#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2247#L20-1 assume true; 2246#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2245#L20-1 assume true; 2244#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2243#L20-1 assume true; 2242#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2241#L20-1 assume true; 2240#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2239#L20-1 assume true; 2238#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2237#L20-1 assume true; 2236#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2235#L20-1 assume true; 2234#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2233#L20-1 assume true; 2232#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2231#L20-1 assume true; 2230#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2229#L20-1 assume true; 2228#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2227#L20-1 assume true; 2226#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2225#L20-1 assume true; 2224#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2223#L20-1 assume true; 2222#L20-2 assume !!(main_~i~0#1 < 100000);havoc main_#t~nondet1#1;call write~int#1(main_#t~nondet1#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2221#L20-1 assume true; 2211#L20-2 assume !(main_~i~0#1 < 100000); 2212#L20 havoc main_~i~0#1; 2215#L25 [2024-11-17 08:12:12,179 INFO L747 eck$LassoCheckResult]: Loop: 2215#L25 assume true;call main_#t~mem3#1 := read~int#1(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 2216#L25-1 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2215#L25 [2024-11-17 08:12:12,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:12,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1892159495, now seen corresponding path program 6 times [2024-11-17 08:12:12,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:12,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597943412] [2024-11-17 08:12:12,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:12,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:12:16,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:12:16,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597943412] [2024-11-17 08:12:16,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597943412] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:12:16,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291773602] [2024-11-17 08:12:16,578 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-17 08:12:16,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:12:16,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:16,580 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:12:16,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process