./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sum10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/sum10-1.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 f341d659968a9193c951bd8eec2bcf2a384f8494a1f57cb579da98ce5ebdb030 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:30:10,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:30:10,843 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 15:30:10,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:30:10,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:30:10,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:30:10,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:30:10,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:30:10,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:30:10,876 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:30:10,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:30:10,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:30:10,878 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:30:10,878 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:30:10,880 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:30:10,881 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:30:10,881 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:30:10,881 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:30:10,881 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:30:10,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:30:10,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:30:10,883 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 15:30:10,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:30:10,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 15:30:10,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:30:10,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:30:10,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:30:10,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:30:10,885 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:30:10,885 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:30:10,885 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 15:30:10,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:30:10,886 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:30:10,886 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:30:10,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:30:10,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:30:10,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:30:10,887 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:30:10,887 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:30:10,888 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 -> f341d659968a9193c951bd8eec2bcf2a384f8494a1f57cb579da98ce5ebdb030 [2024-11-09 15:30:11,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:30:11,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:30:11,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:30:11,110 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:30:11,110 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:30:11,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sum10-1.i [2024-11-09 15:30:12,369 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:30:12,537 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:30:12,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum10-1.i [2024-11-09 15:30:12,543 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c179373d0/7074e0746ac1459892278b1c45faf264/FLAGdc627b4a2 [2024-11-09 15:30:12,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c179373d0/7074e0746ac1459892278b1c45faf264 [2024-11-09 15:30:12,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:30:12,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:30:12,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:30:12,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:30:12,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:30:12,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:30:12" (1/1) ... [2024-11-09 15:30:12,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d506e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:12, skipping insertion in model container [2024-11-09 15:30:12,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:30:12" (1/1) ... [2024-11-09 15:30:12,968 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:30:13,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:30:13,138 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:30:13,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:30:13,180 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:30:13,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:13 WrapperNode [2024-11-09 15:30:13,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:30:13,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:30:13,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:30:13,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:30:13,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:13" (1/1) ... [2024-11-09 15:30:13,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:13" (1/1) ... [2024-11-09 15:30:13,218 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 118 [2024-11-09 15:30:13,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:30:13,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:30:13,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:30:13,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:30:13,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:13" (1/1) ... [2024-11-09 15:30:13,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:13" (1/1) ... [2024-11-09 15:30:13,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:13" (1/1) ... [2024-11-09 15:30:13,253 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-09 15:30:13,254 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:13" (1/1) ... [2024-11-09 15:30:13,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:13" (1/1) ... [2024-11-09 15:30:13,258 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:13" (1/1) ... [2024-11-09 15:30:13,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:13" (1/1) ... [2024-11-09 15:30:13,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:13" (1/1) ... [2024-11-09 15:30:13,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:13" (1/1) ... [2024-11-09 15:30:13,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:30:13,266 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:30:13,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:30:13,266 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:30:13,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:13" (1/1) ... [2024-11-09 15:30:13,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:13,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:13,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:13,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:30:13,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 15:30:13,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 15:30:13,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 15:30:13,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 15:30:13,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:30:13,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 15:30:13,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:30:13,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:30:13,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:30:13,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 15:30:13,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:30:13,445 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:30:13,448 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:30:13,638 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-09 15:30:13,638 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:30:13,654 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:30:13,654 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-09 15:30:13,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:30:13 BoogieIcfgContainer [2024-11-09 15:30:13,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:30:13,655 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:30:13,655 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:30:13,658 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:30:13,659 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:30:13,659 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:30:12" (1/3) ... [2024-11-09 15:30:13,660 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61c46600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:30:13, skipping insertion in model container [2024-11-09 15:30:13,660 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:30:13,660 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:30:13" (2/3) ... [2024-11-09 15:30:13,660 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61c46600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:30:13, skipping insertion in model container [2024-11-09 15:30:13,661 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:30:13,661 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:30:13" (3/3) ... [2024-11-09 15:30:13,662 INFO L332 chiAutomizerObserver]: Analyzing ICFG sum10-1.i [2024-11-09 15:30:13,701 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:30:13,702 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:30:13,702 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:30:13,702 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:30:13,702 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:30:13,702 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:30:13,702 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:30:13,702 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:30:13,706 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-09 15:30:13,718 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2024-11-09 15:30:13,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:13,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:13,723 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:30:13,723 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:13,723 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:30:13,724 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-09 15:30:13,725 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2024-11-09 15:30:13,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:13,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:13,726 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:30:13,726 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:13,731 INFO L745 eck$LassoCheckResult]: Stem: 25#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 17#L34-3true [2024-11-09 15:30:13,732 INFO L747 eck$LassoCheckResult]: Loop: 17#L34-3true assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 13#L34-2true main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 17#L34-3true [2024-11-09 15:30:13,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:13,736 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:30:13,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:13,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278088573] [2024-11-09 15:30:13,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:13,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:13,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:13,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:13,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:13,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2024-11-09 15:30:13,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:13,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395378177] [2024-11-09 15:30:13,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:13,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:13,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:13,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:13,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:13,854 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-11-09 15:30:13,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:13,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779165222] [2024-11-09 15:30:13,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:13,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:13,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:13,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:14,141 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:30:14,142 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:30:14,143 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:30:14,143 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:30:14,143 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:30:14,143 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:14,143 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:30:14,144 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:30:14,144 INFO L132 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration1_Lasso [2024-11-09 15:30:14,144 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:30:14,144 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:30:14,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:14,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:14,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:14,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:14,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:14,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:14,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:14,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:14,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:14,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:14,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:14,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:14,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:14,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:14,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:14,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:14,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:14,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:14,498 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:30:14,505 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:30:14,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:14,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:14,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:14,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-09 15:30:14,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:14,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:14,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:14,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:14,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:14,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:14,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:14,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:14,532 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:14,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-09 15:30:14,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:14,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:14,550 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:14,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-09 15:30:14,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:14,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:14,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:14,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:14,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:14,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:14,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:14,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:14,566 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:14,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:14,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:14,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:14,580 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:14,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-09 15:30:14,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:14,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:14,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:14,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:14,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:14,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:14,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:14,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:14,594 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:14,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-09 15:30:14,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:14,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:14,606 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:14,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-09 15:30:14,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:14,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:14,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:14,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:14,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:14,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:14,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:14,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:14,638 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-09 15:30:14,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:14,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:14,640 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:14,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-09 15:30:14,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-09 15:30:14,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:14,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:14,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:14,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:14,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:14,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:14,657 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:14,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-09 15:30:14,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:14,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:14,675 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:14,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:14,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-09 15:30:14,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:14,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:14,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:14,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:14,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:14,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:14,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:14,692 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:14,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:14,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:14,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:14,706 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:14,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-09 15:30:14,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:14,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:14,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:14,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:14,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:14,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:14,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:14,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:14,723 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:14,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:14,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:14,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:14,737 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:14,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-09 15:30:14,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:14,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:14,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:14,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:14,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:14,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:14,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:14,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:14,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:14,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:14,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:14,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:14,768 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:14,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-09 15:30:14,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:14,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:14,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:14,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:14,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:14,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:14,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:14,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:14,784 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:14,797 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-09 15:30:14,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:14,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:14,799 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:14,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-09 15:30:14,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-09 15:30:14,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:14,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:14,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:14,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:14,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:14,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:14,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:14,813 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:14,824 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-09 15:30:14,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:14,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:14,827 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:14,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-09 15:30:14,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:14,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:14,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:14,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:14,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:14,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:14,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:14,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:14,843 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:14,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-09 15:30:14,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:14,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:14,856 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:14,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-09 15:30:14,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:14,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:14,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:14,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:14,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:14,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:14,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:14,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:14,873 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:14,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:14,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:14,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:14,894 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:14,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-09 15:30:14,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:14,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:14,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:14,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:14,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:14,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:14,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:14,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:14,911 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:14,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:14,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:14,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:14,923 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:14,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-09 15:30:14,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:14,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:14,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:14,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:14,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:14,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:14,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:14,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:14,944 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:14,955 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-09 15:30:14,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:14,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:14,956 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:14,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-09 15:30:14,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:14,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:14,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:14,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:14,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:14,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:14,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:14,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:14,970 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:14,980 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-09 15:30:14,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:14,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:14,986 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:14,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:14,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-09 15:30:15,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:15,005 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:15,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:15,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:15,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:15,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:15,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:15,007 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:15,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:15,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:15,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:15,023 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:15,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-09 15:30:15,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:15,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:15,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:15,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:15,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:15,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:15,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:15,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:15,037 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:15,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:15,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:15,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:15,049 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:15,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-09 15:30:15,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:15,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:15,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:15,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:15,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:15,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:15,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:15,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:15,064 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:15,097 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-09 15:30:15,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:15,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:15,101 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:15,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-09 15:30:15,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:15,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:15,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:15,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:15,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:15,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:15,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:15,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:15,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:15,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:15,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:15,162 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:15,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-09 15:30:15,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:15,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:15,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:15,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:15,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:15,175 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:15,175 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:15,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:15,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:15,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:15,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:15,193 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-09 15:30:15,193 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-09 15:30:15,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:15,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:15,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:15,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:15,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:15,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:15,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:15,211 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:15,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-09 15:30:15,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:15,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:15,227 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-09 15:30:15,229 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-09 15:30:15,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:15,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:15,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:15,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:15,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:15,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:15,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:15,251 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:30:15,282 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-09 15:30:15,282 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-11-09 15:30:15,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:15,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:15,309 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-09 15:30:15,310 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-09 15:30:15,310 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:30:15,322 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:30:15,322 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:30:15,323 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-09 15:30:15,334 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-09 15:30:15,364 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-09 15:30:15,376 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-09 15:30:15,377 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-09 15:30:15,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:15,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:30:15,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:15,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:30:15,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:15,485 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:30:15,486 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-09 15:30:15,534 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 27 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 52 states and 75 transitions. Complement of second has 6 states. [2024-11-09 15:30:15,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:30:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2024-11-09 15:30:15,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-09 15:30:15,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:15,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-09 15:30:15,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:15,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-09 15:30:15,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:15,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 75 transitions. [2024-11-09 15:30:15,548 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-09 15:30:15,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 19 states and 27 transitions. [2024-11-09 15:30:15,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-09 15:30:15,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-09 15:30:15,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2024-11-09 15:30:15,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:30:15,553 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 27 transitions. [2024-11-09 15:30:15,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2024-11-09 15:30:15,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-09 15:30:15,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2024-11-09 15:30:15,571 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 27 transitions. [2024-11-09 15:30:15,571 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2024-11-09 15:30:15,571 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:30:15,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2024-11-09 15:30:15,571 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-09 15:30:15,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:15,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:15,572 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-09 15:30:15,572 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:15,572 INFO L745 eck$LassoCheckResult]: Stem: 149#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 141#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 142#L34-3 assume !(main_~i~1#1 < 10); 134#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 135#L20-3 [2024-11-09 15:30:15,572 INFO L747 eck$LassoCheckResult]: Loop: 135#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 148#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 135#L20-3 [2024-11-09 15:30:15,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:15,573 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2024-11-09 15:30:15,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:15,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066407131] [2024-11-09 15:30:15,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:15,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:15,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:30:15,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066407131] [2024-11-09 15:30:15,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066407131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:30:15,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:30:15,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:30:15,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108997061] [2024-11-09 15:30:15,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:30:15,626 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:30:15,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:15,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2024-11-09 15:30:15,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:15,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966785293] [2024-11-09 15:30:15,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:15,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:15,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:15,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:15,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:30:15,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:30:15,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:30:15,668 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:30:15,678 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-11-09 15:30:15,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2024-11-09 15:30:15,679 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-09 15:30:15,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2024-11-09 15:30:15,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-09 15:30:15,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-09 15:30:15,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2024-11-09 15:30:15,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:30:15,679 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-09 15:30:15,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2024-11-09 15:30:15,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2024-11-09 15:30:15,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:15,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-11-09 15:30:15,681 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-09 15:30:15,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:30:15,682 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-09 15:30:15,682 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:30:15,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2024-11-09 15:30:15,683 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-09 15:30:15,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:15,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:15,683 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-09 15:30:15,683 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:15,683 INFO L745 eck$LassoCheckResult]: Stem: 194#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 186#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 187#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 190#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 191#L34-3 assume !(main_~i~1#1 < 10); 179#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 180#L20-3 [2024-11-09 15:30:15,683 INFO L747 eck$LassoCheckResult]: Loop: 180#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 193#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 180#L20-3 [2024-11-09 15:30:15,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:15,684 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2024-11-09 15:30:15,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:15,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604899600] [2024-11-09 15:30:15,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:15,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:15,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:15,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:30:15,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604899600] [2024-11-09 15:30:15,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604899600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:30:15,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147597956] [2024-11-09 15:30:15,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:15,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:30:15,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:15,726 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:30:15,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-09 15:30:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:15,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 15:30:15,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:15,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:30:15,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:15,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147597956] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:30:15,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:30:15,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-09 15:30:15,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114922472] [2024-11-09 15:30:15,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:30:15,794 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:30:15,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:15,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2024-11-09 15:30:15,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:15,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969142831] [2024-11-09 15:30:15,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:15,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:15,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:15,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:15,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:30:15,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 15:30:15,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 15:30:15,832 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:15,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:30:15,852 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-11-09 15:30:15,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2024-11-09 15:30:15,853 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-09 15:30:15,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 29 transitions. [2024-11-09 15:30:15,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-09 15:30:15,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-09 15:30:15,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2024-11-09 15:30:15,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:30:15,853 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-09 15:30:15,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2024-11-09 15:30:15,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-09 15:30:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:15,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-09 15:30:15,856 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-09 15:30:15,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:30:15,856 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-09 15:30:15,856 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:30:15,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2024-11-09 15:30:15,857 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-09 15:30:15,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:15,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:15,857 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2024-11-09 15:30:15,858 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:15,858 INFO L745 eck$LassoCheckResult]: Stem: 278#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 271#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 279#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 280#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 274#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 275#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 284#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 283#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 282#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 281#L34-3 assume !(main_~i~1#1 < 10); 263#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 264#L20-3 [2024-11-09 15:30:15,858 INFO L747 eck$LassoCheckResult]: Loop: 264#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 277#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 264#L20-3 [2024-11-09 15:30:15,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:15,858 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2024-11-09 15:30:15,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:15,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430320108] [2024-11-09 15:30:15,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:15,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:15,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:30:15,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430320108] [2024-11-09 15:30:15,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430320108] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:30:15,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242371316] [2024-11-09 15:30:15,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:30:15,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:30:15,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:15,961 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:30:15,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-09 15:30:16,009 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:30:16,009 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:30:16,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:30:16,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:16,027 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:16,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:30:16,075 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:16,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242371316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:30:16,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:30:16,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-09 15:30:16,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878570213] [2024-11-09 15:30:16,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:30:16,077 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:30:16,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:16,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2024-11-09 15:30:16,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:16,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123307196] [2024-11-09 15:30:16,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:16,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:16,081 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:16,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:16,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:30:16,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 15:30:16,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 15:30:16,113 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:16,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:30:16,143 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-11-09 15:30:16,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2024-11-09 15:30:16,144 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-09 15:30:16,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2024-11-09 15:30:16,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-09 15:30:16,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-09 15:30:16,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2024-11-09 15:30:16,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:30:16,144 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-09 15:30:16,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2024-11-09 15:30:16,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-09 15:30:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:16,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-11-09 15:30:16,146 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-09 15:30:16,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 15:30:16,147 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-09 15:30:16,147 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:30:16,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2024-11-09 15:30:16,148 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2024-11-09 15:30:16,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:16,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:16,148 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2024-11-09 15:30:16,148 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:16,148 INFO L745 eck$LassoCheckResult]: Stem: 422#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 414#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 415#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 423#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 424#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 418#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 419#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 440#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 439#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 438#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 437#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 436#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 435#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 434#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 433#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 432#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 431#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 430#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 429#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 428#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 427#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 426#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 425#L34-3 assume !(main_~i~1#1 < 10); 407#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 408#L20-3 [2024-11-09 15:30:16,148 INFO L747 eck$LassoCheckResult]: Loop: 408#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 421#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 408#L20-3 [2024-11-09 15:30:16,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:16,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2024-11-09 15:30:16,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:16,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976516290] [2024-11-09 15:30:16,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:16,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:16,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:16,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:16,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:16,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2024-11-09 15:30:16,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:16,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310157784] [2024-11-09 15:30:16,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:16,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:16,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:16,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:16,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:16,201 INFO L85 PathProgramCache]: Analyzing trace with hash -95702815, now seen corresponding path program 1 times [2024-11-09 15:30:16,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:16,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408795738] [2024-11-09 15:30:16,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:16,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:16,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:16,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:16,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:19,855 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:30:19,855 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:30:19,855 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:30:19,855 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:30:19,855 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:30:19,855 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:19,855 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:30:19,855 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:30:19,855 INFO L132 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration5_Lasso [2024-11-09 15:30:19,855 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:30:19,855 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:30:19,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:19,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:19,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:19,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:19,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:19,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:19,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:19,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:19,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:19,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:19,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:19,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:19,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:19,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:19,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:19,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:19,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:19,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:19,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:19,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:20,355 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:30:20,355 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:30:20,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,357 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-09 15:30:20,358 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-09 15:30:20,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,381 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-09 15:30:20,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,383 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-09 15:30:20,384 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-09 15:30:20,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,397 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,407 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-09 15:30:20,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,409 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-09 15:30:20,410 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-09 15:30:20,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,422 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,432 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-09 15:30:20,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,434 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-09 15:30:20,435 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-09 15:30:20,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,457 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-09 15:30:20,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,459 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-09 15:30:20,460 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-09 15:30:20,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,472 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,483 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-09 15:30:20,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,484 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-09 15:30:20,485 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-09 15:30:20,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,497 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:20,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,515 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-09 15:30:20,516 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-09 15:30:20,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,528 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,539 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-09 15:30:20,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,540 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-09 15:30:20,541 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-09 15:30:20,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:20,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,575 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-09 15:30:20,576 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-09 15:30:20,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,604 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-09 15:30:20,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,606 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-09 15:30:20,608 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-09 15:30:20,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,621 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,631 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-09 15:30:20,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,633 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-09 15:30:20,634 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-09 15:30:20,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,646 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-09 15:30:20,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,658 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-09 15:30:20,659 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-09 15:30:20,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,671 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,682 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-09 15:30:20,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,684 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-09 15:30:20,685 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-09 15:30:20,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,697 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-09 15:30:20,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,710 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-09 15:30:20,711 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-09 15:30:20,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,729 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:20,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,742 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-09 15:30:20,743 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-09 15:30:20,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:20,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:20,757 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-11-09 15:30:20,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,769 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-09 15:30:20,770 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-09 15:30:20,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:20,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:20,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-11-09 15:30:20,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,801 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-09 15:30:20,805 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-09 15:30:20,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,818 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,829 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-09 15:30:20,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,830 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-09 15:30:20,831 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-09 15:30:20,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,849 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,869 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-09 15:30:20,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,870 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-09 15:30:20,871 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-09 15:30:20,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,885 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-09 15:30:20,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,899 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-09 15:30:20,900 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-09 15:30:20,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,923 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-09 15:30:20,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,925 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:20,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-09 15:30:20,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:20,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:20,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:20,942 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-11-09 15:30:20,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,955 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:20,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-09 15:30:20,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-09 15:30:20,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,969 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:20,969 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:20,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:20,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:20,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:20,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:20,983 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:20,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-09 15:30:20,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-09 15:30:20,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:20,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:20,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:20,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:20,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:20,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:20,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:20,996 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:21,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-09 15:30:21,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,008 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:21,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-09 15:30:21,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:21,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:21,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:21,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:21,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:21,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:21,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:21,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:21,023 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:21,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:21,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,037 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:21,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-09 15:30:21,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:21,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:21,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:21,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:21,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:21,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:21,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:21,054 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:21,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:21,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,080 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:21,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-09 15:30:21,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:21,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:21,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:21,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:21,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:21,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:21,094 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:21,097 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:21,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:21,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,109 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:21,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-09 15:30:21,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:21,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:21,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:21,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:21,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:21,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:21,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:21,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:21,130 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:21,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:21,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,144 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:21,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-09 15:30:21,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:21,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:21,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:21,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:21,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:21,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:21,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:21,159 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:21,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:21,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,171 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:21,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-09 15:30:21,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:21,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:21,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:21,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:21,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:21,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:21,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:21,190 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:21,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-11-09 15:30:21,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,204 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:21,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-09 15:30:21,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:21,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:21,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:21,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:21,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:21,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:21,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:21,220 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:21,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:21,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,233 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:21,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-09 15:30:21,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:21,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:21,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:21,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:21,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:21,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:21,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:21,252 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:21,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:21,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,265 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:21,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-11-09 15:30:21,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:21,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:21,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:30:21,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:21,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:21,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:21,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:30:21,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:30:21,279 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:30:21,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:21,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,291 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:21,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2024-11-09 15:30:21,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:30:21,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:30:21,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:30:21,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:30:21,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:30:21,308 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:30:21,308 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:30:21,315 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:30:21,326 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-09 15:30:21,326 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-11-09 15:30:21,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:21,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,327 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:30:21,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2024-11-09 15:30:21,329 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:30:21,340 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:30:21,340 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:30:21,340 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0#1) = -2*ULTIMATE.start_sum_~i~0#1 + 19 Supporting invariants [] [2024-11-09 15:30:21,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-11-09 15:30:21,363 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2024-11-09 15:30:21,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:21,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-11-09 15:30:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:21,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:30:21,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:21,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:30:21,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:21,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:30:21,470 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:30:21,470 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:21,483 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 39 states and 45 transitions. Complement of second has 5 states. [2024-11-09 15:30:21,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:30:21,483 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-09 15:30:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2024-11-09 15:30:21,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 24 letters. Loop has 2 letters. [2024-11-09 15:30:21,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:21,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 26 letters. Loop has 2 letters. [2024-11-09 15:30:21,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:21,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 24 letters. Loop has 4 letters. [2024-11-09 15:30:21,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:30:21,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 45 transitions. [2024-11-09 15:30:21,486 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-09 15:30:21,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 38 states and 43 transitions. [2024-11-09 15:30:21,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-09 15:30:21,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-09 15:30:21,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2024-11-09 15:30:21,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:30:21,486 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-09 15:30:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2024-11-09 15:30:21,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-09 15:30:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.131578947368421) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-09 15:30:21,488 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-09 15:30:21,488 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-09 15:30:21,488 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:30:21,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2024-11-09 15:30:21,489 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-09 15:30:21,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:21,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:21,489 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:21,489 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:21,490 INFO L745 eck$LassoCheckResult]: Stem: 629#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 620#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 621#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 630#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 631#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 624#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 625#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 647#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 646#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 645#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 644#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 643#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 642#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 641#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 640#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 639#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 638#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 637#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 636#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 635#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 634#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 633#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 632#L34-3 assume !(main_~i~1#1 < 10); 613#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 614#L20-3 assume !(sum_~i~0#1 < 10); 622#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 623#sum_returnLabel#1 main_#t~ret5#1 := sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } 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_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 618#L20-8 [2024-11-09 15:30:21,490 INFO L747 eck$LassoCheckResult]: Loop: 618#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 619#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 618#L20-8 [2024-11-09 15:30:21,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:21,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1328178265, now seen corresponding path program 1 times [2024-11-09 15:30:21,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:21,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103488101] [2024-11-09 15:30:21,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:21,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:21,549 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 15:30:21,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:30:21,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103488101] [2024-11-09 15:30:21,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103488101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:30:21,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:30:21,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:30:21,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15536467] [2024-11-09 15:30:21,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:30:21,550 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:30:21,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:21,550 INFO L85 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2024-11-09 15:30:21,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:21,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658208487] [2024-11-09 15:30:21,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:21,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:21,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:21,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:21,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:30:21,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:30:21,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:30:21,589 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:21,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:30:21,605 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2024-11-09 15:30:21,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 47 transitions. [2024-11-09 15:30:21,606 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-09 15:30:21,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 47 transitions. [2024-11-09 15:30:21,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-09 15:30:21,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-09 15:30:21,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 47 transitions. [2024-11-09 15:30:21,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:30:21,607 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-11-09 15:30:21,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 47 transitions. [2024-11-09 15:30:21,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2024-11-09 15:30:21,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:21,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-11-09 15:30:21,609 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-11-09 15:30:21,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:30:21,610 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-11-09 15:30:21,610 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:30:21,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2024-11-09 15:30:21,610 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-09 15:30:21,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:21,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:21,611 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:21,611 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:21,611 INFO L745 eck$LassoCheckResult]: Stem: 716#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 707#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 708#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 711#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 712#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 718#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 735#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 734#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 733#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 732#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 731#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 730#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 729#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 728#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 727#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 726#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 725#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 724#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 723#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 722#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 721#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 720#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 719#L34-3 assume !(main_~i~1#1 < 10); 700#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 701#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 714#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 715#L20-3 assume !(sum_~i~0#1 < 10); 709#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 710#sum_returnLabel#1 main_#t~ret5#1 := sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } 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_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 705#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 706#L20-7 [2024-11-09 15:30:21,611 INFO L747 eck$LassoCheckResult]: Loop: 706#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 717#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 706#L20-7 [2024-11-09 15:30:21,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:21,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1721709263, now seen corresponding path program 1 times [2024-11-09 15:30:21,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:21,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387781747] [2024-11-09 15:30:21,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:21,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 15:30:21,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:30:21,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387781747] [2024-11-09 15:30:21,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387781747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:30:21,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616211967] [2024-11-09 15:30:21,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:21,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:30:21,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,667 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:30:21,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2024-11-09 15:30:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:21,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 15:30:21,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:21,741 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 15:30:21,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:30:21,752 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 15:30:21,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616211967] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:30:21,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:30:21,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-09 15:30:21,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933700960] [2024-11-09 15:30:21,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:30:21,753 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:30:21,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:21,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2024-11-09 15:30:21,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:21,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816429298] [2024-11-09 15:30:21,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:21,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:21,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:21,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:21,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:30:21,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 15:30:21,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 15:30:21,786 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:21,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:30:21,831 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2024-11-09 15:30:21,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 62 transitions. [2024-11-09 15:30:21,831 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-09 15:30:21,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 62 transitions. [2024-11-09 15:30:21,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-11-09 15:30:21,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-11-09 15:30:21,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 62 transitions. [2024-11-09 15:30:21,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:30:21,832 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-11-09 15:30:21,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 62 transitions. [2024-11-09 15:30:21,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2024-11-09 15:30:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2024-11-09 15:30:21,834 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 55 transitions. [2024-11-09 15:30:21,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:30:21,835 INFO L425 stractBuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2024-11-09 15:30:21,835 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:30:21,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 55 transitions. [2024-11-09 15:30:21,835 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-09 15:30:21,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:21,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:21,836 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:21,836 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:21,836 INFO L745 eck$LassoCheckResult]: Stem: 998#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 988#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 989#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1000#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1001#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 992#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 993#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1028#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1027#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1026#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1025#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1024#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1023#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1022#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1021#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1020#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1019#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1018#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1017#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1016#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1015#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1014#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1013#L34-3 assume !(main_~i~1#1 < 10); 981#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 982#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 995#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 996#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 997#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1012#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1011#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1009#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1006#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1005#L20-3 assume !(sum_~i~0#1 < 10); 990#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 991#sum_returnLabel#1 main_#t~ret5#1 := sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } 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_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 986#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 987#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 999#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1010#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1008#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1007#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1004#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1003#L20-7 [2024-11-09 15:30:21,836 INFO L747 eck$LassoCheckResult]: Loop: 1003#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1002#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1003#L20-7 [2024-11-09 15:30:21,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:21,840 INFO L85 PathProgramCache]: Analyzing trace with hash 512696561, now seen corresponding path program 1 times [2024-11-09 15:30:21,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:21,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981536998] [2024-11-09 15:30:21,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:21,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:21,932 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-11-09 15:30:21,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:30:21,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981536998] [2024-11-09 15:30:21,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981536998] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:30:21,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216401629] [2024-11-09 15:30:21,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:21,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:30:21,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:21,934 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:30:21,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2024-11-09 15:30:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:22,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:30:22,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:22,021 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-11-09 15:30:22,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:30:22,065 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-11-09 15:30:22,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216401629] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:30:22,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:30:22,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-09 15:30:22,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013717295] [2024-11-09 15:30:22,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:30:22,066 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:30:22,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:22,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2024-11-09 15:30:22,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:22,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183156500] [2024-11-09 15:30:22,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:22,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:22,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:22,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:22,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:30:22,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 15:30:22,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 15:30:22,098 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:22,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:30:22,193 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2024-11-09 15:30:22,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 98 transitions. [2024-11-09 15:30:22,194 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-09 15:30:22,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 98 transitions. [2024-11-09 15:30:22,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2024-11-09 15:30:22,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2024-11-09 15:30:22,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 98 transitions. [2024-11-09 15:30:22,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:30:22,195 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94 states and 98 transitions. [2024-11-09 15:30:22,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 98 transitions. [2024-11-09 15:30:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2024-11-09 15:30:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 74 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2024-11-09 15:30:22,198 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 79 transitions. [2024-11-09 15:30:22,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 15:30:22,198 INFO L425 stractBuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2024-11-09 15:30:22,198 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 15:30:22,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 79 transitions. [2024-11-09 15:30:22,199 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2024-11-09 15:30:22,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:22,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:22,200 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:22,200 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:22,224 INFO L745 eck$LassoCheckResult]: Stem: 1405#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1395#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1396#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1399#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1400#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1407#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1459#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1458#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1457#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1456#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1455#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1454#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1453#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1452#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1451#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1450#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1449#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1448#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1447#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1446#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1445#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1444#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1443#L34-3 assume !(main_~i~1#1 < 10); 1388#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 1389#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1402#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1403#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1404#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1442#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1441#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1439#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1437#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1435#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1433#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1431#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1429#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1427#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1425#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1423#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1421#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1419#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1417#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1415#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1412#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1411#L20-3 assume !(sum_~i~0#1 < 10); 1397#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 1398#sum_returnLabel#1 main_#t~ret5#1 := sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } 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_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 1393#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1394#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1406#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1440#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1438#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1436#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1434#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1432#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1430#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1428#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1426#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1424#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1422#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1420#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1418#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1416#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1414#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1413#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1410#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1409#L20-7 [2024-11-09 15:30:22,225 INFO L747 eck$LassoCheckResult]: Loop: 1409#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1408#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1409#L20-7 [2024-11-09 15:30:22,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:22,225 INFO L85 PathProgramCache]: Analyzing trace with hash -549950095, now seen corresponding path program 2 times [2024-11-09 15:30:22,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:22,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063281783] [2024-11-09 15:30:22,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:22,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:22,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:22,478 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:22,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:22,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2024-11-09 15:30:22,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:22,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192736144] [2024-11-09 15:30:22,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:22,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:22,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:22,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:22,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:22,485 INFO L85 PathProgramCache]: Analyzing trace with hash -221062545, now seen corresponding path program 3 times [2024-11-09 15:30:22,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:22,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325861915] [2024-11-09 15:30:22,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:22,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:30:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 81 proven. 19 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-09 15:30:22,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:30:22,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325861915] [2024-11-09 15:30:22,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325861915] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:30:22,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940205208] [2024-11-09 15:30:22,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 15:30:22,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:30:22,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:30:22,823 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:30:22,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2024-11-09 15:30:22,998 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-09 15:30:22,998 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:30:23,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 15:30:23,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:30:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-09 15:30:23,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 15:30:23,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940205208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:30:23,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 15:30:23,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2024-11-09 15:30:23,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091187081] [2024-11-09 15:30:23,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:30:23,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:30:23,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 15:30:23,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2024-11-09 15:30:23,067 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. cyclomatic complexity: 9 Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:30:23,201 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2024-11-09 15:30:23,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 95 transitions. [2024-11-09 15:30:23,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:23,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 72 states and 73 transitions. [2024-11-09 15:30:23,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-11-09 15:30:23,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2024-11-09 15:30:23,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 73 transitions. [2024-11-09 15:30:23,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:30:23,202 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 73 transitions. [2024-11-09 15:30:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 73 transitions. [2024-11-09 15:30:23,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-09 15:30:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 15:30:23,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2024-11-09 15:30:23,205 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 73 transitions. [2024-11-09 15:30:23,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 15:30:23,205 INFO L425 stractBuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2024-11-09 15:30:23,206 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 15:30:23,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 73 transitions. [2024-11-09 15:30:23,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-09 15:30:23,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:30:23,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:30:23,207 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:30:23,207 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-09 15:30:23,208 INFO L745 eck$LassoCheckResult]: Stem: 1792#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1782#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~post11#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1783#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1786#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1787#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1794#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1830#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1828#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1826#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1825#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1824#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1823#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1821#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1819#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1817#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1815#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1813#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1811#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1809#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1807#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1805#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet3#1; 1802#L34-2 main_#t~post4#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1801#L34-3 assume !(main_~i~1#1 < 10); 1777#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 1778#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1791#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1789#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1790#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1845#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1844#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1843#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1842#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1841#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1840#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1839#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1838#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1837#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1836#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1835#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1834#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1833#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1832#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1831#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1829#L20-2 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1827#L20-3 assume !(sum_~i~0#1 < 10); 1784#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 1785#sum_returnLabel#1 main_#t~ret5#1 := sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } 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_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 1788#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1793#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1780#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1781#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1822#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1820#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1818#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1816#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1814#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1812#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1810#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1808#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1806#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1804#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1803#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1800#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1799#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1798#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1797#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem1#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem1#1;havoc sum_#t~mem1#1; 1796#L20-7 sum_#t~post2#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post2#1;havoc sum_#t~post2#1; 1795#L20-8 assume !(sum_~i~0#1 < 10); 1776#L20-9 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 1774#sum_returnLabel#2 main_#t~ret8#1 := sum_#res#1;havoc sum_#t~mem1#1, sum_#t~post2#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } 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; 1775#L43-3 [2024-11-09 15:30:23,208 INFO L747 eck$LassoCheckResult]: Loop: 1775#L43-3 assume !!(main_~i~2#1 < 9);call main_#t~mem10#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int#1(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem10#1; 1779#L43-2 main_#t~post11#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1775#L43-3 [2024-11-09 15:30:23,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:23,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1987708689, now seen corresponding path program 1 times [2024-11-09 15:30:23,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:23,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506137968] [2024-11-09 15:30:23,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:23,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:23,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:23,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:23,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:23,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2024-11-09 15:30:23,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:23,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927977293] [2024-11-09 15:30:23,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:23,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:23,416 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:23,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:23,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:30:23,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1072398385, now seen corresponding path program 1 times [2024-11-09 15:30:23,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:30:23,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572079787] [2024-11-09 15:30:23,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:30:23,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:30:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:23,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:30:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:30:23,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:30:33,870 WARN L286 SmtUtils]: Spent 10.25s on a formula simplification. DAG size of input: 535 DAG size of output: 399 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-09 15:30:39,745 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:30:39,746 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:30:39,746 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:30:39,746 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:30:39,746 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:30:39,746 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:30:39,746 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:30:39,746 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:30:39,746 INFO L132 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration10_Lasso [2024-11-09 15:30:39,746 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:30:39,746 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:30:39,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:30:39,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true