./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/avg10-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/avg10-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 431bc26901e3cf271c74e4f10a5bc241d4509dbbafd99aaf0126c46ffc8b7c33 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:23:01,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:23:01,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:23:01,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:23:01,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:23:01,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:23:01,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:23:01,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:23:01,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:23:01,656 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:23:01,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:23:01,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:23:01,659 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:23:01,659 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:23:01,659 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:23:01,659 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:23:01,660 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:23:01,660 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:23:01,660 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:23:01,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:23:01,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:23:01,665 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:23:01,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:23:01,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:23:01,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:23:01,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:23:01,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:23:01,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:23:01,667 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:23:01,667 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:23:01,667 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:23:01,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:23:01,668 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:23:01,668 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:23:01,668 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:23:01,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:23:01,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:23:01,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:23:01,669 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:23:01,669 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-clean/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-clean/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 -> 431bc26901e3cf271c74e4f10a5bc241d4509dbbafd99aaf0126c46ffc8b7c33 [2024-10-12 00:23:01,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:23:02,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:23:02,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:23:02,023 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:23:02,025 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:23:02,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/avg10-2.i [2024-10-12 00:23:03,503 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:23:03,692 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:23:03,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/avg10-2.i [2024-10-12 00:23:03,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/03c32ab39/75bf19a238f14ece84edb1857c232b7b/FLAG4c49205a1 [2024-10-12 00:23:03,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/03c32ab39/75bf19a238f14ece84edb1857c232b7b [2024-10-12 00:23:03,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:23:03,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:23:03,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:23:03,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:23:03,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:23:03,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:23:03" (1/1) ... [2024-10-12 00:23:03,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9560f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:03, skipping insertion in model container [2024-10-12 00:23:03,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:23:03" (1/1) ... [2024-10-12 00:23:03,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:23:04,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:23:04,011 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:23:04,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:23:04,048 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:23:04,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:04 WrapperNode [2024-10-12 00:23:04,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:23:04,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:23:04,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:23:04,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:23:04,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:04" (1/1) ... [2024-10-12 00:23:04,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:04" (1/1) ... [2024-10-12 00:23:04,098 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 118 [2024-10-12 00:23:04,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:23:04,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:23:04,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:23:04,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:23:04,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:04" (1/1) ... [2024-10-12 00:23:04,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:04" (1/1) ... [2024-10-12 00:23:04,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:04" (1/1) ... [2024-10-12 00:23:04,144 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-10-12 00:23:04,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:04" (1/1) ... [2024-10-12 00:23:04,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:04" (1/1) ... [2024-10-12 00:23:04,151 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:04" (1/1) ... [2024-10-12 00:23:04,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:04" (1/1) ... [2024-10-12 00:23:04,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:04" (1/1) ... [2024-10-12 00:23:04,157 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:04" (1/1) ... [2024-10-12 00:23:04,164 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:23:04,165 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:23:04,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:23:04,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:23:04,168 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:04" (1/1) ... [2024-10-12 00:23:04,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:04,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:04,208 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:04,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:23:04,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:23:04,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:23:04,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 00:23:04,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 00:23:04,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 00:23:04,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 00:23:04,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:23:04,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:23:04,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 00:23:04,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 00:23:04,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 00:23:04,353 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:23:04,355 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:23:04,588 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-12 00:23:04,588 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:23:04,608 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:23:04,609 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-12 00:23:04,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:23:04 BoogieIcfgContainer [2024-10-12 00:23:04,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:23:04,610 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:23:04,611 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:23:04,615 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:23:04,616 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:23:04,616 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:23:03" (1/3) ... [2024-10-12 00:23:04,617 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c725f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:23:04, skipping insertion in model container [2024-10-12 00:23:04,617 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:23:04,617 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:23:04" (2/3) ... [2024-10-12 00:23:04,618 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c725f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:23:04, skipping insertion in model container [2024-10-12 00:23:04,618 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:23:04,618 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:23:04" (3/3) ... [2024-10-12 00:23:04,619 INFO L332 chiAutomizerObserver]: Analyzing ICFG avg10-2.i [2024-10-12 00:23:04,674 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:23:04,674 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:23:04,674 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:23:04,674 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:23:04,674 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:23:04,674 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:23:04,674 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:23:04,675 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:23:04,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:04,698 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2024-10-12 00:23:04,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:04,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:04,702 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:23:04,702 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:23:04,702 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:23:04,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:04,705 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2024-10-12 00:23:04,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:04,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:04,705 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:23:04,706 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:23:04,714 INFO L745 eck$LassoCheckResult]: Stem: 24#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 14#L34-3true [2024-10-12 00:23:04,714 INFO L747 eck$LassoCheckResult]: Loop: 14#L34-3true assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 11#L34-2true main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 14#L34-3true [2024-10-12 00:23:04,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:04,719 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:23:04,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:04,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422983216] [2024-10-12 00:23:04,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:04,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:04,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:04,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:04,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:04,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-10-12 00:23:04,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:04,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297052125] [2024-10-12 00:23:04,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:04,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:04,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:04,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:04,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:04,876 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-10-12 00:23:04,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:04,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946365918] [2024-10-12 00:23:04,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:04,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:04,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:04,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:05,269 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:23:05,271 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:23:05,271 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:23:05,271 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:23:05,272 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:23:05,272 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:05,272 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:23:05,273 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:23:05,273 INFO L132 ssoRankerPreferences]: Filename of dumped script: avg10-2.i_Iteration1_Lasso [2024-10-12 00:23:05,273 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:23:05,273 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:23:05,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:05,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:05,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:05,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:05,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:05,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:05,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:05,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:05,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:05,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:05,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:05,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:05,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:05,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:05,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:05,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:05,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:05,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:05,786 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:23:05,791 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:23:05,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:05,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:05,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:05,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:23:05,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:05,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:05,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:05,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:05,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:05,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:05,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:05,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:05,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:05,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:23:05,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:05,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:05,842 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:05,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:23:05,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:05,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:05,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:05,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:05,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:05,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:05,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:05,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:05,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:05,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:05,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:05,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:05,884 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:05,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:23:05,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:05,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:05,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:05,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:05,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:05,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:05,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:05,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:05,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:05,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:05,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:05,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:05,917 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:05,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:23:05,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:05,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:05,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:05,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:05,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:05,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:05,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:05,942 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:05,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 00:23:05,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:05,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:05,961 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:05,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:23:05,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:05,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:05,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:05,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:05,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:05,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:05,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:05,994 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:06,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:06,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:06,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:06,012 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:06,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:23:06,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:06,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:06,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:06,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:06,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:06,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:06,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:06,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:06,032 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:06,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:23:06,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:06,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:06,051 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:06,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:23:06,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:06,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:06,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:06,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:06,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:06,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:06,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:06,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:06,070 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:06,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:23:06,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:06,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:06,088 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:06,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:23:06,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:06,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:06,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:06,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:06,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:06,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:06,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:06,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:06,108 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:06,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:06,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:06,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:06,127 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:06,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:23:06,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:06,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:06,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:06,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:06,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:06,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:06,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:06,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:06,148 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:06,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 00:23:06,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:06,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:06,166 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:06,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:23:06,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:06,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:06,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:06,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:06,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:06,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:06,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:06,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:06,186 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:06,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:06,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:06,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:06,202 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:06,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:23:06,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:06,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:06,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:06,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:06,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:06,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:06,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:06,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:06,216 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:06,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-12 00:23:06,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:06,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:06,233 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:06,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:23:06,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:06,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:06,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:06,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:06,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:06,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:06,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:06,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:06,254 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:06,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 00:23:06,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:06,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:06,274 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:06,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:23:06,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:06,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:06,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:06,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:06,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:06,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:06,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:06,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:06,298 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:06,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 00:23:06,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:06,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:06,316 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:06,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:23:06,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:06,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:06,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:06,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:06,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:06,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:06,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:06,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:06,333 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:06,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-12 00:23:06,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:06,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:06,354 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:06,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:23:06,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:06,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:06,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:06,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:06,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:06,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:06,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:06,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:06,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:06,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:06,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:06,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:06,384 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:06,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:23:06,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:06,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:06,396 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:06,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:06,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:06,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:06,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:06,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:06,398 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:06,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:06,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:06,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:06,410 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:06,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:23:06,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:06,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:06,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:06,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:06,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:06,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:06,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:06,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:06,426 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:06,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-10-12 00:23:06,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:06,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:06,444 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:06,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:23:06,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:06,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:06,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:06,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:06,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:06,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:06,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:06,461 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:06,466 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:06,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:23:06,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:06,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:06,483 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:06,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:23:06,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:06,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:06,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:06,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:06,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:06,502 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:06,502 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:06,506 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:06,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-12 00:23:06,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:06,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:06,523 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:06,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:23:06,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:06,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:06,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:06,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:06,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:06,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:06,538 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:06,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:06,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:06,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:06,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:06,557 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:06,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:23:06,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:06,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:06,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:06,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:06,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:06,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:06,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:06,575 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:06,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:06,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:06,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:06,588 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:06,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:23:06,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:06,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:06,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:06,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:06,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:06,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:06,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:06,616 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:23:06,640 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-10-12 00:23:06,640 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-10-12 00:23:06,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:06,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:06,651 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:06,660 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:23:06,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:23:06,678 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:23:06,678 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:23:06,679 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 19*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 - 8*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2024-10-12 00:23:06,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:06,711 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-10-12 00:23:06,730 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-10-12 00:23:06,731 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-10-12 00:23:06,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:06,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:23:06,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:06,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:23:06,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:23:06,859 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-10-12 00:23:06,861 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 27 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 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-10-12 00:23:06,914 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 27 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 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 52 states and 75 transitions. Complement of second has 6 states. [2024-10-12 00:23:06,916 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-10-12 00:23:06,921 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-10-12 00:23:06,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2024-10-12 00:23:06,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 2 letters. Loop has 2 letters. [2024-10-12 00:23:06,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:23:06,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-12 00:23:06,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:23:06,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 2 letters. Loop has 4 letters. [2024-10-12 00:23:06,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:23:06,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 75 transitions. [2024-10-12 00:23:06,927 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-10-12 00:23:06,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 19 states and 27 transitions. [2024-10-12 00:23:06,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-10-12 00:23:06,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-12 00:23:06,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2024-10-12 00:23:06,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:06,931 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 27 transitions. [2024-10-12 00:23:06,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2024-10-12 00:23:06,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-12 00:23:06,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2024-10-12 00:23:06,953 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 27 transitions. [2024-10-12 00:23:06,953 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2024-10-12 00:23:06,954 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:23:06,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2024-10-12 00:23:06,954 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-10-12 00:23:06,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:06,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:06,955 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:23:06,955 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:23:06,955 INFO L745 eck$LassoCheckResult]: Stem: 149#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 141#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 142#L34-3 assume !(main_~i~1#1 < 10); 133#L34-4 havoc main_~i~1#1;assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 134#L20-3 [2024-10-12 00:23:06,955 INFO L747 eck$LassoCheckResult]: Loop: 134#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 148#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 134#L20-3 [2024-10-12 00:23:06,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:06,956 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2024-10-12 00:23:06,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:06,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565872683] [2024-10-12 00:23:06,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:06,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:07,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:23:07,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:23:07,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565872683] [2024-10-12 00:23:07,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565872683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:23:07,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:23:07,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:23:07,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911078168] [2024-10-12 00:23:07,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:23:07,028 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:23:07,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:07,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2024-10-12 00:23:07,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:07,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901925572] [2024-10-12 00:23:07,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:07,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:07,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:07,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:07,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:23:07,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:23:07,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:23:07,086 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 13 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-10-12 00:23:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:23:07,096 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-10-12 00:23:07,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2024-10-12 00:23:07,097 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-10-12 00:23:07,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2024-10-12 00:23:07,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-12 00:23:07,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-12 00:23:07,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2024-10-12 00:23:07,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:07,098 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-12 00:23:07,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2024-10-12 00:23:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2024-10-12 00:23:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-10-12 00:23:07,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-10-12 00:23:07,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:23:07,102 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-10-12 00:23:07,102 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:23:07,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2024-10-12 00:23:07,103 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-10-12 00:23:07,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:07,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:07,103 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:23:07,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:23:07,103 INFO L745 eck$LassoCheckResult]: Stem: 194#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 186#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 187#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 190#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 191#L34-3 assume !(main_~i~1#1 < 10); 178#L34-4 havoc main_~i~1#1;assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 179#L20-3 [2024-10-12 00:23:07,103 INFO L747 eck$LassoCheckResult]: Loop: 179#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 193#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 179#L20-3 [2024-10-12 00:23:07,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:07,104 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2024-10-12 00:23:07,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:07,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859862681] [2024-10-12 00:23:07,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:07,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:07,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-12 00:23:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:23:07,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:23:07,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859862681] [2024-10-12 00:23:07,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859862681] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:23:07,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070805495] [2024-10-12 00:23:07,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:07,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:23:07,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:07,222 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:23:07,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-12 00:23:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:07,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 00:23:07,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:23:07,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:23:07,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:23:07,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070805495] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:23:07,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:23:07,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-12 00:23:07,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556177009] [2024-10-12 00:23:07,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:23:07,328 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:23:07,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:07,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2024-10-12 00:23:07,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:07,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132007375] [2024-10-12 00:23:07,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:07,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:07,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:07,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:07,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:23:07,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 00:23:07,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 00:23:07,408 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:07,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:23:07,442 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-10-12 00:23:07,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2024-10-12 00:23:07,442 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-10-12 00:23:07,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 29 transitions. [2024-10-12 00:23:07,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-12 00:23:07,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-12 00:23:07,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2024-10-12 00:23:07,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:07,445 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-12 00:23:07,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2024-10-12 00:23:07,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-12 00:23:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:07,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-10-12 00:23:07,448 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-12 00:23:07,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:23:07,451 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-12 00:23:07,451 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:23:07,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2024-10-12 00:23:07,451 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-10-12 00:23:07,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:07,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:07,452 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2024-10-12 00:23:07,452 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:23:07,452 INFO L745 eck$LassoCheckResult]: Stem: 278#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 271#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 274#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 275#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 279#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 284#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 283#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 282#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 281#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 280#L34-3 assume !(main_~i~1#1 < 10); 262#L34-4 havoc main_~i~1#1;assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 263#L20-3 [2024-10-12 00:23:07,452 INFO L747 eck$LassoCheckResult]: Loop: 263#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 277#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 263#L20-3 [2024-10-12 00:23:07,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:07,452 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2024-10-12 00:23:07,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:07,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902306417] [2024-10-12 00:23:07,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:07,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:07,608 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:23:07,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:23:07,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902306417] [2024-10-12 00:23:07,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902306417] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:23:07,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741006275] [2024-10-12 00:23:07,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 00:23:07,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:23:07,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:07,611 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:23:07,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-12 00:23:07,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 00:23:07,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:23:07,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:23:07,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:23:07,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:23:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:23:07,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741006275] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:23:07,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:23:07,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-12 00:23:07,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409382289] [2024-10-12 00:23:07,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:23:07,782 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:23:07,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:07,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2024-10-12 00:23:07,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:07,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398469826] [2024-10-12 00:23:07,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:07,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:07,788 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:07,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:07,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:23:07,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 00:23:07,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-12 00:23:07,841 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:23:07,897 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-10-12 00:23:07,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2024-10-12 00:23:07,899 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-10-12 00:23:07,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2024-10-12 00:23:07,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-12 00:23:07,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-12 00:23:07,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2024-10-12 00:23:07,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:07,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-10-12 00:23:07,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2024-10-12 00:23:07,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-12 00:23:07,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-10-12 00:23:07,904 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-10-12 00:23:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 00:23:07,906 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-10-12 00:23:07,906 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:23:07,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2024-10-12 00:23:07,908 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-10-12 00:23:07,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:07,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:07,909 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2024-10-12 00:23:07,911 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:23:07,912 INFO L745 eck$LassoCheckResult]: Stem: 422#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 414#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 415#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 423#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 424#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 418#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 419#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 440#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 439#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 438#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 437#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 436#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 435#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 434#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 433#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 432#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 431#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 430#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 429#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 428#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 427#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 426#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 425#L34-3 assume !(main_~i~1#1 < 10); 406#L34-4 havoc main_~i~1#1;assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 407#L20-3 [2024-10-12 00:23:07,912 INFO L747 eck$LassoCheckResult]: Loop: 407#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 421#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 407#L20-3 [2024-10-12 00:23:07,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:07,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2024-10-12 00:23:07,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:07,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064234935] [2024-10-12 00:23:07,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:07,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:07,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:07,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:07,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2024-10-12 00:23:07,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:07,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127857110] [2024-10-12 00:23:07,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:07,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:07,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:07,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:07,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:07,971 INFO L85 PathProgramCache]: Analyzing trace with hash -95702815, now seen corresponding path program 1 times [2024-10-12 00:23:07,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:07,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712100915] [2024-10-12 00:23:07,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:07,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:08,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:08,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:11,593 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:23:11,593 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:23:11,593 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:23:11,593 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:23:11,593 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:23:11,593 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:11,593 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:23:11,593 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:23:11,593 INFO L132 ssoRankerPreferences]: Filename of dumped script: avg10-2.i_Iteration5_Lasso [2024-10-12 00:23:11,593 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:23:11,593 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:23:11,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:11,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:23:12,246 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:23:12,246 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:23:12,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:12,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:12,251 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:12,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-12 00:23:12,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:12,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:12,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:12,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:12,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:12,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:12,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:12,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:12,265 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:12,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:12,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:12,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:12,278 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:12,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-12 00:23:12,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:12,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:12,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:12,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:12,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:12,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:12,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:12,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:12,293 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:12,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-12 00:23:12,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:12,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:12,305 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:12,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-12 00:23:12,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:12,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:12,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:12,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:12,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:12,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:12,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:12,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:12,318 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:12,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-12 00:23:12,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:12,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:12,331 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:12,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-12 00:23:12,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-10-12 00:23:12,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:12,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:12,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:12,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:12,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:12,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:12,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:12,346 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:12,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-12 00:23:12,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:12,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:12,358 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:12,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-12 00:23:12,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:12,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:12,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:23:12,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:12,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:12,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:12,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:23:12,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:23:12,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:12,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-12 00:23:12,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:12,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:12,387 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:12,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-12 00:23:12,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:12,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:12,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:12,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:12,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:12,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:12,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:12,404 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:23:12,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-12 00:23:12,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:12,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:12,421 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:12,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-12 00:23:12,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:23:12,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:23:12,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:23:12,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:23:12,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:23:12,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:23:12,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:23:12,455 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:23:12,482 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-10-12 00:23:12,482 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2024-10-12 00:23:12,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:23:12,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:12,485 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:23:12,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-12 00:23:12,487 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:23:12,502 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-12 00:23:12,502 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:23:12,502 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_avg_~i~0#1) = -2*ULTIMATE.start_avg_~i~0#1 + 19 Supporting invariants [] [2024-10-12 00:23:12,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-10-12 00:23:12,528 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2024-10-12 00:23:12,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:12,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:23:12,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:12,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:23:12,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:23:12,651 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-10-12 00:23:12,651 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-10-12 00:23:12,669 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Result 39 states and 45 transitions. Complement of second has 5 states. [2024-10-12 00:23:12,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:23:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-10-12 00:23:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2024-10-12 00:23:12,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 24 letters. Loop has 2 letters. [2024-10-12 00:23:12,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:23:12,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 26 letters. Loop has 2 letters. [2024-10-12 00:23:12,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:23:12,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 24 letters. Loop has 4 letters. [2024-10-12 00:23:12,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:23:12,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 45 transitions. [2024-10-12 00:23:12,676 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-10-12 00:23:12,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 38 states and 43 transitions. [2024-10-12 00:23:12,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-12 00:23:12,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-10-12 00:23:12,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2024-10-12 00:23:12,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:12,677 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-10-12 00:23:12,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2024-10-12 00:23:12,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-12 00:23:12,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.131578947368421) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:12,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-10-12 00:23:12,679 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-10-12 00:23:12,679 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-10-12 00:23:12,682 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:23:12,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2024-10-12 00:23:12,682 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-10-12 00:23:12,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:12,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:12,683 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:23:12,684 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:23:12,685 INFO L745 eck$LassoCheckResult]: Stem: 629#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 620#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 621#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 630#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 631#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 624#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 625#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 647#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 646#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 645#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 644#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 643#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 642#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 641#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 640#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 639#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 638#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 637#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 636#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 635#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 634#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 633#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 632#L34-3 assume !(main_~i~1#1 < 10); 612#L34-4 havoc main_~i~1#1;assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 613#L20-3 assume !(avg_~i~0#1 < 10); 622#L20-4 avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296); 623#avg_returnLabel#1 main_#t~ret5#1 := avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;havoc avg_#in~x#1.base, avg_#in~x#1.offset;assume { :end_inline_avg } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 618#L20-8 [2024-10-12 00:23:12,685 INFO L747 eck$LassoCheckResult]: Loop: 618#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 619#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 618#L20-8 [2024-10-12 00:23:12,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:12,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1328178265, now seen corresponding path program 1 times [2024-10-12 00:23:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:12,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917459146] [2024-10-12 00:23:12,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:12,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:12,803 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-12 00:23:12,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:23:12,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917459146] [2024-10-12 00:23:12,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917459146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:23:12,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:23:12,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:23:12,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759267642] [2024-10-12 00:23:12,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:23:12,804 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:23:12,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:12,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2024-10-12 00:23:12,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:12,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517583093] [2024-10-12 00:23:12,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:12,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:12,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:12,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:12,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:23:12,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:23:12,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:23:12,852 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:23:12,879 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2024-10-12 00:23:12,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 47 transitions. [2024-10-12 00:23:12,880 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-10-12 00:23:12,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 47 transitions. [2024-10-12 00:23:12,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-10-12 00:23:12,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-12 00:23:12,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 47 transitions. [2024-10-12 00:23:12,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:12,881 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-10-12 00:23:12,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 47 transitions. [2024-10-12 00:23:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2024-10-12 00:23:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-10-12 00:23:12,884 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-10-12 00:23:12,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:23:12,885 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-10-12 00:23:12,885 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-12 00:23:12,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2024-10-12 00:23:12,886 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-10-12 00:23:12,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:12,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:12,886 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:23:12,887 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:23:12,887 INFO L745 eck$LassoCheckResult]: Stem: 716#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 707#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 708#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 711#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 712#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 718#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 735#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 734#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 733#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 732#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 731#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 730#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 729#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 728#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 727#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 726#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 725#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 724#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 723#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 722#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 721#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 720#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 719#L34-3 assume !(main_~i~1#1 < 10); 699#L34-4 havoc main_~i~1#1;assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 700#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 714#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 715#L20-3 assume !(avg_~i~0#1 < 10); 709#L20-4 avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296); 710#avg_returnLabel#1 main_#t~ret5#1 := avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;havoc avg_#in~x#1.base, avg_#in~x#1.offset;assume { :end_inline_avg } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 705#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 706#L20-7 [2024-10-12 00:23:12,887 INFO L747 eck$LassoCheckResult]: Loop: 706#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 717#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 706#L20-7 [2024-10-12 00:23:12,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1721709263, now seen corresponding path program 1 times [2024-10-12 00:23:12,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:12,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610227285] [2024-10-12 00:23:12,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:12,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-12 00:23:12,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:23:12,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610227285] [2024-10-12 00:23:12,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610227285] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:23:12,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083881962] [2024-10-12 00:23:12,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:12,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:23:12,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:12,978 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:23:12,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-10-12 00:23:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:13,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 00:23:13,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:13,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-10-12 00:23:13,108 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-12 00:23:13,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:23:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-12 00:23:13,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083881962] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:23:13,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:23:13,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-12 00:23:13,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789294158] [2024-10-12 00:23:13,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:23:13,127 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:23:13,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:13,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2024-10-12 00:23:13,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:13,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145764323] [2024-10-12 00:23:13,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:13,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:13,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:13,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:13,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:23:13,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 00:23:13,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 00:23:13,178 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:13,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:23:13,255 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2024-10-12 00:23:13,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 62 transitions. [2024-10-12 00:23:13,256 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-10-12 00:23:13,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 62 transitions. [2024-10-12 00:23:13,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-10-12 00:23:13,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-10-12 00:23:13,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 62 transitions. [2024-10-12 00:23:13,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:13,257 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-10-12 00:23:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 62 transitions. [2024-10-12 00:23:13,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2024-10-12 00:23:13,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:13,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2024-10-12 00:23:13,263 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 55 transitions. [2024-10-12 00:23:13,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:23:13,265 INFO L425 stractBuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2024-10-12 00:23:13,265 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-12 00:23:13,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 55 transitions. [2024-10-12 00:23:13,266 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-10-12 00:23:13,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:13,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:13,268 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:23:13,268 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:23:13,269 INFO L745 eck$LassoCheckResult]: Stem: 998#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 988#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 989#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1000#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1001#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 992#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 993#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1023#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1022#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1021#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1020#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1019#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1018#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1017#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1016#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1015#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1013#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1011#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1009#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1007#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1006#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1005#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1004#L34-3 assume !(main_~i~1#1 < 10); 980#L34-4 havoc main_~i~1#1;assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 981#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 995#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 996#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 997#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1028#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1027#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1026#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1025#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1024#L20-3 assume !(avg_~i~0#1 < 10); 990#L20-4 avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296); 991#avg_returnLabel#1 main_#t~ret5#1 := avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;havoc avg_#in~x#1.base, avg_#in~x#1.offset;assume { :end_inline_avg } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 986#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 987#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 999#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1014#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1012#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1010#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1008#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1003#L20-7 [2024-10-12 00:23:13,269 INFO L747 eck$LassoCheckResult]: Loop: 1003#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1002#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1003#L20-7 [2024-10-12 00:23:13,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:13,269 INFO L85 PathProgramCache]: Analyzing trace with hash 512696561, now seen corresponding path program 1 times [2024-10-12 00:23:13,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:13,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576045564] [2024-10-12 00:23:13,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:13,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-10-12 00:23:13,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:23:13,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576045564] [2024-10-12 00:23:13,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576045564] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:23:13,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684284639] [2024-10-12 00:23:13,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:13,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:23:13,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:13,444 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:23:13,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-10-12 00:23:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:13,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:23:13,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-10-12 00:23:13,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:23:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-10-12 00:23:13,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684284639] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:23:13,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:23:13,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-12 00:23:13,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634596509] [2024-10-12 00:23:13,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:23:13,643 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:23:13,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:13,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2024-10-12 00:23:13,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:13,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204013781] [2024-10-12 00:23:13,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:13,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:13,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:13,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:13,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:23:13,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 00:23:13,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-12 00:23:13,695 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:13,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:23:13,833 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2024-10-12 00:23:13,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 98 transitions. [2024-10-12 00:23:13,834 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-10-12 00:23:13,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 98 transitions. [2024-10-12 00:23:13,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2024-10-12 00:23:13,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2024-10-12 00:23:13,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 98 transitions. [2024-10-12 00:23:13,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:13,837 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94 states and 98 transitions. [2024-10-12 00:23:13,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 98 transitions. [2024-10-12 00:23:13,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2024-10-12 00:23:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 74 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-10-12 00:23:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2024-10-12 00:23:13,848 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 79 transitions. [2024-10-12 00:23:13,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 00:23:13,849 INFO L425 stractBuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2024-10-12 00:23:13,849 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-12 00:23:13,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 79 transitions. [2024-10-12 00:23:13,849 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-10-12 00:23:13,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:13,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:13,851 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:23:13,851 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:23:13,851 INFO L745 eck$LassoCheckResult]: Stem: 1405#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1395#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1396#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1399#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1400#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1407#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1439#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1437#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1435#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1433#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1431#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1429#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1427#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1425#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1423#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1421#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1419#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1417#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1415#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1413#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1412#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1411#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1410#L34-3 assume !(main_~i~1#1 < 10); 1387#L34-4 havoc main_~i~1#1;assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 1388#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1402#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1403#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1404#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1459#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1458#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1457#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1456#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1455#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1454#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1453#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1452#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1451#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1450#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1449#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1448#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1447#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1446#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1445#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1444#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1443#L20-3 assume !(avg_~i~0#1 < 10); 1397#L20-4 avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296); 1398#avg_returnLabel#1 main_#t~ret5#1 := avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;havoc avg_#in~x#1.base, avg_#in~x#1.offset;assume { :end_inline_avg } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 1393#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1394#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1406#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1442#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1441#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1440#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1438#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1436#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1434#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1432#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1430#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1428#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1426#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1424#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1422#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1420#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1418#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1416#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1414#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1409#L20-7 [2024-10-12 00:23:13,854 INFO L747 eck$LassoCheckResult]: Loop: 1409#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1408#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1409#L20-7 [2024-10-12 00:23:13,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:13,854 INFO L85 PathProgramCache]: Analyzing trace with hash -549950095, now seen corresponding path program 2 times [2024-10-12 00:23:13,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:13,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034611709] [2024-10-12 00:23:13,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:13,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:13,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:14,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:14,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:14,116 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2024-10-12 00:23:14,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:14,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655392546] [2024-10-12 00:23:14,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:14,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:14,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:14,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:14,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:14,124 INFO L85 PathProgramCache]: Analyzing trace with hash -221062545, now seen corresponding path program 3 times [2024-10-12 00:23:14,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:14,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313438006] [2024-10-12 00:23:14,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:14,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:23:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 81 proven. 19 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-12 00:23:14,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:23:14,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313438006] [2024-10-12 00:23:14,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313438006] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:23:14,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619530560] [2024-10-12 00:23:14,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 00:23:14,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:23:14,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:23:14,474 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:23:14,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-10-12 00:23:14,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-12 00:23:14,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 00:23:14,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 00:23:14,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:23:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-12 00:23:14,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 00:23:14,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619530560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:23:14,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 00:23:14,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2024-10-12 00:23:14,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709633891] [2024-10-12 00:23:14,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:23:14,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:23:14,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 00:23:14,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2024-10-12 00:23:14,792 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. cyclomatic complexity: 9 Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:14,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:23:14,962 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2024-10-12 00:23:14,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 95 transitions. [2024-10-12 00:23:14,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:23:14,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 72 states and 73 transitions. [2024-10-12 00:23:14,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-10-12 00:23:14,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2024-10-12 00:23:14,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 73 transitions. [2024-10-12 00:23:14,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:23:14,964 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 73 transitions. [2024-10-12 00:23:14,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 73 transitions. [2024-10-12 00:23:14,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-12 00:23:14,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:23:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2024-10-12 00:23:14,967 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 73 transitions. [2024-10-12 00:23:14,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 00:23:14,971 INFO L425 stractBuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2024-10-12 00:23:14,971 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-12 00:23:14,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 73 transitions. [2024-10-12 00:23:14,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-12 00:23:14,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:23:14,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:23:14,973 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:23:14,973 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-12 00:23:14,973 INFO L745 eck$LassoCheckResult]: Stem: 1791#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1782#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1783#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1786#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1787#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1793#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1828#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1826#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1824#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1822#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1820#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1818#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1816#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1814#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1812#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1810#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1808#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1806#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1804#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1802#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1800#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1796#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1795#L34-3 assume !(main_~i~1#1 < 10); 1776#L34-4 havoc main_~i~1#1;assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 1777#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1790#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1788#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1789#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1845#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1844#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1843#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1842#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1841#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1840#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1839#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1838#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1837#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1836#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1835#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1834#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1833#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1832#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1831#L20-3 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1830#L20-2 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1829#L20-3 assume !(avg_~i~0#1 < 10); 1784#L20-4 avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296); 1785#avg_returnLabel#1 main_#t~ret5#1 := avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;havoc avg_#in~x#1.base, avg_#in~x#1.offset;assume { :end_inline_avg } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_avg } true;avg_#in~x#1.base, avg_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;avg_~x#1.base, avg_~x#1.offset := avg_#in~x#1.base, avg_#in~x#1.offset;havoc avg_~i~0#1;havoc avg_~ret~0#1;avg_~ret~0#1 := 0;avg_~i~0#1 := 0; 1780#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1781#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1792#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1827#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1825#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1823#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1821#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1819#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1817#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1815#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1813#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1811#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1809#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1807#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1805#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1803#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1801#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1799#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1798#L20-8 assume !!(avg_~i~0#1 < 10);call avg_#t~mem1#1 := read~int#1(avg_~x#1.base, avg_~x#1.offset + 4 * avg_~i~0#1, 4);avg_~ret~0#1 := avg_~ret~0#1 + avg_#t~mem1#1;havoc avg_#t~mem1#1; 1797#L20-7 avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1794#L20-8 assume !(avg_~i~0#1 < 10); 1774#L20-9 avg_#res#1 := (if (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 else (if avg_~ret~0#1 < 0 && 0 != avg_~ret~0#1 % 10 then 1 + avg_~ret~0#1 / 10 else avg_~ret~0#1 / 10) % 4294967296 - 4294967296); 1775#avg_returnLabel#2 main_#t~ret8#1 := avg_#res#1;havoc avg_#t~mem1#1, avg_#t~post2#1, avg_~x#1.base, avg_~x#1.offset, avg_~i~0#1, avg_~ret~0#1;havoc avg_#in~x#1.base, avg_#in~x#1.offset;assume { :end_inline_avg } true;main_~ret2~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;main_~i~2#1 := 0; 1779#L43-3 [2024-10-12 00:23:14,973 INFO L747 eck$LassoCheckResult]: Loop: 1779#L43-3 assume !!(main_~i~2#1 < 9);call main_#t~mem10#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int#1(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem10#1; 1778#L43-2 main_#t~post11#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1779#L43-3 [2024-10-12 00:23:14,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:14,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1987708689, now seen corresponding path program 1 times [2024-10-12 00:23:14,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:14,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779725027] [2024-10-12 00:23:14,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:14,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:15,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:15,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:15,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:15,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2024-10-12 00:23:15,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:15,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075793887] [2024-10-12 00:23:15,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:15,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:15,229 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:15,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:15,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:23:15,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1072398385, now seen corresponding path program 1 times [2024-10-12 00:23:15,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:23:15,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853447674] [2024-10-12 00:23:15,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:23:15,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:23:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:15,326 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:23:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:23:15,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:23:29,020 WARN L286 SmtUtils]: Spent 13.51s on a formula simplification. DAG size of input: 551 DAG size of output: 413 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)