./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d 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/data_structures_set_multi_proc_trivial_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 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:28:42,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:28:42,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 15:28:42,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:28:42,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:28:42,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:28:42,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:28:42,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:28:42,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:28:42,535 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:28:42,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:28:42,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:28:42,537 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:28:42,537 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:28:42,538 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:28:42,540 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:28:42,540 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:28:42,540 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:28:42,540 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:28:42,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:28:42,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:28:42,541 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 15:28:42,541 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:28:42,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 15:28:42,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:28:42,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:28:42,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:28:42,543 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:28:42,543 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:28:42,543 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:28:42,544 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 15:28:42,544 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:28:42,544 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:28:42,544 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:28:42,545 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:28:42,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:28:42,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:28:42,546 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:28:42,546 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:28:42,546 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 -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2024-11-09 15:28:42,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:28:42,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:28:42,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:28:42,846 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:28:42,847 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:28:42,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2024-11-09 15:28:44,314 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:28:44,517 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:28:44,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2024-11-09 15:28:44,530 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f5ff1b5c/30be31fb22b64f8a986021f368f86f7d/FLAG08a5e7eac [2024-11-09 15:28:44,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f5ff1b5c/30be31fb22b64f8a986021f368f86f7d [2024-11-09 15:28:44,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:28:44,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:28:44,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:28:44,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:28:44,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:28:44,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:28:44" (1/1) ... [2024-11-09 15:28:44,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a4a8070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:44, skipping insertion in model container [2024-11-09 15:28:44,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:28:44" (1/1) ... [2024-11-09 15:28:44,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:28:44,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:28:44,847 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:28:44,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:28:44,895 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:28:44,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:44 WrapperNode [2024-11-09 15:28:44,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:28:44,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:28:44,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:28:44,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:28:44,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:44" (1/1) ... [2024-11-09 15:28:44,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:44" (1/1) ... [2024-11-09 15:28:44,949 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 176 [2024-11-09 15:28:44,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:28:44,955 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:28:44,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:28:44,955 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:28:44,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:44" (1/1) ... [2024-11-09 15:28:44,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:44" (1/1) ... [2024-11-09 15:28:44,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:44" (1/1) ... [2024-11-09 15:28:44,998 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 3, 9]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2024-11-09 15:28:45,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:44" (1/1) ... [2024-11-09 15:28:45,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:44" (1/1) ... [2024-11-09 15:28:45,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:44" (1/1) ... [2024-11-09 15:28:45,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:44" (1/1) ... [2024-11-09 15:28:45,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:44" (1/1) ... [2024-11-09 15:28:45,028 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:44" (1/1) ... [2024-11-09 15:28:45,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:28:45,033 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:28:45,033 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:28:45,033 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:28:45,034 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:44" (1/1) ... [2024-11-09 15:28:45,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:45,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:45,075 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-09 15:28:45,079 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-09 15:28:45,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 15:28:45,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 15:28:45,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 15:28:45,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 15:28:45,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 15:28:45,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:28:45,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 15:28:45,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 15:28:45,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:28:45,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:28:45,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:28:45,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 15:28:45,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 15:28:45,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:28:45,220 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:28:45,222 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:28:45,487 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-09 15:28:45,488 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:28:45,506 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:28:45,507 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-09 15:28:45,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:28:45 BoogieIcfgContainer [2024-11-09 15:28:45,508 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:28:45,509 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:28:45,509 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:28:45,513 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:28:45,514 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:28:45,514 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:28:44" (1/3) ... [2024-11-09 15:28:45,515 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c4c2f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:28:45, skipping insertion in model container [2024-11-09 15:28:45,515 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:28:45,515 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:44" (2/3) ... [2024-11-09 15:28:45,516 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c4c2f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:28:45, skipping insertion in model container [2024-11-09 15:28:45,516 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:28:45,516 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:28:45" (3/3) ... [2024-11-09 15:28:45,517 INFO L332 chiAutomizerObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2024-11-09 15:28:45,568 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:28:45,568 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:28:45,568 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:28:45,568 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:28:45,568 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:28:45,569 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:28:45,569 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:28:45,569 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:28:45,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 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-09 15:28:45,589 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 41 [2024-11-09 15:28:45,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:45,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:45,596 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:28:45,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:28:45,596 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:28:45,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 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-09 15:28:45,600 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 41 [2024-11-09 15:28:45,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:45,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:45,601 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:28:45,601 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:28:45,609 INFO L745 eck$LassoCheckResult]: Stem: 23#$Ultimate##0true 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(48, 2); 26#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 50#L33-3true [2024-11-09 15:28:45,610 INFO L747 eck$LassoCheckResult]: Loop: 50#L33-3true assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 15#L33-2true main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 50#L33-3true [2024-11-09 15:28:45,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:45,616 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:28:45,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:45,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757929399] [2024-11-09 15:28:45,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:45,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:45,797 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:45,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:45,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:45,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-11-09 15:28:45,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:45,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395156603] [2024-11-09 15:28:45,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:45,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:45,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:45,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:45,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:45,871 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-11-09 15:28:45,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:45,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51106010] [2024-11-09 15:28:45,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:45,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:45,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:45,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:46,232 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:46,233 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:46,233 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:46,233 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:46,234 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:46,234 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,234 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:46,234 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:46,234 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration1_Lasso [2024-11-09 15:28:46,235 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:46,235 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:46,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:46,773 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:46,777 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:46,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,782 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-09 15:28:46,783 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-09 15:28:46,784 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-09 15:28:46,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:46,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:46,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:46,805 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,822 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-09 15:28:46,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,825 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-09 15:28:46,826 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-09 15:28:46,828 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-09 15:28:46,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:46,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:46,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:46,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:46,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,857 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-09 15:28:46,858 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-09 15:28:46,860 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-09 15:28:46,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:46,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:46,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:46,876 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:46,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,894 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-09 15:28:46,895 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-09 15:28:46,897 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-09 15:28:46,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:46,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:46,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:46,914 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:46,928 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-09 15:28:46,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:46,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:46,932 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-09 15:28:46,934 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-09 15:28:46,935 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-09 15:28:46,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:46,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:46,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:46,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:46,982 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:46,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:46,992 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:47,033 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-09 15:28:47,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,038 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-09 15:28:47,048 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-09 15:28:47,052 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-09 15:28:47,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:47,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:47,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:47,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:47,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:47,066 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:47,071 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:47,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:47,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,090 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-09 15:28:47,092 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-09 15:28:47,093 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-09 15:28:47,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:47,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:47,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:47,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:47,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:47,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:47,113 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:47,131 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-09 15:28:47,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,134 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-09 15:28:47,135 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-09 15:28:47,137 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-09 15:28:47,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:47,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:47,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:47,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:47,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:47,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:47,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:47,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-09 15:28:47,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,171 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-09 15:28:47,172 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-09 15:28:47,173 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-09 15:28:47,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:47,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:47,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:47,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:47,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:47,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:47,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:47,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:47,205 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-09 15:28:47,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,208 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-09 15:28:47,209 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-09 15:28:47,211 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-09 15:28:47,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:47,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:47,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:47,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:47,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:47,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:47,231 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:47,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-09 15:28:47,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,249 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-09 15:28:47,250 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-09 15:28:47,251 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-09 15:28:47,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:47,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:47,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:47,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:47,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:47,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:47,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:47,287 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-09 15:28:47,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,289 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-09 15:28:47,290 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-09 15:28:47,295 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-09 15:28:47,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:47,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:47,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:47,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:47,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:28:47,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:28:47,320 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:47,348 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-09 15:28:47,348 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-09 15:28:47,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,352 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-09 15:28:47,353 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-09 15:28:47,354 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:47,369 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:28:47,369 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:47,370 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, v_rep(select #length ULTIMATE.start_main_~#set~0#1.base)_1) = -8*ULTIMATE.start_main_~x~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#set~0#1.base)_1 Supporting invariants [] [2024-11-09 15:28:47,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-09 15:28:47,398 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-09 15:28:47,410 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 15:28:47,411 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 15:28:47,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:47,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:28:47,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:47,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:28:47,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:47,500 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-09 15:28:47,533 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:28:47,535 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 51 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 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-09 15:28:47,590 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 51 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 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 100 states and 155 transitions. Complement of second has 6 states. [2024-11-09 15:28:47,594 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-09 15:28:47,601 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-09 15:28:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2024-11-09 15:28:47,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-09 15:28:47,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:47,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-09 15:28:47,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:47,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-09 15:28:47,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:47,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 155 transitions. [2024-11-09 15:28:47,613 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2024-11-09 15:28:47,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 48 states and 74 transitions. [2024-11-09 15:28:47,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2024-11-09 15:28:47,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-11-09 15:28:47,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 74 transitions. [2024-11-09 15:28:47,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:47,620 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 74 transitions. [2024-11-09 15:28:47,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 74 transitions. [2024-11-09 15:28:47,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-09 15:28:47,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 47 states have internal predecessors, (74), 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-09 15:28:47,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 74 transitions. [2024-11-09 15:28:47,645 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 74 transitions. [2024-11-09 15:28:47,645 INFO L425 stractBuchiCegarLoop]: Abstraction has 48 states and 74 transitions. [2024-11-09 15:28:47,645 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:28:47,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 74 transitions. [2024-11-09 15:28:47,647 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2024-11-09 15:28:47,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:47,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:47,647 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:28:47,647 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:28:47,648 INFO L745 eck$LassoCheckResult]: Stem: 250#$Ultimate##0 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(48, 2); 216#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 217#L33-3 assume !(main_~x~0#1 < 100000); 209#L33-4 main_~x~0#1 := 0; 210#L39-3 [2024-11-09 15:28:47,648 INFO L747 eck$LassoCheckResult]: Loop: 210#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 224#L40-3 assume !true; 226#L39-2 main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 210#L39-3 [2024-11-09 15:28:47,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:47,648 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2024-11-09 15:28:47,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:47,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734725394] [2024-11-09 15:28:47,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:47,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:47,738 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-09 15:28:47,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:47,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734725394] [2024-11-09 15:28:47,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734725394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:47,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:47,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:28:47,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000140194] [2024-11-09 15:28:47,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:47,742 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:47,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:47,743 INFO L85 PathProgramCache]: Analyzing trace with hash 54521, now seen corresponding path program 1 times [2024-11-09 15:28:47,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:47,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750097970] [2024-11-09 15:28:47,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:47,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:47,751 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-09 15:28:47,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:47,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750097970] [2024-11-09 15:28:47,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750097970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:47,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:47,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 15:28:47,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501704163] [2024-11-09 15:28:47,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:47,752 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 15:28:47,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:47,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 15:28:47,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 15:28:47,756 INFO L87 Difference]: Start difference. First operand 48 states and 74 transitions. cyclomatic complexity: 31 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-09 15:28:47,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:47,765 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2024-11-09 15:28:47,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2024-11-09 15:28:47,769 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2024-11-09 15:28:47,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 39 states and 51 transitions. [2024-11-09 15:28:47,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2024-11-09 15:28:47,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-11-09 15:28:47,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2024-11-09 15:28:47,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:47,776 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-09 15:28:47,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2024-11-09 15:28:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-09 15:28:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 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-09 15:28:47,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-11-09 15:28:47,781 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-09 15:28:47,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 15:28:47,782 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-09 15:28:47,782 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:28:47,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2024-11-09 15:28:47,782 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2024-11-09 15:28:47,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:47,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:47,783 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:28:47,783 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:28:47,786 INFO L745 eck$LassoCheckResult]: Stem: 340#$Ultimate##0 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(48, 2); 310#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 311#L33-3 assume !(main_~x~0#1 < 100000); 306#L33-4 main_~x~0#1 := 0; 307#L39-3 [2024-11-09 15:28:47,786 INFO L747 eck$LassoCheckResult]: Loop: 307#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 318#L40-3 assume !(main_~y~0#1 < main_~n~0#1); 320#L39-2 main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 307#L39-3 [2024-11-09 15:28:47,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:47,786 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 2 times [2024-11-09 15:28:47,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:47,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144156767] [2024-11-09 15:28:47,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:47,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:47,835 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-09 15:28:47,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:47,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144156767] [2024-11-09 15:28:47,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144156767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:47,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:47,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:28:47,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133696102] [2024-11-09 15:28:47,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:47,837 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:47,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:47,838 INFO L85 PathProgramCache]: Analyzing trace with hash 53839, now seen corresponding path program 1 times [2024-11-09 15:28:47,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:47,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562796338] [2024-11-09 15:28:47,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:47,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:47,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:47,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:47,866 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:47,866 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:47,866 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:47,866 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:47,867 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 15:28:47,867 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,867 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:47,867 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:47,867 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration3_Loop [2024-11-09 15:28:47,867 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:47,867 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:47,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:47,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:47,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:47,905 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:47,906 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 15:28:47,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,910 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-09 15:28:47,912 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-09 15:28:47,913 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:28:47,913 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:28:47,927 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 15:28:47,927 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-09 15:28:47,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:47,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,939 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-09 15:28:47,940 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-09 15:28:47,942 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 15:28:47,942 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:28:47,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-09 15:28:47,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:47,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:47,965 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-09 15:28:47,966 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-09 15:28:47,967 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 15:28:47,967 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 15:28:48,110 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 15:28:48,115 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-09 15:28:48,115 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:28:48,115 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:28:48,115 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:28:48,115 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:28:48,116 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:28:48,116 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:48,116 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:28:48,116 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:28:48,116 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration3_Loop [2024-11-09 15:28:48,116 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:28:48,116 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:28:48,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:28:48,159 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:28:48,160 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:28:48,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:48,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:48,165 INFO L229 MonitoredProcess]: Starting monitored process 18 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-09 15:28:48,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-09 15:28:48,169 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-09 15:28:48,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:48,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:48,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:48,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:48,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:48,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:48,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:48,184 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:48,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-09 15:28:48,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:48,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:48,201 INFO L229 MonitoredProcess]: Starting monitored process 19 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-09 15:28:48,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-09 15:28:48,203 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-09 15:28:48,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:48,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:48,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:48,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:48,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:48,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:48,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:48,218 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:28:48,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-09 15:28:48,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:48,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:48,235 INFO L229 MonitoredProcess]: Starting monitored process 20 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-09 15:28:48,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-09 15:28:48,239 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-09 15:28:48,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:28:48,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:28:48,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:28:48,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:28:48,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:28:48,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:28:48,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:28:48,256 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:28:48,261 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 15:28:48,262 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-09 15:28:48,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:28:48,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:48,264 INFO L229 MonitoredProcess]: Starting monitored process 21 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-09 15:28:48,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-09 15:28:48,266 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:28:48,266 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 15:28:48,266 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:28:48,266 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~x~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2024-11-09 15:28:48,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-09 15:28:48,283 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 15:28:48,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:48,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:28:48,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:48,326 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:28:48,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:48,351 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-09 15:28:48,352 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:28:48,352 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 51 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-09 15:28:48,378 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 51 transitions. cyclomatic complexity: 17. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 46 states and 62 transitions. Complement of second has 5 states. [2024-11-09 15:28:48,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:28:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-09 15:28:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2024-11-09 15:28:48,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 3 letters. [2024-11-09 15:28:48,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:48,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 7 letters. Loop has 3 letters. [2024-11-09 15:28:48,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:48,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 6 letters. [2024-11-09 15:28:48,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:28:48,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 62 transitions. [2024-11-09 15:28:48,384 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2024-11-09 15:28:48,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 60 transitions. [2024-11-09 15:28:48,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2024-11-09 15:28:48,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-11-09 15:28:48,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 60 transitions. [2024-11-09 15:28:48,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:48,388 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 60 transitions. [2024-11-09 15:28:48,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 60 transitions. [2024-11-09 15:28:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2024-11-09 15:28:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 43 states have internal predecessors, (59), 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-09 15:28:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2024-11-09 15:28:48,393 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 59 transitions. [2024-11-09 15:28:48,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:48,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:28:48,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:28:48,394 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. 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-09 15:28:48,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:48,443 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2024-11-09 15:28:48,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 84 transitions. [2024-11-09 15:28:48,445 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 42 [2024-11-09 15:28:48,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 84 transitions. [2024-11-09 15:28:48,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2024-11-09 15:28:48,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2024-11-09 15:28:48,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 84 transitions. [2024-11-09 15:28:48,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:48,449 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 84 transitions. [2024-11-09 15:28:48,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 84 transitions. [2024-11-09 15:28:48,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2024-11-09 15:28:48,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 43 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-09 15:28:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2024-11-09 15:28:48,454 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 58 transitions. [2024-11-09 15:28:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:28:48,459 INFO L425 stractBuchiCegarLoop]: Abstraction has 44 states and 58 transitions. [2024-11-09 15:28:48,459 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:28:48,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 58 transitions. [2024-11-09 15:28:48,459 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2024-11-09 15:28:48,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:48,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:48,460 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:48,460 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:28:48,460 INFO L745 eck$LassoCheckResult]: Stem: 580#$Ultimate##0 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(48, 2); 547#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 548#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 578#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 579#L33-3 assume !(main_~x~0#1 < 100000); 541#L33-4 main_~x~0#1 := 0; 542#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 555#L40-3 [2024-11-09 15:28:48,460 INFO L747 eck$LassoCheckResult]: Loop: 555#L40-3 assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem5#1 := read~int#2(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem6#1 := read~int#2(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1 != main_#t~mem6#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 556#L13 assume !(0 == __VERIFIER_assert_~cond#1); 543#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1; 544#L40-2 main_#t~post7#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 555#L40-3 [2024-11-09 15:28:48,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:48,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669547, now seen corresponding path program 1 times [2024-11-09 15:28:48,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:48,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543381716] [2024-11-09 15:28:48,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:48,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:48,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-09 15:28:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:48,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:48,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543381716] [2024-11-09 15:28:48,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543381716] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:28:48,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333518483] [2024-11-09 15:28:48,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:48,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:28:48,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:48,560 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-09 15:28:48,561 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-09 15:28:48,562 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-09 15:28:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:48,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 15:28:48,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:48,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:48,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:28:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:48,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333518483] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:28:48,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:28:48,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-09 15:28:48,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041071787] [2024-11-09 15:28:48,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:28:48,650 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:48,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:48,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1922577, now seen corresponding path program 1 times [2024-11-09 15:28:48,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:48,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456172152] [2024-11-09 15:28:48,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:48,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:48,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:48,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:48,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:48,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 15:28:48,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 15:28:48,778 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. cyclomatic complexity: 20 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-09 15:28:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:48,893 INFO L93 Difference]: Finished difference Result 137 states and 173 transitions. [2024-11-09 15:28:48,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 173 transitions. [2024-11-09 15:28:48,898 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 84 [2024-11-09 15:28:48,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 137 states and 173 transitions. [2024-11-09 15:28:48,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2024-11-09 15:28:48,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2024-11-09 15:28:48,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 173 transitions. [2024-11-09 15:28:48,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:28:48,904 INFO L218 hiAutomatonCegarLoop]: Abstraction has 137 states and 173 transitions. [2024-11-09 15:28:48,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 173 transitions. [2024-11-09 15:28:48,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 50. [2024-11-09 15:28:48,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.28) internal successors, (64), 49 states have internal predecessors, (64), 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-09 15:28:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2024-11-09 15:28:48,913 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2024-11-09 15:28:48,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:28:48,915 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2024-11-09 15:28:48,916 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:28:48,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 64 transitions. [2024-11-09 15:28:48,917 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2024-11-09 15:28:48,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:48,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:48,918 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2024-11-09 15:28:48,918 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:28:48,919 INFO L745 eck$LassoCheckResult]: Stem: 807#$Ultimate##0 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(48, 2); 774#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 775#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 805#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 806#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 808#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 813#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 812#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 811#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 810#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 809#L33-3 assume !(main_~x~0#1 < 100000); 768#L33-4 main_~x~0#1 := 0; 769#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 782#L40-3 [2024-11-09 15:28:48,919 INFO L747 eck$LassoCheckResult]: Loop: 782#L40-3 assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem5#1 := read~int#2(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem6#1 := read~int#2(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem5#1 != main_#t~mem6#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 783#L13 assume !(0 == __VERIFIER_assert_~cond#1); 770#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1; 771#L40-2 main_#t~post7#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 782#L40-3 [2024-11-09 15:28:48,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:48,919 INFO L85 PathProgramCache]: Analyzing trace with hash 82232677, now seen corresponding path program 2 times [2024-11-09 15:28:48,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:48,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552442760] [2024-11-09 15:28:48,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:48,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:49,018 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 15:28:49,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:49,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552442760] [2024-11-09 15:28:49,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552442760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:28:49,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:28:49,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:28:49,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797927519] [2024-11-09 15:28:49,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:28:49,020 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:49,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:49,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1922577, now seen corresponding path program 2 times [2024-11-09 15:28:49,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:49,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080056990] [2024-11-09 15:28:49,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:49,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:49,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:49,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:49,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:49,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:28:49,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:28:49,121 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. cyclomatic complexity: 20 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-09 15:28:49,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:49,154 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2024-11-09 15:28:49,154 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 64 transitions. [2024-11-09 15:28:49,154 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2024-11-09 15:28:49,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 50 states and 62 transitions. [2024-11-09 15:28:49,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-09 15:28:49,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-09 15:28:49,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 62 transitions. [2024-11-09 15:28:49,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:49,156 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 62 transitions. [2024-11-09 15:28:49,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 62 transitions. [2024-11-09 15:28:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-09 15:28:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.24) internal successors, (62), 49 states have internal predecessors, (62), 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-09 15:28:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2024-11-09 15:28:49,163 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 62 transitions. [2024-11-09 15:28:49,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:28:49,167 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 62 transitions. [2024-11-09 15:28:49,167 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:28:49,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 62 transitions. [2024-11-09 15:28:49,167 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2024-11-09 15:28:49,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:49,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:49,168 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:49,168 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:28:49,168 INFO L745 eck$LassoCheckResult]: Stem: 913#$Ultimate##0 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(48, 2); 878#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 879#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 909#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 910#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 914#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 919#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 918#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 917#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 916#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 915#L33-3 assume !(main_~x~0#1 < 100000); 876#L33-4 main_~x~0#1 := 0; 877#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 895#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 896#L47-3 [2024-11-09 15:28:49,168 INFO L747 eck$LassoCheckResult]: Loop: 896#L47-3 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1; 897#L47-2 main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 896#L47-3 [2024-11-09 15:28:49,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:49,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754313, now seen corresponding path program 1 times [2024-11-09 15:28:49,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:49,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623862345] [2024-11-09 15:28:49,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:49,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:49,285 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:49,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:49,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623862345] [2024-11-09 15:28:49,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623862345] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:28:49,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865874261] [2024-11-09 15:28:49,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:49,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:28:49,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,288 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-09 15:28:49,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-09 15:28:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:49,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:28:49,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:49,374 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:49,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:28:49,442 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:49,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865874261] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:28:49,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:28:49,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-09 15:28:49,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534978668] [2024-11-09 15:28:49,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:28:49,444 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:49,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:49,444 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 1 times [2024-11-09 15:28:49,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:49,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191021810] [2024-11-09 15:28:49,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:49,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:49,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:49,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:49,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:49,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 15:28:49,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 15:28:49,505 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. cyclomatic complexity: 17 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-09 15:28:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:49,674 INFO L93 Difference]: Finished difference Result 182 states and 224 transitions. [2024-11-09 15:28:49,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 224 transitions. [2024-11-09 15:28:49,676 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 134 [2024-11-09 15:28:49,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 182 states and 224 transitions. [2024-11-09 15:28:49,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2024-11-09 15:28:49,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2024-11-09 15:28:49,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 224 transitions. [2024-11-09 15:28:49,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:49,679 INFO L218 hiAutomatonCegarLoop]: Abstraction has 182 states and 224 transitions. [2024-11-09 15:28:49,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 224 transitions. [2024-11-09 15:28:49,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 62. [2024-11-09 15:28:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 61 states have internal predecessors, (74), 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-09 15:28:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2024-11-09 15:28:49,686 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 74 transitions. [2024-11-09 15:28:49,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 15:28:49,689 INFO L425 stractBuchiCegarLoop]: Abstraction has 62 states and 74 transitions. [2024-11-09 15:28:49,690 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:28:49,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 74 transitions. [2024-11-09 15:28:49,691 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2024-11-09 15:28:49,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:49,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:49,691 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:49,691 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:28:49,692 INFO L745 eck$LassoCheckResult]: Stem: 1233#$Ultimate##0 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(48, 2); 1207#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 1208#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1231#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1232#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1235#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1255#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1254#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1253#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1252#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1251#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1250#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1249#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1248#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1247#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1246#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1245#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1244#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1243#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1242#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1241#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1237#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1236#L33-3 assume !(main_~x~0#1 < 100000); 1203#L33-4 main_~x~0#1 := 0; 1204#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 1221#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 1222#L47-3 [2024-11-09 15:28:49,692 INFO L747 eck$LassoCheckResult]: Loop: 1222#L47-3 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1; 1223#L47-2 main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1222#L47-3 [2024-11-09 15:28:49,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:49,693 INFO L85 PathProgramCache]: Analyzing trace with hash -95702845, now seen corresponding path program 2 times [2024-11-09 15:28:49,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:49,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175205412] [2024-11-09 15:28:49,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:49,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:49,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:49,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175205412] [2024-11-09 15:28:49,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175205412] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:28:49,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501840771] [2024-11-09 15:28:49,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:28:49,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:28:49,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:49,943 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:28:49,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-09 15:28:50,016 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:28:50,017 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:28:50,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:28:50,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:50,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:28:50,313 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:50,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501840771] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:28:50,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:28:50,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-09 15:28:50,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994959517] [2024-11-09 15:28:50,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:28:50,314 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:50,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:50,314 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 2 times [2024-11-09 15:28:50,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:50,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919826284] [2024-11-09 15:28:50,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:50,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:50,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:50,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:50,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:50,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 15:28:50,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-09 15:28:50,372 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. cyclomatic complexity: 17 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-09 15:28:50,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:50,743 INFO L93 Difference]: Finished difference Result 350 states and 428 transitions. [2024-11-09 15:28:50,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 350 states and 428 transitions. [2024-11-09 15:28:50,746 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 254 [2024-11-09 15:28:50,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 350 states to 350 states and 428 transitions. [2024-11-09 15:28:50,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2024-11-09 15:28:50,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2024-11-09 15:28:50,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 350 states and 428 transitions. [2024-11-09 15:28:50,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:50,749 INFO L218 hiAutomatonCegarLoop]: Abstraction has 350 states and 428 transitions. [2024-11-09 15:28:50,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states and 428 transitions. [2024-11-09 15:28:50,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 86. [2024-11-09 15:28:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.1395348837209303) internal successors, (98), 85 states have internal predecessors, (98), 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-09 15:28:50,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2024-11-09 15:28:50,754 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 98 transitions. [2024-11-09 15:28:50,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 15:28:50,755 INFO L425 stractBuchiCegarLoop]: Abstraction has 86 states and 98 transitions. [2024-11-09 15:28:50,755 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:28:50,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 98 transitions. [2024-11-09 15:28:50,756 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2024-11-09 15:28:50,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:50,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:50,757 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:50,757 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:28:50,757 INFO L745 eck$LassoCheckResult]: Stem: 1825#$Ultimate##0 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(48, 2); 1795#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 1796#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1827#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1828#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1823#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1824#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1870#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1869#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1868#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1867#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1866#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1865#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1864#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1863#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1862#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1861#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1860#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1859#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1858#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1857#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1856#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1855#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1854#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1853#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1852#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1851#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1850#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1849#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1848#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1847#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1846#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1845#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1844#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1843#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1842#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1841#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1840#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1839#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1838#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1837#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1836#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1835#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1832#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1831#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 1830#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1829#L33-3 assume !(main_~x~0#1 < 100000); 1793#L33-4 main_~x~0#1 := 0; 1794#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 1812#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 1813#L47-3 [2024-11-09 15:28:50,757 INFO L747 eck$LassoCheckResult]: Loop: 1813#L47-3 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1; 1814#L47-2 main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1813#L47-3 [2024-11-09 15:28:50,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:50,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1293970907, now seen corresponding path program 3 times [2024-11-09 15:28:50,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:50,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347962042] [2024-11-09 15:28:50,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:50,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:51,421 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:51,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:51,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347962042] [2024-11-09 15:28:51,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347962042] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:28:51,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624980415] [2024-11-09 15:28:51,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 15:28:51,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:28:51,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:51,425 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:28:51,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-09 15:28:52,293 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2024-11-09 15:28:52,294 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:28:52,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 15:28:52,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:52,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:28:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:53,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624980415] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:28:53,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:28:53,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2024-11-09 15:28:53,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322679536] [2024-11-09 15:28:53,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:28:53,108 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:53,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:53,108 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 3 times [2024-11-09 15:28:53,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:53,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534420667] [2024-11-09 15:28:53,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:53,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:53,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:53,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:53,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:53,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-09 15:28:53,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 15:28:53,166 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. cyclomatic complexity: 17 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-09 15:28:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:28:54,050 INFO L93 Difference]: Finished difference Result 686 states and 836 transitions. [2024-11-09 15:28:54,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 686 states and 836 transitions. [2024-11-09 15:28:54,057 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 494 [2024-11-09 15:28:54,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 686 states to 686 states and 836 transitions. [2024-11-09 15:28:54,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 594 [2024-11-09 15:28:54,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 594 [2024-11-09 15:28:54,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 686 states and 836 transitions. [2024-11-09 15:28:54,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:28:54,063 INFO L218 hiAutomatonCegarLoop]: Abstraction has 686 states and 836 transitions. [2024-11-09 15:28:54,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states and 836 transitions. [2024-11-09 15:28:54,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 134. [2024-11-09 15:28:54,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 134 states have (on average 1.0895522388059702) internal successors, (146), 133 states have internal predecessors, (146), 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-09 15:28:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2024-11-09 15:28:54,070 INFO L240 hiAutomatonCegarLoop]: Abstraction has 134 states and 146 transitions. [2024-11-09 15:28:54,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-09 15:28:54,072 INFO L425 stractBuchiCegarLoop]: Abstraction has 134 states and 146 transitions. [2024-11-09 15:28:54,072 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 15:28:54,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 146 transitions. [2024-11-09 15:28:54,073 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2024-11-09 15:28:54,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:28:54,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:28:54,076 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1, 1, 1] [2024-11-09 15:28:54,076 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:28:54,076 INFO L745 eck$LassoCheckResult]: Stem: 2941#$Ultimate##0 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(48, 2); 2913#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 2914#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2939#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2940#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2943#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3035#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3034#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3033#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3032#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3031#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3030#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3029#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3028#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3027#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3026#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3025#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3024#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3023#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3022#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3021#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3020#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3019#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3018#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3017#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3016#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3015#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3014#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3013#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3012#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3011#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3010#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3009#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3008#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3007#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3006#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3005#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3004#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3003#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3002#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3001#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 3000#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2999#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2998#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2997#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2996#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2995#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2994#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2993#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2992#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2991#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2990#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2989#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2988#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2987#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2986#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2985#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2984#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2983#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2982#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2981#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2980#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2979#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2978#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2977#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2976#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2975#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2974#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2973#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2972#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2971#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2970#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2969#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2968#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2967#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2966#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2965#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2964#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2963#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2962#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2961#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2960#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2959#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2958#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2957#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2956#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2955#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2954#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2953#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2952#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2951#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2950#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2949#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 2945#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2944#L33-3 assume !(main_~x~0#1 < 100000); 2911#L33-4 main_~x~0#1 := 0; 2912#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 2929#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 2930#L47-3 [2024-11-09 15:28:54,077 INFO L747 eck$LassoCheckResult]: Loop: 2930#L47-3 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1; 2931#L47-2 main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2930#L47-3 [2024-11-09 15:28:54,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:54,078 INFO L85 PathProgramCache]: Analyzing trace with hash -675114997, now seen corresponding path program 4 times [2024-11-09 15:28:54,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:54,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315538615] [2024-11-09 15:28:54,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:54,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:28:56,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:56,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:28:56,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315538615] [2024-11-09 15:28:56,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315538615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:28:56,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150291718] [2024-11-09 15:28:56,035 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 15:28:56,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:28:56,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:28:56,056 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:28:56,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-09 15:28:56,223 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 15:28:56,223 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:28:56,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 15:28:56,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:28:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:56,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:28:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:28:58,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150291718] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:28:58,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:28:58,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2024-11-09 15:28:58,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835783899] [2024-11-09 15:28:58,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:28:58,852 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:28:58,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:28:58,852 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 4 times [2024-11-09 15:28:58,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:28:58,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163379539] [2024-11-09 15:28:58,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:28:58,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:28:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:58,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:28:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:28:58,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:28:58,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:28:58,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-11-09 15:28:58,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2024-11-09 15:28:58,904 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. cyclomatic complexity: 17 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-09 15:29:02,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:29:02,888 INFO L93 Difference]: Finished difference Result 1358 states and 1652 transitions. [2024-11-09 15:29:02,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1358 states and 1652 transitions. [2024-11-09 15:29:02,896 INFO L131 ngComponentsAnalysis]: Automaton has 98 accepting balls. 974 [2024-11-09 15:29:02,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1358 states to 1358 states and 1652 transitions. [2024-11-09 15:29:02,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1170 [2024-11-09 15:29:02,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1170 [2024-11-09 15:29:02,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1358 states and 1652 transitions. [2024-11-09 15:29:02,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:29:02,904 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1358 states and 1652 transitions. [2024-11-09 15:29:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states and 1652 transitions. [2024-11-09 15:29:02,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 230. [2024-11-09 15:29:02,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 230 states have (on average 1.0521739130434782) internal successors, (242), 229 states have internal predecessors, (242), 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-09 15:29:02,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 242 transitions. [2024-11-09 15:29:02,924 INFO L240 hiAutomatonCegarLoop]: Abstraction has 230 states and 242 transitions. [2024-11-09 15:29:02,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-09 15:29:02,925 INFO L425 stractBuchiCegarLoop]: Abstraction has 230 states and 242 transitions. [2024-11-09 15:29:02,925 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 15:29:02,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 230 states and 242 transitions. [2024-11-09 15:29:02,926 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2024-11-09 15:29:02,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:29:02,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:29:02,932 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1, 1, 1] [2024-11-09 15:29:02,934 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:29:02,934 INFO L745 eck$LassoCheckResult]: Stem: 5117#$Ultimate##0 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(48, 2); 5087#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 5088#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5119#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5120#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5115#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5116#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5306#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5305#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5304#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5303#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5302#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5301#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5300#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5299#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5298#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5297#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5296#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5295#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5294#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5293#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5292#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5291#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5290#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5289#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5288#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5287#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5286#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5285#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5284#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5283#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5282#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5281#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5280#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5279#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5278#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5277#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5276#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5275#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5274#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5273#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5272#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5271#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5270#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5269#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5268#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5267#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5266#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5265#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5264#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5263#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5262#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5261#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5260#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5259#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5258#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5257#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5256#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5255#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5254#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5253#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5252#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5251#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5250#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5249#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5248#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5247#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5246#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5245#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5244#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5243#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5242#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5241#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5240#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5239#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5238#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5237#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5236#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5235#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5234#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5233#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5232#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5231#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5230#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5229#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5228#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5227#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5226#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5225#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5224#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5223#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5222#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5221#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5220#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5219#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5218#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5217#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5216#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5215#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5214#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5213#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5212#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5211#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5210#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5209#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5208#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5207#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5206#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5205#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5204#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5203#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5202#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5201#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5200#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5199#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5198#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5197#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5196#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5195#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5194#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5193#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5192#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5191#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5190#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5189#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5188#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5187#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5186#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5185#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5184#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5183#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5182#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5181#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5180#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5179#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5178#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5177#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5176#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5175#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5174#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5173#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5172#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5171#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5170#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5169#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5168#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5167#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5166#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5165#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5164#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5163#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5162#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5161#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5160#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5159#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5158#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5157#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5156#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5155#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5154#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5153#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5152#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5151#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5150#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5149#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5148#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5147#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5146#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5145#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5144#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5143#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5142#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5141#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5140#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5139#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5138#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5137#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5136#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5135#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5134#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5133#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5132#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5131#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5130#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5129#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5128#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5127#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5124#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5123#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#2(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1; 5122#L33-2 main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5121#L33-3 assume !(main_~x~0#1 < 100000); 5085#L33-4 main_~x~0#1 := 0; 5086#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 5104#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 5105#L47-3 [2024-11-09 15:29:02,934 INFO L747 eck$LassoCheckResult]: Loop: 5105#L47-3 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#1(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1; 5106#L47-2 main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5105#L47-3 [2024-11-09 15:29:02,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:29:02,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1064733589, now seen corresponding path program 5 times [2024-11-09 15:29:02,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:29:02,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439609783] [2024-11-09 15:29:02,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:29:02,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:29:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:29:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:29:08,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:29:08,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439609783] [2024-11-09 15:29:08,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439609783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:29:08,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119863150] [2024-11-09 15:29:08,717 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 15:29:08,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:29:08,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:29:08,720 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:29:08,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process