./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 023d838f 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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:42:05,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:42:05,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-10 22:42:05,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:42:05,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:42:05,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 22:42:05,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:42:05,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:42:05,792 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:42:05,793 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:42:05,794 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:42:05,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:42:05,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:42:05,797 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:42:05,797 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 22:42:05,797 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 22:42:05,797 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 22:42:05,798 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 22:42:05,798 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 22:42:05,798 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 22:42:05,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:42:05,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 22:42:05,803 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 22:42:05,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:42:05,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 22:42:05,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:42:05,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 22:42:05,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 22:42:05,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 22:42:05,804 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:42:05,804 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:42:05,805 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 22:42:05,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:42:05,805 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 22:42:05,805 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:42:05,806 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:42:05,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:42:05,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:42:05,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:42:05,809 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 22:42:05,809 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-10 22:42:06,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:42:06,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:42:06,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:42:06,108 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:42:06,108 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:42:06,110 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-10 22:42:07,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:42:07,782 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:42:07,783 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2024-11-10 22:42:07,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539025abd/23457f3b094545eca911d4af6afaf2b9/FLAG2b3879f97 [2024-11-10 22:42:07,803 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539025abd/23457f3b094545eca911d4af6afaf2b9 [2024-11-10 22:42:07,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:42:07,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:42:07,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:42:07,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:42:07,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:42:07,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:42:07" (1/1) ... [2024-11-10 22:42:07,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b9e5e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:07, skipping insertion in model container [2024-11-10 22:42:07,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:42:07" (1/1) ... [2024-11-10 22:42:07,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:42:08,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:42:08,065 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:42:08,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:42:08,119 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:42:08,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:08 WrapperNode [2024-11-10 22:42:08,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:42:08,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:42:08,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:42:08,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:42:08,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:08" (1/1) ... [2024-11-10 22:42:08,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:08" (1/1) ... [2024-11-10 22:42:08,177 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 166 [2024-11-10 22:42:08,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:42:08,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:42:08,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:42:08,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:42:08,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:08" (1/1) ... [2024-11-10 22:42:08,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:08" (1/1) ... [2024-11-10 22:42:08,204 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:08" (1/1) ... [2024-11-10 22:42:08,237 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 9, 3]. 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, 2, 1]. [2024-11-10 22:42:08,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:08" (1/1) ... [2024-11-10 22:42:08,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:08" (1/1) ... [2024-11-10 22:42:08,249 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:08" (1/1) ... [2024-11-10 22:42:08,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:08" (1/1) ... [2024-11-10 22:42:08,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:08" (1/1) ... [2024-11-10 22:42:08,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:08" (1/1) ... [2024-11-10 22:42:08,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:42:08,255 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:42:08,255 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:42:08,255 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:42:08,256 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:08" (1/1) ... [2024-11-10 22:42:08,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:08,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:08,298 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-10 22:42:08,299 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-10 22:42:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 22:42:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 22:42:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 22:42:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 22:42:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 22:42:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 22:42:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 22:42:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 22:42:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:42:08,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:42:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 22:42:08,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 22:42:08,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 22:42:08,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 22:42:08,410 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:42:08,412 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:42:08,628 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L29: call ULTIMATE.dealloc(main_~#set~0#1.base, main_~#set~0#1.offset);havoc main_~#set~0#1.base, main_~#set~0#1.offset;call ULTIMATE.dealloc(main_~#values~0#1.base, main_~#values~0#1.offset);havoc main_~#values~0#1.base, main_~#values~0#1.offset; [2024-11-10 22:42:08,655 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-10 22:42:08,658 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:42:08,673 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:42:08,674 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 22:42:08,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:42:08 BoogieIcfgContainer [2024-11-10 22:42:08,674 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:42:08,675 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 22:42:08,675 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 22:42:08,678 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 22:42:08,679 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:42:08,679 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:42:07" (1/3) ... [2024-11-10 22:42:08,679 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b50aa0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:42:08, skipping insertion in model container [2024-11-10 22:42:08,680 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:42:08,680 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:08" (2/3) ... [2024-11-10 22:42:08,680 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b50aa0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:42:08, skipping insertion in model container [2024-11-10 22:42:08,680 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:42:08,681 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:42:08" (3/3) ... [2024-11-10 22:42:08,682 INFO L332 chiAutomizerObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2024-11-10 22:42:08,728 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 22:42:08,728 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 22:42:08,729 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 22:42:08,729 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 22:42:08,729 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 22:42:08,729 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 22:42:08,729 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 22:42:08,729 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 22:42:08,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 states have internal predecessors, (82), 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-10 22:42:08,750 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 45 [2024-11-10 22:42:08,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:42:08,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:42:08,756 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:42:08,756 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:42:08,756 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 22:42:08,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 states have internal predecessors, (82), 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-10 22:42:08,760 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 45 [2024-11-10 22:42:08,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:42:08,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:42:08,760 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:42:08,760 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:42:08,766 INFO L745 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 25#ULTIMATE.init_returnLabel#1true assume true;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; 21#L33true [2024-11-10 22:42:08,766 INFO L747 eck$LassoCheckResult]: Loop: 21#L33true assume true; 46#L33-1true assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 21#L33true [2024-11-10 22:42:08,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:08,770 INFO L85 PathProgramCache]: Analyzing trace with hash 4384, now seen corresponding path program 1 times [2024-11-10 22:42:08,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:08,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515528919] [2024-11-10 22:42:08,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:08,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:08,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:42:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:08,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:42:08,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:08,890 INFO L85 PathProgramCache]: Analyzing trace with hash 4288, now seen corresponding path program 1 times [2024-11-10 22:42:08,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:08,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179168704] [2024-11-10 22:42:08,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:08,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:08,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:42:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:08,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:42:08,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:08,909 INFO L85 PathProgramCache]: Analyzing trace with hash 4216351, now seen corresponding path program 1 times [2024-11-10 22:42:08,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:08,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564524686] [2024-11-10 22:42:08,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:08,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:08,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:42:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:08,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:42:09,261 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:42:09,261 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:42:09,262 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:42:09,262 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:42:09,262 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:42:09,262 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:09,263 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:42:09,263 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:42:09,264 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration1_Lasso [2024-11-10 22:42:09,264 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:42:09,264 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:42:09,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:09,811 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:42:09,815 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:42:09,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:09,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:09,819 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-10 22:42:09,821 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-10 22:42:09,822 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-10 22:42:09,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:09,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:42:09,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:09,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:09,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:09,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:42:09,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:42:09,842 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:09,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-10 22:42:09,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:09,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:09,861 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-10 22:42:09,862 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-10 22:42:09,864 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-10 22:42:09,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:09,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:42:09,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:09,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:09,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:09,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:42:09,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:42:09,878 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:09,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-10 22:42:09,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:09,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:09,896 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-10 22:42:09,897 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-10 22:42:09,898 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-10 22:42:09,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:09,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:42:09,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:09,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:09,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:09,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:42:09,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:42:09,911 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:09,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-10 22:42:09,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:09,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:09,928 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-10 22:42:09,930 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-10 22:42:09,931 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-10 22:42:09,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:09,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:42:09,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:09,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:09,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:09,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:42:09,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:42:09,950 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:09,966 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-10 22:42:09,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:09,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:09,968 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-10 22:42:09,970 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-10 22:42:09,971 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-10 22:42:09,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:09,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:42:09,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:09,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:09,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:09,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:42:09,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:42:09,987 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:10,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-10 22:42:10,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:10,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:10,005 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-10 22:42:10,008 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-10 22:42:10,009 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-10 22:42:10,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:10,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:42:10,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:10,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:10,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:10,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:42:10,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:42:10,028 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:10,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-10 22:42:10,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:10,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:10,046 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-10 22:42:10,048 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-10 22:42:10,049 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-10 22:42:10,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:10,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:42:10,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:10,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:10,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:10,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:42:10,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:42:10,064 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:10,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-10 22:42:10,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:10,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:10,081 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-10 22:42:10,082 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-10 22:42:10,084 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-10 22:42:10,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:10,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:42:10,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:10,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:10,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:10,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:42:10,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:42:10,100 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:10,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-10 22:42:10,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:10,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:10,118 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-10 22:42:10,120 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-10 22:42:10,120 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-10 22:42:10,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:10,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:42:10,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:10,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:10,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:10,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:42:10,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:42:10,136 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:10,151 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-10 22:42:10,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:10,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:10,154 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-10 22:42:10,155 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-10 22:42:10,157 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-10 22:42:10,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:10,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:42:10,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:10,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:10,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:10,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:42:10,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:42:10,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:10,191 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-10 22:42:10,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:10,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:10,193 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-10 22:42:10,194 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-10 22:42:10,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-10 22:42:10,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:10,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:42:10,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:10,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:10,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:10,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:42:10,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:42:10,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:10,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-10 22:42:10,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:10,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:10,227 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-10 22:42:10,228 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-10 22:42:10,229 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-10 22:42:10,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:10,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:42:10,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:10,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:10,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:10,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:42:10,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:42:10,243 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:10,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-10 22:42:10,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:10,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:10,256 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-10 22:42:10,257 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-10 22:42:10,258 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-10 22:42:10,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:10,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:10,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:10,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:10,271 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:42:10,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:42:10,275 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:10,288 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-10 22:42:10,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:10,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:10,289 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-10 22:42:10,290 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-10 22:42:10,291 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-10 22:42:10,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:10,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:10,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:10,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:10,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:42:10,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:42:10,306 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:10,321 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-10 22:42:10,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:10,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:10,324 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-10 22:42:10,325 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-10 22:42:10,326 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-10 22:42:10,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:10,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:42:10,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:10,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:10,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:10,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:42:10,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:42:10,341 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:10,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-10 22:42:10,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:10,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:10,353 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-10 22:42:10,354 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-10 22:42:10,354 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-10 22:42:10,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:10,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:42:10,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:10,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:10,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:10,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:42:10,366 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:42:10,367 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:10,378 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-10 22:42:10,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:10,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:10,379 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-10 22:42:10,380 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-10 22:42:10,381 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-10 22:42:10,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:10,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:42:10,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:10,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:10,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:10,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:42:10,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:42:10,393 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:10,405 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-10 22:42:10,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:10,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:10,406 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-10 22:42:10,407 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-10 22:42:10,408 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-10 22:42:10,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:10,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:42:10,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:10,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:10,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:10,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:42:10,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:42:10,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:10,430 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-10 22:42:10,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:10,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:10,432 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-10 22:42:10,433 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-10 22:42:10,434 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-10 22:42:10,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:10,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:10,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:10,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:10,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:42:10,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:42:10,452 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:10,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-10 22:42:10,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:10,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:10,469 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-10 22:42:10,472 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-10 22:42:10,473 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-10 22:42:10,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:10,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:10,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:10,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:10,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:42:10,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:42:10,494 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:10,508 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-10 22:42:10,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:10,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:10,511 INFO L229 MonitoredProcess]: Starting monitored process 22 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-10 22:42:10,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-10 22:42:10,514 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-10 22:42:10,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:10,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:10,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:10,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:10,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:42:10,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:42:10,535 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-10 22:42:10,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-10 22:42:10,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:10,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:10,548 INFO L229 MonitoredProcess]: Starting monitored process 23 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-10 22:42:10,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-10 22:42:10,550 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-10 22:42:10,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:10,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:10,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:10,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:10,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-10 22:42:10,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-10 22:42:10,572 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:42:10,591 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-11-10 22:42:10,591 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-11-10 22:42:10,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:10,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:10,618 INFO L229 MonitoredProcess]: Starting monitored process 24 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-10 22:42:10,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-10 22:42:10,621 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:42:10,632 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-10 22:42:10,632 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:42:10,633 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-10 22:42:10,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-10 22:42:10,657 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-10 22:42:10,669 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-10 22:42:10,670 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-10 22:42:10,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:10,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:42:10,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:42:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:10,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 22:42:10,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:42:10,730 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-10 22:42:10,766 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-10 22:42:10,769 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 states have internal predecessors, (82), 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-10 22:42:10,806 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 55 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 54 states have internal predecessors, (82), 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 108 states and 162 transitions. Complement of second has 6 states. [2024-11-10 22:42:10,809 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-10 22:42:10,813 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-10 22:42:10,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2024-11-10 22:42:10,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-10 22:42:10,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:42:10,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-10 22:42:10,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:42:10,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-10 22:42:10,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:42:10,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 162 transitions. [2024-11-10 22:42:10,821 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 43 [2024-11-10 22:42:10,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 53 states and 79 transitions. [2024-11-10 22:42:10,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-11-10 22:42:10,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2024-11-10 22:42:10,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 79 transitions. [2024-11-10 22:42:10,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:42:10,827 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 79 transitions. [2024-11-10 22:42:10,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 79 transitions. [2024-11-10 22:42:10,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-10 22:42:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 52 states have internal predecessors, (79), 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-10 22:42:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. [2024-11-10 22:42:10,852 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 79 transitions. [2024-11-10 22:42:10,852 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 79 transitions. [2024-11-10 22:42:10,852 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 22:42:10,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 79 transitions. [2024-11-10 22:42:10,853 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 43 [2024-11-10 22:42:10,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:42:10,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:42:10,854 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-10 22:42:10,854 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 22:42:10,854 INFO L745 eck$LassoCheckResult]: Stem: 266#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 249#ULTIMATE.init_returnLabel#1 assume true;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; 240#L33 assume true; 242#L33-1 assume !(main_~x~0#1 < 100000); 265#L39-3 main_~x~0#1 := 0; 245#L39 [2024-11-10 22:42:10,854 INFO L747 eck$LassoCheckResult]: Loop: 245#L39 assume true; 263#L39-2 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 238#L40 assume !true; 244#L39-1 main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 245#L39 [2024-11-10 22:42:10,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:10,855 INFO L85 PathProgramCache]: Analyzing trace with hash 130706918, now seen corresponding path program 1 times [2024-11-10 22:42:10,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:10,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893739656] [2024-11-10 22:42:10,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:10,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:10,922 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-10 22:42:10,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:42:10,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893739656] [2024-11-10 22:42:10,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893739656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:42:10,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:42:10,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:42:10,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860502084] [2024-11-10 22:42:10,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:42:10,926 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:42:10,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:10,926 INFO L85 PathProgramCache]: Analyzing trace with hash 3908435, now seen corresponding path program 1 times [2024-11-10 22:42:10,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:10,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514482960] [2024-11-10 22:42:10,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:10,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:10,939 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-10 22:42:10,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:42:10,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514482960] [2024-11-10 22:42:10,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514482960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:42:10,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:42:10,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 22:42:10,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462433561] [2024-11-10 22:42:10,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:42:10,940 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:42:10,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:42:10,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 22:42:10,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 22:42:10,944 INFO L87 Difference]: Start difference. First operand 53 states and 79 transitions. cyclomatic complexity: 31 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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-10 22:42:10,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:42:10,950 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2024-11-10 22:42:10,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 62 transitions. [2024-11-10 22:42:10,951 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2024-11-10 22:42:10,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 44 states and 56 transitions. [2024-11-10 22:42:10,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-10 22:42:10,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-10 22:42:10,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 56 transitions. [2024-11-10 22:42:10,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:42:10,953 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 56 transitions. [2024-11-10 22:42:10,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 56 transitions. [2024-11-10 22:42:10,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-10 22:42:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 43 states have internal predecessors, (56), 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-10 22:42:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2024-11-10 22:42:10,956 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 56 transitions. [2024-11-10 22:42:10,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 22:42:10,956 INFO L425 stractBuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2024-11-10 22:42:10,956 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 22:42:10,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 56 transitions. [2024-11-10 22:42:10,957 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2024-11-10 22:42:10,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:42:10,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:42:10,958 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-10 22:42:10,958 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-10 22:42:10,958 INFO L745 eck$LassoCheckResult]: Stem: 355#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 356#ULTIMATE.init_returnLabel#1 assume true;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; 362#L33 assume true; 359#L33-1 assume !(main_~x~0#1 < 100000); 354#L39-3 main_~x~0#1 := 0; 350#L39 [2024-11-10 22:42:10,958 INFO L747 eck$LassoCheckResult]: Loop: 350#L39 assume true; 351#L39-2 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 357#L40 assume true; 366#L40-1 assume !(main_~y~0#1 < main_~n~0#1); 363#L39-1 main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 350#L39 [2024-11-10 22:42:10,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:10,959 INFO L85 PathProgramCache]: Analyzing trace with hash 130706918, now seen corresponding path program 2 times [2024-11-10 22:42:10,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:10,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508891171] [2024-11-10 22:42:10,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:10,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:10,987 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-10 22:42:10,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:42:10,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508891171] [2024-11-10 22:42:10,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508891171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:42:10,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:42:10,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:42:10,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123033049] [2024-11-10 22:42:10,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:42:10,988 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:42:10,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:10,991 INFO L85 PathProgramCache]: Analyzing trace with hash 121160882, now seen corresponding path program 1 times [2024-11-10 22:42:10,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:10,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88627801] [2024-11-10 22:42:10,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:10,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:10,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:42:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:11,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:42:11,032 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:42:11,032 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:42:11,032 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:42:11,033 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:42:11,033 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-10 22:42:11,033 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:11,033 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:42:11,033 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:42:11,033 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration3_Loop [2024-11-10 22:42:11,033 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:42:11,033 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:42:11,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:11,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:11,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:11,068 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:42:11,069 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-10 22:42:11,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:11,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:11,073 INFO L229 MonitoredProcess]: Starting monitored process 25 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-10 22:42:11,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-10 22:42:11,075 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-10 22:42:11,075 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:42:11,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-10 22:42:11,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:11,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:11,108 INFO L229 MonitoredProcess]: Starting monitored process 26 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-10 22:42:11,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-10 22:42:11,110 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-10 22:42:11,110 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-10 22:42:11,284 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-10 22:42:11,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-10 22:42:11,291 INFO L204 LassoAnalysis]: Preferences: [2024-11-10 22:42:11,292 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-10 22:42:11,292 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-10 22:42:11,292 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-10 22:42:11,292 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-10 22:42:11,292 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:11,292 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-10 22:42:11,292 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-10 22:42:11,293 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration3_Loop [2024-11-10 22:42:11,293 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-10 22:42:11,293 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-10 22:42:11,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:11,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:11,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-10 22:42:11,327 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-10 22:42:11,328 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-10 22:42:11,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:11,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:11,331 INFO L229 MonitoredProcess]: Starting monitored process 27 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-10 22:42:11,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-10 22:42:11,333 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-10 22:42:11,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-10 22:42:11,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-10 22:42:11,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-10 22:42:11,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-10 22:42:11,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-10 22:42:11,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-10 22:42:11,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-10 22:42:11,350 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-10 22:42:11,354 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-10 22:42:11,355 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-10 22:42:11,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:42:11,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:11,357 INFO L229 MonitoredProcess]: Starting monitored process 28 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-10 22:42:11,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-10 22:42:11,390 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-10 22:42:11,390 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-10 22:42:11,391 INFO L474 LassoAnalysis]: Proved termination. [2024-11-10 22:42:11,391 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-10 22:42:11,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-10 22:42:11,408 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-10 22:42:11,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-10 22:42:11,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:11,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 22:42:11,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:42:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:11,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 22:42:11,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:42:11,489 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-10 22:42:11,490 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-10 22:42:11,490 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 56 transitions. cyclomatic complexity: 17 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-10 22:42:11,519 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 56 transitions. cyclomatic complexity: 17. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 51 states and 65 transitions. Complement of second has 7 states. [2024-11-10 22:42:11,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-10 22:42:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-10 22:42:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-11-10 22:42:11,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 5 letters. [2024-11-10 22:42:11,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:42:11,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 5 letters. [2024-11-10 22:42:11,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:42:11,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 10 letters. [2024-11-10 22:42:11,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-10 22:42:11,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 65 transitions. [2024-11-10 22:42:11,524 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 31 [2024-11-10 22:42:11,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 50 states and 64 transitions. [2024-11-10 22:42:11,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-11-10 22:42:11,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2024-11-10 22:42:11,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 64 transitions. [2024-11-10 22:42:11,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:42:11,525 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2024-11-10 22:42:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 64 transitions. [2024-11-10 22:42:11,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-10 22:42:11,527 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-10 22:42:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2024-11-10 22:42:11,528 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2024-11-10 22:42:11,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:42:11,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:42:11,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:42:11,529 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:42:11,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:42:11,581 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2024-11-10 22:42:11,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 95 transitions. [2024-11-10 22:42:11,582 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 46 [2024-11-10 22:42:11,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 76 states and 94 transitions. [2024-11-10 22:42:11,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2024-11-10 22:42:11,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2024-11-10 22:42:11,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 94 transitions. [2024-11-10 22:42:11,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:42:11,585 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 94 transitions. [2024-11-10 22:42:11,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 94 transitions. [2024-11-10 22:42:11,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 50. [2024-11-10 22:42:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.26) internal successors, (63), 49 states have internal predecessors, (63), 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-10 22:42:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2024-11-10 22:42:11,593 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 63 transitions. [2024-11-10 22:42:11,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:42:11,594 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2024-11-10 22:42:11,594 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 22:42:11,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 63 transitions. [2024-11-10 22:42:11,595 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 31 [2024-11-10 22:42:11,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:42:11,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:42:11,595 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:42:11,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 22:42:11,597 INFO L745 eck$LassoCheckResult]: Stem: 633#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 634#ULTIMATE.init_returnLabel#1 assume true;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; 641#L33 assume true; 639#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 640#L33 assume true; 638#L33-1 assume !(main_~x~0#1 < 100000); 632#L39-3 main_~x~0#1 := 0; 626#L39 assume true; 628#L39-2 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 635#L40 [2024-11-10 22:42:11,598 INFO L747 eck$LassoCheckResult]: Loop: 635#L40 assume true; 645#L40-1 assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem5#1 := read~int#1(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem6#1 := read~int#1(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; 620#L13-2 assume !(0 == __VERIFIER_assert_~cond#1); 621#__VERIFIER_assert_returnLabel#1 assume true;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;main_#t~post7#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 635#L40 [2024-11-10 22:42:11,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:11,598 INFO L85 PathProgramCache]: Analyzing trace with hash 592747238, now seen corresponding path program 1 times [2024-11-10 22:42:11,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:11,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396313881] [2024-11-10 22:42:11,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:11,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:11,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:42:11,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396313881] [2024-11-10 22:42:11,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396313881] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:42:11,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950812007] [2024-11-10 22:42:11,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:11,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:42:11,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:11,675 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:42:11,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-10 22:42:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:11,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 22:42:11,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:42:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:11,742 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:42:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:11,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950812007] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:42:11,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:42:11,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-10 22:42:11,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954334453] [2024-11-10 22:42:11,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:42:11,768 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:42:11,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:11,769 INFO L85 PathProgramCache]: Analyzing trace with hash 3723738, now seen corresponding path program 1 times [2024-11-10 22:42:11,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:11,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022141636] [2024-11-10 22:42:11,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:11,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:11,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:42:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:11,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:42:11,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:42:11,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 22:42:11,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 22:42:11,891 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. cyclomatic complexity: 19 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 22:42:12,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:42:12,008 INFO L93 Difference]: Finished difference Result 163 states and 199 transitions. [2024-11-10 22:42:12,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 199 transitions. [2024-11-10 22:42:12,009 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 91 [2024-11-10 22:42:12,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 160 states and 196 transitions. [2024-11-10 22:42:12,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2024-11-10 22:42:12,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2024-11-10 22:42:12,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 196 transitions. [2024-11-10 22:42:12,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:42:12,015 INFO L218 hiAutomatonCegarLoop]: Abstraction has 160 states and 196 transitions. [2024-11-10 22:42:12,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 196 transitions. [2024-11-10 22:42:12,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 56. [2024-11-10 22:42:12,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 55 states have internal predecessors, (69), 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-10 22:42:12,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2024-11-10 22:42:12,022 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 69 transitions. [2024-11-10 22:42:12,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 22:42:12,025 INFO L425 stractBuchiCegarLoop]: Abstraction has 56 states and 69 transitions. [2024-11-10 22:42:12,025 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 22:42:12,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 69 transitions. [2024-11-10 22:42:12,025 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 31 [2024-11-10 22:42:12,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:42:12,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:42:12,026 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1, 1] [2024-11-10 22:42:12,026 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-10 22:42:12,026 INFO L745 eck$LassoCheckResult]: Stem: 904#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 905#ULTIMATE.init_returnLabel#1 assume true;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; 912#L33 assume true; 913#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 914#L33 assume true; 910#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 911#L33 assume true; 923#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 922#L33 assume true; 921#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 920#L33 assume true; 909#L33-1 assume !(main_~x~0#1 < 100000); 903#L39-3 main_~x~0#1 := 0; 897#L39 assume true; 899#L39-2 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 906#L40 [2024-11-10 22:42:12,026 INFO L747 eck$LassoCheckResult]: Loop: 906#L40 assume true; 918#L40-1 assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem5#1 := read~int#1(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem6#1 := read~int#1(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; 891#L13-2 assume !(0 == __VERIFIER_assert_~cond#1); 892#__VERIFIER_assert_returnLabel#1 assume true;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;main_#t~post7#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 906#L40 [2024-11-10 22:42:12,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:12,027 INFO L85 PathProgramCache]: Analyzing trace with hash -186619767, now seen corresponding path program 2 times [2024-11-10 22:42:12,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:12,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230232152] [2024-11-10 22:42:12,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:12,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 22:42:12,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:42:12,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230232152] [2024-11-10 22:42:12,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230232152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:42:12,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:42:12,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:42:12,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412916304] [2024-11-10 22:42:12,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:42:12,136 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:42:12,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:12,136 INFO L85 PathProgramCache]: Analyzing trace with hash 3723738, now seen corresponding path program 2 times [2024-11-10 22:42:12,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:12,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668658710] [2024-11-10 22:42:12,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:12,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:12,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:42:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:12,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:42:12,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:42:12,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 22:42:12,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 22:42:12,231 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. cyclomatic complexity: 19 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-10 22:42:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:42:12,274 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2024-11-10 22:42:12,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 73 transitions. [2024-11-10 22:42:12,274 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2024-11-10 22:42:12,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 57 states and 69 transitions. [2024-11-10 22:42:12,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-11-10 22:42:12,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-11-10 22:42:12,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 69 transitions. [2024-11-10 22:42:12,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:42:12,275 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 69 transitions. [2024-11-10 22:42:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 69 transitions. [2024-11-10 22:42:12,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-10 22:42:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 56 states have internal predecessors, (69), 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-10 22:42:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2024-11-10 22:42:12,281 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 69 transitions. [2024-11-10 22:42:12,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 22:42:12,282 INFO L425 stractBuchiCegarLoop]: Abstraction has 57 states and 69 transitions. [2024-11-10 22:42:12,282 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 22:42:12,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 69 transitions. [2024-11-10 22:42:12,282 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2024-11-10 22:42:12,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:42:12,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:42:12,283 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:42:12,283 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:42:12,283 INFO L745 eck$LassoCheckResult]: Stem: 1023#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 1024#ULTIMATE.init_returnLabel#1 assume true;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; 1030#L33 assume true; 1028#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1029#L33 assume true; 1031#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1046#L33 assume true; 1042#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1040#L33 assume true; 1038#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1037#L33 assume true; 1027#L33-1 assume !(main_~x~0#1 < 100000); 1022#L39-3 main_~x~0#1 := 0; 1018#L39 assume true; 1019#L39-2 assume !(main_~x~0#1 < main_~n~0#1); 994#L44 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 992#L47 [2024-11-10 22:42:12,283 INFO L747 eck$LassoCheckResult]: Loop: 992#L47 assume true; 993#L47-1 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#2(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;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 992#L47 [2024-11-10 22:42:12,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:12,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1490245465, now seen corresponding path program 1 times [2024-11-10 22:42:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:12,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313867489] [2024-11-10 22:42:12,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:12,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:12,389 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:12,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:42:12,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313867489] [2024-11-10 22:42:12,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313867489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:42:12,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115235552] [2024-11-10 22:42:12,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:12,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:42:12,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:12,393 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:42:12,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2024-11-10 22:42:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:12,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 22:42:12,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:42:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:12,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:42:12,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-10 22:42:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:12,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115235552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:42:12,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:42:12,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-10 22:42:12,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454222349] [2024-11-10 22:42:12,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:42:12,603 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:42:12,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:12,603 INFO L85 PathProgramCache]: Analyzing trace with hash 3392, now seen corresponding path program 1 times [2024-11-10 22:42:12,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:12,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714295227] [2024-11-10 22:42:12,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:12,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:12,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:42:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:12,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:42:12,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:42:12,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 22:42:12,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-10 22:42:12,669 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. cyclomatic complexity: 17 Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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-10 22:42:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:42:12,831 INFO L93 Difference]: Finished difference Result 216 states and 258 transitions. [2024-11-10 22:42:12,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 216 states and 258 transitions. [2024-11-10 22:42:12,833 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 149 [2024-11-10 22:42:12,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 216 states to 210 states and 252 transitions. [2024-11-10 22:42:12,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 189 [2024-11-10 22:42:12,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2024-11-10 22:42:12,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 210 states and 252 transitions. [2024-11-10 22:42:12,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:42:12,836 INFO L218 hiAutomatonCegarLoop]: Abstraction has 210 states and 252 transitions. [2024-11-10 22:42:12,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states and 252 transitions. [2024-11-10 22:42:12,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 69. [2024-11-10 22:42:12,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.173913043478261) internal successors, (81), 68 states have internal predecessors, (81), 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-10 22:42:12,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2024-11-10 22:42:12,841 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 81 transitions. [2024-11-10 22:42:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 22:42:12,842 INFO L425 stractBuchiCegarLoop]: Abstraction has 69 states and 81 transitions. [2024-11-10 22:42:12,842 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 22:42:12,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 81 transitions. [2024-11-10 22:42:12,843 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2024-11-10 22:42:12,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:42:12,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:42:12,844 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:42:12,844 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:42:12,844 INFO L745 eck$LassoCheckResult]: Stem: 1401#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 1402#ULTIMATE.init_returnLabel#1 assume true;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; 1409#L33 assume true; 1410#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1411#L33 assume true; 1405#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1406#L33 assume true; 1439#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1438#L33 assume true; 1437#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1436#L33 assume true; 1435#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1434#L33 assume true; 1433#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1432#L33 assume true; 1431#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1430#L33 assume true; 1429#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1428#L33 assume true; 1427#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1426#L33 assume true; 1417#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1416#L33 assume true; 1404#L33-1 assume !(main_~x~0#1 < 100000); 1400#L39-3 main_~x~0#1 := 0; 1397#L39 assume true; 1398#L39-2 assume !(main_~x~0#1 < main_~n~0#1); 1373#L44 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 1371#L47 [2024-11-10 22:42:12,844 INFO L747 eck$LassoCheckResult]: Loop: 1371#L47 assume true; 1372#L47-1 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#2(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;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1371#L47 [2024-11-10 22:42:12,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:12,845 INFO L85 PathProgramCache]: Analyzing trace with hash 999325921, now seen corresponding path program 2 times [2024-11-10 22:42:12,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:12,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943593438] [2024-11-10 22:42:12,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:12,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:13,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:42:13,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943593438] [2024-11-10 22:42:13,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943593438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:42:13,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649790117] [2024-11-10 22:42:13,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 22:42:13,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:42:13,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:13,056 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:42:13,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2024-11-10 22:42:13,133 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 22:42:13,133 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:42:13,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 22:42:13,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:42:13,180 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:13,180 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:42:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:13,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649790117] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:42:13,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:42:13,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-10 22:42:13,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682792823] [2024-11-10 22:42:13,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:42:13,402 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:42:13,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:13,402 INFO L85 PathProgramCache]: Analyzing trace with hash 3392, now seen corresponding path program 2 times [2024-11-10 22:42:13,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:13,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572421729] [2024-11-10 22:42:13,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:13,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:13,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:42:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:13,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:42:13,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:42:13,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 22:42:13,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-10 22:42:13,448 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. cyclomatic complexity: 17 Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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-10 22:42:13,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:42:13,786 INFO L93 Difference]: Finished difference Result 414 states and 492 transitions. [2024-11-10 22:42:13,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 414 states and 492 transitions. [2024-11-10 22:42:13,789 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 281 [2024-11-10 22:42:13,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 414 states to 402 states and 480 transitions. [2024-11-10 22:42:13,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 357 [2024-11-10 22:42:13,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 357 [2024-11-10 22:42:13,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 402 states and 480 transitions. [2024-11-10 22:42:13,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:42:13,791 INFO L218 hiAutomatonCegarLoop]: Abstraction has 402 states and 480 transitions. [2024-11-10 22:42:13,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states and 480 transitions. [2024-11-10 22:42:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 93. [2024-11-10 22:42:13,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.1290322580645162) internal successors, (105), 92 states have internal predecessors, (105), 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-10 22:42:13,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2024-11-10 22:42:13,801 INFO L240 hiAutomatonCegarLoop]: Abstraction has 93 states and 105 transitions. [2024-11-10 22:42:13,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 22:42:13,802 INFO L425 stractBuchiCegarLoop]: Abstraction has 93 states and 105 transitions. [2024-11-10 22:42:13,802 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-10 22:42:13,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 105 transitions. [2024-11-10 22:42:13,803 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2024-11-10 22:42:13,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:42:13,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:42:13,804 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [23, 22, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:42:13,804 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:42:13,804 INFO L745 eck$LassoCheckResult]: Stem: 2074#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 2075#ULTIMATE.init_returnLabel#1 assume true;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; 2082#L33 assume true; 2083#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2084#L33 assume true; 2078#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2079#L33 assume true; 2136#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2135#L33 assume true; 2134#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2133#L33 assume true; 2132#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2131#L33 assume true; 2130#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2129#L33 assume true; 2128#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2127#L33 assume true; 2126#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2125#L33 assume true; 2124#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2123#L33 assume true; 2122#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2121#L33 assume true; 2120#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2119#L33 assume true; 2118#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2117#L33 assume true; 2116#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2115#L33 assume true; 2114#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2113#L33 assume true; 2112#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2111#L33 assume true; 2110#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2109#L33 assume true; 2108#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2107#L33 assume true; 2106#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2105#L33 assume true; 2104#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2103#L33 assume true; 2102#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2101#L33 assume true; 2100#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2099#L33 assume true; 2090#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2089#L33 assume true; 2077#L33-1 assume !(main_~x~0#1 < 100000); 2073#L39-3 main_~x~0#1 := 0; 2070#L39 assume true; 2071#L39-2 assume !(main_~x~0#1 < main_~n~0#1); 2046#L44 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 2044#L47 [2024-11-10 22:42:13,806 INFO L747 eck$LassoCheckResult]: Loop: 2044#L47 assume true; 2045#L47-1 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#2(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;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2044#L47 [2024-11-10 22:42:13,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:13,806 INFO L85 PathProgramCache]: Analyzing trace with hash -101901227, now seen corresponding path program 3 times [2024-11-10 22:42:13,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:13,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789049483] [2024-11-10 22:42:13,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:13,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:14,441 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:14,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:42:14,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789049483] [2024-11-10 22:42:14,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789049483] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:42:14,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848135620] [2024-11-10 22:42:14,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 22:42:14,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:42:14,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:14,444 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:42:14,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-10 22:42:15,849 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2024-11-10 22:42:15,849 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:42:15,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 22:42:15,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:42:15,947 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:15,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:42:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:16,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848135620] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:42:16,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:42:16,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2024-11-10 22:42:16,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709517617] [2024-11-10 22:42:16,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:42:16,703 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:42:16,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:16,703 INFO L85 PathProgramCache]: Analyzing trace with hash 3392, now seen corresponding path program 3 times [2024-11-10 22:42:16,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:16,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403534302] [2024-11-10 22:42:16,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:16,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:16,708 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:42:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:16,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:42:16,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:42:16,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-10 22:42:16,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-11-10 22:42:16,749 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. cyclomatic complexity: 17 Second operand has 49 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 49 states have internal predecessors, (102), 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-10 22:42:17,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:42:17,667 INFO L93 Difference]: Finished difference Result 810 states and 960 transitions. [2024-11-10 22:42:17,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 810 states and 960 transitions. [2024-11-10 22:42:17,671 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 545 [2024-11-10 22:42:17,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 810 states to 786 states and 936 transitions. [2024-11-10 22:42:17,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 693 [2024-11-10 22:42:17,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 693 [2024-11-10 22:42:17,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 786 states and 936 transitions. [2024-11-10 22:42:17,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:42:17,676 INFO L218 hiAutomatonCegarLoop]: Abstraction has 786 states and 936 transitions. [2024-11-10 22:42:17,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states and 936 transitions. [2024-11-10 22:42:17,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 141. [2024-11-10 22:42:17,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 141 states have (on average 1.0851063829787233) internal successors, (153), 140 states have internal predecessors, (153), 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-10 22:42:17,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 153 transitions. [2024-11-10 22:42:17,683 INFO L240 hiAutomatonCegarLoop]: Abstraction has 141 states and 153 transitions. [2024-11-10 22:42:17,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-10 22:42:17,687 INFO L425 stractBuchiCegarLoop]: Abstraction has 141 states and 153 transitions. [2024-11-10 22:42:17,687 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-10 22:42:17,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 153 transitions. [2024-11-10 22:42:17,688 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2024-11-10 22:42:17,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:42:17,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:42:17,691 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [47, 46, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:42:17,691 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:42:17,692 INFO L745 eck$LassoCheckResult]: Stem: 3335#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 3336#ULTIMATE.init_returnLabel#1 assume true;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; 3343#L33 assume true; 3344#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3345#L33 assume true; 3339#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3340#L33 assume true; 3445#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3444#L33 assume true; 3443#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3442#L33 assume true; 3441#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3440#L33 assume true; 3439#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3438#L33 assume true; 3437#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3436#L33 assume true; 3435#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3434#L33 assume true; 3433#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3432#L33 assume true; 3431#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3430#L33 assume true; 3429#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3428#L33 assume true; 3427#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3426#L33 assume true; 3425#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3424#L33 assume true; 3423#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3422#L33 assume true; 3421#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3420#L33 assume true; 3419#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3418#L33 assume true; 3417#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3416#L33 assume true; 3415#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3414#L33 assume true; 3413#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3412#L33 assume true; 3411#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3410#L33 assume true; 3409#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3408#L33 assume true; 3407#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3406#L33 assume true; 3405#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3404#L33 assume true; 3403#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3402#L33 assume true; 3401#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3400#L33 assume true; 3399#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3398#L33 assume true; 3397#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3396#L33 assume true; 3395#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3394#L33 assume true; 3393#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3392#L33 assume true; 3391#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3390#L33 assume true; 3389#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3388#L33 assume true; 3387#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3386#L33 assume true; 3385#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3384#L33 assume true; 3383#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3382#L33 assume true; 3381#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3380#L33 assume true; 3379#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3378#L33 assume true; 3377#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3376#L33 assume true; 3375#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3374#L33 assume true; 3373#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3372#L33 assume true; 3371#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3370#L33 assume true; 3369#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3368#L33 assume true; 3367#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3366#L33 assume true; 3365#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3364#L33 assume true; 3363#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3362#L33 assume true; 3361#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3360#L33 assume true; 3351#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3350#L33 assume true; 3338#L33-1 assume !(main_~x~0#1 < 100000); 3334#L39-3 main_~x~0#1 := 0; 3331#L39 assume true; 3332#L39-2 assume !(main_~x~0#1 < main_~n~0#1); 3307#L44 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 3305#L47 [2024-11-10 22:42:17,692 INFO L747 eck$LassoCheckResult]: Loop: 3305#L47 assume true; 3306#L47-1 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#2(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;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3305#L47 [2024-11-10 22:42:17,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:17,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1178599619, now seen corresponding path program 4 times [2024-11-10 22:42:17,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:17,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481714659] [2024-11-10 22:42:17,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:17,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:19,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:42:19,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481714659] [2024-11-10 22:42:19,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481714659] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:42:19,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327506966] [2024-11-10 22:42:19,513 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 22:42:19,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:42:19,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:19,515 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:42:19,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2024-11-10 22:42:19,705 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 22:42:19,705 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 22:42:19,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-10 22:42:19,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 22:42:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:19,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 22:42:22,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:22,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327506966] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 22:42:22,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 22:42:22,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2024-11-10 22:42:22,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389806048] [2024-11-10 22:42:22,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 22:42:22,178 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-10 22:42:22,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:22,179 INFO L85 PathProgramCache]: Analyzing trace with hash 3392, now seen corresponding path program 4 times [2024-11-10 22:42:22,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:22,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294071001] [2024-11-10 22:42:22,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:22,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:22,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:42:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:42:22,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:42:22,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:42:22,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-11-10 22:42:22,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2024-11-10 22:42:22,240 INFO L87 Difference]: Start difference. First operand 141 states and 153 transitions. cyclomatic complexity: 17 Second operand has 97 states, 97 states have (on average 2.0412371134020617) internal successors, (198), 97 states have internal predecessors, (198), 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-10 22:42:26,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:42:26,833 INFO L93 Difference]: Finished difference Result 1602 states and 1896 transitions. [2024-11-10 22:42:26,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1602 states and 1896 transitions. [2024-11-10 22:42:26,841 INFO L131 ngComponentsAnalysis]: Automaton has 98 accepting balls. 1073 [2024-11-10 22:42:26,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1602 states to 1554 states and 1848 transitions. [2024-11-10 22:42:26,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1365 [2024-11-10 22:42:26,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1365 [2024-11-10 22:42:26,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1554 states and 1848 transitions. [2024-11-10 22:42:26,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-10 22:42:26,851 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1554 states and 1848 transitions. [2024-11-10 22:42:26,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states and 1848 transitions. [2024-11-10 22:42:26,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 237. [2024-11-10 22:42:26,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 237 states have (on average 1.0506329113924051) internal successors, (249), 236 states have internal predecessors, (249), 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-10 22:42:26,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 249 transitions. [2024-11-10 22:42:26,867 INFO L240 hiAutomatonCegarLoop]: Abstraction has 237 states and 249 transitions. [2024-11-10 22:42:26,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-10 22:42:26,869 INFO L425 stractBuchiCegarLoop]: Abstraction has 237 states and 249 transitions. [2024-11-10 22:42:26,869 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-10 22:42:26,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 237 states and 249 transitions. [2024-11-10 22:42:26,870 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2024-11-10 22:42:26,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:42:26,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:42:26,872 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [95, 94, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:42:26,872 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-10 22:42:26,876 INFO L745 eck$LassoCheckResult]: Stem: 5772#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(48, 2); 5773#ULTIMATE.init_returnLabel#1 assume true;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; 5780#L33 assume true; 5781#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5782#L33 assume true; 5776#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5777#L33 assume true; 5978#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5977#L33 assume true; 5976#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5975#L33 assume true; 5974#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5973#L33 assume true; 5972#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5971#L33 assume true; 5970#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5969#L33 assume true; 5968#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5967#L33 assume true; 5966#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5965#L33 assume true; 5964#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5963#L33 assume true; 5962#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5961#L33 assume true; 5960#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5959#L33 assume true; 5958#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5957#L33 assume true; 5956#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5955#L33 assume true; 5954#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5953#L33 assume true; 5952#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5951#L33 assume true; 5950#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5949#L33 assume true; 5948#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5947#L33 assume true; 5946#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5945#L33 assume true; 5944#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5943#L33 assume true; 5942#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5941#L33 assume true; 5940#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5939#L33 assume true; 5938#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5937#L33 assume true; 5936#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5935#L33 assume true; 5934#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5933#L33 assume true; 5932#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5931#L33 assume true; 5930#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5929#L33 assume true; 5928#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5927#L33 assume true; 5926#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5925#L33 assume true; 5924#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5923#L33 assume true; 5922#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5921#L33 assume true; 5920#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5919#L33 assume true; 5918#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5917#L33 assume true; 5916#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5915#L33 assume true; 5914#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5913#L33 assume true; 5912#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5911#L33 assume true; 5910#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5909#L33 assume true; 5908#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5907#L33 assume true; 5906#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5905#L33 assume true; 5904#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5903#L33 assume true; 5902#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5901#L33 assume true; 5900#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5899#L33 assume true; 5898#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5897#L33 assume true; 5896#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5895#L33 assume true; 5894#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5893#L33 assume true; 5892#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5891#L33 assume true; 5890#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5889#L33 assume true; 5888#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5887#L33 assume true; 5886#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5885#L33 assume true; 5884#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5883#L33 assume true; 5882#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5881#L33 assume true; 5880#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5879#L33 assume true; 5878#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5877#L33 assume true; 5876#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5875#L33 assume true; 5874#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5873#L33 assume true; 5872#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5871#L33 assume true; 5870#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5869#L33 assume true; 5868#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5867#L33 assume true; 5866#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5865#L33 assume true; 5864#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5863#L33 assume true; 5862#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5861#L33 assume true; 5860#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5859#L33 assume true; 5858#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5857#L33 assume true; 5856#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5855#L33 assume true; 5854#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5853#L33 assume true; 5852#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5851#L33 assume true; 5850#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5849#L33 assume true; 5848#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5847#L33 assume true; 5846#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5845#L33 assume true; 5844#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5843#L33 assume true; 5842#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5841#L33 assume true; 5840#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5839#L33 assume true; 5838#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5837#L33 assume true; 5836#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5835#L33 assume true; 5834#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5833#L33 assume true; 5832#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5831#L33 assume true; 5830#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5829#L33 assume true; 5828#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5827#L33 assume true; 5826#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5825#L33 assume true; 5824#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5823#L33 assume true; 5822#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5821#L33 assume true; 5820#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5819#L33 assume true; 5818#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5817#L33 assume true; 5816#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5815#L33 assume true; 5814#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5813#L33 assume true; 5812#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5811#L33 assume true; 5810#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5809#L33 assume true; 5808#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5807#L33 assume true; 5806#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5805#L33 assume true; 5804#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5803#L33 assume true; 5802#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5801#L33 assume true; 5800#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5799#L33 assume true; 5798#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5797#L33 assume true; 5788#L33-1 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(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;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5787#L33 assume true; 5775#L33-1 assume !(main_~x~0#1 < 100000); 5771#L39-3 main_~x~0#1 := 0; 5768#L39 assume true; 5769#L39-2 assume !(main_~x~0#1 < main_~n~0#1); 5744#L44 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 5742#L47 [2024-11-10 22:42:26,876 INFO L747 eck$LassoCheckResult]: Loop: 5742#L47 assume true; 5743#L47-1 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#2(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;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 5742#L47 [2024-11-10 22:42:26,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:42:26,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1039955213, now seen corresponding path program 5 times [2024-11-10 22:42:26,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:42:26,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506683941] [2024-11-10 22:42:26,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:42:26,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:42:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:42:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 22:42:32,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:42:32,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506683941] [2024-11-10 22:42:32,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506683941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 22:42:32,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314008512] [2024-11-10 22:42:32,761 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 22:42:32,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 22:42:32,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:42:32,763 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 22:42:32,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process