./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/avg10-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/avg10-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 431bc26901e3cf271c74e4f10a5bc241d4509dbbafd99aaf0126c46ffc8b7c33 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:11:40,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:11:40,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:11:40,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:11:40,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:11:40,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:11:40,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:11:40,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:11:40,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:11:40,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:11:40,592 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:11:40,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:11:40,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:11:40,593 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:11:40,596 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:11:40,596 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:11:40,597 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:11:40,597 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:11:40,597 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:11:40,597 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:11:40,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:11:40,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:11:40,598 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:11:40,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:11:40,599 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:11:40,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:11:40,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:11:40,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:11:40,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:11:40,600 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:11:40,600 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:11:40,600 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:11:40,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:11:40,600 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:11:40,601 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:11:40,601 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:11:40,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:11:40,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:11:40,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:11:40,602 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:11:40,602 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 431bc26901e3cf271c74e4f10a5bc241d4509dbbafd99aaf0126c46ffc8b7c33 [2024-11-17 08:11:40,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:11:40,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:11:40,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:11:40,816 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:11:40,816 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:11:40,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/avg10-2.i [2024-11-17 08:11:42,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:11:42,151 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:11:42,152 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/avg10-2.i [2024-11-17 08:11:42,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ce1d0c1c/94e75ac878fc4153a37ec2e735b07212/FLAGdcf9aac13 [2024-11-17 08:11:42,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ce1d0c1c/94e75ac878fc4153a37ec2e735b07212 [2024-11-17 08:11:42,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:11:42,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:11:42,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:11:42,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:11:42,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:11:42,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:11:42" (1/1) ... [2024-11-17 08:11:42,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d20d2e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:42, skipping insertion in model container [2024-11-17 08:11:42,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:11:42" (1/1) ... [2024-11-17 08:11:42,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:11:42,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:11:42,772 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:11:42,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:11:42,799 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:11:42,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:42 WrapperNode [2024-11-17 08:11:42,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:11:42,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:11:42,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:11:42,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:11:42,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:42" (1/1) ... [2024-11-17 08:11:42,815 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:42" (1/1) ... [2024-11-17 08:11:42,830 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 113 [2024-11-17 08:11:42,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:11:42,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:11:42,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:11:42,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:11:42,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:42" (1/1) ... [2024-11-17 08:11:42,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:42" (1/1) ... [2024-11-17 08:11:42,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:42" (1/1) ... [2024-11-17 08:11:42,849 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-11-17 08:11:42,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:42" (1/1) ... [2024-11-17 08:11:42,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:42" (1/1) ... [2024-11-17 08:11:42,854 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:42" (1/1) ... [2024-11-17 08:11:42,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:42" (1/1) ... [2024-11-17 08:11:42,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:42" (1/1) ... [2024-11-17 08:11:42,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:42" (1/1) ... [2024-11-17 08:11:42,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:11:42,858 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:11:42,858 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:11:42,858 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:11:42,859 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:42" (1/1) ... [2024-11-17 08:11:42,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:42,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:42,884 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:42,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-17 08:11:42,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:11:42,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:11:42,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 08:11:42,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 08:11:42,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 08:11:42,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 08:11:42,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:11:42,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:11:42,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 08:11:42,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 08:11:42,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 08:11:42,976 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:11:42,978 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:11:43,116 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2024-11-17 08:11:43,132 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-17 08:11:43,132 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:11:43,142 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:11:43,142 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:11:43,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:11:43 BoogieIcfgContainer [2024-11-17 08:11:43,142 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:11:43,143 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:11:43,143 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:11:43,146 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:11:43,146 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:11:43,147 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:11:42" (1/3) ... [2024-11-17 08:11:43,147 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d51c20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:11:43, skipping insertion in model container [2024-11-17 08:11:43,147 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:11:43,147 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:11:42" (2/3) ... [2024-11-17 08:11:43,148 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d51c20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:11:43, skipping insertion in model container [2024-11-17 08:11:43,148 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:11:43,148 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:11:43" (3/3) ... [2024-11-17 08:11:43,149 INFO L332 chiAutomizerObserver]: Analyzing ICFG avg10-2.i [2024-11-17 08:11:43,205 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:11:43,206 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:11:43,206 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:11:43,206 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:11:43,206 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:11:43,206 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:11:43,206 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:11:43,206 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:11:43,211 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-11-17 08:11:43,223 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2024-11-17 08:11:43,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:43,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:43,227 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:11:43,227 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:43,227 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:11:43,227 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-11-17 08:11:43,229 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2024-11-17 08:11:43,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:43,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:43,229 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:11:43,229 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:43,233 INFO L745 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 21#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~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; 7#L34-1true [2024-11-17 08:11:43,233 INFO L747 eck$LassoCheckResult]: Loop: 7#L34-1true assume true; 6#L34-2true 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 7#L34-1true [2024-11-17 08:11:43,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:43,237 INFO L85 PathProgramCache]: Analyzing trace with hash 2592, now seen corresponding path program 1 times [2024-11-17 08:11:43,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:43,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361108782] [2024-11-17 08:11:43,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:43,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:43,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:43,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:43,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:43,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2496, now seen corresponding path program 1 times [2024-11-17 08:11:43,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:43,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460912328] [2024-11-17 08:11:43,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:43,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:43,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:43,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:43,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:43,360 INFO L85 PathProgramCache]: Analyzing trace with hash 2492447, now seen corresponding path program 1 times [2024-11-17 08:11:43,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:43,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570321847] [2024-11-17 08:11:43,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:43,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:43,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:43,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:43,647 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:11:43,648 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:11:43,648 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:11:43,648 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:11:43,648 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:11:43,649 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:43,649 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:11:43,649 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:11:43,649 INFO L132 ssoRankerPreferences]: Filename of dumped script: avg10-2.i_Iteration1_Lasso [2024-11-17 08:11:43,650 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:11:43,650 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:11:43,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:43,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:43,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:43,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:43,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:43,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:43,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:43,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:43,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:43,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:43,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:43,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:43,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:43,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:43,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:43,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:43,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:43,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:43,981 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:11:43,984 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:11:43,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:43,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:43,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:43,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-17 08:11:43,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:44,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:44,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:44,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:44,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:44,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:44,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:44,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:44,004 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:44,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-17 08:11:44,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:44,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:44,017 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:44,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-17 08:11:44,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:44,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:44,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:44,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:44,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:44,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:44,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:44,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:44,031 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:44,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-17 08:11:44,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:44,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:44,048 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:44,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-17 08:11:44,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:44,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:44,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:44,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:44,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:44,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:44,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:44,071 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:44,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:44,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:44,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:44,086 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:44,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-17 08:11:44,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:44,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:44,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:44,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:44,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:44,103 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:44,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:44,109 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:44,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:44,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:44,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:44,120 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:44,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-17 08:11:44,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:44,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:44,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:44,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:44,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:44,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:44,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:44,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:44,134 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:44,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:44,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:44,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:44,145 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:44,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-17 08:11:44,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:44,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:44,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:44,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:44,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:44,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:44,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:44,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:44,164 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:44,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-17 08:11:44,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:44,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:44,177 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:44,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-17 08:11:44,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:44,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:44,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:44,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:44,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:44,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:44,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:44,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:44,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:44,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-17 08:11:44,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:44,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:44,203 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:44,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-17 08:11:44,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:44,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:44,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:44,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:44,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:44,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:44,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:44,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:44,219 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:44,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-17 08:11:44,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:44,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:44,231 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:44,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-17 08:11:44,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:44,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:44,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:44,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:44,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:44,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:44,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:44,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:44,244 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:44,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-17 08:11:44,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:44,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:44,255 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:44,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-17 08:11:44,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:44,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:44,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:44,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:44,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:44,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:44,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:44,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:44,268 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:44,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:44,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:44,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:44,280 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:44,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-17 08:11:44,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:44,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:44,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:44,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:44,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:44,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:44,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:44,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:44,292 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:44,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:44,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:44,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:44,304 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:44,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-17 08:11:44,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:44,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:44,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:44,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:44,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:44,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:44,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:44,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:44,317 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:44,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-17 08:11:44,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:44,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:44,328 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:44,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-17 08:11:44,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:44,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:44,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:44,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:44,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:44,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:44,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:44,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:44,343 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:44,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:44,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:44,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:44,355 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:44,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-17 08:11:44,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:44,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:44,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:44,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:44,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:44,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:44,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:44,373 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:44,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-17 08:11:44,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:44,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:44,385 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:44,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-17 08:11:44,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:44,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:44,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:44,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:44,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:44,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:44,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:44,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:44,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:44,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:44,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:44,414 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:44,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-17 08:11:44,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:44,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:44,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:44,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:44,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:44,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:44,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:44,431 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:44,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-17 08:11:44,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:44,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:44,443 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:44,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-17 08:11:44,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:44,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:44,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:44,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:44,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:44,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:44,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:44,464 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:11:44,482 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-17 08:11:44,482 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-17 08:11:44,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:44,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:44,507 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:44,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-17 08:11:44,509 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:11:44,520 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:11:44,521 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:11:44,521 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-11-17 08:11:44,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-17 08:11:44,544 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-17 08:11:44,557 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:11:44,558 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:11:44,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:44,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:11:44,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:44,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:11:44,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:44,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:44,623 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-17 08:11:44,625 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-11-17 08:11:44,656 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 74 transitions. Complement of second has 6 states. [2024-11-17 08:11:44,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-17 08:11:44,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:11:44,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2024-11-17 08:11:44,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-17 08:11:44,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:44,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-17 08:11:44,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:44,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-17 08:11:44,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:44,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 74 transitions. [2024-11-17 08:11:44,666 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-17 08:11:44,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 20 states and 28 transitions. [2024-11-17 08:11:44,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-17 08:11:44,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-17 08:11:44,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2024-11-17 08:11:44,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:44,670 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 28 transitions. [2024-11-17 08:11:44,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2024-11-17 08:11:44,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-17 08:11:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:11:44,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2024-11-17 08:11:44,687 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 28 transitions. [2024-11-17 08:11:44,687 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2024-11-17 08:11:44,687 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:11:44,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 28 transitions. [2024-11-17 08:11:44,688 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-17 08:11:44,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:44,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:44,688 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-17 08:11:44,688 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:44,688 INFO L745 eck$LassoCheckResult]: Stem: 132#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 133#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~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; 145#L34-1 assume true; 141#L34-2 assume !(main_~i~1#1 < 10); 142#L34 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; 138#L20-4 [2024-11-17 08:11:44,688 INFO L747 eck$LassoCheckResult]: Loop: 138#L20-4 assume true; 137#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 138#L20-4 [2024-11-17 08:11:44,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:44,689 INFO L85 PathProgramCache]: Analyzing trace with hash 77265838, now seen corresponding path program 1 times [2024-11-17 08:11:44,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:44,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091540696] [2024-11-17 08:11:44,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:44,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:44,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:44,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:44,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091540696] [2024-11-17 08:11:44,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091540696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:11:44,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:11:44,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:11:44,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338697618] [2024-11-17 08:11:44,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:11:44,749 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:11:44,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:44,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2272, now seen corresponding path program 1 times [2024-11-17 08:11:44,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:44,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510260767] [2024-11-17 08:11:44,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:44,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:44,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:44,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:44,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-17 08:11:44,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:44,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:11:44,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:11:44,826 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:11:44,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:44,834 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-11-17 08:11:44,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2024-11-17 08:11:44,835 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-17 08:11:44,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 25 transitions. [2024-11-17 08:11:44,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-17 08:11:44,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-17 08:11:44,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2024-11-17 08:11:44,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:44,836 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-11-17 08:11:44,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2024-11-17 08:11:44,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2024-11-17 08:11:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:11:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-17 08:11:44,838 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-17 08:11:44,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:11:44,838 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-17 08:11:44,838 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:11:44,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2024-11-17 08:11:44,839 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-17 08:11:44,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:44,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:44,839 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-11-17 08:11:44,839 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:44,839 INFO L745 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 181#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~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; 193#L34-1 assume true; 191#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 192#L34-1 assume true; 189#L34-2 assume !(main_~i~1#1 < 10); 190#L34 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; 185#L20-4 [2024-11-17 08:11:44,839 INFO L747 eck$LassoCheckResult]: Loop: 185#L20-4 assume true; 184#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 185#L20-4 [2024-11-17 08:11:44,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:44,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1238092111, now seen corresponding path program 1 times [2024-11-17 08:11:44,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:44,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723364790] [2024-11-17 08:11:44,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:44,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:44,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:44,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723364790] [2024-11-17 08:11:44,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723364790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:44,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709523920] [2024-11-17 08:11:44,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:44,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:44,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:44,897 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:44,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-17 08:11:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:44,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 08:11:44,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:44,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:44,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:11:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:44,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709523920] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:11:44,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:11:44,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-17 08:11:44,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772517033] [2024-11-17 08:11:44,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:11:44,975 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:11:44,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:44,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2272, now seen corresponding path program 2 times [2024-11-17 08:11:44,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:44,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006791413] [2024-11-17 08:11:44,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:44,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:44,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:44,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:45,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:45,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 08:11:45,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-17 08:11:45,025 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:11:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:45,038 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-11-17 08:11:45,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2024-11-17 08:11:45,039 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-17 08:11:45,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 31 transitions. [2024-11-17 08:11:45,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-17 08:11:45,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-17 08:11:45,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2024-11-17 08:11:45,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:45,040 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-17 08:11:45,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2024-11-17 08:11:45,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-17 08:11:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:11:45,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-11-17 08:11:45,042 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-17 08:11:45,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 08:11:45,043 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-11-17 08:11:45,043 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:11:45,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 30 transitions. [2024-11-17 08:11:45,043 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-17 08:11:45,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:45,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:45,044 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1] [2024-11-17 08:11:45,044 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:45,044 INFO L745 eck$LassoCheckResult]: Stem: 276#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 277#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~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; 289#L34-1 assume true; 291#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 292#L34-1 assume true; 287#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 288#L34-1 assume true; 299#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 298#L34-1 assume true; 297#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 296#L34-1 assume true; 285#L34-2 assume !(main_~i~1#1 < 10); 286#L34 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; 281#L20-4 [2024-11-17 08:11:45,044 INFO L747 eck$LassoCheckResult]: Loop: 281#L20-4 assume true; 280#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 281#L20-4 [2024-11-17 08:11:45,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:45,044 INFO L85 PathProgramCache]: Analyzing trace with hash -934471502, now seen corresponding path program 2 times [2024-11-17 08:11:45,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:45,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146824928] [2024-11-17 08:11:45,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:45,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:45,145 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:45,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:45,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146824928] [2024-11-17 08:11:45,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146824928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:45,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002625561] [2024-11-17 08:11:45,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:11:45,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:45,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:45,149 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:45,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-17 08:11:45,194 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:11:45,194 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:11:45,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:11:45,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:45,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:11:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:45,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002625561] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:11:45,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:11:45,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-17 08:11:45,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424124528] [2024-11-17 08:11:45,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:11:45,270 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:11:45,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:45,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2272, now seen corresponding path program 3 times [2024-11-17 08:11:45,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:45,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192729257] [2024-11-17 08:11:45,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:45,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:45,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:45,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:45,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:45,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 08:11:45,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-17 08:11:45,306 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:11:45,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:45,324 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2024-11-17 08:11:45,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 49 transitions. [2024-11-17 08:11:45,325 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-17 08:11:45,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 39 states and 43 transitions. [2024-11-17 08:11:45,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-17 08:11:45,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-17 08:11:45,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 43 transitions. [2024-11-17 08:11:45,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:45,326 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-11-17 08:11:45,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 43 transitions. [2024-11-17 08:11:45,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-11-17 08:11:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:11:45,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-17 08:11:45,328 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-17 08:11:45,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 08:11:45,328 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-17 08:11:45,328 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:11:45,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 42 transitions. [2024-11-17 08:11:45,329 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-17 08:11:45,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:45,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:45,329 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 1, 1, 1, 1] [2024-11-17 08:11:45,330 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:45,330 INFO L745 eck$LassoCheckResult]: Stem: 435#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 436#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~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; 448#L34-1 assume true; 450#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 451#L34-1 assume true; 446#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 447#L34-1 assume true; 470#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 469#L34-1 assume true; 468#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 467#L34-1 assume true; 466#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 465#L34-1 assume true; 464#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 463#L34-1 assume true; 462#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 461#L34-1 assume true; 460#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 459#L34-1 assume true; 458#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 457#L34-1 assume true; 456#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 455#L34-1 assume true; 444#L34-2 assume !(main_~i~1#1 < 10); 445#L34 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; 440#L20-4 [2024-11-17 08:11:45,330 INFO L747 eck$LassoCheckResult]: Loop: 440#L20-4 assume true; 439#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 440#L20-4 [2024-11-17 08:11:45,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:45,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1810996040, now seen corresponding path program 3 times [2024-11-17 08:11:45,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:45,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066015129] [2024-11-17 08:11:45,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:45,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:45,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:45,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:45,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:45,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2272, now seen corresponding path program 4 times [2024-11-17 08:11:45,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:45,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392735102] [2024-11-17 08:11:45,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:45,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:45,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:45,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:45,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:45,388 INFO L85 PathProgramCache]: Analyzing trace with hash -905438249, now seen corresponding path program 1 times [2024-11-17 08:11:45,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:45,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633798760] [2024-11-17 08:11:45,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:45,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:45,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:45,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:49,028 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:11:49,029 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:11:49,029 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:11:49,029 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:11:49,029 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:11:49,029 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,029 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:11:49,029 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:11:49,029 INFO L132 ssoRankerPreferences]: Filename of dumped script: avg10-2.i_Iteration5_Lasso [2024-11-17 08:11:49,029 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:11:49,029 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:11:49,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:11:49,421 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:11:49,421 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:11:49,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,423 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-17 08:11:49,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:49,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:49,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:49,436 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:49,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,447 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-17 08:11:49,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:49,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:49,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:49,463 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:49,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,475 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-17 08:11:49,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:49,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:49,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:49,488 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-17 08:11:49,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,500 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-17 08:11:49,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:49,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:49,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:49,512 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:49,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,523 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-17 08:11:49,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:49,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:49,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:49,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:49,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,547 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-17 08:11:49,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:49,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:49,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:49,561 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:49,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,572 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-17 08:11:49,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:49,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:49,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:49,584 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:49,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,594 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-17 08:11:49,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:49,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:49,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:49,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:49,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,618 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-17 08:11:49,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:49,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:49,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:49,630 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:49,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,641 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-17 08:11:49,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:49,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:49,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:49,653 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:49,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,664 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-17 08:11:49,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:49,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:49,683 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-17 08:11:49,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,695 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-17 08:11:49,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:49,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,708 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:49,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:49,709 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:49,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,720 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-17 08:11:49,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:49,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:49,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:49,732 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-17 08:11:49,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,743 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-17 08:11:49,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:49,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:49,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:49,757 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-17 08:11:49,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,769 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-17 08:11:49,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:49,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:49,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:49,786 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-17 08:11:49,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,798 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-17 08:11:49,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-11-17 08:11:49,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:49,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:49,814 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:49,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,825 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-17 08:11:49,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,838 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:49,838 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:49,840 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:49,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,852 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-17 08:11:49,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:49,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:49,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:49,864 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:49,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,875 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-17 08:11:49,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:11:49,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:11:49,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:11:49,887 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-17 08:11:49,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,898 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-17 08:11:49,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:49,910 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:49,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:49,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,923 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-17 08:11:49,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:49,943 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:49,945 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:49,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,956 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-17 08:11:49,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:49,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:49,972 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:49,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:49,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:49,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:49,983 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:49,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-17 08:11:49,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:49,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:49,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:49,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:49,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:49,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:49,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:49,998 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:11:50,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-11-17 08:11:50,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:50,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:50,011 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:50,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-17 08:11:50,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:11:50,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:11:50,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:11:50,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:11:50,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:11:50,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:11:50,029 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:11:50,038 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:11:50,053 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-17 08:11:50,053 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-11-17 08:11:50,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:11:50,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:50,055 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:11:50,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-17 08:11:50,057 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:11:50,067 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:11:50,067 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:11:50,067 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_avg_~x#1.base)_1, ULTIMATE.start_avg_~i~0#1) = 19*v_rep(select #length ULTIMATE.start_avg_~x#1.base)_1 - 8*ULTIMATE.start_avg_~i~0#1 Supporting invariants [] [2024-11-17 08:11:50,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:50,090 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2024-11-17 08:11:50,092 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:11:50,092 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:11:50,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:50,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:11:50,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:50,160 WARN L253 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:11:50,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:50,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:11:50,166 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-17 08:11:50,167 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 42 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-11-17 08:11:50,174 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 42 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 40 states and 45 transitions. Complement of second has 5 states. [2024-11-17 08:11:50,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-17 08:11:50,176 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-11-17 08:11:50,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2024-11-17 08:11:50,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 25 letters. Loop has 2 letters. [2024-11-17 08:11:50,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:50,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 27 letters. Loop has 2 letters. [2024-11-17 08:11:50,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:50,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 25 letters. Loop has 4 letters. [2024-11-17 08:11:50,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:11:50,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2024-11-17 08:11:50,177 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-17 08:11:50,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 45 transitions. [2024-11-17 08:11:50,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-17 08:11:50,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-17 08:11:50,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 45 transitions. [2024-11-17 08:11:50,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:50,178 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-17 08:11:50,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 45 transitions. [2024-11-17 08:11:50,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-17 08:11:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.125) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:11:50,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-17 08:11:50,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-17 08:11:50,182 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-17 08:11:50,182 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:11:50,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2024-11-17 08:11:50,182 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-17 08:11:50,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:50,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:50,183 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:50,183 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:50,183 INFO L745 eck$LassoCheckResult]: Stem: 645#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 646#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~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; 660#L34-1 assume true; 662#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 663#L34-1 assume true; 658#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 659#L34-1 assume true; 682#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 681#L34-1 assume true; 680#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 679#L34-1 assume true; 678#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 677#L34-1 assume true; 676#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 675#L34-1 assume true; 674#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 673#L34-1 assume true; 672#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 671#L34-1 assume true; 670#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 669#L34-1 assume true; 668#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 667#L34-1 assume true; 656#L34-2 assume !(main_~i~1#1 < 10); 657#L34 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; 655#L20-4 assume true; 649#L20-5 assume !(avg_~i~0#1 < 10); 643#L23-5 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); 644#L23-4 assume true;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; 654#L20-2 [2024-11-17 08:11:50,183 INFO L747 eck$LassoCheckResult]: Loop: 654#L20-2 assume true; 664#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 654#L20-2 [2024-11-17 08:11:50,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:50,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1752203027, now seen corresponding path program 1 times [2024-11-17 08:11:50,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:50,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104161909] [2024-11-17 08:11:50,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:50,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 08:11:50,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:50,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104161909] [2024-11-17 08:11:50,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104161909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:11:50,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:11:50,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:11:50,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077303791] [2024-11-17 08:11:50,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:11:50,235 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:11:50,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:50,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1984, now seen corresponding path program 1 times [2024-11-17 08:11:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:50,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461261412] [2024-11-17 08:11:50,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:50,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:50,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:50,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:50,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:50,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:11:50,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:11:50,268 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:11:50,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:50,279 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2024-11-17 08:11:50,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 50 transitions. [2024-11-17 08:11:50,280 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-17 08:11:50,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 49 transitions. [2024-11-17 08:11:50,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-17 08:11:50,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-17 08:11:50,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 49 transitions. [2024-11-17 08:11:50,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:50,281 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 49 transitions. [2024-11-17 08:11:50,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 49 transitions. [2024-11-17 08:11:50,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2024-11-17 08:11:50,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:11:50,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-11-17 08:11:50,283 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-11-17 08:11:50,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:11:50,284 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-11-17 08:11:50,284 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:11:50,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 46 transitions. [2024-11-17 08:11:50,284 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-17 08:11:50,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:50,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:50,285 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:50,285 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:50,285 INFO L745 eck$LassoCheckResult]: Stem: 737#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 738#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~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; 752#L34-1 assume true; 750#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 751#L34-1 assume true; 754#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 776#L34-1 assume true; 775#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 774#L34-1 assume true; 773#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 772#L34-1 assume true; 771#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 770#L34-1 assume true; 769#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 768#L34-1 assume true; 767#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 766#L34-1 assume true; 765#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 764#L34-1 assume true; 763#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 762#L34-1 assume true; 761#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 760#L34-1 assume true; 748#L34-2 assume !(main_~i~1#1 < 10); 749#L34 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; 747#L20-4 assume true; 742#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 743#L20-4 assume true; 741#L20-5 assume !(avg_~i~0#1 < 10); 735#L23-5 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); 736#L23-4 assume true;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; 746#L20-2 assume true; 755#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 756#L20-2 [2024-11-17 08:11:50,285 INFO L747 eck$LassoCheckResult]: Loop: 756#L20-2 assume true; 759#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 756#L20-2 [2024-11-17 08:11:50,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:50,285 INFO L85 PathProgramCache]: Analyzing trace with hash 566406705, now seen corresponding path program 1 times [2024-11-17 08:11:50,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:50,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900874973] [2024-11-17 08:11:50,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:50,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:50,342 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 08:11:50,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:50,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900874973] [2024-11-17 08:11:50,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900874973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:50,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431848289] [2024-11-17 08:11:50,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:50,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:50,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:50,345 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:50,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2024-11-17 08:11:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:50,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 08:11:50,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 08:11:50,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:11:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 08:11:50,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431848289] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:11:50,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:11:50,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-17 08:11:50,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435702261] [2024-11-17 08:11:50,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:11:50,440 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:11:50,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:50,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1984, now seen corresponding path program 2 times [2024-11-17 08:11:50,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:50,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077067352] [2024-11-17 08:11:50,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:50,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:50,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:50,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:50,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:50,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 08:11:50,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-17 08:11:50,475 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:11:50,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:50,508 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2024-11-17 08:11:50,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 70 transitions. [2024-11-17 08:11:50,509 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-17 08:11:50,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 63 states and 67 transitions. [2024-11-17 08:11:50,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-11-17 08:11:50,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-11-17 08:11:50,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 67 transitions. [2024-11-17 08:11:50,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:50,512 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 67 transitions. [2024-11-17 08:11:50,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 67 transitions. [2024-11-17 08:11:50,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2024-11-17 08:11:50,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:11:50,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-11-17 08:11:50,514 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-11-17 08:11:50,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 08:11:50,515 INFO L425 stractBuchiCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-11-17 08:11:50,515 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:11:50,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 58 transitions. [2024-11-17 08:11:50,516 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-17 08:11:50,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:50,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:50,517 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:50,517 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:50,517 INFO L745 eck$LassoCheckResult]: Stem: 1047#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1048#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~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; 1063#L34-1 assume true; 1065#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1066#L34-1 assume true; 1061#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1062#L34-1 assume true; 1098#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1097#L34-1 assume true; 1096#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1092#L34-1 assume true; 1091#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1090#L34-1 assume true; 1089#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1088#L34-1 assume true; 1087#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1086#L34-1 assume true; 1084#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1082#L34-1 assume true; 1080#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1078#L34-1 assume true; 1075#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1074#L34-1 assume true; 1059#L34-2 assume !(main_~i~1#1 < 10); 1060#L34 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; 1057#L20-4 assume true; 1052#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1053#L20-4 assume true; 1058#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1095#L20-4 assume true; 1094#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1093#L20-4 assume true; 1073#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1072#L20-4 assume true; 1051#L20-5 assume !(avg_~i~0#1 < 10); 1045#L23-5 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); 1046#L23-4 assume true;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; 1056#L20-2 assume true; 1069#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1067#L20-2 assume true; 1068#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1085#L20-2 assume true; 1083#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1081#L20-2 assume true; 1079#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1077#L20-2 [2024-11-17 08:11:50,518 INFO L747 eck$LassoCheckResult]: Loop: 1077#L20-2 assume true; 1076#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1077#L20-2 [2024-11-17 08:11:50,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:50,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1187958389, now seen corresponding path program 2 times [2024-11-17 08:11:50,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:50,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925522862] [2024-11-17 08:11:50,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:50,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-17 08:11:50,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:50,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925522862] [2024-11-17 08:11:50,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925522862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:50,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354928521] [2024-11-17 08:11:50,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:11:50,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:50,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:50,618 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:50,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2024-11-17 08:11:50,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-17 08:11:50,717 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:11:50,717 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:11:50,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:11:50,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-17 08:11:50,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:11:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-17 08:11:50,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354928521] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:11:50,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:11:50,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-17 08:11:50,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914487636] [2024-11-17 08:11:50,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:11:50,793 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:11:50,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:50,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1984, now seen corresponding path program 3 times [2024-11-17 08:11:50,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:50,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127401043] [2024-11-17 08:11:50,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:50,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:50,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:50,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:50,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:50,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 08:11:50,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-17 08:11:50,828 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:11:50,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:50,889 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2024-11-17 08:11:50,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 109 transitions. [2024-11-17 08:11:50,890 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-17 08:11:50,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 99 states and 103 transitions. [2024-11-17 08:11:50,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2024-11-17 08:11:50,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2024-11-17 08:11:50,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 103 transitions. [2024-11-17 08:11:50,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:50,891 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 103 transitions. [2024-11-17 08:11:50,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 103 transitions. [2024-11-17 08:11:50,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 78. [2024-11-17 08:11:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:11:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-17 08:11:50,896 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-17 08:11:50,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 08:11:50,899 INFO L425 stractBuchiCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-17 08:11:50,899 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-17 08:11:50,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 82 transitions. [2024-11-17 08:11:50,900 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-17 08:11:50,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:50,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:50,901 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:50,901 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:50,901 INFO L745 eck$LassoCheckResult]: Stem: 1486#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1487#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~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; 1502#L34-1 assume true; 1504#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1505#L34-1 assume true; 1500#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1501#L34-1 assume true; 1542#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1540#L34-1 assume true; 1538#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1536#L34-1 assume true; 1534#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1532#L34-1 assume true; 1530#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1528#L34-1 assume true; 1526#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1524#L34-1 assume true; 1522#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1520#L34-1 assume true; 1518#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1516#L34-1 assume true; 1513#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1512#L34-1 assume true; 1498#L34-2 assume !(main_~i~1#1 < 10); 1499#L34 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; 1496#L20-4 assume true; 1491#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1492#L20-4 assume true; 1497#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1561#L20-4 assume true; 1560#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1559#L20-4 assume true; 1558#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1557#L20-4 assume true; 1556#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1555#L20-4 assume true; 1554#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1553#L20-4 assume true; 1552#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1551#L20-4 assume true; 1550#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1549#L20-4 assume true; 1548#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1547#L20-4 assume true; 1511#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1510#L20-4 assume true; 1490#L20-5 assume !(avg_~i~0#1 < 10); 1484#L23-5 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); 1485#L23-4 assume true;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; 1495#L20-2 assume true; 1506#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1507#L20-2 assume true; 1546#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1545#L20-2 assume true; 1544#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1543#L20-2 assume true; 1541#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1539#L20-2 assume true; 1537#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1535#L20-2 assume true; 1533#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1531#L20-2 assume true; 1529#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1527#L20-2 assume true; 1525#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1523#L20-2 assume true; 1521#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1519#L20-2 assume true; 1517#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1515#L20-2 [2024-11-17 08:11:50,903 INFO L747 eck$LassoCheckResult]: Loop: 1515#L20-2 assume true; 1514#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1515#L20-2 [2024-11-17 08:11:50,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:50,903 INFO L85 PathProgramCache]: Analyzing trace with hash 291572543, now seen corresponding path program 3 times [2024-11-17 08:11:50,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:50,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964458995] [2024-11-17 08:11:50,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:50,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:51,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:51,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:51,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:51,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1984, now seen corresponding path program 4 times [2024-11-17 08:11:51,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:51,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683823314] [2024-11-17 08:11:51,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:51,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:51,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:51,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:51,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:51,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1028340606, now seen corresponding path program 4 times [2024-11-17 08:11:51,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:51,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797778570] [2024-11-17 08:11:51,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:51,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:11:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 90 proven. 20 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-17 08:11:51,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:11:51,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797778570] [2024-11-17 08:11:51,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797778570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:11:51,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449807354] [2024-11-17 08:11:51,339 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 08:11:51,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:11:51,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:11:51,340 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:11:51,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2024-11-17 08:11:51,431 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 08:11:51,431 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:11:51,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 08:11:51,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:11:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-17 08:11:51,465 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 08:11:51,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449807354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:11:51,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 08:11:51,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2024-11-17 08:11:51,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412621717] [2024-11-17 08:11:51,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:11:51,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:11:51,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 08:11:51,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2024-11-17 08:11:51,495 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. cyclomatic complexity: 9 Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:11:51,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:11:51,560 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2024-11-17 08:11:51,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 100 transitions. [2024-11-17 08:11:51,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:11:51,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 75 states and 76 transitions. [2024-11-17 08:11:51,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2024-11-17 08:11:51,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2024-11-17 08:11:51,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 76 transitions. [2024-11-17 08:11:51,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:11:51,561 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 76 transitions. [2024-11-17 08:11:51,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 76 transitions. [2024-11-17 08:11:51,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-17 08:11:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 74 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:11:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2024-11-17 08:11:51,564 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 76 transitions. [2024-11-17 08:11:51,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 08:11:51,565 INFO L425 stractBuchiCegarLoop]: Abstraction has 75 states and 76 transitions. [2024-11-17 08:11:51,565 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-17 08:11:51,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 76 transitions. [2024-11-17 08:11:51,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-17 08:11:51,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:11:51,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:11:51,568 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:11:51,568 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:11:51,568 INFO L745 eck$LassoCheckResult]: Stem: 1892#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1893#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~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; 1904#L34-1 assume true; 1902#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1903#L34-1 assume true; 1906#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1959#L34-1 assume true; 1956#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1953#L34-1 assume true; 1950#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1947#L34-1 assume true; 1944#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1941#L34-1 assume true; 1938#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1935#L34-1 assume true; 1932#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1929#L34-1 assume true; 1926#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1923#L34-1 assume true; 1920#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1917#L34-1 assume true; 1912#L34-2 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;main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1911#L34-1 assume true; 1900#L34-2 assume !(main_~i~1#1 < 10); 1901#L34 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; 1899#L20-4 assume true; 1896#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1897#L20-4 assume true; 1963#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1961#L20-4 assume true; 1958#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1955#L20-4 assume true; 1952#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1949#L20-4 assume true; 1946#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1943#L20-4 assume true; 1940#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1937#L20-4 assume true; 1934#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1931#L20-4 assume true; 1928#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1925#L20-4 assume true; 1922#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1919#L20-4 assume true; 1916#L20-5 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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1914#L20-4 assume true; 1910#L20-5 assume !(avg_~i~0#1 < 10); 1890#L23-5 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); 1891#L23-4 assume true;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; 1898#L20-2 assume true; 1907#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1908#L20-2 assume true; 1964#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1962#L20-2 assume true; 1960#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1957#L20-2 assume true; 1954#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1951#L20-2 assume true; 1948#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1945#L20-2 assume true; 1942#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1939#L20-2 assume true; 1936#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1933#L20-2 assume true; 1930#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1927#L20-2 assume true; 1924#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1921#L20-2 assume true; 1918#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;avg_#t~post2#1 := avg_~i~0#1;avg_~i~0#1 := 1 + avg_#t~post2#1;havoc avg_#t~post2#1; 1915#L20-2 assume true; 1913#L20-3 assume !(avg_~i~0#1 < 10); 1909#L23-3 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); 1905#L23-2 assume true;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; 1894#L43-1 [2024-11-17 08:11:51,570 INFO L747 eck$LassoCheckResult]: Loop: 1894#L43-1 assume true; 1895#L43-2 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;main_#t~post11#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1894#L43-1 [2024-11-17 08:11:51,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash 392843226, now seen corresponding path program 1 times [2024-11-17 08:11:51,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:51,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82831615] [2024-11-17 08:11:51,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:51,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:51,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:51,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:51,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:51,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1696, now seen corresponding path program 1 times [2024-11-17 08:11:51,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:51,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388820171] [2024-11-17 08:11:51,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:51,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:51,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:51,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:11:51,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:11:51,770 INFO L85 PathProgramCache]: Analyzing trace with hash -434781127, now seen corresponding path program 1 times [2024-11-17 08:11:51,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:11:51,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152252275] [2024-11-17 08:11:51,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:11:51,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:11:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:51,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:11:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:11:51,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:11,800 WARN L286 SmtUtils]: Spent 19.86s on a formula simplification. DAG size of input: 551 DAG size of output: 415 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-17 08:12:38,205 WARN L286 SmtUtils]: Spent 23.67s on a formula simplification that was a NOOP. DAG size: 624 (called from [L 299] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-17 08:12:38,216 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:12:38,216 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:12:38,216 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:12:38,216 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:12:38,216 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:12:38,216 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:38,216 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:12:38,216 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:12:38,216 INFO L132 ssoRankerPreferences]: Filename of dumped script: avg10-2.i_Iteration10_Lasso [2024-11-17 08:12:38,217 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:12:38,217 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:12:38,222 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2024-11-17 08:12:38,414 WARN L176 XnfTransformerHelper]: Simplifying conjunction of 63504 disjunctions. This might take some time...