./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted/4BitCounterPointer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:00:44,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:00:44,346 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-17 08:00:44,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:00:44,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:00:44,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:00:44,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:00:44,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:00:44,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:00:44,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:00:44,379 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:00:44,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:00:44,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:00:44,380 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:00:44,380 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:00:44,380 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:00:44,380 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:00:44,380 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:00:44,380 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:00:44,381 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:00:44,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:00:44,382 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:00:44,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:00:44,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:00:44,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:00:44,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:00:44,383 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:00:44,383 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:00:44,383 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:00:44,383 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:00:44,384 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:00:44,384 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:00:44,384 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:00:44,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:00:44,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:00:44,385 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:00:44,385 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:00:44,385 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 [2024-11-17 08:00:44,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:00:44,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:00:44,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:00:44,599 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:00:44,599 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:00:44,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2024-11-17 08:00:45,796 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:00:45,915 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:00:45,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2024-11-17 08:00:45,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e701dfbec/7716719f49774272ba80a9b6c11891e9/FLAG2c9215c9a [2024-11-17 08:00:45,930 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e701dfbec/7716719f49774272ba80a9b6c11891e9 [2024-11-17 08:00:45,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:00:45,935 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:00:45,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:00:45,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:00:45,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:00:45,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:00:45" (1/1) ... [2024-11-17 08:00:45,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50299990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:00:45, skipping insertion in model container [2024-11-17 08:00:45,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:00:45" (1/1) ... [2024-11-17 08:00:45,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:00:46,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:00:46,097 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:00:46,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:00:46,119 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:00:46,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:00:46 WrapperNode [2024-11-17 08:00:46,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:00:46,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:00:46,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:00:46,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:00:46,126 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:00:46" (1/1) ... [2024-11-17 08:00:46,131 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:00:46" (1/1) ... [2024-11-17 08:00:46,144 INFO L138 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2024-11-17 08:00:46,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:00:46,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:00:46,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:00:46,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:00:46,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:00:46" (1/1) ... [2024-11-17 08:00:46,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:00:46" (1/1) ... [2024-11-17 08:00:46,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:00:46" (1/1) ... [2024-11-17 08:00:46,168 INFO L175 MemorySlicer]: Split 15 memory accesses to 4 slices as follows [4, 4, 4, 3]. 27 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 11 writes are split as follows [3, 3, 3, 2]. [2024-11-17 08:00:46,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:00:46" (1/1) ... [2024-11-17 08:00:46,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:00:46" (1/1) ... [2024-11-17 08:00:46,172 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:00:46" (1/1) ... [2024-11-17 08:00:46,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:00:46" (1/1) ... [2024-11-17 08:00:46,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:00:46" (1/1) ... [2024-11-17 08:00:46,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:00:46" (1/1) ... [2024-11-17 08:00:46,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:00:46,178 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:00:46,179 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:00:46,179 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:00:46,179 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:00:46" (1/1) ... [2024-11-17 08:00:46,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:46,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:46,203 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:00:46,208 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:00:46,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 08:00:46,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 08:00:46,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 08:00:46,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-17 08:00:46,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:00:46,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:00:46,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 08:00:46,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 08:00:46,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 08:00:46,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-17 08:00:46,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 08:00:46,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 08:00:46,296 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:00:46,298 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:00:46,418 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L7: call ULTIMATE.dealloc(main_#t~malloc0#1.base, main_#t~malloc0#1.offset);havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call ULTIMATE.dealloc(main_#t~malloc1#1.base, main_#t~malloc1#1.offset);havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call ULTIMATE.dealloc(main_#t~malloc2#1.base, main_#t~malloc2#1.offset);havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call ULTIMATE.dealloc(main_#t~malloc3#1.base, main_#t~malloc3#1.offset);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; [2024-11-17 08:00:46,431 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-17 08:00:46,431 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:00:46,443 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:00:46,443 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:00:46,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:00:46 BoogieIcfgContainer [2024-11-17 08:00:46,444 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:00:46,444 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:00:46,444 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:00:46,447 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:00:46,448 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:00:46,448 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:00:45" (1/3) ... [2024-11-17 08:00:46,448 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70ab944c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:00:46, skipping insertion in model container [2024-11-17 08:00:46,448 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:00:46,448 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:00:46" (2/3) ... [2024-11-17 08:00:46,449 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@70ab944c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:00:46, skipping insertion in model container [2024-11-17 08:00:46,449 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:00:46,449 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:00:46" (3/3) ... [2024-11-17 08:00:46,450 INFO L332 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2024-11-17 08:00:46,488 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:00:46,488 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:00:46,488 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:00:46,488 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:00:46,488 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:00:46,488 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:00:46,489 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:00:46,489 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:00:46,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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:00:46,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-17 08:00:46,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:00:46,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:00:46,506 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:00:46,506 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:00:46,506 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:00:46,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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:00:46,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-17 08:00:46,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:00:46,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:00:46,508 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:00:46,508 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:00:46,511 INFO L745 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 7#L15true [2024-11-17 08:00:46,511 INFO L747 eck$LassoCheckResult]: Loop: 7#L15true assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 9#L15-1true assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 2#L16true assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 7#L15true [2024-11-17 08:00:46,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:46,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1504, now seen corresponding path program 1 times [2024-11-17 08:00:46,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:46,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19008341] [2024-11-17 08:00:46,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:46,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:46,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:00:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:46,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:00:46,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:46,740 INFO L85 PathProgramCache]: Analyzing trace with hash 43652, now seen corresponding path program 1 times [2024-11-17 08:00:46,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:46,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290958799] [2024-11-17 08:00:46,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:46,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:46,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:00:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:46,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:00:46,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:46,801 INFO L85 PathProgramCache]: Analyzing trace with hash 44819525, now seen corresponding path program 1 times [2024-11-17 08:00:46,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:46,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082080907] [2024-11-17 08:00:46,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:46,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:46,865 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:00:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:46,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:00:47,577 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:00:47,578 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:00:47,578 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:00:47,578 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:00:47,578 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:00:47,578 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:47,578 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:00:47,579 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:00:47,579 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2024-11-17 08:00:47,579 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:00:47,579 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:00:47,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:47,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:47,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:47,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:47,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:48,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:48,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:48,303 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:00:48,306 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:00:48,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:48,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:48,309 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:00:48,310 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:00:48,312 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:00:48,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:48,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:00:48,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:48,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:48,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:48,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:00:48,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:00:48,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:48,345 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:00:48,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:48,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:48,348 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:00:48,349 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:00:48,350 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:00:48,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:48,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:00:48,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:48,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:48,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:48,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:00:48,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:00:48,365 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:48,375 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:00:48,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:48,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:48,377 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:00:48,378 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:00:48,383 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:00:48,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:48,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:00:48,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:48,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:48,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:48,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:00:48,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:00:48,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:48,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:48,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:48,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:48,407 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:00:48,408 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:00:48,409 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:00:48,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:48,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:48,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:48,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:48,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:48,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:48,425 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:48,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:48,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:48,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:48,438 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:00:48,439 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:00:48,441 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:00:48,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:48,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:48,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:48,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:48,453 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:48,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:48,457 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:48,467 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:00:48,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:48,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:48,469 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:00:48,470 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:00:48,472 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:00:48,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:48,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:48,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:48,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:48,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:48,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:48,488 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:48,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:48,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:48,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:48,500 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:00:48,500 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:00:48,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:00:48,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:48,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:48,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:48,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:48,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:48,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:48,515 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:48,525 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:00:48,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:48,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:48,527 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:00:48,528 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:00:48,529 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:00:48,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:48,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:48,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:48,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:48,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:48,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:48,547 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:48,557 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:00:48,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:48,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:48,559 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:00:48,560 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:00:48,561 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:00:48,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:48,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:48,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:48,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:48,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:48,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:48,578 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:48,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:48,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:48,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:48,590 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:00:48,591 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:00:48,592 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:00:48,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:48,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:48,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:48,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:48,607 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:48,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:48,615 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:48,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:48,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:48,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:48,627 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:00:48,628 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:00:48,629 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:00:48,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:48,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:48,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:48,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:48,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:48,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:48,643 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:48,655 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:00:48,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:48,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:48,656 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:00:48,657 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:00:48,658 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:00:48,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:48,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:48,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:48,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:48,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:48,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:48,676 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:00:48,688 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-11-17 08:00:48,688 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-11-17 08:00:48,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:48,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:48,709 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:00:48,711 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:00:48,716 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:00:48,730 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:00:48,731 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:00:48,731 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1) = -2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1 + 1 Supporting invariants [] [2024-11-17 08:00:48,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:48,789 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:00:48,835 INFO L156 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2024-11-17 08:00:48,843 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-17 08:00:48,844 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-17 08:00:48,844 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2024-11-17 08:00:48,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:00:48,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:00:48,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:00:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:00:48,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:00:48,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:00:48,916 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:00:48,940 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:00:48,942 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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:00:48,980 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Result 25 states and 33 transitions. Complement of second has 8 states. [2024-11-17 08:00:48,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:00:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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:00:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2024-11-17 08:00:48,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 3 letters. [2024-11-17 08:00:48,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:00:48,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2024-11-17 08:00:48,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:00:48,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 6 letters. [2024-11-17 08:00:48,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:00:48,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2024-11-17 08:00:48,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-17 08:00:48,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 13 states and 18 transitions. [2024-11-17 08:00:48,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-17 08:00:48,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-17 08:00:48,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2024-11-17 08:00:48,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:00:48,994 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-17 08:00:49,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2024-11-17 08:00:49,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-17 08:00:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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:00:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2024-11-17 08:00:49,010 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-17 08:00:49,010 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-17 08:00:49,010 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:00:49,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2024-11-17 08:00:49,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-17 08:00:49,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:00:49,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:00:49,011 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-17 08:00:49,011 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:00:49,011 INFO L745 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 199#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 200#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 204#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 194#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 195#L20 [2024-11-17 08:00:49,012 INFO L747 eck$LassoCheckResult]: Loop: 195#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 201#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 202#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 206#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 195#L20 [2024-11-17 08:00:49,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:49,012 INFO L85 PathProgramCache]: Analyzing trace with hash 44819530, now seen corresponding path program 1 times [2024-11-17 08:00:49,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:49,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27356024] [2024-11-17 08:00:49,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:49,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:00:49,126 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:00:49,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:00:49,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27356024] [2024-11-17 08:00:49,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27356024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:00:49,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:00:49,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:00:49,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078516547] [2024-11-17 08:00:49,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:00:49,129 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:00:49,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:49,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1086342, now seen corresponding path program 1 times [2024-11-17 08:00:49,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:49,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374640991] [2024-11-17 08:00:49,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:49,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:49,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:00:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:49,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:00:49,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:00:49,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:00:49,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:00:49,243 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:00:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:00:49,262 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-11-17 08:00:49,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2024-11-17 08:00:49,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-17 08:00:49,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 22 transitions. [2024-11-17 08:00:49,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-17 08:00:49,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-17 08:00:49,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2024-11-17 08:00:49,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:00:49,265 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-17 08:00:49,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2024-11-17 08:00:49,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-11-17 08:00:49,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:00:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-11-17 08:00:49,267 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-17 08:00:49,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:00:49,268 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-17 08:00:49,268 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:00:49,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2024-11-17 08:00:49,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-17 08:00:49,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:00:49,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:00:49,270 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2024-11-17 08:00:49,270 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2024-11-17 08:00:49,270 INFO L745 eck$LassoCheckResult]: Stem: 240#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 241#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 242#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 244#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 238#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 239#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 245#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 246#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 247#L20 [2024-11-17 08:00:49,270 INFO L747 eck$LassoCheckResult]: Loop: 247#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 248#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 250#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 236#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 237#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 243#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 251#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 247#L20 [2024-11-17 08:00:49,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:49,271 INFO L85 PathProgramCache]: Analyzing trace with hash -516345915, now seen corresponding path program 1 times [2024-11-17 08:00:49,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:49,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410447901] [2024-11-17 08:00:49,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:49,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:49,296 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:00:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:49,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:00:49,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:49,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1996658935, now seen corresponding path program 1 times [2024-11-17 08:00:49,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:49,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192626989] [2024-11-17 08:00:49,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:49,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:49,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:00:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:49,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:00:49,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:49,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1699197637, now seen corresponding path program 1 times [2024-11-17 08:00:49,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:49,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56907238] [2024-11-17 08:00:49,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:49,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:49,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:00:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:49,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:00:50,536 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:00:50,536 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:00:50,537 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:00:50,537 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:00:50,537 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:00:50,537 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:50,537 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:00:50,537 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:00:50,537 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration3_Lasso [2024-11-17 08:00:50,537 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:00:50,537 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:00:50,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:50,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:50,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:50,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:50,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:51,214 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:00:51,215 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:00:51,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:51,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:51,216 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:00:51,217 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:00:51,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:00:51,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:51,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:00:51,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:51,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:51,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:51,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:00:51,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:00:51,230 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:51,240 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:00:51,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:51,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:51,242 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:00:51,244 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:00:51,245 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:00:51,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:51,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:00:51,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:51,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:51,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:51,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:00:51,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:00:51,256 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:51,266 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:00:51,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:51,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:51,268 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:00:51,269 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:00:51,270 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:00:51,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:51,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:00:51,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:51,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:51,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:51,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:00:51,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:00:51,281 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:51,291 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:00:51,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:51,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:51,292 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:00:51,293 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:00:51,293 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:00:51,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:51,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:51,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:51,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:51,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:51,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:51,306 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:51,315 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:00:51,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:51,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:51,317 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:00:51,318 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:00:51,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:00:51,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:51,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:51,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:51,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:51,329 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:51,330 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:51,332 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:51,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:51,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:51,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:51,343 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:00:51,344 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:00:51,345 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:00:51,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:51,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:51,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:51,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:51,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:51,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:51,360 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:51,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:51,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:51,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:51,372 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:00:51,373 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:00:51,373 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:00:51,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:51,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:51,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:51,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:51,384 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:51,384 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:51,386 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:51,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:51,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:51,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:51,398 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:00:51,398 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:00:51,399 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:00:51,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:51,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:51,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:51,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:51,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:51,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:51,415 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:51,424 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:00:51,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:51,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:51,425 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:00:51,426 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:00:51,427 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:00:51,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:51,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:51,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:51,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:51,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:51,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:51,442 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:51,452 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:00:51,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:51,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:51,453 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:00:51,454 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:00:51,454 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:00:51,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:51,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:51,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:51,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:51,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:51,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:51,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:51,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:51,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:51,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:51,481 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:00:51,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-17 08:00:51,482 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:00:51,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:51,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:51,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:51,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:51,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:51,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:51,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:51,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:51,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:51,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:51,509 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:00:51,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-17 08:00:51,512 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:00:51,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:51,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:51,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:51,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:51,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:51,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:51,527 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:51,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:51,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:51,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:51,538 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:00:51,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-17 08:00:51,540 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:00:51,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:51,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:51,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:51,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:51,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:51,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:51,558 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:00:51,570 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-11-17 08:00:51,570 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-17 08:00:51,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:51,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:51,572 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:00:51,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-17 08:00:51,574 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:00:51,584 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:00:51,584 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:00:51,584 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem6#1) = -2*ULTIMATE.start_main_#t~mem6#1 + 1 Supporting invariants [] [2024-11-17 08:00:51,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-17 08:00:51,674 INFO L156 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2024-11-17 08:00:51,675 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem6 [2024-11-17 08:00:51,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:00:51,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:00:51,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:00:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:00:51,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 08:00:51,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:00:51,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 08:00:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 08:00:51,773 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:00:51,773 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:00:51,782 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 31 states and 41 transitions. Complement of second has 5 states. [2024-11-17 08:00:51,783 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:00:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:00:51,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-11-17 08:00:51,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 7 letters. [2024-11-17 08:00:51,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:00:51,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 15 letters. Loop has 7 letters. [2024-11-17 08:00:51,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:00:51,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 14 letters. [2024-11-17 08:00:51,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:00:51,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2024-11-17 08:00:51,785 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-17 08:00:51,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 41 transitions. [2024-11-17 08:00:51,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-17 08:00:51,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-17 08:00:51,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2024-11-17 08:00:51,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:00:51,786 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-11-17 08:00:51,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2024-11-17 08:00:51,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-17 08:00:51,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 26 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:00:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-11-17 08:00:51,788 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-11-17 08:00:51,788 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-11-17 08:00:51,788 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:00:51,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2024-11-17 08:00:51,789 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-17 08:00:51,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:00:51,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:00:51,789 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-17 08:00:51,789 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:00:51,789 INFO L745 eck$LassoCheckResult]: Stem: 496#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 497#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 498#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 500#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 494#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 495#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 501#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 513#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 512#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 493#L15 [2024-11-17 08:00:51,789 INFO L747 eck$LassoCheckResult]: Loop: 493#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 499#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 492#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 493#L15 [2024-11-17 08:00:51,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:51,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1173145824, now seen corresponding path program 2 times [2024-11-17 08:00:51,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:51,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827024562] [2024-11-17 08:00:51,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:51,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:51,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:00:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:51,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:00:51,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:51,837 INFO L85 PathProgramCache]: Analyzing trace with hash 43652, now seen corresponding path program 2 times [2024-11-17 08:00:51,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:51,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103602220] [2024-11-17 08:00:51,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:51,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:51,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:00:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:51,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-17 08:00:51,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:00:51,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:51,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1038369093, now seen corresponding path program 3 times [2024-11-17 08:00:51,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:51,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494468515] [2024-11-17 08:00:51,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:51,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:51,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:00:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:51,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:00:53,128 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:00:53,129 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:00:53,129 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:00:53,129 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:00:53,129 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:00:53,129 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:53,129 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:00:53,129 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:00:53,129 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration4_Lasso [2024-11-17 08:00:53,129 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:00:53,129 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:00:53,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:53,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:53,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:53,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:53,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:53,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:53,653 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:00:53,653 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:00:53,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:53,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:53,655 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:00:53,656 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:00:53,657 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:00:53,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:53,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:00:53,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:53,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:53,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:53,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:00:53,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:00:53,668 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:53,678 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:00:53,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:53,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:53,679 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:00:53,679 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:00:53,680 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:00:53,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:53,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:00:53,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:53,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:53,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:53,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:00:53,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:00:53,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:53,700 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:00:53,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:53,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:53,701 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:00:53,703 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:00:53,704 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:00:53,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:53,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:00:53,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:53,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:53,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:53,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:00:53,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:00:53,713 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:53,723 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:00:53,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:53,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:53,724 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:00:53,725 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:00:53,727 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:00:53,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:53,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:00:53,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:53,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:53,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:53,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:00:53,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:00:53,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:53,749 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:00:53,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:53,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:53,750 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:00:53,751 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:00:53,752 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:00:53,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:53,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:00:53,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:53,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:53,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:53,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:00:53,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:00:53,763 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:53,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:53,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:53,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:53,774 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:00:53,775 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:00:53,775 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:00:53,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:53,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:53,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:53,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:53,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:53,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:53,788 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:53,797 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:00:53,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:53,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:53,799 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:00:53,800 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:00:53,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:00:53,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:53,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:53,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:53,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:53,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:53,812 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:53,814 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:53,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:53,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:53,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:53,825 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:00:53,827 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:00:53,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:00:53,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:53,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:53,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:53,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:53,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:53,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:53,848 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:53,858 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:00:53,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:53,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:53,859 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:00:53,860 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:00:53,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:00:53,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:53,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:53,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:53,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:53,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:53,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:53,873 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:53,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-17 08:00:53,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:53,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:53,884 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:00:53,884 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:00:53,885 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:00:53,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:53,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:53,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:53,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:53,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:53,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:53,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:53,912 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:00:53,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:53,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:53,914 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:00:53,915 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:00:53,915 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:00:53,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:53,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:53,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:53,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:53,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:53,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:53,928 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:53,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:53,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:53,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:53,939 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:00:53,940 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:00:53,941 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:00:53,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:53,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:53,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:53,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:53,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:53,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:53,954 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:53,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:53,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:53,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:53,965 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:00:53,966 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:00:53,966 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:00:53,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:53,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:53,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:53,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:53,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:53,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:53,982 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:53,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-11-17 08:00:53,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:53,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:53,994 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:00:53,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-17 08:00:53,996 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:00:54,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:54,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:54,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:54,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:54,007 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:54,007 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:54,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:54,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-11-17 08:00:54,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:54,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:54,021 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:00:54,022 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:00:54,023 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:00:54,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:54,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:54,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:54,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:54,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:54,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:54,039 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:54,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-11-17 08:00:54,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:54,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:54,051 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:00:54,052 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:00:54,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:00:54,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:54,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:54,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:54,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:54,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:54,063 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:54,066 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:54,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-11-17 08:00:54,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:54,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:54,077 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:00:54,078 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:00:54,078 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:00:54,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:54,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:54,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:54,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:54,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:54,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:54,092 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:54,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-17 08:00:54,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:54,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:54,103 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:00:54,104 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:00:54,105 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:00:54,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:54,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:54,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:54,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:54,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:54,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:54,119 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:00:54,123 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-17 08:00:54,123 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-11-17 08:00:54,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:54,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:54,124 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:00:54,125 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:00:54,126 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:00:54,136 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:00:54,136 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:00:54,136 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_3) = -2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_3 + 1 Supporting invariants [] [2024-11-17 08:00:54,146 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:00:54,204 INFO L156 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2024-11-17 08:00:54,205 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-17 08:00:54,205 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-17 08:00:54,205 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2024-11-17 08:00:54,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:00:54,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:00:54,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:00:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:00:54,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:00:54,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:00:54,254 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:00:54,254 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:00:54,254 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 36 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:00:54,266 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 36 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 61 states and 76 transitions. Complement of second has 7 states. [2024-11-17 08:00:54,267 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:00:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:00:54,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-17 08:00:54,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 3 letters. [2024-11-17 08:00:54,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:00:54,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 12 letters. Loop has 3 letters. [2024-11-17 08:00:54,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:00:54,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 6 letters. [2024-11-17 08:00:54,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:00:54,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. [2024-11-17 08:00:54,269 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2024-11-17 08:00:54,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 51 states and 64 transitions. [2024-11-17 08:00:54,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-11-17 08:00:54,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-17 08:00:54,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 64 transitions. [2024-11-17 08:00:54,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:00:54,271 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 64 transitions. [2024-11-17 08:00:54,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 64 transitions. [2024-11-17 08:00:54,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2024-11-17 08:00:54,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 46 states have internal predecessors, (60), 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:00:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2024-11-17 08:00:54,275 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 60 transitions. [2024-11-17 08:00:54,275 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2024-11-17 08:00:54,275 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:00:54,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 60 transitions. [2024-11-17 08:00:54,275 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2024-11-17 08:00:54,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:00:54,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:00:54,276 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-17 08:00:54,276 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2024-11-17 08:00:54,276 INFO L745 eck$LassoCheckResult]: Stem: 779#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 780#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 781#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 808#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 777#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 778#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 807#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 806#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 804#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 805#L24 [2024-11-17 08:00:54,276 INFO L747 eck$LassoCheckResult]: Loop: 805#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 817#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 816#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 815#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 810#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 814#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 809#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 811#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 805#L24 [2024-11-17 08:00:54,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:54,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1173145827, now seen corresponding path program 1 times [2024-11-17 08:00:54,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:54,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709851455] [2024-11-17 08:00:54,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:54,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:00:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 08:00:54,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:00:54,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709851455] [2024-11-17 08:00:54,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709851455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:00:54,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:00:54,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:00:54,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760602825] [2024-11-17 08:00:54,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:00:54,359 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:00:54,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:54,360 INFO L85 PathProgramCache]: Analyzing trace with hash -24074498, now seen corresponding path program 1 times [2024-11-17 08:00:54,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:54,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040750409] [2024-11-17 08:00:54,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:54,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:54,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:00:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:54,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:00:54,437 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:00:54,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:00:54,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:00:54,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:00:54,580 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. cyclomatic complexity: 20 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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:00:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:00:54,590 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2024-11-17 08:00:54,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2024-11-17 08:00:54,591 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-17 08:00:54,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2024-11-17 08:00:54,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-17 08:00:54,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-17 08:00:54,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2024-11-17 08:00:54,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:00:54,592 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-17 08:00:54,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2024-11-17 08:00:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-17 08:00:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 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:00:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2024-11-17 08:00:54,594 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-17 08:00:54,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:00:54,595 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-17 08:00:54,595 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:00:54,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2024-11-17 08:00:54,595 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-17 08:00:54,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:00:54,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:00:54,596 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 1, 1] [2024-11-17 08:00:54,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:00:54,596 INFO L745 eck$LassoCheckResult]: Stem: 875#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 876#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 877#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 901#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 902#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 900#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 898#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 895#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 881#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 879#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 880#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 873#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 874#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 905#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 888#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 882#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 872#L15 [2024-11-17 08:00:54,596 INFO L747 eck$LassoCheckResult]: Loop: 872#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 878#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 871#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 872#L15 [2024-11-17 08:00:54,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:54,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1135519200, now seen corresponding path program 4 times [2024-11-17 08:00:54,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:54,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487182119] [2024-11-17 08:00:54,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:54,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:00:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 08:00:54,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:00:54,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487182119] [2024-11-17 08:00:54,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487182119] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:00:54,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549155641] [2024-11-17 08:00:54,693 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 08:00:54,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:00:54,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:54,695 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:00:54,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2024-11-17 08:00:54,755 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 08:00:54,755 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:00:54,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:00:54,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:00:54,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 08:00:54,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-17 08:00:54,782 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 08:00:54,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 08:00:54,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549155641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:00:54,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 08:00:54,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-17 08:00:54,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269752487] [2024-11-17 08:00:54,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:00:54,783 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:00:54,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:54,784 INFO L85 PathProgramCache]: Analyzing trace with hash 43652, now seen corresponding path program 3 times [2024-11-17 08:00:54,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:54,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808597386] [2024-11-17 08:00:54,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:54,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:54,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:00:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:54,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:00:54,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:00:54,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:00:54,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 08:00:54,832 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 14 Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:00:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:00:54,852 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-11-17 08:00:54,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2024-11-17 08:00:54,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-17 08:00:54,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2024-11-17 08:00:54,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-17 08:00:54,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-17 08:00:54,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2024-11-17 08:00:54,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:00:54,854 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-11-17 08:00:54,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2024-11-17 08:00:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-11-17 08:00:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 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:00:54,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-17 08:00:54,858 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-17 08:00:54,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:00:54,859 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-17 08:00:54,860 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:00:54,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2024-11-17 08:00:54,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-17 08:00:54,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:00:54,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:00:54,861 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1] [2024-11-17 08:00:54,861 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2024-11-17 08:00:54,862 INFO L745 eck$LassoCheckResult]: Stem: 1004#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1005#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1006#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1016#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1025#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1022#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1023#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1017#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1012#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1008#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1009#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1002#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1003#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1021#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1018#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1015#L20 [2024-11-17 08:00:54,862 INFO L747 eck$LassoCheckResult]: Loop: 1015#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1013#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1014#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1010#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1011#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1024#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1019#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1020#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1026#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1028#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1027#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1000#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1001#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1007#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1029#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1015#L20 [2024-11-17 08:00:54,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:54,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1699197637, now seen corresponding path program 5 times [2024-11-17 08:00:54,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:54,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690373759] [2024-11-17 08:00:54,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:54,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:54,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:00:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:54,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:00:54,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:54,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1776752198, now seen corresponding path program 1 times [2024-11-17 08:00:54,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:54,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358802348] [2024-11-17 08:00:54,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:54,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:54,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:00:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:54,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:00:54,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:54,908 INFO L85 PathProgramCache]: Analyzing trace with hash 229835522, now seen corresponding path program 1 times [2024-11-17 08:00:54,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:54,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632569324] [2024-11-17 08:00:54,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:54,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:54,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:00:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:54,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:00:56,606 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:00:56,607 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:00:56,607 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:00:56,607 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:00:56,607 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:00:56,607 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:56,607 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:00:56,607 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:00:56,607 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration7_Lasso [2024-11-17 08:00:56,607 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:00:56,607 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:00:56,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:56,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:56,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:56,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:57,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:00:57,324 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:00:57,324 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:00:57,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:57,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:57,326 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:00:57,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-17 08:00:57,327 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:00:57,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:57,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:00:57,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:57,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:57,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:57,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:00:57,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:00:57,340 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:57,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:57,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:57,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:57,351 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:00:57,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-17 08:00:57,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:00:57,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:57,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:00:57,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:57,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:57,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:57,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:00:57,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:00:57,363 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:57,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:57,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:57,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:57,375 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:00:57,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-17 08:00:57,376 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:00:57,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:57,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:00:57,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:57,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:57,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:57,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:00:57,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:00:57,387 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:57,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-11-17 08:00:57,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:57,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:57,397 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:00:57,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-17 08:00:57,399 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:00:57,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:57,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:57,409 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:00:57,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:57,415 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-17 08:00:57,415 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-17 08:00:57,427 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:57,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:57,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:57,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:57,438 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:00:57,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-17 08:00:57,439 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:00:57,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:57,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:57,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:57,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:57,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:57,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:57,455 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:57,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:57,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:57,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:57,465 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:00:57,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-17 08:00:57,466 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:00:57,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:57,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:57,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:57,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:57,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:57,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:57,481 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:57,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:57,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:57,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:57,492 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:00:57,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-11-17 08:00:57,493 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:00:57,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:57,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:57,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:57,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:57,506 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:57,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:57,513 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:00:57,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:57,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:57,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:57,524 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:00:57,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-11-17 08:00:57,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:00:57,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:00:57,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:00:57,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:00:57,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:00:57,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:00:57,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:00:57,539 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:00:57,544 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-17 08:00:57,544 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-11-17 08:00:57,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:00:57,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:57,545 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:00:57,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-11-17 08:00:57,550 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:00:57,560 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:00:57,561 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:00:57,561 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4) = -2*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4 + 1 Supporting invariants [] [2024-11-17 08:00:57,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-11-17 08:00:57,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-11-17 08:00:57,666 INFO L156 tatePredicateManager]: 38 out of 38 supporting invariants were superfluous and have been removed [2024-11-17 08:00:57,667 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-17 08:00:57,668 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-17 08:00:57,668 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x2~0!base,]]] [2024-11-17 08:00:57,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:00:57,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:00:57,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:00:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:00:57,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:00:57,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:00:57,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-17 08:00:57,786 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-17 08:00:57,786 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:00:57,786 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 35 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:00:57,802 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 35 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 65 states and 77 transitions. Complement of second has 7 states. [2024-11-17 08:00:57,803 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:00:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:00:57,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-11-17 08:00:57,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 15 letters. [2024-11-17 08:00:57,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:00:57,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 30 letters. Loop has 15 letters. [2024-11-17 08:00:57,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:00:57,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 30 letters. [2024-11-17 08:00:57,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:00:57,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 77 transitions. [2024-11-17 08:00:57,805 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2024-11-17 08:00:57,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 77 transitions. [2024-11-17 08:00:57,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-17 08:00:57,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-11-17 08:00:57,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 77 transitions. [2024-11-17 08:00:57,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:00:57,805 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2024-11-17 08:00:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 77 transitions. [2024-11-17 08:00:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-17 08:00:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 64 states have internal predecessors, (77), 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:00:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2024-11-17 08:00:57,808 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2024-11-17 08:00:57,809 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 77 transitions. [2024-11-17 08:00:57,809 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:00:57,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 77 transitions. [2024-11-17 08:00:57,809 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2024-11-17 08:00:57,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:00:57,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:00:57,810 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2024-11-17 08:00:57,810 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2024-11-17 08:00:57,811 INFO L745 eck$LassoCheckResult]: Stem: 1365#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1366#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1367#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1407#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1408#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1406#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1405#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1404#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1403#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1369#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1370#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1363#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1364#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1413#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1393#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1394#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1377#L24 assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1378#L15 [2024-11-17 08:00:57,811 INFO L747 eck$LassoCheckResult]: Loop: 1378#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1414#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1412#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1410#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1411#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1409#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1373#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1374#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1371#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1372#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1416#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1417#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1415#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1389#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1390#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1378#L15 [2024-11-17 08:00:57,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:57,811 INFO L85 PathProgramCache]: Analyzing trace with hash 841356932, now seen corresponding path program 1 times [2024-11-17 08:00:57,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:57,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925992552] [2024-11-17 08:00:57,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:57,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:00:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-17 08:00:57,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:00:57,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925992552] [2024-11-17 08:00:57,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925992552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:00:57,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:00:57,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:00:57,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952131825] [2024-11-17 08:00:57,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:00:57,890 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:00:57,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:57,890 INFO L85 PathProgramCache]: Analyzing trace with hash -624921022, now seen corresponding path program 2 times [2024-11-17 08:00:57,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:57,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800338451] [2024-11-17 08:00:57,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:57,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:57,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:00:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:57,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:00:58,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:00:58,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:00:58,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:00:58,249 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. cyclomatic complexity: 19 Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:00:58,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:00:58,261 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2024-11-17 08:00:58,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 97 transitions. [2024-11-17 08:00:58,262 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2024-11-17 08:00:58,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 76 states and 88 transitions. [2024-11-17 08:00:58,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-11-17 08:00:58,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-11-17 08:00:58,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 88 transitions. [2024-11-17 08:00:58,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:00:58,263 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 88 transitions. [2024-11-17 08:00:58,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 88 transitions. [2024-11-17 08:00:58,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-11-17 08:00:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.162162162162162) internal successors, (86), 73 states have internal predecessors, (86), 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:00:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2024-11-17 08:00:58,266 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-11-17 08:00:58,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:00:58,268 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-11-17 08:00:58,268 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-17 08:00:58,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 86 transitions. [2024-11-17 08:00:58,269 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2024-11-17 08:00:58,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:00:58,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:00:58,269 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1, 1, 1, 1, 1] [2024-11-17 08:00:58,270 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:00:58,270 INFO L745 eck$LassoCheckResult]: Stem: 1523#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1524#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1525#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1531#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1521#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1522#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1555#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1557#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1556#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1528#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1529#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1553#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1552#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1551#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1546#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1539#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1537#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1538#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1545#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1567#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1561#L15 [2024-11-17 08:00:58,270 INFO L747 eck$LassoCheckResult]: Loop: 1561#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1565#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1560#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1561#L15 [2024-11-17 08:00:58,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:58,270 INFO L85 PathProgramCache]: Analyzing trace with hash -564794174, now seen corresponding path program 2 times [2024-11-17 08:00:58,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:58,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46224150] [2024-11-17 08:00:58,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:58,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:58,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:00:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:58,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:00:58,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:58,292 INFO L85 PathProgramCache]: Analyzing trace with hash 43652, now seen corresponding path program 4 times [2024-11-17 08:00:58,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:58,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402922158] [2024-11-17 08:00:58,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:58,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:58,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:00:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:58,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:00:58,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:58,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1898641955, now seen corresponding path program 3 times [2024-11-17 08:00:58,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:58,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050188013] [2024-11-17 08:00:58,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:58,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:00:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-17 08:00:58,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:00:58,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050188013] [2024-11-17 08:00:58,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050188013] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:00:58,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884568006] [2024-11-17 08:00:58,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 08:00:58,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:00:58,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:58,425 INFO L229 MonitoredProcess]: Starting monitored process 58 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:00:58,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2024-11-17 08:00:58,494 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 08:00:58,495 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:00:58,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:00:58,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:00:58,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 08:00:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-17 08:00:58,510 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 08:00:58,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884568006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:00:58,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 08:00:58,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-11-17 08:00:58,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937438448] [2024-11-17 08:00:58,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:00:58,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:00:58,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:00:58,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 08:00:58,552 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. cyclomatic complexity: 18 Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:00:58,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:00:58,567 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2024-11-17 08:00:58,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 80 transitions. [2024-11-17 08:00:58,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-11-17 08:00:58,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 74 states and 76 transitions. [2024-11-17 08:00:58,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-11-17 08:00:58,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2024-11-17 08:00:58,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 76 transitions. [2024-11-17 08:00:58,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:00:58,570 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 76 transitions. [2024-11-17 08:00:58,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 76 transitions. [2024-11-17 08:00:58,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2024-11-17 08:00:58,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 67 states have internal predecessors, (70), 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:00:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2024-11-17 08:00:58,575 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 70 transitions. [2024-11-17 08:00:58,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:00:58,576 INFO L425 stractBuchiCegarLoop]: Abstraction has 68 states and 70 transitions. [2024-11-17 08:00:58,576 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-17 08:00:58,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 70 transitions. [2024-11-17 08:00:58,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-11-17 08:00:58,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:00:58,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:00:58,578 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 1, 1, 1, 1] [2024-11-17 08:00:58,579 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 4, 4, 2, 2, 1, 1] [2024-11-17 08:00:58,579 INFO L745 eck$LassoCheckResult]: Stem: 1754#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1755#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1756#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1784#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1783#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1782#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1781#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1780#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1779#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1764#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1761#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1752#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1753#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1759#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1771#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1769#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1767#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1768#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1776#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1792#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1790#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1788#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1785#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1762#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1757#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1758#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1760#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1791#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1789#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1786#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1787#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1765#L24 assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1766#L15 [2024-11-17 08:00:58,579 INFO L747 eck$LassoCheckResult]: Loop: 1766#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1793#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1816#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1814#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1812#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1810#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1808#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1806#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1804#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1750#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1751#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1800#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1798#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1777#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1778#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#2(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1794#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1817#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1815#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1813#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1811#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1809#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1807#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#1(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1805#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1803#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1802#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#0(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1801#L15 assume true;call main_#t~mem4#1 := read~int#3(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1799#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#0(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1797#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#0(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1796#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#1(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#2(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1795#L24 assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#2(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#3(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1766#L15 [2024-11-17 08:00:58,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:58,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1828604801, now seen corresponding path program 1 times [2024-11-17 08:00:58,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:58,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842320028] [2024-11-17 08:00:58,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:58,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:58,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:00:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:58,614 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:00:58,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:58,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1437690398, now seen corresponding path program 1 times [2024-11-17 08:00:58,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:58,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280344688] [2024-11-17 08:00:58,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:58,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:58,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:00:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:00:58,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:00:58,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:00:58,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1843118434, now seen corresponding path program 2 times [2024-11-17 08:00:58,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:00:58,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32740933] [2024-11-17 08:00:58,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:00:58,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:00:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:00:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 227 proven. 20 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-17 08:00:58,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:00:58,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32740933] [2024-11-17 08:00:58,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32740933] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:00:58,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277820507] [2024-11-17 08:00:58,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:00:58,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:00:58,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:00:58,948 INFO L229 MonitoredProcess]: Starting monitored process 59 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:00:58,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2024-11-17 08:00:59,072 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:00:59,072 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:00:59,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 08:00:59,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:00:59,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 08:00:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 223 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-17 08:00:59,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:00:59,161 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 223 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-17 08:00:59,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277820507] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:00:59,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:00:59,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2024-11-17 08:00:59,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139652049] [2024-11-17 08:00:59,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:01:00,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:01:00,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 08:01:00,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 08:01:00,944 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. cyclomatic complexity: 4 Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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:01:00,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:01:00,971 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2024-11-17 08:01:00,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 40 transitions. [2024-11-17 08:01:00,972 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:01:00,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2024-11-17 08:01:00,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-17 08:01:00,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-17 08:01:00,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-17 08:01:00,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:01:00,972 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:01:00,972 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:01:00,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 08:01:00,972 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:01:00,972 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-17 08:01:00,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-17 08:01:00,973 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:01:00,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-17 08:01:00,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:01:00 BoogieIcfgContainer [2024-11-17 08:01:00,978 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:01:00,978 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:01:00,978 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:01:00,978 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:01:00,979 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:00:46" (3/4) ... [2024-11-17 08:01:00,980 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 08:01:00,981 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:01:00,981 INFO L158 Benchmark]: Toolchain (without parser) took 15045.96ms. Allocated memory was 188.7MB in the beginning and 299.9MB in the end (delta: 111.1MB). Free memory was 119.2MB in the beginning and 241.4MB in the end (delta: -122.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:01:00,981 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 78.9MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:01:00,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.57ms. Allocated memory is still 188.7MB. Free memory was 118.9MB in the beginning and 107.2MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 08:01:00,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.29ms. Allocated memory is still 188.7MB. Free memory was 106.9MB in the beginning and 105.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:01:00,982 INFO L158 Benchmark]: Boogie Preprocessor took 33.35ms. Allocated memory is still 188.7MB. Free memory was 105.7MB in the beginning and 103.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:01:00,982 INFO L158 Benchmark]: IcfgBuilder took 265.38ms. Allocated memory is still 188.7MB. Free memory was 103.6MB in the beginning and 89.8MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 08:01:00,982 INFO L158 Benchmark]: BuchiAutomizer took 14533.55ms. Allocated memory was 188.7MB in the beginning and 299.9MB in the end (delta: 111.1MB). Free memory was 89.8MB in the beginning and 242.4MB in the end (delta: -152.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:01:00,982 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 299.9MB. Free memory is still 241.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:01:00,983 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 78.9MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.57ms. Allocated memory is still 188.7MB. Free memory was 118.9MB in the beginning and 107.2MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.29ms. Allocated memory is still 188.7MB. Free memory was 106.9MB in the beginning and 105.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.35ms. Allocated memory is still 188.7MB. Free memory was 105.7MB in the beginning and 103.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 265.38ms. Allocated memory is still 188.7MB. Free memory was 103.6MB in the beginning and 89.8MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 14533.55ms. Allocated memory was 188.7MB in the beginning and 299.9MB in the end (delta: 111.1MB). Free memory was 89.8MB in the beginning and 242.4MB in the end (delta: -152.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 299.9MB. Free memory is still 241.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x0~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~mem6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x0~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x2~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.4s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 13.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 19 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 22/22 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 200 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94 IncrementalHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 93 mSDtfsCounter, 94 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU4 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital268 mio100 ax100 hnf100 lsp99 ukn73 mio100 lsp24 div100 bol100 ite100 ukn100 eq164 hnf90 smp100 dnf101 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 3 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-17 08:01:01,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2024-11-17 08:01:01,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2024-11-17 08:01:01,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2024-11-17 08:01:01,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE