./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-?-c7c6ca5-m [2024-11-09 15:18:00,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:18:00,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-09 15:18:00,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:18:00,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:18:00,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:18:00,719 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:18:00,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:18:00,719 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:18:00,720 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:18:00,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:18:00,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:18:00,721 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:18:00,721 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:18:00,723 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:18:00,723 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:18:00,723 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:18:00,724 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:18:00,724 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:18:00,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:18:00,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:18:00,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:18:00,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:18:00,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:18:00,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:18:00,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:18:00,728 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:18:00,728 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:18:00,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:18:00,728 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:18:00,729 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:18:00,729 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:18:00,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:18:00,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:18:00,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:18:00,729 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:18:00,730 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-09 15:18:00,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:18:00,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:18:00,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:18:00,948 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:18:00,949 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:18:00,950 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-09 15:18:02,228 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:18:02,354 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:18:02,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2024-11-09 15:18:02,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef5492a0d/c8df7282a9124b3ba124d74554a845fe/FLAG15d8ef696 [2024-11-09 15:18:02,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef5492a0d/c8df7282a9124b3ba124d74554a845fe [2024-11-09 15:18:02,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:18:02,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:18:02,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:18:02,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:18:02,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:18:02,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:18:02" (1/1) ... [2024-11-09 15:18:02,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502fefc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:02, skipping insertion in model container [2024-11-09 15:18:02,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:18:02" (1/1) ... [2024-11-09 15:18:02,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:18:02,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:18:02,555 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:18:02,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:18:02,601 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:18:02,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:02 WrapperNode [2024-11-09 15:18:02,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:18:02,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:18:02,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:18:02,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:18:02,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:02" (1/1) ... [2024-11-09 15:18:02,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:02" (1/1) ... [2024-11-09 15:18:02,627 INFO L138 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2024-11-09 15:18:02,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:18:02,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:18:02,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:18:02,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:18:02,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:02" (1/1) ... [2024-11-09 15:18:02,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:02" (1/1) ... [2024-11-09 15:18:02,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:02" (1/1) ... [2024-11-09 15:18:02,658 INFO L175 MemorySlicer]: Split 15 memory accesses to 4 slices as follows [4, 3, 4, 4]. 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, 2, 3, 3]. [2024-11-09 15:18:02,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:02" (1/1) ... [2024-11-09 15:18:02,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:02" (1/1) ... [2024-11-09 15:18:02,665 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:02" (1/1) ... [2024-11-09 15:18:02,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:02" (1/1) ... [2024-11-09 15:18:02,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:02" (1/1) ... [2024-11-09 15:18:02,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:02" (1/1) ... [2024-11-09 15:18:02,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:18:02,676 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:18:02,676 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:18:02,676 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:18:02,677 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:02" (1/1) ... [2024-11-09 15:18:02,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:02,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:02,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:02,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 15:18:02,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 15:18:02,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 15:18:02,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 15:18:02,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 15:18:02,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:18:02,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:18:02,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 15:18:02,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 15:18:02,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 15:18:02,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 15:18:02,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 15:18:02,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 15:18:02,795 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:18:02,796 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:18:02,909 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-09 15:18:02,909 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:18:02,917 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:18:02,917 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 15:18:02,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:18:02 BoogieIcfgContainer [2024-11-09 15:18:02,921 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:18:02,922 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:18:02,922 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:18:02,926 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:18:02,926 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:18:02,926 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:18:02" (1/3) ... [2024-11-09 15:18:02,927 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27d599d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:18:02, skipping insertion in model container [2024-11-09 15:18:02,927 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:18:02,927 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:18:02" (2/3) ... [2024-11-09 15:18:02,927 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27d599d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:18:02, skipping insertion in model container [2024-11-09 15:18:02,928 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:18:02,928 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:18:02" (3/3) ... [2024-11-09 15:18:02,929 INFO L332 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2024-11-09 15:18:02,969 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:18:02,969 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:18:02,969 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:18:02,969 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:18:02,970 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:18:02,970 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:18:02,970 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:18:02,970 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:18:02,972 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-09 15:18:02,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:18:02,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:18:02,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:18:02,988 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:18:02,988 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:18:02,988 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:18:02,988 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-09 15:18:02,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:18:02,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:18:02,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:18:02,989 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:18:02,989 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:18:02,994 INFO L745 eck$LassoCheckResult]: Stem: 7#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true 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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#3(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 4#L24-2true [2024-11-09 15:18:02,994 INFO L747 eck$LassoCheckResult]: Loop: 4#L24-2true call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 8#L15-1true assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 4#L24-2true [2024-11-09 15:18:02,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:02,999 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:18:03,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:03,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018940500] [2024-11-09 15:18:03,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:03,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:03,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:03,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:03,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2024-11-09 15:18:03,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:03,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955200733] [2024-11-09 15:18:03,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:03,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:03,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:03,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:03,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:03,208 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2024-11-09 15:18:03,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:03,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191713103] [2024-11-09 15:18:03,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:03,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:03,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:03,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:04,371 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:18:04,371 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:18:04,371 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:18:04,371 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:18:04,372 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:18:04,372 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:04,372 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:18:04,372 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:18:04,372 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2024-11-09 15:18:04,372 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:18:04,372 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:18:04,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:04,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:04,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:04,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:04,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:04,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:05,157 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:18:05,160 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:18:05,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:05,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:05,163 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:05,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-09 15:18:05,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:05,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:05,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:18:05,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:05,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:05,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:05,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:18:05,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:18:05,184 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:05,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-09 15:18:05,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:05,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:05,197 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:05,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-09 15:18:05,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:05,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:05,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:18:05,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:05,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:05,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:05,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:18:05,213 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:18:05,214 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:05,224 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-09 15:18:05,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:05,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:05,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:05,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-09 15:18:05,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:05,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:05,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:18:05,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:05,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:05,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:05,237 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:18:05,237 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:18:05,238 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:05,249 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-09 15:18:05,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:05,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:05,250 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:05,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-09 15:18:05,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:05,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:05,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:05,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:05,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:05,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:05,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:05,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:05,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-09 15:18:05,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:05,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:05,284 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:05,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-09 15:18:05,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:05,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:05,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:05,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:05,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:05,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:05,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:05,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:05,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-09 15:18:05,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:05,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:05,311 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:05,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-09 15:18:05,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:05,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:05,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:05,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:05,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:05,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:05,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:05,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:05,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-09 15:18:05,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:05,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:05,343 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:05,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-09 15:18:05,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-09 15:18:05,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:05,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:05,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:05,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:05,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:05,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:05,368 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:05,378 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-09 15:18:05,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:05,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:05,380 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:05,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-09 15:18:05,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:05,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:05,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:05,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:05,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:05,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:05,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:05,397 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:05,408 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-09 15:18:05,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:05,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:05,410 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:05,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-09 15:18:05,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:05,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:05,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:05,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:05,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:05,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:05,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:05,426 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:05,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-09 15:18:05,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:05,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:05,439 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:05,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-09 15:18:05,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-09 15:18:05,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:05,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:05,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:05,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:05,453 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:05,453 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:05,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:05,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-09 15:18:05,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:05,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:05,468 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:05,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-09 15:18:05,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:05,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:05,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:05,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:05,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:05,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:05,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:05,493 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:05,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-09 15:18:05,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:05,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:05,505 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:05,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-09 15:18:05,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:05,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:05,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:05,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:05,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:05,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:05,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:05,520 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:05,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-09 15:18:05,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:05,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:05,532 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:05,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-09 15:18:05,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:05,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:05,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:05,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:05,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:05,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:05,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:05,549 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:05,559 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-09 15:18:05,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:05,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:05,561 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:05,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-09 15:18:05,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:05,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:05,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:05,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:05,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:05,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:05,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:05,577 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:05,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-09 15:18:05,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:05,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:05,589 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:05,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-09 15:18:05,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:05,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:05,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:05,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:05,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:05,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:05,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:05,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:05,617 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-09 15:18:05,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:05,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:05,618 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:05,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-09 15:18:05,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:05,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:05,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:05,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:05,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:05,631 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:05,631 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:05,633 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:05,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-09 15:18:05,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:05,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:05,644 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:05,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-09 15:18:05,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:05,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:05,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:05,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:05,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:05,656 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:05,656 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:05,659 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:18:05,667 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-11-09 15:18:05,668 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-11-09 15:18:05,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:05,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:05,670 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:05,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-09 15:18:05,673 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:18:05,691 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:18:05,691 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:18:05,691 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1) = -2*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1 + 1 Supporting invariants [] [2024-11-09 15:18:05,702 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-09 15:18:05,769 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-09 15:18:05,812 INFO L156 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2024-11-09 15:18:05,819 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-09 15:18:05,819 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-09 15:18:05,819 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2024-11-09 15:18:05,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:05,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:18:05,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:18:05,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:18:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:18:05,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:18:05,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:18:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:18:05,918 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:18:05,920 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-09 15:18:05,956 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-09 15:18:05,958 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-09 15:18:05,963 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-09 15:18:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2024-11-09 15:18:05,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 3 letters. [2024-11-09 15:18:05,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:18:05,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2024-11-09 15:18:05,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:18:05,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 6 letters. [2024-11-09 15:18:05,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:18:05,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2024-11-09 15:18:05,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:18:05,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 13 states and 18 transitions. [2024-11-09 15:18:05,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-09 15:18:05,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-11-09 15:18:05,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2024-11-09 15:18:05,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:18:05,971 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-09 15:18:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2024-11-09 15:18:05,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-09 15:18:05,988 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-09 15:18:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2024-11-09 15:18:05,989 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-09 15:18:05,989 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-11-09 15:18:05,989 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:18:05,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2024-11-09 15:18:05,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 15:18:05,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:18:05,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:18:05,991 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-09 15:18:05,991 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-09 15:18:05,991 INFO L745 eck$LassoCheckResult]: Stem: 222#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 223#L-1 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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#3(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 224#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 221#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 214#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 215#L20 [2024-11-09 15:18:05,992 INFO L747 eck$LassoCheckResult]: Loop: 215#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#3(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 218#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 219#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 226#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 215#L20 [2024-11-09 15:18:05,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:05,993 INFO L85 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2024-11-09 15:18:05,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:05,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772148909] [2024-11-09 15:18:05,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:05,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:18:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:18:06,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:18:06,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772148909] [2024-11-09 15:18:06,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772148909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:18:06,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:18:06,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:18:06,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526807193] [2024-11-09 15:18:06,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:18:06,150 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:18:06,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:06,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2024-11-09 15:18:06,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:06,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159722681] [2024-11-09 15:18:06,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:06,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:06,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:06,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:06,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:18:06,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:18:06,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:18:06,258 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-09 15:18:06,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:18:06,276 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-11-09 15:18:06,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2024-11-09 15:18:06,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:18:06,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 22 transitions. [2024-11-09 15:18:06,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-11-09 15:18:06,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-09 15:18:06,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2024-11-09 15:18:06,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:18:06,277 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-09 15:18:06,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2024-11-09 15:18:06,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-11-09 15:18:06,278 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-09 15:18:06,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-11-09 15:18:06,279 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-09 15:18:06,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:18:06,280 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-09 15:18:06,280 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 15:18:06,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2024-11-09 15:18:06,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-11-09 15:18:06,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:18:06,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:18:06,281 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2024-11-09 15:18:06,281 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2024-11-09 15:18:06,281 INFO L745 eck$LassoCheckResult]: Stem: 263#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 264#L-1 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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#3(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 260#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 261#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 258#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 259#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 262#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 269#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 266#L20 [2024-11-09 15:18:06,281 INFO L747 eck$LassoCheckResult]: Loop: 266#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#3(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 267#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 265#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 256#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 257#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 270#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 271#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 266#L20 [2024-11-09 15:18:06,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:06,281 INFO L85 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2024-11-09 15:18:06,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:06,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402678081] [2024-11-09 15:18:06,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:06,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:06,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:06,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:06,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:06,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1770012235, now seen corresponding path program 1 times [2024-11-09 15:18:06,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:06,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416963911] [2024-11-09 15:18:06,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:06,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:06,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:06,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:06,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:06,315 INFO L85 PathProgramCache]: Analyzing trace with hash -161041423, now seen corresponding path program 1 times [2024-11-09 15:18:06,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:06,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125645585] [2024-11-09 15:18:06,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:06,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:06,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:06,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:07,360 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:18:07,360 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:18:07,360 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:18:07,360 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:18:07,360 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:18:07,360 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:07,360 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:18:07,360 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:18:07,360 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration3_Lasso [2024-11-09 15:18:07,361 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:18:07,361 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:18:07,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:07,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:07,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:07,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:07,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:08,095 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:18:08,096 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:18:08,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:08,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:08,098 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:08,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-09 15:18:08,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:08,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:08,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:18:08,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:08,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:08,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:08,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:18:08,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:18:08,113 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:08,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-09 15:18:08,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:08,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:08,124 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:08,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-09 15:18:08,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:08,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:08,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:18:08,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:08,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:08,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:08,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:18:08,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:18:08,137 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:08,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-09 15:18:08,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:08,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:08,148 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:08,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-09 15:18:08,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:08,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:08,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:18:08,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:08,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:08,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:08,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:18:08,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:18:08,161 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:08,170 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-09 15:18:08,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:08,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:08,180 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:08,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-09 15:18:08,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:08,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:08,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:08,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:08,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:08,192 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:08,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:08,195 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:08,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-11-09 15:18:08,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:08,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:08,205 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:08,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-09 15:18:08,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:08,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:08,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:08,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:08,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:08,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:08,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:08,224 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:08,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-09 15:18:08,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:08,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:08,236 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-09 15:18:08,236 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-09 15:18:08,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:08,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:08,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:08,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:08,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:08,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:08,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:08,252 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:18:08,263 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-09 15:18:08,263 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-09 15:18:08,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:08,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:08,265 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-09 15:18:08,266 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-09 15:18:08,266 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:18:08,277 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:18:08,277 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:18:08,277 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-09 15:18:08,288 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-09 15:18:08,369 INFO L156 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2024-11-09 15:18:08,370 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem6 [2024-11-09 15:18:08,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:18:08,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:18:08,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:18:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:18:08,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:18:08,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:18:08,455 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-09 15:18:08,480 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-09 15:18:08,481 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-09 15:18:08,481 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-09 15:18:08,492 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-09 15:18:08,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 15:18:08,492 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-09 15:18:08,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-11-09 15:18:08,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 7 letters. [2024-11-09 15:18:08,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:18:08,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 15 letters. Loop has 7 letters. [2024-11-09 15:18:08,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:18:08,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 14 letters. [2024-11-09 15:18:08,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:18:08,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2024-11-09 15:18:08,494 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-09 15:18:08,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 41 transitions. [2024-11-09 15:18:08,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-09 15:18:08,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-09 15:18:08,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2024-11-09 15:18:08,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:18:08,495 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-11-09 15:18:08,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2024-11-09 15:18:08,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-09 15:18:08,497 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-09 15:18:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-11-09 15:18:08,497 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-11-09 15:18:08,497 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-11-09 15:18:08,497 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 15:18:08,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2024-11-09 15:18:08,498 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-09 15:18:08,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:18:08,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:18:08,498 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-09 15:18:08,498 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:18:08,498 INFO L745 eck$LassoCheckResult]: Stem: 523#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 524#L-1 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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#3(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 525#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 521#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 518#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 519#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 522#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 537#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 536#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#3(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 517#L24-2 [2024-11-09 15:18:08,498 INFO L747 eck$LassoCheckResult]: Loop: 517#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 520#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 516#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 517#L24-2 [2024-11-09 15:18:08,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:08,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 2 times [2024-11-09 15:18:08,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:08,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545154596] [2024-11-09 15:18:08,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:08,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:08,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:08,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:08,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:08,524 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 2 times [2024-11-09 15:18:08,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:08,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848856747] [2024-11-09 15:18:08,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:08,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:08,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:08,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:08,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:08,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1467212283, now seen corresponding path program 3 times [2024-11-09 15:18:08,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:08,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615994206] [2024-11-09 15:18:08,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:08,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:08,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:08,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:09,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-09 15:18:09,761 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:18:09,762 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:18:09,762 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:18:09,762 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:18:09,762 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:18:09,762 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:09,762 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:18:09,762 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:18:09,762 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration4_Lasso [2024-11-09 15:18:09,762 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:18:09,762 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:18:09,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:09,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:09,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:09,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:10,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:10,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:10,311 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:18:10,311 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:18:10,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:10,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:10,313 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:10,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-09 15:18:10,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:10,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:10,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:18:10,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:10,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:10,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:10,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:18:10,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:18:10,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:10,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-09 15:18:10,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:10,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:10,336 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:10,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-09 15:18:10,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:10,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:10,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:18:10,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:10,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:10,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:10,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:18:10,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:18:10,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:10,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-09 15:18:10,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:10,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:10,359 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:10,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-09 15:18:10,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:10,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:10,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:18:10,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:10,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:10,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:10,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:18:10,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:18:10,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:10,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-09 15:18:10,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:10,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:10,382 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:10,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-09 15:18:10,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-09 15:18:10,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:10,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:10,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:10,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:10,397 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:10,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:10,400 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:10,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-09 15:18:10,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:10,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:10,411 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:10,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-09 15:18:10,414 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:10,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:10,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:10,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:10,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:10,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:10,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:10,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:10,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-09 15:18:10,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:10,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:10,440 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:10,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-09 15:18:10,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:10,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:10,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:10,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:10,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:10,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:10,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:10,457 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:10,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-09 15:18:10,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:10,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:10,468 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:10,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-09 15:18:10,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:10,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:10,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:10,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:10,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:10,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:10,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:10,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:10,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-09 15:18:10,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:10,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:10,500 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:10,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-11-09 15:18:10,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-09 15:18:10,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:10,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:10,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:10,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:10,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:10,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:10,514 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:10,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-09 15:18:10,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:10,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:10,524 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:10,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-11-09 15:18:10,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:10,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:10,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:10,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:10,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:10,536 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:10,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:10,549 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:10,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-09 15:18:10,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:10,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:10,560 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:10,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-11-09 15:18:10,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-09 15:18:10,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:10,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:10,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:10,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:10,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:10,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:10,574 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:10,584 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-09 15:18:10,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:10,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:10,585 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:10,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-11-09 15:18:10,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:10,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:10,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:10,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:10,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:10,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:10,598 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:10,602 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:10,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-09 15:18:10,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:10,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:10,613 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:10,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-09 15:18:10,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:10,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:10,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:10,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:10,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:10,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:10,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:10,632 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:18:10,640 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-09 15:18:10,640 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-11-09 15:18:10,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:10,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:10,642 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:10,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-11-09 15:18:10,643 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:18:10,653 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:18:10,653 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:18:10,654 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x0~0#1.base) 0)_2) = -2*v_rep(select (select #memory_int#2 ULTIMATE.start_main_~x0~0#1.base) 0)_2 + 1 Supporting invariants [] [2024-11-09 15:18:10,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-09 15:18:10,732 INFO L156 tatePredicateManager]: 34 out of 35 supporting invariants were superfluous and have been removed [2024-11-09 15:18:10,734 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-09 15:18:10,734 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-09 15:18:10,734 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2024-11-09 15:18:10,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:18:10,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 15:18:10,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:18:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:18:10,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:18:10,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:18:10,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:18:10,817 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2024-11-09 15:18:10,818 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 36 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-09 15:18:10,850 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 36 transitions. cyclomatic complexity: 13. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 8 states. [2024-11-09 15:18:10,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-09 15:18:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-09 15:18:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2024-11-09 15:18:10,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 3 letters. [2024-11-09 15:18:10,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:18:10,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 12 letters. Loop has 3 letters. [2024-11-09 15:18:10,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:18:10,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 6 letters. [2024-11-09 15:18:10,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:18:10,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. [2024-11-09 15:18:10,852 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2024-11-09 15:18:10,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 51 states and 64 transitions. [2024-11-09 15:18:10,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-11-09 15:18:10,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-09 15:18:10,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 64 transitions. [2024-11-09 15:18:10,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:18:10,853 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 64 transitions. [2024-11-09 15:18:10,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 64 transitions. [2024-11-09 15:18:10,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2024-11-09 15:18:10,855 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-09 15:18:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2024-11-09 15:18:10,856 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 60 transitions. [2024-11-09 15:18:10,856 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2024-11-09 15:18:10,856 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 15:18:10,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 60 transitions. [2024-11-09 15:18:10,857 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2024-11-09 15:18:10,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:18:10,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:18:10,857 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-09 15:18:10,857 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2024-11-09 15:18:10,857 INFO L745 eck$LassoCheckResult]: Stem: 819#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 820#L-1 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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#3(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 823#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 822#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 812#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 813#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 845#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 844#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 842#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#3(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 843#L24 [2024-11-09 15:18:10,858 INFO L747 eck$LassoCheckResult]: Loop: 843#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#0(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 854#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 853#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 852#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 839#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 851#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 837#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 838#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#3(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 843#L24 [2024-11-09 15:18:10,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:10,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1269321585, now seen corresponding path program 1 times [2024-11-09 15:18:10,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:10,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315028248] [2024-11-09 15:18:10,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:10,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:18:10,928 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-09 15:18:10,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:18:10,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315028248] [2024-11-09 15:18:10,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315028248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:18:10,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:18:10,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:18:10,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988190721] [2024-11-09 15:18:10,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:18:10,929 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:18:10,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:10,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1088312668, now seen corresponding path program 1 times [2024-11-09 15:18:10,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:10,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080461238] [2024-11-09 15:18:10,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:10,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:10,934 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:10,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:11,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:18:11,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:18:11,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:18:11,150 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-09 15:18:11,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:18:11,161 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2024-11-09 15:18:11,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2024-11-09 15:18:11,162 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-09 15:18:11,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2024-11-09 15:18:11,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-09 15:18:11,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-09 15:18:11,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2024-11-09 15:18:11,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:18:11,162 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-09 15:18:11,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2024-11-09 15:18:11,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 15:18:11,164 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-09 15:18:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2024-11-09 15:18:11,165 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-09 15:18:11,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:18:11,165 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-09 15:18:11,165 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 15:18:11,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2024-11-09 15:18:11,166 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-09 15:18:11,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:18:11,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:18:11,166 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 1, 1] [2024-11-09 15:18:11,166 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:18:11,166 INFO L745 eck$LassoCheckResult]: Stem: 914#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 915#L-1 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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#3(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 919#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 939#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 940#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 938#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 936#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 933#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 920#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#3(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 921#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 942#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 908#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 909#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 917#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 918#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 922#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#3(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 907#L24-2 [2024-11-09 15:18:11,166 INFO L747 eck$LassoCheckResult]: Loop: 907#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 941#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 906#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 907#L24-2 [2024-11-09 15:18:11,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:11,167 INFO L85 PathProgramCache]: Analyzing trace with hash -697316797, now seen corresponding path program 4 times [2024-11-09 15:18:11,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:11,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5306059] [2024-11-09 15:18:11,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:11,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:18:11,266 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-09 15:18:11,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:18:11,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5306059] [2024-11-09 15:18:11,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5306059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:18:11,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384586526] [2024-11-09 15:18:11,267 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 15:18:11,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:18:11,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:11,269 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:18:11,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-11-09 15:18:11,328 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 15:18:11,328 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:18:11,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 15:18:11,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:18:11,334 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-09 15:18:11,372 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-09 15:18:11,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 15:18:11,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384586526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:18:11,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 15:18:11,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-09 15:18:11,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954441153] [2024-11-09 15:18:11,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:18:11,373 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:18:11,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:11,373 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 3 times [2024-11-09 15:18:11,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:11,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171751982] [2024-11-09 15:18:11,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:11,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:11,374 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-09 15:18:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:11,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:11,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:11,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:18:11,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:18:11,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 15:18:11,425 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-09 15:18:11,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:18:11,442 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-11-09 15:18:11,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2024-11-09 15:18:11,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-09 15:18:11,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2024-11-09 15:18:11,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-09 15:18:11,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-09 15:18:11,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2024-11-09 15:18:11,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:18:11,444 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-11-09 15:18:11,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2024-11-09 15:18:11,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-11-09 15:18:11,446 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-09 15:18:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-09 15:18:11,447 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-09 15:18:11,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:18:11,447 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-09 15:18:11,448 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 15:18:11,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2024-11-09 15:18:11,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-09 15:18:11,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:18:11,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:18:11,449 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1] [2024-11-09 15:18:11,449 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2024-11-09 15:18:11,450 INFO L745 eck$LassoCheckResult]: Stem: 1043#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1044#L-1 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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#3(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1045#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1042#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1037#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1038#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1041#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1062#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1061#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#3(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1060#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1055#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1057#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1053#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1054#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1050#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1049#L20 [2024-11-09 15:18:11,450 INFO L747 eck$LassoCheckResult]: Loop: 1049#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#3(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1048#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#0(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1039#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1040#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1035#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1036#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1064#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1063#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1046#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#3(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1047#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1059#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1058#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1056#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1051#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1052#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1049#L20 [2024-11-09 15:18:11,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:11,450 INFO L85 PathProgramCache]: Analyzing trace with hash -161041423, now seen corresponding path program 5 times [2024-11-09 15:18:11,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:11,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052745622] [2024-11-09 15:18:11,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:11,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:11,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:11,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:11,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:11,487 INFO L85 PathProgramCache]: Analyzing trace with hash -97586480, now seen corresponding path program 1 times [2024-11-09 15:18:11,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:11,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507384563] [2024-11-09 15:18:11,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:11,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:11,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:11,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:11,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:11,497 INFO L85 PathProgramCache]: Analyzing trace with hash 569106656, now seen corresponding path program 1 times [2024-11-09 15:18:11,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:11,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870535792] [2024-11-09 15:18:11,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:11,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:11,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:11,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:13,061 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 15:18:13,061 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 15:18:13,061 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 15:18:13,061 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 15:18:13,061 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 15:18:13,061 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:13,061 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 15:18:13,061 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 15:18:13,061 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration7_Lasso [2024-11-09 15:18:13,061 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 15:18:13,061 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 15:18:13,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:13,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:13,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:13,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:13,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 15:18:13,761 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 15:18:13,761 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 15:18:13,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:13,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:13,762 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:13,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-11-09 15:18:13,764 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:13,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:13,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:18:13,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:13,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:13,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:13,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:18:13,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:18:13,776 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:13,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-09 15:18:13,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:13,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:13,789 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:13,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-09 15:18:13,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:13,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:13,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:18:13,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:13,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:13,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:13,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:18:13,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:18:13,801 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:13,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-09 15:18:13,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:13,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:13,813 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:13,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-09 15:18:13,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:13,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:13,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 15:18:13,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:13,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:13,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:13,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 15:18:13,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 15:18:13,825 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:13,834 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-09 15:18:13,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:13,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:13,835 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:13,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-09 15:18:13,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:13,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:13,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:13,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:13,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:13,849 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:13,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:13,853 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:13,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-09 15:18:13,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:13,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:13,865 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:13,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-09 15:18:13,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:13,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:13,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:13,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:13,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:13,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:13,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:13,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 15:18:13,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-09 15:18:13,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:13,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:13,893 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:13,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-09 15:18:13,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 15:18:13,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 15:18:13,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 15:18:13,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 15:18:13,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 15:18:13,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 15:18:13,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 15:18:13,909 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 15:18:13,912 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-11-09 15:18:13,912 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-11-09 15:18:13,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:18:13,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:13,913 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 15:18:13,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-09 15:18:13,915 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 15:18:13,925 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 15:18:13,925 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 15:18:13,925 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4) = -2*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4 + 1 Supporting invariants [] [2024-11-09 15:18:13,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-11-09 15:18:14,016 INFO L156 tatePredicateManager]: 38 out of 38 supporting invariants were superfluous and have been removed [2024-11-09 15:18:14,017 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-11-09 15:18:14,017 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-11-09 15:18:14,017 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x2~0!base,]]] [2024-11-09 15:18:14,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:18:14,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 15:18:14,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:18:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:18:14,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:18:14,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:18:14,099 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-09 15:18:14,141 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-09 15:18:14,142 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-09 15:18:14,142 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-09 15:18:14,156 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-09 15:18:14,157 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-09 15:18:14,158 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-09 15:18:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-11-09 15:18:14,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 15 letters. [2024-11-09 15:18:14,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:18:14,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 30 letters. Loop has 15 letters. [2024-11-09 15:18:14,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:18:14,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 30 letters. [2024-11-09 15:18:14,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 15:18:14,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 77 transitions. [2024-11-09 15:18:14,159 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2024-11-09 15:18:14,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 77 transitions. [2024-11-09 15:18:14,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-09 15:18:14,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-11-09 15:18:14,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 77 transitions. [2024-11-09 15:18:14,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:18:14,160 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2024-11-09 15:18:14,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 77 transitions. [2024-11-09 15:18:14,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-09 15:18:14,162 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-09 15:18:14,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2024-11-09 15:18:14,162 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2024-11-09 15:18:14,163 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 77 transitions. [2024-11-09 15:18:14,163 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 15:18:14,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 77 transitions. [2024-11-09 15:18:14,163 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2024-11-09 15:18:14,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:18:14,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:18:14,163 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 15:18:14,163 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2024-11-09 15:18:14,164 INFO L745 eck$LassoCheckResult]: Stem: 1403#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1404#L-1 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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#3(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1409#L24-2 call main_#t~mem4#1 := read~int#1(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#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1443#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1442#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1441#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1440#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#3(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1401#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1402#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1398#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1399#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1448#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1430#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1431#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#3(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1414#L24 assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1415#L24-2 [2024-11-09 15:18:14,164 INFO L747 eck$LassoCheckResult]: Loop: 1415#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1449#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1447#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1445#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1446#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1444#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1410#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#3(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1411#L24-2 call main_#t~mem4#1 := read~int#1(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#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1406#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1451#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1452#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1450#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1426#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#3(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1427#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#0(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1415#L24-2 [2024-11-09 15:18:14,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:14,164 INFO L85 PathProgramCache]: Analyzing trace with hash -141984138, now seen corresponding path program 1 times [2024-11-09 15:18:14,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:14,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980829534] [2024-11-09 15:18:14,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:14,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:18:14,240 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-09 15:18:14,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:18:14,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980829534] [2024-11-09 15:18:14,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980829534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:18:14,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:18:14,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:18:14,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672918164] [2024-11-09 15:18:14,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:18:14,241 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 15:18:14,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:14,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1365622390, now seen corresponding path program 2 times [2024-11-09 15:18:14,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:14,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028739110] [2024-11-09 15:18:14,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:14,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:14,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:14,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:14,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:18:14,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:18:14,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 15:18:14,594 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-09 15:18:14,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:18:14,607 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2024-11-09 15:18:14,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 97 transitions. [2024-11-09 15:18:14,608 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2024-11-09 15:18:14,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 76 states and 88 transitions. [2024-11-09 15:18:14,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-11-09 15:18:14,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-11-09 15:18:14,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 88 transitions. [2024-11-09 15:18:14,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:18:14,609 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 88 transitions. [2024-11-09 15:18:14,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 88 transitions. [2024-11-09 15:18:14,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-11-09 15:18:14,611 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-09 15:18:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2024-11-09 15:18:14,612 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-11-09 15:18:14,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:18:14,615 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-11-09 15:18:14,615 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 15:18:14,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 86 transitions. [2024-11-09 15:18:14,615 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2024-11-09 15:18:14,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:18:14,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:18:14,616 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1, 1, 1, 1, 1] [2024-11-09 15:18:14,616 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:18:14,616 INFO L745 eck$LassoCheckResult]: Stem: 1562#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1563#L-1 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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#3(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1565#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1589#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1556#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1557#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1591#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1594#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1593#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#3(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1592#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1590#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1584#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1585#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1581#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1580#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1573#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#3(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1571#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#0(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1572#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1579#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1625#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1620#L24-2 [2024-11-09 15:18:14,616 INFO L747 eck$LassoCheckResult]: Loop: 1620#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1623#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1619#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1620#L24-2 [2024-11-09 15:18:14,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:14,617 INFO L85 PathProgramCache]: Analyzing trace with hash 693278934, now seen corresponding path program 2 times [2024-11-09 15:18:14,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:14,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909308481] [2024-11-09 15:18:14,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:14,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:14,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:14,662 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-09 15:18:14,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:14,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:14,666 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 4 times [2024-11-09 15:18:14,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:14,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147359619] [2024-11-09 15:18:14,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:14,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:14,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:14,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:14,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:14,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1024996556, now seen corresponding path program 3 times [2024-11-09 15:18:14,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:14,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448072928] [2024-11-09 15:18:14,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:14,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:18:14,768 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-09 15:18:14,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:18:14,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448072928] [2024-11-09 15:18:14,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448072928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:18:14,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513344522] [2024-11-09 15:18:14,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 15:18:14,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:18:14,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:14,770 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-09 15:18:14,771 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-09 15:18:14,838 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 15:18:14,838 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:18:14,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 15:18:14,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:18:14,843 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-09 15:18:14,847 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-09 15:18:14,847 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 15:18:14,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513344522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:18:14,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 15:18:14,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-11-09 15:18:14,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657591896] [2024-11-09 15:18:14,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:18:14,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:18:14,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 15:18:14,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 15:18:14,883 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-09 15:18:14,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:18:14,895 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2024-11-09 15:18:14,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 80 transitions. [2024-11-09 15:18:14,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-11-09 15:18:14,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 74 states and 76 transitions. [2024-11-09 15:18:14,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-11-09 15:18:14,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2024-11-09 15:18:14,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 76 transitions. [2024-11-09 15:18:14,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 15:18:14,896 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 76 transitions. [2024-11-09 15:18:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 76 transitions. [2024-11-09 15:18:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2024-11-09 15:18:14,898 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-09 15:18:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2024-11-09 15:18:14,899 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 70 transitions. [2024-11-09 15:18:14,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 15:18:14,900 INFO L425 stractBuchiCegarLoop]: Abstraction has 68 states and 70 transitions. [2024-11-09 15:18:14,901 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 15:18:14,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 70 transitions. [2024-11-09 15:18:14,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-11-09 15:18:14,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:18:14,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:18:14,902 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 1, 1, 1, 1] [2024-11-09 15:18:14,902 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 4, 4, 2, 2, 1, 1] [2024-11-09 15:18:14,902 INFO L745 eck$LassoCheckResult]: Stem: 1793#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1794#L-1 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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#3(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1796#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1819#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1818#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1817#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1816#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1814#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#3(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1791#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1792#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1787#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1788#L24-2 call main_#t~mem4#1 := read~int#1(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#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1805#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1803#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#3(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1801#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#0(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1802#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1810#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1827#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1825#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1823#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1820#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1797#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#3(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1789#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1790#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1795#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1826#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1824#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1821#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1822#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#3(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1799#L24 assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1800#L24-2 [2024-11-09 15:18:14,902 INFO L747 eck$LassoCheckResult]: Loop: 1800#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1828#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1851#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1849#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1847#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1845#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1843#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#3(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1841#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1839#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(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#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1786#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1835#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1833#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1812#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#3(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1813#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#0(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1829#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1852#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1850#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1848#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1846#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1844#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1842#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#3(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1840#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1838#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1837#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#2(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1836#L24-2 call main_#t~mem4#1 := read~int#1(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1834#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#2(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1832#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#2(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#3(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1831#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#3(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1830#L24 assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#0(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#1(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1800#L24-2 [2024-11-09 15:18:14,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:14,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1450650533, now seen corresponding path program 1 times [2024-11-09 15:18:14,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:14,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455467481] [2024-11-09 15:18:14,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:14,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:14,918 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:14,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:14,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:14,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1011439773, now seen corresponding path program 1 times [2024-11-09 15:18:14,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:14,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039674506] [2024-11-09 15:18:14,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:14,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:14,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:18:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:18:14,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:18:14,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:18:14,943 INFO L85 PathProgramCache]: Analyzing trace with hash 783342599, now seen corresponding path program 2 times [2024-11-09 15:18:14,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:18:14,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785632307] [2024-11-09 15:18:14,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:18:14,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:18:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:18:15,199 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-09 15:18:15,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:18:15,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785632307] [2024-11-09 15:18:15,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785632307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 15:18:15,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370428358] [2024-11-09 15:18:15,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 15:18:15,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 15:18:15,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:18:15,201 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 15:18:15,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2024-11-09 15:18:15,321 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 15:18:15,322 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 15:18:15,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 15:18:15,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 15:18:15,332 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-09 15:18:15,371 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-09 15:18:15,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 15:18:15,402 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-09 15:18:15,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370428358] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 15:18:15,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 15:18:15,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2024-11-09 15:18:15,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820932632] [2024-11-09 15:18:15,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 15:18:17,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:18:17,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 15:18:17,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 15:18:17,210 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-09 15:18:17,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:18:17,235 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2024-11-09 15:18:17,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 40 transitions. [2024-11-09 15:18:17,235 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:18:17,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2024-11-09 15:18:17,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 15:18:17,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 15:18:17,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 15:18:17,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:18:17,236 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:18:17,236 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:18:17,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 15:18:17,236 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 15:18:17,236 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-09 15:18:17,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-09 15:18:17,236 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 15:18:17,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-09 15:18:17,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:18:17 BoogieIcfgContainer [2024-11-09 15:18:17,242 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:18:17,242 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:18:17,242 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:18:17,242 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:18:17,242 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:18:02" (3/4) ... [2024-11-09 15:18:17,244 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 15:18:17,244 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:18:17,245 INFO L158 Benchmark]: Toolchain (without parser) took 14867.80ms. Allocated memory was 151.0MB in the beginning and 327.2MB in the end (delta: 176.2MB). Free memory was 80.0MB in the beginning and 276.7MB in the end (delta: -196.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:18:17,245 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 151.0MB. Free memory was 104.1MB in the beginning and 103.9MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:18:17,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.04ms. Allocated memory is still 151.0MB. Free memory was 79.9MB in the beginning and 122.9MB in the end (delta: -43.0MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-11-09 15:18:17,245 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.50ms. Allocated memory is still 151.0MB. Free memory was 122.9MB in the beginning and 121.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:18:17,245 INFO L158 Benchmark]: Boogie Preprocessor took 47.30ms. Allocated memory was 151.0MB in the beginning and 226.5MB in the end (delta: 75.5MB). Free memory was 121.4MB in the beginning and 198.2MB in the end (delta: -76.9MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. [2024-11-09 15:18:17,246 INFO L158 Benchmark]: RCFGBuilder took 245.37ms. Allocated memory is still 226.5MB. Free memory was 198.2MB in the beginning and 184.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 15:18:17,246 INFO L158 Benchmark]: BuchiAutomizer took 14319.42ms. Allocated memory was 226.5MB in the beginning and 327.2MB in the end (delta: 100.7MB). Free memory was 183.6MB in the beginning and 277.8MB in the end (delta: -94.2MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-11-09 15:18:17,246 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 327.2MB. Free memory was 277.8MB in the beginning and 276.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:18:17,247 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.37ms. Allocated memory is still 151.0MB. Free memory was 104.1MB in the beginning and 103.9MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.04ms. Allocated memory is still 151.0MB. Free memory was 79.9MB in the beginning and 122.9MB in the end (delta: -43.0MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.50ms. Allocated memory is still 151.0MB. Free memory was 122.9MB in the beginning and 121.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.30ms. Allocated memory was 151.0MB in the beginning and 226.5MB in the end (delta: 75.5MB). Free memory was 121.4MB in the beginning and 198.2MB in the end (delta: -76.9MB). Peak memory consumption was 2.6MB. Max. memory is 16.1GB. * RCFGBuilder took 245.37ms. Allocated memory is still 226.5MB. Free memory was 198.2MB in the beginning and 184.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 14319.42ms. Allocated memory was 226.5MB in the beginning and 327.2MB in the end (delta: 100.7MB). Free memory was 183.6MB in the beginning and 277.8MB in the end (delta: -94.2MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 327.2MB. Free memory was 277.8MB in the beginning and 276.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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[~x0~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~mem6 - 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[~x0~0!base,]]] - 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[~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 5 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.2s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 13.5s. 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, 51 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 198 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 90 mSDtfsCounter, 96 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU4 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital270 mio100 ax100 hnf100 lsp100 ukn73 mio100 lsp24 div100 bol100 ite100 ukn100 eq165 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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-09 15:18:17,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2024-11-09 15:18:17,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2024-11-09 15:18:17,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2024-11-09 15:18:17,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE