./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/rangesum10.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 43671c88cb28f81a53d6c7fbea907e55b0f99c68f8a522c4103c0a12ddf9f652 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:12:17,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:12:17,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:12:17,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:12:17,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:12:17,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:12:17,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:12:17,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:12:17,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:12:17,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:12:17,438 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:12:17,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:12:17,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:12:17,442 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:12:17,443 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:12:17,443 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:12:17,443 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:12:17,443 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:12:17,443 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:12:17,444 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:12:17,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:12:17,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:12:17,444 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:12:17,445 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:12:17,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:12:17,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:12:17,445 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:12:17,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:12:17,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:12:17,446 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:12:17,446 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:12:17,446 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:12:17,446 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:12:17,446 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:12:17,447 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:12:17,447 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:12:17,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:12:17,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:12:17,447 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:12:17,448 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:12:17,450 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 -> 43671c88cb28f81a53d6c7fbea907e55b0f99c68f8a522c4103c0a12ddf9f652 [2024-11-17 08:12:17,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:12:17,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:12:17,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:12:17,737 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:12:17,737 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:12:17,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum10.i [2024-11-17 08:12:19,227 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:12:19,403 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:12:19,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i [2024-11-17 08:12:19,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd547466e/e59e4ff81dd54fcf9bcd60007634969b/FLAG0a5511610 [2024-11-17 08:12:19,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd547466e/e59e4ff81dd54fcf9bcd60007634969b [2024-11-17 08:12:19,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:12:19,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:12:19,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:12:19,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:12:19,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:12:19,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:12:19" (1/1) ... [2024-11-17 08:12:19,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f440ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:12:19, skipping insertion in model container [2024-11-17 08:12:19,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:12:19" (1/1) ... [2024-11-17 08:12:19,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:12:19,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:12:19,724 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:12:19,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:12:19,774 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:12:19,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:12:19 WrapperNode [2024-11-17 08:12:19,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:12:19,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:12:19,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:12:19,776 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:12:19,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:12:19" (1/1) ... [2024-11-17 08:12:19,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:12:19" (1/1) ... [2024-11-17 08:12:19,817 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2024-11-17 08:12:19,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:12:19,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:12:19,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:12:19,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:12:19,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:12:19" (1/1) ... [2024-11-17 08:12:19,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:12:19" (1/1) ... [2024-11-17 08:12:19,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:12:19" (1/1) ... [2024-11-17 08:12:19,849 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-17 08:12:19,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:12:19" (1/1) ... [2024-11-17 08:12:19,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:12:19" (1/1) ... [2024-11-17 08:12:19,856 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:12:19" (1/1) ... [2024-11-17 08:12:19,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:12:19" (1/1) ... [2024-11-17 08:12:19,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:12:19" (1/1) ... [2024-11-17 08:12:19,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:12:19" (1/1) ... [2024-11-17 08:12:19,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:12:19,862 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:12:19,862 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:12:19,862 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:12:19,863 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:12:19" (1/1) ... [2024-11-17 08:12:19,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:19,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:19,897 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:19,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-17 08:12:19,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:12:19,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:12:19,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 08:12:19,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 08:12:19,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 08:12:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 08:12:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:12:19,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:12:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 08:12:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 08:12:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 08:12:20,014 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:12:20,016 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:12:20,220 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2024-11-17 08:12:20,240 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-17 08:12:20,241 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:12:20,256 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:12:20,259 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:12:20,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:12:20 BoogieIcfgContainer [2024-11-17 08:12:20,259 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:12:20,260 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:12:20,261 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:12:20,265 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:12:20,266 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:12:20,267 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:12:19" (1/3) ... [2024-11-17 08:12:20,267 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b4babd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:12:20, skipping insertion in model container [2024-11-17 08:12:20,268 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:12:20,268 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:12:19" (2/3) ... [2024-11-17 08:12:20,268 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b4babd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:12:20, skipping insertion in model container [2024-11-17 08:12:20,269 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:12:20,269 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:12:20" (3/3) ... [2024-11-17 08:12:20,270 INFO L332 chiAutomizerObserver]: Analyzing ICFG rangesum10.i [2024-11-17 08:12:20,315 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:12:20,315 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:12:20,315 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:12:20,315 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:12:20,316 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:12:20,316 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:12:20,316 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:12:20,316 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:12:20,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:20,337 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2024-11-17 08:12:20,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:12:20,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:12:20,342 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:12:20,342 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:12:20,343 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:12:20,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 33 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:20,345 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2024-11-17 08:12:20,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:12:20,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:12:20,346 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:12:20,346 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:12:20,350 INFO L745 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 27#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 26#L17true [2024-11-17 08:12:20,351 INFO L747 eck$LassoCheckResult]: Loop: 26#L17true assume true; 14#L17-1true assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 26#L17true [2024-11-17 08:12:20,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:20,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2880, now seen corresponding path program 1 times [2024-11-17 08:12:20,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:20,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772802010] [2024-11-17 08:12:20,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:20,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:20,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:20,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:20,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:20,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2784, now seen corresponding path program 1 times [2024-11-17 08:12:20,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:20,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592898995] [2024-11-17 08:12:20,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:20,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:20,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:20,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:20,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:20,543 INFO L85 PathProgramCache]: Analyzing trace with hash 2769503, now seen corresponding path program 1 times [2024-11-17 08:12:20,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:20,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333551631] [2024-11-17 08:12:20,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:20,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:20,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:20,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:20,976 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:12:20,976 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:12:20,977 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:12:20,977 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:12:20,977 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:12:20,978 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:20,978 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:12:20,978 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:12:20,978 INFO L132 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration1_Lasso [2024-11-17 08:12:20,979 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:12:20,979 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:12:21,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:21,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:21,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:21,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:21,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:21,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:21,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:21,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:21,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:21,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:21,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:21,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:21,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:21,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:21,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:21,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:21,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:21,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:21,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:21,563 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:12:21,568 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:12:21,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:21,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:21,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:21,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-17 08:12:21,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:21,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:21,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:21,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:21,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:21,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:12:21,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:12:21,598 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:21,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-17 08:12:21,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:21,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:21,616 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:21,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-17 08:12:21,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:21,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:21,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:12:21,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:21,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:21,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:21,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:12:21,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:12:21,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:21,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-17 08:12:21,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:21,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:21,653 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:21,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-17 08:12:21,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:21,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:21,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:21,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:21,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:21,671 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:12:21,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:12:21,674 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:21,690 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-17 08:12:21,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:21,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:21,693 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:21,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-17 08:12:21,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:21,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:21,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:21,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:21,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:21,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:12:21,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:12:21,719 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:21,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-17 08:12:21,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:21,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:21,737 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:21,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-17 08:12:21,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:21,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:21,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:12:21,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:21,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:21,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:21,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:12:21,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:12:21,757 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:21,772 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-17 08:12:21,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:21,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:21,774 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:21,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-17 08:12:21,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:21,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:21,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:12:21,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:21,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:21,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:21,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:12:21,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:12:21,794 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:21,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-17 08:12:21,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:21,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:21,810 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:21,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-17 08:12:21,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:21,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:21,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:12:21,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:21,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:21,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:21,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:12:21,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:12:21,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:21,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-17 08:12:21,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:21,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:21,843 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:21,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-17 08:12:21,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:21,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:21,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:12:21,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:21,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:21,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:21,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:12:21,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:12:21,866 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:21,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-17 08:12:21,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:21,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:21,885 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:21,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-17 08:12:21,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:21,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:21,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:12:21,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:21,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:21,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:21,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:12:21,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:12:21,906 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:21,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-17 08:12:21,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:21,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:21,923 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:21,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-17 08:12:21,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:21,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:21,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:12:21,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:21,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:21,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:21,938 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:12:21,938 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:12:21,943 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:21,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-17 08:12:21,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:21,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:21,960 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:21,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-17 08:12:21,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:21,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:21,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:12:21,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:21,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:21,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:21,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:12:21,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:12:21,977 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:21,992 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-17 08:12:21,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:21,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:21,995 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:21,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-17 08:12:21,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:22,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:22,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:12:22,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:22,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:22,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:22,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:12:22,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:12:22,013 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:22,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-17 08:12:22,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:22,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:22,030 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:22,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-17 08:12:22,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:22,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:22,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:12:22,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:22,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:22,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:22,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:12:22,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:12:22,053 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:22,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-17 08:12:22,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:22,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:22,070 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:22,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-17 08:12:22,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:22,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:22,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:22,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:22,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:22,088 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:12:22,088 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:12:22,092 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:22,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-17 08:12:22,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:22,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:22,109 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:22,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-17 08:12:22,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-17 08:12:22,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:22,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:22,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:22,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:22,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:12:22,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:12:22,135 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:22,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-17 08:12:22,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:22,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:22,153 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:22,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-17 08:12:22,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:22,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:22,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:12:22,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:22,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:22,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:22,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:12:22,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:12:22,172 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:22,188 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-17 08:12:22,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:22,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:22,190 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:22,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-17 08:12:22,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-17 08:12:22,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:22,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:22,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:22,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:22,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:12:22,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:12:22,215 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:22,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-17 08:12:22,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:22,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:22,231 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:22,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-17 08:12:22,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:22,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:22,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:22,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:22,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:22,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:12:22,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:12:22,252 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:22,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-17 08:12:22,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:22,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:22,270 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-17 08:12:22,272 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-17 08:12:22,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:22,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:22,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:22,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:22,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:22,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:12:22,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:12:22,293 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:22,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-17 08:12:22,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:22,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:22,312 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-17 08:12:22,313 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-17 08:12:22,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:22,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:22,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:22,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:22,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:22,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:12:22,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:12:22,339 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:22,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-17 08:12:22,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:22,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:22,356 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:22,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-17 08:12:22,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:22,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:22,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:22,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:22,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:22,374 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:12:22,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:12:22,378 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:22,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-17 08:12:22,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:22,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:22,394 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:22,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-17 08:12:22,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:22,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:22,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:22,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:22,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:22,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:12:22,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:12:22,423 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:12:22,493 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2024-11-17 08:12:22,494 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-11-17 08:12:22,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:22,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:22,649 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:22,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-17 08:12:22,652 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:12:22,669 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:12:22,669 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:12:22,670 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1, ULTIMATE.start_init_nondet_~i~0#1) = 19*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 - 8*ULTIMATE.start_init_nondet_~i~0#1 Supporting invariants [] [2024-11-17 08:12:22,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-17 08:12:22,700 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2024-11-17 08:12:22,710 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:12:22,711 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:12:22,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:22,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:12:22,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:12:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:22,776 WARN L253 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 08:12:22,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:12:22,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:12:22,819 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-17 08:12:22,821 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 33 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:22,889 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 33 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 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 64 states and 98 transitions. Complement of second has 6 states. [2024-11-17 08:12:22,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-17 08:12:22,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:22,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2024-11-17 08:12:22,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-17 08:12:22,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:12:22,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-17 08:12:22,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:12:22,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 49 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-17 08:12:22,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:12:22,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 98 transitions. [2024-11-17 08:12:22,906 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-17 08:12:22,909 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 26 states and 39 transitions. [2024-11-17 08:12:22,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-17 08:12:22,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-17 08:12:22,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 39 transitions. [2024-11-17 08:12:22,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:12:22,911 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 39 transitions. [2024-11-17 08:12:22,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 39 transitions. [2024-11-17 08:12:22,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-17 08:12:22,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.5) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 39 transitions. [2024-11-17 08:12:22,938 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 39 transitions. [2024-11-17 08:12:22,938 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 39 transitions. [2024-11-17 08:12:22,938 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:12:22,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 39 transitions. [2024-11-17 08:12:22,939 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-17 08:12:22,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:12:22,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:12:22,939 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-17 08:12:22,939 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:12:22,939 INFO L745 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 174#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 191#L17 assume true; 193#L17-1 assume !(init_nondet_~i~0#1 < 10); 190#init_nondet_returnLabel#1 assume true;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;havoc init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 185#L28-6 [2024-11-17 08:12:22,940 INFO L747 eck$LassoCheckResult]: Loop: 185#L28-6 assume true; 175#L28-8 assume !!(rangesum_~i~1#1 < 10); 177#L29-2 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 186#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 185#L28-6 [2024-11-17 08:12:22,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:22,940 INFO L85 PathProgramCache]: Analyzing trace with hash 85854583, now seen corresponding path program 1 times [2024-11-17 08:12:22,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:22,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272319863] [2024-11-17 08:12:22,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:22,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:12:23,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:12:23,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272319863] [2024-11-17 08:12:23,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272319863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:12:23,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:12:23,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:12:23,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230596246] [2024-11-17 08:12:23,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:12:23,025 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:12:23,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:23,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2461631, now seen corresponding path program 1 times [2024-11-17 08:12:23,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:23,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54158757] [2024-11-17 08:12:23,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:23,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:23,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:23,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:23,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:12:23,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:12:23,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:12:23,110 INFO L87 Difference]: Start difference. First operand 26 states and 39 transitions. cyclomatic complexity: 18 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:23,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:12:23,128 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2024-11-17 08:12:23,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2024-11-17 08:12:23,131 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-17 08:12:23,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 36 transitions. [2024-11-17 08:12:23,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-17 08:12:23,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-17 08:12:23,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2024-11-17 08:12:23,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:12:23,134 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-11-17 08:12:23,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2024-11-17 08:12:23,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-17 08:12:23,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2024-11-17 08:12:23,137 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-11-17 08:12:23,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:12:23,139 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-11-17 08:12:23,140 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:12:23,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2024-11-17 08:12:23,141 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-17 08:12:23,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:12:23,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:12:23,143 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-11-17 08:12:23,143 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:12:23,144 INFO L745 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 234#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 251#L17 assume true; 252#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 253#L17 assume true; 254#L17-1 assume !(init_nondet_~i~0#1 < 10); 250#init_nondet_returnLabel#1 assume true;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;havoc init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 242#L28-6 [2024-11-17 08:12:23,144 INFO L747 eck$LassoCheckResult]: Loop: 242#L28-6 assume true; 235#L28-8 assume !!(rangesum_~i~1#1 < 10); 237#L29-2 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 246#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 242#L28-6 [2024-11-17 08:12:23,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:23,144 INFO L85 PathProgramCache]: Analyzing trace with hash 901941752, now seen corresponding path program 1 times [2024-11-17 08:12:23,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:23,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721492364] [2024-11-17 08:12:23,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:23,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:12:23,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:12:23,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721492364] [2024-11-17 08:12:23,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721492364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:12:23,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95257643] [2024-11-17 08:12:23,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:23,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:12:23,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:23,214 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-17 08:12:23,215 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-17 08:12:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:23,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 08:12:23,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:12:23,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:12:23,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:12:23,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:12:23,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95257643] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:12:23,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:12:23,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-17 08:12:23,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246799079] [2024-11-17 08:12:23,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:12:23,305 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:12:23,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:23,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2461631, now seen corresponding path program 2 times [2024-11-17 08:12:23,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:23,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738069094] [2024-11-17 08:12:23,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:23,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:23,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:23,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:23,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:12:23,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 08:12:23,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-17 08:12:23,396 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 14 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:23,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:12:23,419 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-17 08:12:23,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2024-11-17 08:12:23,423 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-17 08:12:23,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 33 states and 42 transitions. [2024-11-17 08:12:23,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-17 08:12:23,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-17 08:12:23,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2024-11-17 08:12:23,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:12:23,424 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-11-17 08:12:23,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2024-11-17 08:12:23,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-11-17 08:12:23,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.28125) internal successors, (41), 31 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-17 08:12:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-11-17 08:12:23,428 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-11-17 08:12:23,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 08:12:23,430 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-11-17 08:12:23,430 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:12:23,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2024-11-17 08:12:23,432 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-17 08:12:23,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:12:23,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:12:23,432 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1] [2024-11-17 08:12:23,432 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:12:23,432 INFO L745 eck$LassoCheckResult]: Stem: 341#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 342#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 359#L17 assume true; 360#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 361#L17 assume true; 362#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 364#L17 assume true; 368#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 367#L17 assume true; 366#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 365#L17 assume true; 363#L17-1 assume !(init_nondet_~i~0#1 < 10); 358#init_nondet_returnLabel#1 assume true;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;havoc init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 353#L28-6 [2024-11-17 08:12:23,432 INFO L747 eck$LassoCheckResult]: Loop: 353#L28-6 assume true; 343#L28-8 assume !!(rangesum_~i~1#1 < 10); 345#L29-2 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 354#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 353#L28-6 [2024-11-17 08:12:23,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:23,433 INFO L85 PathProgramCache]: Analyzing trace with hash 202351099, now seen corresponding path program 2 times [2024-11-17 08:12:23,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:23,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255239048] [2024-11-17 08:12:23,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:23,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:12:23,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:12:23,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255239048] [2024-11-17 08:12:23,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255239048] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:12:23,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338447970] [2024-11-17 08:12:23,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:12:23,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:12:23,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:23,594 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-17 08:12:23,596 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-17 08:12:23,656 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:12:23,657 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:12:23,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:12:23,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:12:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:12:23,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:12:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:12:23,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338447970] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:12:23,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:12:23,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-17 08:12:23,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329607484] [2024-11-17 08:12:23,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:12:23,748 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:12:23,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:23,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2461631, now seen corresponding path program 3 times [2024-11-17 08:12:23,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:23,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105569012] [2024-11-17 08:12:23,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:23,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:23,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:23,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:23,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-17 08:12:23,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:12:23,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 08:12:23,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-17 08:12:23,865 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 14 Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:23,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:12:23,901 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2024-11-17 08:12:23,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 60 transitions. [2024-11-17 08:12:23,902 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-17 08:12:23,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 45 states and 54 transitions. [2024-11-17 08:12:23,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-17 08:12:23,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-17 08:12:23,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2024-11-17 08:12:23,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:12:23,903 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-11-17 08:12:23,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2024-11-17 08:12:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2024-11-17 08:12:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 43 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-11-17 08:12:23,910 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-11-17 08:12:23,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 08:12:23,912 INFO L425 stractBuchiCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-11-17 08:12:23,912 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:12:23,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 53 transitions. [2024-11-17 08:12:23,913 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-17 08:12:23,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:12:23,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:12:23,915 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 1, 1, 1, 1] [2024-11-17 08:12:23,916 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:12:23,916 INFO L745 eck$LassoCheckResult]: Stem: 512#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 513#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 530#L17 assume true; 531#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 532#L17 assume true; 533#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 535#L17 assume true; 551#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 550#L17 assume true; 549#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 548#L17 assume true; 547#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 546#L17 assume true; 545#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 544#L17 assume true; 543#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 542#L17 assume true; 541#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 540#L17 assume true; 539#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 538#L17 assume true; 537#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 536#L17 assume true; 534#L17-1 assume !(init_nondet_~i~0#1 < 10); 529#init_nondet_returnLabel#1 assume true;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;havoc init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 521#L28-6 [2024-11-17 08:12:23,916 INFO L747 eck$LassoCheckResult]: Loop: 521#L28-6 assume true; 514#L28-8 assume !!(rangesum_~i~1#1 < 10); 516#L29-2 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 525#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 521#L28-6 [2024-11-17 08:12:23,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:23,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1204787009, now seen corresponding path program 3 times [2024-11-17 08:12:23,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:23,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592019713] [2024-11-17 08:12:23,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:23,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:23,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:23,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:23,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:23,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2461631, now seen corresponding path program 4 times [2024-11-17 08:12:23,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:23,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113410224] [2024-11-17 08:12:23,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:23,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:24,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:24,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:24,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:24,010 INFO L85 PathProgramCache]: Analyzing trace with hash 467109631, now seen corresponding path program 1 times [2024-11-17 08:12:24,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:24,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466651593] [2024-11-17 08:12:24,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:24,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:24,125 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 08:12:24,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:12:24,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466651593] [2024-11-17 08:12:24,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466651593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:12:24,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:12:24,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:12:24,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103460542] [2024-11-17 08:12:24,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:12:24,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:12:24,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:12:24,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:12:24,183 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:12:24,223 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2024-11-17 08:12:24,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 65 transitions. [2024-11-17 08:12:24,224 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-17 08:12:24,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 65 transitions. [2024-11-17 08:12:24,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-17 08:12:24,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-11-17 08:12:24,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 65 transitions. [2024-11-17 08:12:24,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:12:24,227 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 65 transitions. [2024-11-17 08:12:24,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 65 transitions. [2024-11-17 08:12:24,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2024-11-17 08:12:24,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.169811320754717) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:24,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2024-11-17 08:12:24,233 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-11-17 08:12:24,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:12:24,234 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-11-17 08:12:24,235 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:12:24,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 62 transitions. [2024-11-17 08:12:24,236 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-17 08:12:24,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:12:24,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:12:24,237 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:12:24,237 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:12:24,238 INFO L745 eck$LassoCheckResult]: Stem: 620#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 621#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 638#L17 assume true; 639#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 640#L17 assume true; 641#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 666#L17 assume true; 665#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 664#L17 assume true; 663#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 662#L17 assume true; 661#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 660#L17 assume true; 659#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 658#L17 assume true; 657#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 656#L17 assume true; 655#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 654#L17 assume true; 653#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 652#L17 assume true; 651#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 650#L17 assume true; 644#L17-1 assume !(init_nondet_~i~0#1 < 10); 637#init_nondet_returnLabel#1 assume true;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;havoc init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 628#L28-6 assume true; 622#L28-8 assume !!(rangesum_~i~1#1 < 10); 623#L29-2 assume !(rangesum_~i~1#1 > 5); 632#L28-7 [2024-11-17 08:12:24,238 INFO L747 eck$LassoCheckResult]: Loop: 632#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 633#L28-6 assume true; 648#L28-8 assume !!(rangesum_~i~1#1 < 10); 649#L29-2 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 632#L28-7 [2024-11-17 08:12:24,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:24,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1231857937, now seen corresponding path program 1 times [2024-11-17 08:12:24,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:24,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738359271] [2024-11-17 08:12:24,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:24,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:24,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:24,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:24,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:24,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2313731, now seen corresponding path program 5 times [2024-11-17 08:12:24,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:24,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005440] [2024-11-17 08:12:24,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:24,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:24,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:24,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:24,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:24,312 INFO L85 PathProgramCache]: Analyzing trace with hash -30048783, now seen corresponding path program 1 times [2024-11-17 08:12:24,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:24,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410037984] [2024-11-17 08:12:24,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:24,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:24,407 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 08:12:24,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:12:24,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410037984] [2024-11-17 08:12:24,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410037984] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:12:24,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761675721] [2024-11-17 08:12:24,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:24,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:12:24,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:24,410 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:12:24,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-17 08:12:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:24,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 08:12:24,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:12:24,512 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 08:12:24,512 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:12:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 08:12:24,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761675721] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:12:24,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:12:24,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-17 08:12:24,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204491615] [2024-11-17 08:12:24,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:12:24,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:12:24,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 08:12:24,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-17 08:12:24,588 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. cyclomatic complexity: 14 Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:24,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:12:24,682 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2024-11-17 08:12:24,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 101 transitions. [2024-11-17 08:12:24,683 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2024-11-17 08:12:24,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 92 states and 101 transitions. [2024-11-17 08:12:24,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2024-11-17 08:12:24,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2024-11-17 08:12:24,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 101 transitions. [2024-11-17 08:12:24,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:12:24,685 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 101 transitions. [2024-11-17 08:12:24,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 101 transitions. [2024-11-17 08:12:24,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2024-11-17 08:12:24,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.101123595505618) internal successors, (98), 88 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2024-11-17 08:12:24,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 98 transitions. [2024-11-17 08:12:24,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 08:12:24,698 INFO L425 stractBuchiCegarLoop]: Abstraction has 89 states and 98 transitions. [2024-11-17 08:12:24,698 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:12:24,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 98 transitions. [2024-11-17 08:12:24,699 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-17 08:12:24,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:12:24,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:12:24,700 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 4, 4, 4, 3, 1, 1, 1, 1] [2024-11-17 08:12:24,700 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:12:24,700 INFO L745 eck$LassoCheckResult]: Stem: 963#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 964#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 982#L17 assume true; 983#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 984#L17 assume true; 985#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1017#L17 assume true; 1016#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1015#L17 assume true; 1014#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1013#L17 assume true; 1012#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1011#L17 assume true; 1010#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1009#L17 assume true; 1008#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1007#L17 assume true; 1006#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1005#L17 assume true; 1004#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1003#L17 assume true; 998#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 997#L17 assume true; 990#L17-1 assume !(init_nondet_~i~0#1 < 10); 980#init_nondet_returnLabel#1 assume true;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;havoc init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 981#L28-6 assume true; 1033#L28-8 assume !!(rangesum_~i~1#1 < 10); 992#L29-2 assume !(rangesum_~i~1#1 > 5); 975#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 971#L28-6 assume true; 965#L28-8 assume !!(rangesum_~i~1#1 < 10); 966#L29-2 assume !(rangesum_~i~1#1 > 5); 1032#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1031#L28-6 assume true; 1030#L28-8 assume !!(rangesum_~i~1#1 < 10); 1029#L29-2 assume !(rangesum_~i~1#1 > 5); 1028#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1027#L28-6 assume true; 1026#L28-8 assume !!(rangesum_~i~1#1 < 10); 1025#L29-2 assume !(rangesum_~i~1#1 > 5); 1002#L28-7 [2024-11-17 08:12:24,700 INFO L747 eck$LassoCheckResult]: Loop: 1002#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1000#L28-6 assume true; 995#L28-8 assume !!(rangesum_~i~1#1 < 10); 996#L29-2 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 1002#L28-7 [2024-11-17 08:12:24,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:24,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2045697912, now seen corresponding path program 1 times [2024-11-17 08:12:24,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:24,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684187312] [2024-11-17 08:12:24,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:24,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:24,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:24,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:24,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:24,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2313731, now seen corresponding path program 6 times [2024-11-17 08:12:24,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:24,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087602876] [2024-11-17 08:12:24,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:24,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:24,755 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:24,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:24,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:24,758 INFO L85 PathProgramCache]: Analyzing trace with hash 538417658, now seen corresponding path program 2 times [2024-11-17 08:12:24,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:24,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115358814] [2024-11-17 08:12:24,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:24,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 08:12:24,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:12:24,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115358814] [2024-11-17 08:12:24,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115358814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:12:24,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541904172] [2024-11-17 08:12:24,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:12:24,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:12:24,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:24,888 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:12:24,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-17 08:12:24,975 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:12:24,975 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:12:24,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:12:24,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:12:25,036 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 08:12:25,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:12:25,094 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-17 08:12:25,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541904172] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:12:25,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:12:25,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-17 08:12:25,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247134534] [2024-11-17 08:12:25,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:12:25,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:12:25,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 08:12:25,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-17 08:12:25,151 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. cyclomatic complexity: 14 Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:25,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:12:25,266 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2024-11-17 08:12:25,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 125 transitions. [2024-11-17 08:12:25,267 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2024-11-17 08:12:25,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 125 transitions. [2024-11-17 08:12:25,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2024-11-17 08:12:25,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2024-11-17 08:12:25,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 125 transitions. [2024-11-17 08:12:25,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:12:25,273 INFO L218 hiAutomatonCegarLoop]: Abstraction has 116 states and 125 transitions. [2024-11-17 08:12:25,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 125 transitions. [2024-11-17 08:12:25,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2024-11-17 08:12:25,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.079646017699115) internal successors, (122), 112 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2024-11-17 08:12:25,279 INFO L240 hiAutomatonCegarLoop]: Abstraction has 113 states and 122 transitions. [2024-11-17 08:12:25,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 08:12:25,281 INFO L425 stractBuchiCegarLoop]: Abstraction has 113 states and 122 transitions. [2024-11-17 08:12:25,283 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:12:25,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 122 transitions. [2024-11-17 08:12:25,284 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-17 08:12:25,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:12:25,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:12:25,285 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 6, 6, 6, 5, 1, 1, 1, 1] [2024-11-17 08:12:25,285 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:12:25,285 INFO L745 eck$LassoCheckResult]: Stem: 1440#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 1441#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 1459#L17 assume true; 1460#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1461#L17 assume true; 1462#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1493#L17 assume true; 1492#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1491#L17 assume true; 1490#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1489#L17 assume true; 1488#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1487#L17 assume true; 1486#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1485#L17 assume true; 1484#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1483#L17 assume true; 1482#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1481#L17 assume true; 1480#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1479#L17 assume true; 1474#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1473#L17 assume true; 1467#L17-1 assume !(init_nondet_~i~0#1 < 10); 1458#init_nondet_returnLabel#1 assume true;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;havoc init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 1448#L28-6 assume true; 1442#L28-8 assume !!(rangesum_~i~1#1 < 10); 1443#L29-2 assume !(rangesum_~i~1#1 > 5); 1452#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1453#L28-6 assume true; 1526#L28-8 assume !!(rangesum_~i~1#1 < 10); 1525#L29-2 assume !(rangesum_~i~1#1 > 5); 1524#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1523#L28-6 assume true; 1522#L28-8 assume !!(rangesum_~i~1#1 < 10); 1521#L29-2 assume !(rangesum_~i~1#1 > 5); 1520#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1519#L28-6 assume true; 1518#L28-8 assume !!(rangesum_~i~1#1 < 10); 1517#L29-2 assume !(rangesum_~i~1#1 > 5); 1515#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1513#L28-6 assume true; 1511#L28-8 assume !!(rangesum_~i~1#1 < 10); 1509#L29-2 assume !(rangesum_~i~1#1 > 5); 1507#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1505#L28-6 assume true; 1503#L28-8 assume !!(rangesum_~i~1#1 < 10); 1502#L29-2 assume !(rangesum_~i~1#1 > 5); 1478#L28-7 [2024-11-17 08:12:25,285 INFO L747 eck$LassoCheckResult]: Loop: 1478#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1476#L28-6 assume true; 1471#L28-8 assume !!(rangesum_~i~1#1 < 10); 1472#L29-2 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 1478#L28-7 [2024-11-17 08:12:25,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:25,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1232512258, now seen corresponding path program 2 times [2024-11-17 08:12:25,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:25,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213400509] [2024-11-17 08:12:25,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:25,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:25,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:25,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:25,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:25,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2313731, now seen corresponding path program 7 times [2024-11-17 08:12:25,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:25,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17357957] [2024-11-17 08:12:25,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:25,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:25,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:25,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:25,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:25,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1281155712, now seen corresponding path program 3 times [2024-11-17 08:12:25,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:25,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210720299] [2024-11-17 08:12:25,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:25,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:25,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:25,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:29,625 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:12:29,625 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:12:29,625 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:12:29,625 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:12:29,625 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:12:29,625 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:29,625 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:12:29,625 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:12:29,625 INFO L132 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration8_Lasso [2024-11-17 08:12:29,625 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:12:29,625 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:12:29,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:29,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:30,210 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:12:30,210 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:12:30,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:30,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:30,215 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:30,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-17 08:12:30,218 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:30,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:30,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:12:30,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:30,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:30,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:30,232 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:12:30,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:12:30,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:30,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-17 08:12:30,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:30,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:30,253 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:30,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-17 08:12:30,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:30,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:30,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:12:30,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:30,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:30,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:30,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:12:30,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:12:30,269 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:30,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-17 08:12:30,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:30,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:30,285 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:30,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-17 08:12:30,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:30,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:30,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:12:30,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:30,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:30,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:30,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:12:30,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:12:30,305 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:30,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-17 08:12:30,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:30,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:30,322 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:30,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-17 08:12:30,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:30,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:30,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:12:30,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:30,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:30,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:30,337 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:12:30,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:12:30,338 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:30,349 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-17 08:12:30,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:30,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:30,350 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:30,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-17 08:12:30,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:30,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:30,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:12:30,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:30,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:30,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:30,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:12:30,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:12:30,364 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:30,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-17 08:12:30,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:30,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:30,378 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:30,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-17 08:12:30,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:30,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:30,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:12:30,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:30,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:30,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:30,390 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:12:30,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:12:30,391 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:30,401 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-17 08:12:30,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:30,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:30,402 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:30,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-17 08:12:30,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:30,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:30,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:12:30,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:30,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:30,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:30,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:12:30,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:12:30,415 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:30,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-17 08:12:30,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:30,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:30,427 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:30,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-17 08:12:30,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:30,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:30,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:30,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:30,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:30,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:12:30,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:12:30,444 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:30,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-17 08:12:30,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:30,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:30,455 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:30,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-17 08:12:30,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:30,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:30,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:30,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:30,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:30,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:12:30,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:12:30,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:30,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-17 08:12:30,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:30,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:30,482 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:30,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-17 08:12:30,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:30,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:30,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:30,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:30,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:30,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:12:30,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:12:30,497 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:30,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-17 08:12:30,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:30,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:30,509 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:30,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-17 08:12:30,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:30,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:30,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:30,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:30,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:30,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:12:30,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:12:30,530 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:30,540 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-17 08:12:30,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:30,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:30,542 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:30,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-11-17 08:12:30,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:30,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:30,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:30,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:30,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:30,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:12:30,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:12:30,566 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:12:30,581 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-17 08:12:30,582 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2024-11-17 08:12:30,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:30,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:30,584 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:30,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-17 08:12:30,585 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:12:30,596 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:12:30,596 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:12:30,596 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1#1) = -2*ULTIMATE.start_rangesum_~i~1#1 + 17 Supporting invariants [] [2024-11-17 08:12:30,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-17 08:12:30,622 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2024-11-17 08:12:30,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:30,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:12:30,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:12:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:30,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:12:30,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:12:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:12:30,768 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-17 08:12:30,768 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 122 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:30,793 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 122 transitions. cyclomatic complexity: 14. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 130 states and 141 transitions. Complement of second has 7 states. [2024-11-17 08:12:30,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:12:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-11-17 08:12:30,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 48 letters. Loop has 4 letters. [2024-11-17 08:12:30,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:12:30,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 52 letters. Loop has 4 letters. [2024-11-17 08:12:30,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:12:30,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 48 letters. Loop has 8 letters. [2024-11-17 08:12:30,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:12:30,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 141 transitions. [2024-11-17 08:12:30,801 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-11-17 08:12:30,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 116 states and 127 transitions. [2024-11-17 08:12:30,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2024-11-17 08:12:30,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2024-11-17 08:12:30,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 127 transitions. [2024-11-17 08:12:30,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:12:30,803 INFO L218 hiAutomatonCegarLoop]: Abstraction has 116 states and 127 transitions. [2024-11-17 08:12:30,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 127 transitions. [2024-11-17 08:12:30,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-17 08:12:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 1.0948275862068966) internal successors, (127), 115 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2024-11-17 08:12:30,812 INFO L240 hiAutomatonCegarLoop]: Abstraction has 116 states and 127 transitions. [2024-11-17 08:12:30,813 INFO L425 stractBuchiCegarLoop]: Abstraction has 116 states and 127 transitions. [2024-11-17 08:12:30,813 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-17 08:12:30,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 127 transitions. [2024-11-17 08:12:30,813 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-11-17 08:12:30,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:12:30,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:12:30,816 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:12:30,817 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:12:30,817 INFO L745 eck$LassoCheckResult]: Stem: 1895#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 1896#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 1919#L17 assume true; 1920#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1921#L17 assume true; 1922#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1962#L17 assume true; 1960#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1958#L17 assume true; 1956#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1954#L17 assume true; 1952#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1950#L17 assume true; 1948#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1946#L17 assume true; 1944#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1942#L17 assume true; 1940#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1938#L17 assume true; 1936#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1934#L17 assume true; 1931#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 1930#L17 assume true; 1925#L17-1 assume !(init_nondet_~i~0#1 < 10); 1917#init_nondet_returnLabel#1 assume true;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;havoc init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 1918#L28-6 assume true; 1897#L28-8 assume !!(rangesum_~i~1#1 < 10); 1898#L29-2 assume !(rangesum_~i~1#1 > 5); 1911#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1907#L28-6 assume true; 1899#L28-8 assume !!(rangesum_~i~1#1 < 10); 1900#L29-2 assume !(rangesum_~i~1#1 > 5); 1912#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1913#L28-6 assume true; 1984#L28-8 assume !!(rangesum_~i~1#1 < 10); 1983#L29-2 assume !(rangesum_~i~1#1 > 5); 1982#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1981#L28-6 assume true; 1980#L28-8 assume !!(rangesum_~i~1#1 < 10); 1979#L29-2 assume !(rangesum_~i~1#1 > 5); 1978#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1977#L28-6 assume true; 1976#L28-8 assume !!(rangesum_~i~1#1 < 10); 1975#L29-2 assume !(rangesum_~i~1#1 > 5); 1974#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1972#L28-6 assume true; 1970#L28-8 assume !!(rangesum_~i~1#1 < 10); 1969#L29-2 assume !(rangesum_~i~1#1 > 5); 1966#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1905#L28-6 assume true; 1906#L28-8 assume !(rangesum_~i~1#1 < 10); 1914#L34-2 assume !(0 != rangesum_~cnt~0#1);rangesum_#res#1 := 0; 1891#L37-2 assume true;main_#t~ret5#1 := rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;havoc rangesum_#in~x#1.base, rangesum_#in~x#1.offset;assume { :end_inline_rangesum } 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_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 1892#L28-3 assume true; 1915#L28-5 assume !!(rangesum_~i~1#1 < 10); 1901#L29-1 assume !(rangesum_~i~1#1 > 5); 1902#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1926#L28-3 assume true; 1965#L28-5 assume !!(rangesum_~i~1#1 < 10); 1964#L29-1 assume !(rangesum_~i~1#1 > 5); 1963#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1961#L28-3 assume true; 1959#L28-5 assume !!(rangesum_~i~1#1 < 10); 1957#L29-1 assume !(rangesum_~i~1#1 > 5); 1955#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1953#L28-3 assume true; 1951#L28-5 assume !!(rangesum_~i~1#1 < 10); 1949#L29-1 assume !(rangesum_~i~1#1 > 5); 1947#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1945#L28-3 assume true; 1943#L28-5 assume !!(rangesum_~i~1#1 < 10); 1941#L29-1 assume !(rangesum_~i~1#1 > 5); 1939#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1937#L28-3 assume true; 1935#L28-5 assume !!(rangesum_~i~1#1 < 10); 1933#L29-1 assume !(rangesum_~i~1#1 > 5); 1932#L28-4 [2024-11-17 08:12:30,817 INFO L747 eck$LassoCheckResult]: Loop: 1932#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 1929#L28-3 assume true; 1927#L28-5 assume !!(rangesum_~i~1#1 < 10); 1928#L29-1 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 1932#L28-4 [2024-11-17 08:12:30,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:30,818 INFO L85 PathProgramCache]: Analyzing trace with hash -502352886, now seen corresponding path program 1 times [2024-11-17 08:12:30,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:30,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853799963] [2024-11-17 08:12:30,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:30,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:30,921 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-17 08:12:30,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:12:30,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853799963] [2024-11-17 08:12:30,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853799963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:12:30,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:12:30,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:12:30,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734276020] [2024-11-17 08:12:30,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:12:30,922 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:12:30,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:30,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1944323, now seen corresponding path program 1 times [2024-11-17 08:12:30,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:30,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404713208] [2024-11-17 08:12:30,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:30,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:30,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:30,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:30,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:12:30,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:12:30,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:12:30,985 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:31,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:12:31,035 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2024-11-17 08:12:31,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 150 transitions. [2024-11-17 08:12:31,036 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2024-11-17 08:12:31,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 132 states and 145 transitions. [2024-11-17 08:12:31,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2024-11-17 08:12:31,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2024-11-17 08:12:31,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 145 transitions. [2024-11-17 08:12:31,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:12:31,038 INFO L218 hiAutomatonCegarLoop]: Abstraction has 132 states and 145 transitions. [2024-11-17 08:12:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 145 transitions. [2024-11-17 08:12:31,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 119. [2024-11-17 08:12:31,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.0756302521008403) internal successors, (128), 118 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:31,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2024-11-17 08:12:31,050 INFO L240 hiAutomatonCegarLoop]: Abstraction has 119 states and 128 transitions. [2024-11-17 08:12:31,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:12:31,051 INFO L425 stractBuchiCegarLoop]: Abstraction has 119 states and 128 transitions. [2024-11-17 08:12:31,054 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-17 08:12:31,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 128 transitions. [2024-11-17 08:12:31,055 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-17 08:12:31,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:12:31,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:12:31,056 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 8, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:12:31,057 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:12:31,057 INFO L745 eck$LassoCheckResult]: Stem: 2153#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 2154#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 2177#L17 assume true; 2178#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 2179#L17 assume true; 2180#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 2209#L17 assume true; 2208#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 2207#L17 assume true; 2206#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 2205#L17 assume true; 2204#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 2203#L17 assume true; 2202#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 2201#L17 assume true; 2200#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 2199#L17 assume true; 2197#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 2196#L17 assume true; 2194#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 2193#L17 assume true; 2191#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 2190#L17 assume true; 2184#L17-1 assume !(init_nondet_~i~0#1 < 10); 2175#init_nondet_returnLabel#1 assume true;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;havoc init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 2176#L28-6 assume true; 2155#L28-8 assume !!(rangesum_~i~1#1 < 10); 2156#L29-2 assume !(rangesum_~i~1#1 > 5); 2169#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 2165#L28-6 assume true; 2157#L28-8 assume !!(rangesum_~i~1#1 < 10); 2158#L29-2 assume !(rangesum_~i~1#1 > 5); 2170#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 2171#L28-6 assume true; 2245#L28-8 assume !!(rangesum_~i~1#1 < 10); 2244#L29-2 assume !(rangesum_~i~1#1 > 5); 2243#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 2242#L28-6 assume true; 2241#L28-8 assume !!(rangesum_~i~1#1 < 10); 2240#L29-2 assume !(rangesum_~i~1#1 > 5); 2239#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 2238#L28-6 assume true; 2237#L28-8 assume !!(rangesum_~i~1#1 < 10); 2236#L29-2 assume !(rangesum_~i~1#1 > 5); 2235#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 2234#L28-6 assume true; 2233#L28-8 assume !!(rangesum_~i~1#1 < 10); 2232#L29-2 assume !(rangesum_~i~1#1 > 5); 2228#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 2231#L28-6 assume true; 2230#L28-8 assume !!(rangesum_~i~1#1 < 10); 2227#L29-2 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 2198#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 2163#L28-6 assume true; 2164#L28-8 assume !(rangesum_~i~1#1 < 10); 2172#L34-2 assume !(0 != rangesum_~cnt~0#1);rangesum_#res#1 := 0; 2149#L37-2 assume true;main_#t~ret5#1 := rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;havoc rangesum_#in~x#1.base, rangesum_#in~x#1.offset;assume { :end_inline_rangesum } 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_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 2150#L28-3 assume true; 2183#L28-5 assume !!(rangesum_~i~1#1 < 10); 2229#L29-1 assume !(rangesum_~i~1#1 > 5); 2185#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 2186#L28-3 assume true; 2173#L28-5 assume !!(rangesum_~i~1#1 < 10); 2159#L29-1 assume !(rangesum_~i~1#1 > 5); 2160#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 2226#L28-3 assume true; 2225#L28-5 assume !!(rangesum_~i~1#1 < 10); 2224#L29-1 assume !(rangesum_~i~1#1 > 5); 2223#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 2222#L28-3 assume true; 2221#L28-5 assume !!(rangesum_~i~1#1 < 10); 2220#L29-1 assume !(rangesum_~i~1#1 > 5); 2219#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 2218#L28-3 assume true; 2217#L28-5 assume !!(rangesum_~i~1#1 < 10); 2216#L29-1 assume !(rangesum_~i~1#1 > 5); 2215#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 2214#L28-3 assume true; 2213#L28-5 assume !!(rangesum_~i~1#1 < 10); 2212#L29-1 assume !(rangesum_~i~1#1 > 5); 2195#L28-4 [2024-11-17 08:12:31,057 INFO L747 eck$LassoCheckResult]: Loop: 2195#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 2211#L28-3 assume true; 2210#L28-5 assume !!(rangesum_~i~1#1 < 10); 2188#L29-1 assume !(rangesum_~i~1#1 > 5); 2195#L28-4 [2024-11-17 08:12:31,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:31,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1769194636, now seen corresponding path program 1 times [2024-11-17 08:12:31,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:31,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415825772] [2024-11-17 08:12:31,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:31,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:31,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-17 08:12:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-11-17 08:12:31,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:12:31,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415825772] [2024-11-17 08:12:31,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415825772] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:12:31,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529600563] [2024-11-17 08:12:31,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:31,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:12:31,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:31,198 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:12:31,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-11-17 08:12:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:31,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 08:12:31,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:12:31,341 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-11-17 08:12:31,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 08:12:31,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529600563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:12:31,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 08:12:31,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-17 08:12:31,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866958688] [2024-11-17 08:12:31,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:12:31,343 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:12:31,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:31,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1944324, now seen corresponding path program 1 times [2024-11-17 08:12:31,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:31,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223712502] [2024-11-17 08:12:31,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:31,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:31,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:31,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:31,365 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:12:31,365 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:12:31,365 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:12:31,365 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:12:31,366 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:12:31,366 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:31,366 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:12:31,366 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:12:31,366 INFO L132 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration10_Loop [2024-11-17 08:12:31,366 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:12:31,366 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:12:31,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:31,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:31,388 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:12:31,389 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:12:31,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:31,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:31,392 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:31,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-17 08:12:31,395 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:12:31,395 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:12:31,411 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:12:31,411 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_rangesum_#t~post4#1=0} Honda state: {ULTIMATE.start_rangesum_#t~post4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-17 08:12:31,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-17 08:12:31,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:31,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:31,427 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:31,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-17 08:12:31,430 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:12:31,430 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:12:31,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-17 08:12:31,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:31,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:31,464 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:31,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-17 08:12:31,467 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:12:31,467 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:12:31,553 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:12:31,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-17 08:12:31,557 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:12:31,557 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:12:31,557 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:12:31,558 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:12:31,558 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:12:31,558 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:31,558 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:12:31,558 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:12:31,558 INFO L132 ssoRankerPreferences]: Filename of dumped script: rangesum10.i_Iteration10_Loop [2024-11-17 08:12:31,558 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:12:31,558 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:12:31,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:31,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:12:31,577 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:12:31,577 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:12:31,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:31,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:31,580 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:12:31,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-17 08:12:31,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:31,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:31,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:12:31,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:31,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:31,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:31,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:12:31,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:12:31,599 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:12:31,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-17 08:12:31,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:31,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:31,611 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-17 08:12:31,611 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-17 08:12:31,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:12:31,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:12:31,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:12:31,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:12:31,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:12:31,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:12:31,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:12:31,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:12:31,624 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:12:31,626 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-17 08:12:31,626 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:12:31,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:12:31,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:31,628 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-17 08:12:31,629 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-17 08:12:31,629 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:12:31,629 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:12:31,629 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:12:31,629 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1#1) = -2*ULTIMATE.start_rangesum_~i~1#1 + 9 Supporting invariants [] [2024-11-17 08:12:31,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-11-17 08:12:31,640 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:12:31,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:31,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:12:31,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:12:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:31,798 WARN L253 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:12:31,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:12:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:12:31,812 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-17 08:12:31,812 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 119 states and 128 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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-17 08:12:31,837 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 119 states and 128 transitions. cyclomatic complexity: 14. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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) Result 140 states and 150 transitions. Complement of second has 5 states. [2024-11-17 08:12:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-17 08:12:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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-17 08:12:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2024-11-17 08:12:31,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 80 letters. Loop has 4 letters. [2024-11-17 08:12:31,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:12:31,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 84 letters. Loop has 4 letters. [2024-11-17 08:12:31,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:12:31,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 80 letters. Loop has 8 letters. [2024-11-17 08:12:31,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:12:31,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 150 transitions. [2024-11-17 08:12:31,842 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-11-17 08:12:31,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 125 states and 135 transitions. [2024-11-17 08:12:31,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2024-11-17 08:12:31,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2024-11-17 08:12:31,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 135 transitions. [2024-11-17 08:12:31,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:12:31,843 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 135 transitions. [2024-11-17 08:12:31,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 135 transitions. [2024-11-17 08:12:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-11-17 08:12:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.08130081300813) internal successors, (133), 122 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:31,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2024-11-17 08:12:31,848 INFO L240 hiAutomatonCegarLoop]: Abstraction has 123 states and 133 transitions. [2024-11-17 08:12:31,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:12:31,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:12:31,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 08:12:31,849 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:31,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:12:31,879 INFO L93 Difference]: Finished difference Result 138 states and 151 transitions. [2024-11-17 08:12:31,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 151 transitions. [2024-11-17 08:12:31,880 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2024-11-17 08:12:31,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 151 transitions. [2024-11-17 08:12:31,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2024-11-17 08:12:31,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2024-11-17 08:12:31,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 151 transitions. [2024-11-17 08:12:31,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:12:31,882 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 151 transitions. [2024-11-17 08:12:31,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 151 transitions. [2024-11-17 08:12:31,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 123. [2024-11-17 08:12:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.065040650406504) internal successors, (131), 122 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2024-11-17 08:12:31,885 INFO L240 hiAutomatonCegarLoop]: Abstraction has 123 states and 131 transitions. [2024-11-17 08:12:31,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:12:31,886 INFO L425 stractBuchiCegarLoop]: Abstraction has 123 states and 131 transitions. [2024-11-17 08:12:31,886 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-17 08:12:31,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 131 transitions. [2024-11-17 08:12:31,886 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-11-17 08:12:31,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:12:31,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:12:31,887 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 10, 8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:12:31,887 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:12:31,888 INFO L745 eck$LassoCheckResult]: Stem: 3183#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 3184#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 3209#L17 assume true; 3210#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 3211#L17 assume true; 3212#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 3248#L17 assume true; 3247#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 3246#L17 assume true; 3245#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 3244#L17 assume true; 3243#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 3242#L17 assume true; 3241#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 3240#L17 assume true; 3239#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 3238#L17 assume true; 3237#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 3236#L17 assume true; 3235#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 3234#L17 assume true; 3227#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 3226#L17 assume true; 3218#L17-1 assume !(init_nondet_~i~0#1 < 10); 3207#init_nondet_returnLabel#1 assume true;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;havoc init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 3208#L28-6 assume true; 3224#L28-8 assume !!(rangesum_~i~1#1 < 10); 3221#L29-2 assume !(rangesum_~i~1#1 > 5); 3201#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 3202#L28-6 assume true; 3187#L28-8 assume !!(rangesum_~i~1#1 < 10); 3188#L29-2 assume !(rangesum_~i~1#1 > 5); 3203#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 3196#L28-6 assume true; 3197#L28-8 assume !!(rangesum_~i~1#1 < 10); 3222#L29-2 assume !(rangesum_~i~1#1 > 5); 3223#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 3266#L28-6 assume true; 3265#L28-8 assume !!(rangesum_~i~1#1 < 10); 3264#L29-2 assume !(rangesum_~i~1#1 > 5); 3263#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 3262#L28-6 assume true; 3261#L28-8 assume !!(rangesum_~i~1#1 < 10); 3260#L29-2 assume !(rangesum_~i~1#1 > 5); 3259#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 3258#L28-6 assume true; 3257#L28-8 assume !!(rangesum_~i~1#1 < 10); 3254#L29-2 assume !(rangesum_~i~1#1 > 5); 3231#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 3253#L28-6 assume true; 3251#L28-8 assume !!(rangesum_~i~1#1 < 10); 3230#L29-2 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 3229#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 3195#L28-6 assume true; 3185#L28-8 assume !(rangesum_~i~1#1 < 10); 3186#L34-2 assume 0 != rangesum_~cnt~0#1;rangesum_#res#1 := (if (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 <= 2147483647 then (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 else (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 - 4294967296); 3179#L37-2 assume true;main_#t~ret5#1 := rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;havoc rangesum_#in~x#1.base, rangesum_#in~x#1.offset;assume { :end_inline_rangesum } 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_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 3180#L28-3 assume true; 3233#L28-5 assume !!(rangesum_~i~1#1 < 10); 3232#L29-1 assume !(rangesum_~i~1#1 > 5); 3219#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 3220#L28-3 assume true; 3205#L28-5 assume !!(rangesum_~i~1#1 < 10); 3191#L29-1 assume !(rangesum_~i~1#1 > 5); 3192#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 3216#L28-3 assume true; 3217#L28-5 assume !!(rangesum_~i~1#1 < 10); 3279#L29-1 assume !(rangesum_~i~1#1 > 5); 3278#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 3277#L28-3 assume true; 3276#L28-5 assume !!(rangesum_~i~1#1 < 10); 3275#L29-1 assume !(rangesum_~i~1#1 > 5); 3274#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 3273#L28-3 assume true; 3271#L28-5 assume !!(rangesum_~i~1#1 < 10); 3268#L29-1 assume !(rangesum_~i~1#1 > 5); 3269#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 3272#L28-3 assume true; 3270#L28-5 assume !!(rangesum_~i~1#1 < 10); 3252#L29-1 assume !(rangesum_~i~1#1 > 5); 3249#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 3215#L28-3 assume true; 3204#L28-5 assume !!(rangesum_~i~1#1 < 10); 3189#L29-1 [2024-11-17 08:12:31,888 INFO L747 eck$LassoCheckResult]: Loop: 3189#L29-1 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 3190#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 3228#L28-3 assume true; 3225#L28-5 assume !!(rangesum_~i~1#1 < 10); 3189#L29-1 [2024-11-17 08:12:31,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:31,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1251749418, now seen corresponding path program 1 times [2024-11-17 08:12:31,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:31,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641218390] [2024-11-17 08:12:31,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:31,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-17 08:12:32,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:12:32,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641218390] [2024-11-17 08:12:32,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641218390] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:12:32,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136685793] [2024-11-17 08:12:32,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:32,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:12:32,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:32,118 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:12:32,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2024-11-17 08:12:32,166 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-17 08:12:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:32,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:12:32,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:12:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-17 08:12:32,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:12:32,366 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-17 08:12:32,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136685793] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:12:32,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:12:32,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 13 [2024-11-17 08:12:32,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857077868] [2024-11-17 08:12:32,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:12:32,367 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:12:32,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:32,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1969343, now seen corresponding path program 2 times [2024-11-17 08:12:32,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:32,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708278899] [2024-11-17 08:12:32,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:32,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:32,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:32,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:32,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:12:32,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 08:12:32,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-17 08:12:32,432 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. cyclomatic complexity: 14 Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:32,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:12:32,584 INFO L93 Difference]: Finished difference Result 188 states and 205 transitions. [2024-11-17 08:12:32,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 205 transitions. [2024-11-17 08:12:32,585 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2024-11-17 08:12:32,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 179 states and 196 transitions. [2024-11-17 08:12:32,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2024-11-17 08:12:32,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2024-11-17 08:12:32,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 196 transitions. [2024-11-17 08:12:32,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:12:32,588 INFO L218 hiAutomatonCegarLoop]: Abstraction has 179 states and 196 transitions. [2024-11-17 08:12:32,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 196 transitions. [2024-11-17 08:12:32,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 147. [2024-11-17 08:12:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 147 states have (on average 1.0748299319727892) internal successors, (158), 146 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2024-11-17 08:12:32,592 INFO L240 hiAutomatonCegarLoop]: Abstraction has 147 states and 158 transitions. [2024-11-17 08:12:32,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 08:12:32,594 INFO L425 stractBuchiCegarLoop]: Abstraction has 147 states and 158 transitions. [2024-11-17 08:12:32,595 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-17 08:12:32,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 158 transitions. [2024-11-17 08:12:32,596 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2024-11-17 08:12:32,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:12:32,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:12:32,597 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 10, 10, 10, 9, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:12:32,597 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:12:32,598 INFO L745 eck$LassoCheckResult]: Stem: 4002#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 4003#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 4030#L17 assume true; 4031#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 4032#L17 assume true; 4033#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 4083#L17 assume true; 4082#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 4081#L17 assume true; 4079#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 4077#L17 assume true; 4075#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 4073#L17 assume true; 4071#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 4069#L17 assume true; 4067#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 4065#L17 assume true; 4063#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 4061#L17 assume true; 4059#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 4057#L17 assume true; 4049#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 4048#L17 assume true; 4040#L17-1 assume !(init_nondet_~i~0#1 < 10); 4028#init_nondet_returnLabel#1 assume true;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;havoc init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 4029#L28-6 assume true; 4045#L28-8 assume !!(rangesum_~i~1#1 < 10); 4043#L29-2 assume !(rangesum_~i~1#1 > 5); 4021#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4015#L28-6 assume true; 4016#L28-8 assume !!(rangesum_~i~1#1 < 10); 4044#L29-2 assume !(rangesum_~i~1#1 > 5); 4022#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4023#L28-6 assume true; 4006#L28-8 assume !!(rangesum_~i~1#1 < 10); 4007#L29-2 assume !(rangesum_~i~1#1 > 5); 4109#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4108#L28-6 assume true; 4107#L28-8 assume !!(rangesum_~i~1#1 < 10); 4106#L29-2 assume !(rangesum_~i~1#1 > 5); 4105#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4104#L28-6 assume true; 4103#L28-8 assume !!(rangesum_~i~1#1 < 10); 4102#L29-2 assume !(rangesum_~i~1#1 > 5); 4101#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4100#L28-6 assume true; 4099#L28-8 assume !!(rangesum_~i~1#1 < 10); 4098#L29-2 assume !(rangesum_~i~1#1 > 5); 4054#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4097#L28-6 assume true; 4096#L28-8 assume !!(rangesum_~i~1#1 < 10); 4095#L29-2 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 4094#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4093#L28-6 assume true; 4092#L28-8 assume !!(rangesum_~i~1#1 < 10); 4091#L29-2 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 4090#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4089#L28-6 assume true; 4088#L28-8 assume !!(rangesum_~i~1#1 < 10); 4087#L29-2 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 4053#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4084#L28-6 assume true; 4055#L28-8 assume !!(rangesum_~i~1#1 < 10); 4052#L29-2 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 4051#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4014#L28-6 assume true; 4004#L28-8 assume !(rangesum_~i~1#1 < 10); 4005#L34-2 assume 0 != rangesum_~cnt~0#1;rangesum_#res#1 := (if (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 <= 2147483647 then (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 else (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 - 4294967296); 3998#L37-2 assume true;main_#t~ret5#1 := rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;havoc rangesum_#in~x#1.base, rangesum_#in~x#1.offset;assume { :end_inline_rangesum } 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_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 3999#L28-3 assume true; 4024#L28-5 assume !!(rangesum_~i~1#1 < 10); 4008#L29-1 assume !(rangesum_~i~1#1 > 5); 4009#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4041#L28-3 assume true; 4110#L28-5 assume !!(rangesum_~i~1#1 < 10); 4111#L29-1 assume !(rangesum_~i~1#1 > 5); 4114#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4112#L28-3 assume true; 4113#L28-5 assume !!(rangesum_~i~1#1 < 10); 4115#L29-1 assume !(rangesum_~i~1#1 > 5); 4116#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4122#L28-3 assume true; 4121#L28-5 assume !!(rangesum_~i~1#1 < 10); 4120#L29-1 assume !(rangesum_~i~1#1 > 5); 4119#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4118#L28-3 assume true; 4117#L28-5 assume !!(rangesum_~i~1#1 < 10); 4010#L29-1 assume !(rangesum_~i~1#1 > 5); 4011#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4124#L28-3 assume true; 4123#L28-5 assume !!(rangesum_~i~1#1 < 10); 4086#L29-1 assume !(rangesum_~i~1#1 > 5); 4085#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4037#L28-3 assume true; 4038#L28-5 assume !!(rangesum_~i~1#1 < 10); 4080#L29-1 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 4078#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4076#L28-3 assume true; 4074#L28-5 assume !!(rangesum_~i~1#1 < 10); 4072#L29-1 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 4070#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4068#L28-3 assume true; 4066#L28-5 assume !!(rangesum_~i~1#1 < 10); 4064#L29-1 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 4062#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4060#L28-3 assume true; 4058#L28-5 assume !!(rangesum_~i~1#1 < 10); 4047#L29-1 [2024-11-17 08:12:32,598 INFO L747 eck$LassoCheckResult]: Loop: 4047#L29-1 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 4056#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4050#L28-3 assume true; 4046#L28-5 assume !!(rangesum_~i~1#1 < 10); 4047#L29-1 [2024-11-17 08:12:32,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:32,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1443321014, now seen corresponding path program 1 times [2024-11-17 08:12:32,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:32,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838328096] [2024-11-17 08:12:32,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:32,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 08:12:32,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [573758524] [2024-11-17 08:12:32,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:32,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:12:32,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:32,678 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:12:32,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2024-11-17 08:12:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:32,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:32,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:32,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:32,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1969343, now seen corresponding path program 3 times [2024-11-17 08:12:32,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:32,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210312552] [2024-11-17 08:12:32,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:32,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:32,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:32,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:32,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:32,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1540221832, now seen corresponding path program 2 times [2024-11-17 08:12:32,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:32,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499488865] [2024-11-17 08:12:32,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:32,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:12:33,102 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-11-17 08:12:33,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:12:33,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499488865] [2024-11-17 08:12:33,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499488865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:12:33,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:12:33,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 08:12:33,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458465614] [2024-11-17 08:12:33,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:12:33,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:12:33,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 08:12:33,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-17 08:12:33,151 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. cyclomatic complexity: 17 Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:33,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:12:33,220 INFO L93 Difference]: Finished difference Result 179 states and 183 transitions. [2024-11-17 08:12:33,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 183 transitions. [2024-11-17 08:12:33,221 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:12:33,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 146 states and 150 transitions. [2024-11-17 08:12:33,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2024-11-17 08:12:33,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2024-11-17 08:12:33,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 150 transitions. [2024-11-17 08:12:33,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:12:33,222 INFO L218 hiAutomatonCegarLoop]: Abstraction has 146 states and 150 transitions. [2024-11-17 08:12:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 150 transitions. [2024-11-17 08:12:33,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 120. [2024-11-17 08:12:33,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 120 states have (on average 1.0333333333333334) internal successors, (124), 119 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:12:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2024-11-17 08:12:33,225 INFO L240 hiAutomatonCegarLoop]: Abstraction has 120 states and 124 transitions. [2024-11-17 08:12:33,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 08:12:33,226 INFO L425 stractBuchiCegarLoop]: Abstraction has 120 states and 124 transitions. [2024-11-17 08:12:33,227 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-17 08:12:33,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 124 transitions. [2024-11-17 08:12:33,228 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:12:33,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:12:33,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:12:33,228 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 11, 10, 10, 10, 10, 10, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:12:33,229 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:12:33,229 INFO L745 eck$LassoCheckResult]: Stem: 4340#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 4341#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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);assume { :begin_inline_init_nondet } true;init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;init_nondet_~x#1.base, init_nondet_~x#1.offset := init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;havoc init_nondet_~i~0#1;init_nondet_~i~0#1 := 0; 4366#L17 assume true; 4367#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 4368#L17 assume true; 4369#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 4427#L17 assume true; 4424#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 4419#L17 assume true; 4418#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 4416#L17 assume true; 4413#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 4411#L17 assume true; 4408#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 4405#L17 assume true; 4402#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 4399#L17 assume true; 4396#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 4393#L17 assume true; 4390#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 4387#L17 assume true; 4382#L17-1 assume !!(init_nondet_~i~0#1 < 10);havoc init_nondet_#t~nondet1#1;call write~int#1(init_nondet_#t~nondet1#1, init_nondet_~x#1.base, init_nondet_~x#1.offset + 4 * init_nondet_~i~0#1, 4);havoc init_nondet_#t~nondet1#1;init_nondet_#t~post2#1 := init_nondet_~i~0#1;init_nondet_~i~0#1 := 1 + init_nondet_#t~post2#1;havoc init_nondet_#t~post2#1; 4381#L17 assume true; 4373#L17-1 assume !(init_nondet_~i~0#1 < 10); 4364#init_nondet_returnLabel#1 assume true;havoc init_nondet_#t~nondet1#1, init_nondet_#t~post2#1, init_nondet_~x#1.base, init_nondet_~x#1.offset, init_nondet_~i~0#1;havoc init_nondet_#in~x#1.base, init_nondet_#in~x#1.offset;assume { :end_inline_init_nondet } true;havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 4365#L28-6 assume true; 4414#L28-8 assume !!(rangesum_~i~1#1 < 10); 4377#L29-2 assume !(rangesum_~i~1#1 > 5); 4357#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4358#L28-6 assume true; 4454#L28-8 assume !!(rangesum_~i~1#1 < 10); 4452#L29-2 assume !(rangesum_~i~1#1 > 5); 4359#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4353#L28-6 assume true; 4344#L28-8 assume !!(rangesum_~i~1#1 < 10); 4345#L29-2 assume !(rangesum_~i~1#1 > 5); 4378#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4450#L28-6 assume true; 4448#L28-8 assume !!(rangesum_~i~1#1 < 10); 4446#L29-2 assume !(rangesum_~i~1#1 > 5); 4444#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4442#L28-6 assume true; 4441#L28-8 assume !!(rangesum_~i~1#1 < 10); 4436#L29-2 assume !(rangesum_~i~1#1 > 5); 4435#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4433#L28-6 assume true; 4430#L28-8 assume !!(rangesum_~i~1#1 < 10); 4429#L29-2 assume !(rangesum_~i~1#1 > 5); 4422#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4428#L28-6 assume true; 4425#L28-8 assume !!(rangesum_~i~1#1 < 10); 4420#L29-2 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 4421#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4352#L28-6 assume true; 4342#L28-8 assume !!(rangesum_~i~1#1 < 10); 4343#L29-2 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 4410#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4407#L28-6 assume true; 4404#L28-8 assume !!(rangesum_~i~1#1 < 10); 4401#L29-2 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 4398#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4395#L28-6 assume true; 4392#L28-8 assume !!(rangesum_~i~1#1 < 10); 4389#L29-2 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 4386#L28-7 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4384#L28-6 assume true; 4380#L28-8 assume !(rangesum_~i~1#1 < 10); 4360#L34-2 assume 0 != rangesum_~cnt~0#1;rangesum_#res#1 := (if (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 <= 2147483647 then (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 else (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 - 4294967296); 4336#L37-2 assume true;main_#t~ret5#1 := rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;havoc rangesum_#in~x#1.base, rangesum_#in~x#1.offset;assume { :end_inline_rangesum } 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_rangesum } true;rangesum_#in~x#1.base, rangesum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;rangesum_~x#1.base, rangesum_~x#1.offset := rangesum_#in~x#1.base, rangesum_#in~x#1.offset;havoc rangesum_~i~1#1;havoc rangesum_~ret~0#1;rangesum_~ret~0#1 := 0;rangesum_~cnt~0#1 := 0;rangesum_~i~1#1 := 0; 4337#L28-3 assume true; 4426#L28-5 assume !!(rangesum_~i~1#1 < 10); 4423#L29-1 assume !(rangesum_~i~1#1 > 5); 4374#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4375#L28-3 assume true; 4455#L28-5 assume !!(rangesum_~i~1#1 < 10); 4453#L29-1 assume !(rangesum_~i~1#1 > 5); 4376#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4372#L28-3 assume true; 4362#L28-5 assume !!(rangesum_~i~1#1 < 10); 4348#L29-1 assume !(rangesum_~i~1#1 > 5); 4349#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4451#L28-3 assume true; 4449#L28-5 assume !!(rangesum_~i~1#1 < 10); 4447#L29-1 assume !(rangesum_~i~1#1 > 5); 4445#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4443#L28-3 assume true; 4440#L28-5 assume !!(rangesum_~i~1#1 < 10); 4439#L29-1 assume !(rangesum_~i~1#1 > 5); 4438#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4432#L28-3 assume true; 4437#L28-5 assume !!(rangesum_~i~1#1 < 10); 4434#L29-1 assume !(rangesum_~i~1#1 > 5); 4431#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4371#L28-3 assume true; 4361#L28-5 assume !!(rangesum_~i~1#1 < 10); 4346#L29-1 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 4347#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4417#L28-3 assume true; 4415#L28-5 assume !!(rangesum_~i~1#1 < 10); 4412#L29-1 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 4409#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4406#L28-3 assume true; 4403#L28-5 assume !!(rangesum_~i~1#1 < 10); 4400#L29-1 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 4397#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4394#L28-3 assume true; 4391#L28-5 assume !!(rangesum_~i~1#1 < 10); 4388#L29-1 assume rangesum_~i~1#1 > 5;call rangesum_#t~mem3#1 := read~int#1(rangesum_~x#1.base, rangesum_~x#1.offset + 4 * rangesum_~i~1#1, 4);rangesum_~ret~0#1 := rangesum_~ret~0#1 + rangesum_#t~mem3#1;havoc rangesum_#t~mem3#1;rangesum_~cnt~0#1 := 1 + rangesum_~cnt~0#1; 4385#L28-4 rangesum_#t~post4#1 := rangesum_~i~1#1;rangesum_~i~1#1 := 1 + rangesum_#t~post4#1;havoc rangesum_#t~post4#1; 4383#L28-3 assume true; 4379#L28-5 assume !(rangesum_~i~1#1 < 10); 4370#L34-1 assume 0 != rangesum_~cnt~0#1;rangesum_#res#1 := (if (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 <= 2147483647 then (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 else (if rangesum_~ret~0#1 < 0 && 0 != rangesum_~ret~0#1 % rangesum_~cnt~0#1 then (if rangesum_~cnt~0#1 < 0 then rangesum_~ret~0#1 / rangesum_~cnt~0#1 - 1 else 1 + rangesum_~ret~0#1 / rangesum_~cnt~0#1) else rangesum_~ret~0#1 / rangesum_~cnt~0#1) % 4294967296 - 4294967296); 4363#L37-1 assume true;main_#t~ret8#1 := rangesum_#res#1;havoc rangesum_#t~mem3#1, rangesum_#t~post4#1, rangesum_~x#1.base, rangesum_~x#1.offset, rangesum_~i~1#1, rangesum_~ret~0#1, rangesum_~cnt~0#1;havoc rangesum_#in~x#1.base, rangesum_#in~x#1.offset;assume { :end_inline_rangesum } 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; 4354#L54-1 [2024-11-17 08:12:33,229 INFO L747 eck$LassoCheckResult]: Loop: 4354#L54-1 assume true; 4355#L54-2 assume !!(main_~i~2#1 < 9);call main_#t~mem10#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int#1(main_#t~mem10#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem10#1;main_#t~post11#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 4354#L54-1 [2024-11-17 08:12:33,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:33,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1610536571, now seen corresponding path program 1 times [2024-11-17 08:12:33,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:33,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503110915] [2024-11-17 08:12:33,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:33,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 08:12:33,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [851327172] [2024-11-17 08:12:33,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:33,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:12:33,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:33,301 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:12:33,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2024-11-17 08:12:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:33,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:33,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:33,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:33,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1792, now seen corresponding path program 1 times [2024-11-17 08:12:33,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:33,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264804084] [2024-11-17 08:12:33,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:33,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:33,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:33,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:12:33,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:12:33,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1537417340, now seen corresponding path program 1 times [2024-11-17 08:12:33,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:12:33,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589284482] [2024-11-17 08:12:33,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:33,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:12:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-17 08:12:33,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [133256702] [2024-11-17 08:12:33,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:12:33,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:12:33,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:12:33,617 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:12:33,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2024-11-17 08:12:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:33,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:12:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:12:33,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:13:01,832 WARN L286 SmtUtils]: Spent 27.90s on a formula simplification. DAG size of input: 515 DAG size of output: 386 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-17 08:13:19,869 WARN L286 SmtUtils]: Spent 12.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-17 08:13:35,810 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-17 08:13:51,370 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)