./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-dev-4a390ef-m [2024-10-24 23:47:05,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 23:47:05,228 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-24 23:47:05,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 23:47:05,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 23:47:05,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 23:47:05,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 23:47:05,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 23:47:05,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 23:47:05,259 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 23:47:05,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 23:47:05,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 23:47:05,260 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 23:47:05,260 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-24 23:47:05,260 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-24 23:47:05,260 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-24 23:47:05,261 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-24 23:47:05,261 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-24 23:47:05,261 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-24 23:47:05,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 23:47:05,261 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-24 23:47:05,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 23:47:05,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 23:47:05,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-24 23:47:05,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-24 23:47:05,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-24 23:47:05,264 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 23:47:05,264 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 23:47:05,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 23:47:05,265 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-24 23:47:05,265 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 23:47:05,265 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 23:47:05,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 23:47:05,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 23:47:05,266 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 23:47:05,266 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-24 23:47:05,267 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-10-24 23:47:05,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 23:47:05,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 23:47:05,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 23:47:05,500 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 23:47:05,501 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 23:47:05,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2024-10-24 23:47:06,754 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 23:47:06,889 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 23:47:06,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2024-10-24 23:47:06,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/551f5ecce/19331b3d500d4404bb23216dcaa47d84/FLAGf4117a3af [2024-10-24 23:47:06,912 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/551f5ecce/19331b3d500d4404bb23216dcaa47d84 [2024-10-24 23:47:06,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 23:47:06,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 23:47:06,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 23:47:06,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 23:47:06,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 23:47:06,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:47:06" (1/1) ... [2024-10-24 23:47:06,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c3c1131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:06, skipping insertion in model container [2024-10-24 23:47:06,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:47:06" (1/1) ... [2024-10-24 23:47:06,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 23:47:07,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 23:47:07,092 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 23:47:07,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 23:47:07,113 INFO L204 MainTranslator]: Completed translation [2024-10-24 23:47:07,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:07 WrapperNode [2024-10-24 23:47:07,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 23:47:07,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 23:47:07,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 23:47:07,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 23:47:07,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:07" (1/1) ... [2024-10-24 23:47:07,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:07" (1/1) ... [2024-10-24 23:47:07,135 INFO L138 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2024-10-24 23:47:07,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 23:47:07,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 23:47:07,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 23:47:07,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 23:47:07,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:07" (1/1) ... [2024-10-24 23:47:07,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:07" (1/1) ... [2024-10-24 23:47:07,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:07" (1/1) ... [2024-10-24 23:47:07,154 INFO L175 MemorySlicer]: Split 15 memory accesses to 4 slices as follows [3, 4, 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 [2, 3, 3, 3]. [2024-10-24 23:47:07,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:07" (1/1) ... [2024-10-24 23:47:07,154 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:07" (1/1) ... [2024-10-24 23:47:07,159 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:07" (1/1) ... [2024-10-24 23:47:07,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:07" (1/1) ... [2024-10-24 23:47:07,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:07" (1/1) ... [2024-10-24 23:47:07,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:07" (1/1) ... [2024-10-24 23:47:07,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 23:47:07,165 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 23:47:07,165 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 23:47:07,165 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 23:47:07,166 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:07" (1/1) ... [2024-10-24 23:47:07,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:07,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:07,197 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-10-24 23:47:07,201 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-10-24 23:47:07,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 23:47:07,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 23:47:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 23:47:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 23:47:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 23:47:07,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 23:47:07,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 23:47:07,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 23:47:07,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 23:47:07,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 23:47:07,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 23:47:07,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 23:47:07,324 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 23:47:07,325 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 23:47:07,462 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-24 23:47:07,462 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 23:47:07,477 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 23:47:07,477 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 23:47:07,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:47:07 BoogieIcfgContainer [2024-10-24 23:47:07,477 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 23:47:07,478 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-24 23:47:07,478 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-24 23:47:07,481 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-24 23:47:07,482 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-24 23:47:07,482 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 24.10 11:47:06" (1/3) ... [2024-10-24 23:47:07,482 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cba7f6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 24.10 11:47:07, skipping insertion in model container [2024-10-24 23:47:07,483 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-24 23:47:07,483 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:47:07" (2/3) ... [2024-10-24 23:47:07,483 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6cba7f6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 24.10 11:47:07, skipping insertion in model container [2024-10-24 23:47:07,483 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-24 23:47:07,483 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:47:07" (3/3) ... [2024-10-24 23:47:07,484 INFO L332 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2024-10-24 23:47:07,518 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-24 23:47:07,518 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-24 23:47:07,518 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-24 23:47:07,518 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-24 23:47:07,519 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-24 23:47:07,519 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-24 23:47:07,519 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-24 23:47:07,519 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-24 23:47:07,521 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-10-24 23:47:07,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-24 23:47:07,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:47:07,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:47:07,536 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-24 23:47:07,536 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-24 23:47:07,536 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-24 23:47:07,536 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-10-24 23:47:07,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-24 23:47:07,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:47:07,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:47:07,537 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-24 23:47:07,537 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-24 23:47:07,542 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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 4#L24-2true [2024-10-24 23:47:07,542 INFO L747 eck$LassoCheckResult]: Loop: 4#L24-2true call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 4#L24-2true [2024-10-24 23:47:07,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:07,546 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-24 23:47:07,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:07,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73654026] [2024-10-24 23:47:07,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:07,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:07,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:47:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:07,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:47:07,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:07,725 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2024-10-24 23:47:07,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:07,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154527269] [2024-10-24 23:47:07,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:07,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:07,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:47:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:07,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:47:07,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:07,740 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2024-10-24 23:47:07,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:07,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118848729] [2024-10-24 23:47:07,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:07,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:07,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:47:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:07,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:47:08,868 INFO L204 LassoAnalysis]: Preferences: [2024-10-24 23:47:08,880 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-24 23:47:08,881 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-24 23:47:08,881 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-24 23:47:08,881 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-24 23:47:08,881 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:08,882 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-24 23:47:08,882 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-24 23:47:08,882 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2024-10-24 23:47:08,882 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-24 23:47:08,882 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-24 23:47:08,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:09,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:09,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:09,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:09,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:09,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:09,615 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-24 23:47:09,618 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-24 23:47:09,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:09,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:09,621 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-10-24 23:47:09,623 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-10-24 23:47:09,627 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-10-24 23:47:09,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:09,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:09,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:09,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:09,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:09,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:09,657 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:09,668 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-10-24 23:47:09,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:09,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:09,670 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-10-24 23:47:09,672 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-10-24 23:47:09,672 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-10-24 23:47:09,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:09,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:09,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:09,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:09,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:09,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:09,688 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:09,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-24 23:47:09,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:09,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:09,704 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-10-24 23:47:09,705 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-10-24 23:47:09,706 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-10-24 23:47:09,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:09,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:09,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:09,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:09,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:09,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:09,731 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:09,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-24 23:47:09,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:09,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:09,744 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-10-24 23:47:09,746 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-10-24 23:47:09,747 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-10-24 23:47:09,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:09,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:09,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:09,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:09,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:09,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:09,770 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:09,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-24 23:47:09,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:09,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:09,782 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-10-24 23:47:09,783 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-10-24 23:47:09,785 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-10-24 23:47:09,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:09,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:09,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:09,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:09,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:09,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:09,800 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:09,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-10-24 23:47:09,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:09,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:09,813 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-10-24 23:47:09,814 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-10-24 23:47:09,815 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-10-24 23:47:09,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:09,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:09,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:09,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:09,827 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:09,827 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:09,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:09,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-24 23:47:09,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:09,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:09,841 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-10-24 23:47:09,843 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-10-24 23:47:09,844 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-10-24 23:47:09,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:09,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:09,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:09,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:09,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:09,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:09,858 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:09,870 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-10-24 23:47:09,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:09,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:09,871 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-10-24 23:47:09,872 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-10-24 23:47:09,874 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-10-24 23:47:09,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:09,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:09,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:09,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:09,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:09,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:09,898 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:09,911 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-10-24 23:47:09,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:09,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:09,913 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-10-24 23:47:09,914 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-10-24 23:47:09,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:47:09,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:09,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:09,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:09,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:09,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:09,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:09,929 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:09,940 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-10-24 23:47:09,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:09,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:09,942 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-10-24 23:47:09,943 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-10-24 23:47:09,944 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-10-24 23:47:09,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:09,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:09,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:09,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:09,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:09,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:09,960 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:09,974 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-10-24 23:47:09,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:09,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:09,976 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-10-24 23:47:09,976 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-10-24 23:47:09,978 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-10-24 23:47:09,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:09,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:09,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:09,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:09,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:09,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:09,994 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:10,004 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-10-24 23:47:10,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:10,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:10,006 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-10-24 23:47:10,007 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-10-24 23:47:10,008 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-10-24 23:47:10,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:10,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:10,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:10,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:10,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:10,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:10,025 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:10,035 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-10-24 23:47:10,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:10,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:10,037 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-10-24 23:47:10,038 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-10-24 23:47:10,039 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-10-24 23:47:10,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:10,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:10,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:10,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:10,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:10,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:10,055 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-24 23:47:10,069 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-24 23:47:10,070 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-10-24 23:47:10,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:10,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:10,076 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-10-24 23:47:10,079 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-10-24 23:47:10,079 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-24 23:47:10,091 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-24 23:47:10,091 INFO L474 LassoAnalysis]: Proved termination. [2024-10-24 23:47:10,092 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#3 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1) = -2*v_rep(select (select #memory_int#3 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1 + 1 Supporting invariants [] [2024-10-24 23:47:10,104 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-10-24 23:47:10,176 INFO L156 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2024-10-24 23:47:10,182 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-24 23:47:10,184 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-24 23:47:10,184 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2024-10-24 23:47:10,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:47:10,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 23:47:10,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:47:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:47:10,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 23:47:10,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:47:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:47:10,283 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-10-24 23:47:10,285 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-10-24 23:47:10,322 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-10-24 23:47:10,324 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-10-24 23:47:10,328 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-10-24 23:47:10,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2024-10-24 23:47:10,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 3 letters. [2024-10-24 23:47:10,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:47:10,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2024-10-24 23:47:10,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:47:10,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 2 letters. Loop has 6 letters. [2024-10-24 23:47:10,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:47:10,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2024-10-24 23:47:10,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-24 23:47:10,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 13 states and 18 transitions. [2024-10-24 23:47:10,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-24 23:47:10,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-10-24 23:47:10,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2024-10-24 23:47:10,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-24 23:47:10,338 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-24 23:47:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2024-10-24 23:47:10,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-24 23:47:10,358 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-10-24 23:47:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2024-10-24 23:47:10,361 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-24 23:47:10,361 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2024-10-24 23:47:10,361 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-24 23:47:10,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2024-10-24 23:47:10,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-24 23:47:10,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:47:10,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:47:10,362 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-24 23:47:10,362 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-24 23:47:10,362 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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 224#L24-2 call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 215#L20 [2024-10-24 23:47:10,362 INFO L747 eck$LassoCheckResult]: Loop: 215#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 218#L24-2 call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 215#L20 [2024-10-24 23:47:10,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:10,364 INFO L85 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2024-10-24 23:47:10,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:10,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801870559] [2024-10-24 23:47:10,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:10,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:47:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:47:10,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 23:47:10,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801870559] [2024-10-24 23:47:10,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801870559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 23:47:10,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 23:47:10,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 23:47:10,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271501582] [2024-10-24 23:47:10,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 23:47:10,499 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-24 23:47:10,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:10,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2024-10-24 23:47:10,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:10,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426061923] [2024-10-24 23:47:10,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:10,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:10,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:47:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:10,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:47:10,589 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-10-24 23:47:10,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 23:47:10,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 23:47:10,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 23:47:10,635 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-10-24 23:47:10,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 23:47:10,655 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2024-10-24 23:47:10,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2024-10-24 23:47:10,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-24 23:47:10,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 22 transitions. [2024-10-24 23:47:10,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2024-10-24 23:47:10,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-10-24 23:47:10,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2024-10-24 23:47:10,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-24 23:47:10,658 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-10-24 23:47:10,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2024-10-24 23:47:10,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-10-24 23:47:10,660 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-10-24 23:47:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-10-24 23:47:10,660 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-24 23:47:10,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 23:47:10,661 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-24 23:47:10,662 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-24 23:47:10,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2024-10-24 23:47:10,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-10-24 23:47:10,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:47:10,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:47:10,663 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2024-10-24 23:47:10,664 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2024-10-24 23:47:10,664 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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 260#L24-2 call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 259#L24-2 call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 266#L20 [2024-10-24 23:47:10,665 INFO L747 eck$LassoCheckResult]: Loop: 266#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 267#L24-2 call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 257#L24-2 call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 266#L20 [2024-10-24 23:47:10,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:10,665 INFO L85 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2024-10-24 23:47:10,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:10,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557515360] [2024-10-24 23:47:10,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:10,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:10,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:47:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:10,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:47:10,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:10,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1770012235, now seen corresponding path program 1 times [2024-10-24 23:47:10,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:10,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902004105] [2024-10-24 23:47:10,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:10,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:10,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:47:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:10,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:47:10,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:10,735 INFO L85 PathProgramCache]: Analyzing trace with hash -161041423, now seen corresponding path program 1 times [2024-10-24 23:47:10,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:10,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474730559] [2024-10-24 23:47:10,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:10,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:10,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:47:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:10,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:47:11,595 INFO L204 LassoAnalysis]: Preferences: [2024-10-24 23:47:11,596 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-24 23:47:11,596 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-24 23:47:11,596 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-24 23:47:11,596 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-24 23:47:11,596 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:11,596 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-24 23:47:11,596 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-24 23:47:11,596 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration3_Lasso [2024-10-24 23:47:11,596 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-24 23:47:11,596 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-24 23:47:11,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:11,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:12,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:12,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:12,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:12,291 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-24 23:47:12,291 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-24 23:47:12,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:12,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:12,293 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-10-24 23:47:12,294 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-10-24 23:47:12,297 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-10-24 23:47:12,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:12,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:47:12,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:12,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:12,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:12,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:47:12,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:47:12,309 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:12,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-24 23:47:12,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:12,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:12,321 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-10-24 23:47:12,321 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-10-24 23:47:12,322 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-10-24 23:47:12,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:12,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:12,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:12,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:12,336 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:12,336 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:12,338 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:12,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-24 23:47:12,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:12,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:12,350 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-10-24 23:47:12,350 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-10-24 23:47:12,351 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-10-24 23:47:12,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:12,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:12,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:12,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:12,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:12,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:12,367 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:12,381 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-10-24 23:47:12,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:12,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:12,383 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-10-24 23:47:12,384 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-10-24 23:47:12,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:47:12,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:12,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:12,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:12,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:12,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:12,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:12,406 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:12,417 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-10-24 23:47:12,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:12,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:12,419 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-10-24 23:47:12,420 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-10-24 23:47:12,421 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-10-24 23:47:12,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:12,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:12,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:12,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:12,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:12,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:12,434 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:12,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-24 23:47:12,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:12,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:12,449 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-10-24 23:47:12,451 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-10-24 23:47:12,451 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-10-24 23:47:12,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:12,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:12,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:12,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:12,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:12,463 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:12,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:12,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-24 23:47:12,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:12,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:12,478 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-10-24 23:47:12,480 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-10-24 23:47:12,480 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-10-24 23:47:12,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:12,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:12,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:12,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:12,492 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:12,492 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:12,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:12,506 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-10-24 23:47:12,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:12,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:12,507 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-10-24 23:47:12,508 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-10-24 23:47:12,508 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-10-24 23:47:12,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:12,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:12,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:12,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:12,519 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:12,519 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:12,523 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:12,533 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-10-24 23:47:12,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:12,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:12,535 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-10-24 23:47:12,536 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-10-24 23:47:12,536 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-10-24 23:47:12,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:12,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:12,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:12,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:12,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:12,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:12,551 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:12,561 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-10-24 23:47:12,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:12,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:12,563 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-10-24 23:47:12,564 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-10-24 23:47:12,565 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-10-24 23:47:12,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:12,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:12,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:12,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:12,577 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:12,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:12,580 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:12,589 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-10-24 23:47:12,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:12,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:12,591 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-10-24 23:47:12,591 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-10-24 23:47:12,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:47:12,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:12,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:12,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:12,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:12,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:12,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:12,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:12,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-24 23:47:12,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:12,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:12,618 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-10-24 23:47:12,619 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-10-24 23:47:12,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:47:12,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:12,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:12,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:12,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:12,631 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:12,631 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:12,636 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:12,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-10-24 23:47:12,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:12,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:12,647 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-10-24 23:47:12,647 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-10-24 23:47:12,648 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-10-24 23:47:12,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:12,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:12,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:12,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:12,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:12,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:12,664 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:12,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-24 23:47:12,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:12,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:12,675 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-10-24 23:47:12,675 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-10-24 23:47:12,676 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-10-24 23:47:12,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:12,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:12,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:12,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:12,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:12,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:12,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:12,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-24 23:47:12,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:12,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:12,704 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-10-24 23:47:12,706 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-10-24 23:47:12,707 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-10-24 23:47:12,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:12,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:12,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:12,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:12,720 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:12,720 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:12,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:12,734 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-10-24 23:47:12,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:12,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:12,736 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-10-24 23:47:12,737 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-10-24 23:47:12,738 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-10-24 23:47:12,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:12,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:12,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:12,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:12,750 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:12,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:12,754 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-24 23:47:12,764 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2024-10-24 23:47:12,765 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-10-24 23:47:12,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:12,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:12,766 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-10-24 23:47:12,767 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-10-24 23:47:12,768 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-24 23:47:12,779 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-24 23:47:12,779 INFO L474 LassoAnalysis]: Proved termination. [2024-10-24 23:47:12,779 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-10-24 23:47:12,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-24 23:47:12,878 INFO L156 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2024-10-24 23:47:12,879 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~mem6 [2024-10-24 23:47:12,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:47:12,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 23:47:12,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:47:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:47:12,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 23:47:12,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:47:12,966 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-10-24 23:47:12,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 23:47:12,994 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-10-24 23:47:12,995 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-10-24 23:47:13,008 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-10-24 23:47:13,008 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-10-24 23:47:13,009 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-10-24 23:47:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-10-24 23:47:13,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 7 letters. [2024-10-24 23:47:13,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:47:13,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 15 letters. Loop has 7 letters. [2024-10-24 23:47:13,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:47:13,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 14 letters. [2024-10-24 23:47:13,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:47:13,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2024-10-24 23:47:13,011 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-24 23:47:13,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 41 transitions. [2024-10-24 23:47:13,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-24 23:47:13,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-10-24 23:47:13,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2024-10-24 23:47:13,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-24 23:47:13,012 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-10-24 23:47:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2024-10-24 23:47:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-10-24 23:47:13,013 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-10-24 23:47:13,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-10-24 23:47:13,014 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-24 23:47:13,014 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-24 23:47:13,014 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-24 23:47:13,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2024-10-24 23:47:13,015 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-10-24 23:47:13,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:47:13,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:47:13,015 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2024-10-24 23:47:13,015 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-24 23:47:13,015 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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 525#L24-2 call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 519#L24-2 call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(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#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 517#L24-2 [2024-10-24 23:47:13,015 INFO L747 eck$LassoCheckResult]: Loop: 517#L24-2 call main_#t~mem4#1 := read~int#0(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#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 517#L24-2 [2024-10-24 23:47:13,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:13,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 2 times [2024-10-24 23:47:13,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:13,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915859847] [2024-10-24 23:47:13,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:13,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:13,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:47:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:13,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:47:13,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:13,059 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 2 times [2024-10-24 23:47:13,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:13,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363795506] [2024-10-24 23:47:13,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:13,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:13,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:47:13,072 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-10-24 23:47:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:13,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:47:13,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:13,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1467212283, now seen corresponding path program 3 times [2024-10-24 23:47:13,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:13,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263987032] [2024-10-24 23:47:13,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:13,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:13,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:47:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:13,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:47:14,293 INFO L204 LassoAnalysis]: Preferences: [2024-10-24 23:47:14,293 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-24 23:47:14,294 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-24 23:47:14,294 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-24 23:47:14,294 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-24 23:47:14,294 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:14,294 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-24 23:47:14,294 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-24 23:47:14,294 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration4_Lasso [2024-10-24 23:47:14,294 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-24 23:47:14,295 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-24 23:47:14,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:14,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:14,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:14,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:14,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:14,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:14,913 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-24 23:47:14,913 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-24 23:47:14,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:14,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:14,914 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-10-24 23:47:14,915 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-10-24 23:47:14,916 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-10-24 23:47:14,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:14,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:14,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:14,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:14,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:14,928 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:14,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:14,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-10-24 23:47:14,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:14,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:14,942 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-10-24 23:47:14,942 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-10-24 23:47:14,944 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-10-24 23:47:14,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:14,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:14,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:14,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:14,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:14,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:14,957 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:14,967 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-10-24 23:47:14,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:14,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:14,968 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-10-24 23:47:14,969 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-10-24 23:47:14,969 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-10-24 23:47:14,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:14,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:14,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:14,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:14,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:14,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:14,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:14,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-10-24 23:47:14,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:14,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:14,995 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-10-24 23:47:14,995 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-10-24 23:47:14,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:47:15,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:15,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:15,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:15,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:15,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:15,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:15,008 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:15,018 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-10-24 23:47:15,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:15,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:15,020 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-10-24 23:47:15,021 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-10-24 23:47:15,021 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-10-24 23:47:15,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:15,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:15,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:15,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:15,033 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:15,033 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:15,036 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:15,046 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-10-24 23:47:15,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:15,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:15,047 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-10-24 23:47:15,048 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-10-24 23:47:15,049 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-10-24 23:47:15,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:15,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:15,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:15,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:15,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:15,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:15,061 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:15,072 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-10-24 23:47:15,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:15,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:15,073 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-10-24 23:47:15,074 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-10-24 23:47:15,074 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-10-24 23:47:15,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:15,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:15,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:15,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:15,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:15,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:15,087 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:15,097 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-10-24 23:47:15,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:15,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:15,098 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:47:15,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-24 23:47:15,099 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-10-24 23:47:15,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:15,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:15,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:15,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:15,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:15,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:15,116 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-24 23:47:15,121 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-24 23:47:15,122 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-10-24 23:47:15,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:15,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:15,123 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-10-24 23:47:15,123 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-10-24 23:47:15,124 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-24 23:47:15,135 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-24 23:47:15,135 INFO L474 LassoAnalysis]: Proved termination. [2024-10-24 23:47:15,135 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#3 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_3) = -2*v_rep(select (select #memory_int#3 ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_3 + 1 Supporting invariants [] [2024-10-24 23:47:15,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-10-24 23:47:15,213 INFO L156 tatePredicateManager]: 35 out of 35 supporting invariants were superfluous and have been removed [2024-10-24 23:47:15,214 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-24 23:47:15,214 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-24 23:47:15,214 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~x0~0!base,]]] [2024-10-24 23:47:15,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:47:15,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 23:47:15,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:47:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:47:15,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 23:47:15,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:47:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 23:47:15,275 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-10-24 23:47:15,275 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 36 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:47:15,291 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 36 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 61 states and 76 transitions. Complement of second has 7 states. [2024-10-24 23:47:15,292 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-10-24 23:47:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 23:47:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-10-24 23:47:15,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 3 letters. [2024-10-24 23:47:15,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:47:15,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 12 letters. Loop has 3 letters. [2024-10-24 23:47:15,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:47:15,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 6 letters. [2024-10-24 23:47:15,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:47:15,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 76 transitions. [2024-10-24 23:47:15,296 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2024-10-24 23:47:15,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 51 states and 64 transitions. [2024-10-24 23:47:15,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-10-24 23:47:15,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-24 23:47:15,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 64 transitions. [2024-10-24 23:47:15,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-24 23:47:15,296 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 64 transitions. [2024-10-24 23:47:15,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 64 transitions. [2024-10-24 23:47:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2024-10-24 23:47:15,300 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-10-24 23:47:15,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2024-10-24 23:47:15,300 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 60 transitions. [2024-10-24 23:47:15,300 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2024-10-24 23:47:15,300 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-24 23:47:15,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 60 transitions. [2024-10-24 23:47:15,301 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2024-10-24 23:47:15,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:47:15,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:47:15,301 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2024-10-24 23:47:15,302 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2024-10-24 23:47:15,302 INFO L745 eck$LassoCheckResult]: Stem: 811#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 812#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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 815#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 840#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 805#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 806#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 839#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 835#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 830#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 831#L24 [2024-10-24 23:47:15,302 INFO L747 eck$LassoCheckResult]: Loop: 831#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#1(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 845#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 844#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 843#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 838#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 842#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 836#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 837#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 831#L24 [2024-10-24 23:47:15,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:15,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1269321585, now seen corresponding path program 1 times [2024-10-24 23:47:15,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:15,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643843104] [2024-10-24 23:47:15,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:15,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:47:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 23:47:15,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 23:47:15,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643843104] [2024-10-24 23:47:15,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643843104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 23:47:15,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 23:47:15,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 23:47:15,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54678] [2024-10-24 23:47:15,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 23:47:15,394 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-24 23:47:15,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:15,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1088312668, now seen corresponding path program 1 times [2024-10-24 23:47:15,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:15,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784149815] [2024-10-24 23:47:15,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:15,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:15,397 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-10-24 23:47:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:15,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:47:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:15,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:47:15,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 23:47:15,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 23:47:15,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 23:47:15,605 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-10-24 23:47:15,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 23:47:15,616 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2024-10-24 23:47:15,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2024-10-24 23:47:15,617 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-10-24 23:47:15,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2024-10-24 23:47:15,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-24 23:47:15,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-24 23:47:15,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2024-10-24 23:47:15,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-24 23:47:15,618 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-10-24 23:47:15,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2024-10-24 23:47:15,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-24 23:47:15,620 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-10-24 23:47:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2024-10-24 23:47:15,620 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-10-24 23:47:15,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 23:47:15,621 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-10-24 23:47:15,621 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-24 23:47:15,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2024-10-24 23:47:15,621 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-10-24 23:47:15,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:47:15,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:47:15,622 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 1, 1] [2024-10-24 23:47:15,622 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-24 23:47:15,622 INFO L745 eck$LassoCheckResult]: Stem: 907#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 908#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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 912#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 932#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 931#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 929#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 926#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 913#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 914#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 935#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 901#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 902#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 910#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 911#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 915#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 900#L24-2 [2024-10-24 23:47:15,622 INFO L747 eck$LassoCheckResult]: Loop: 900#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 934#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 899#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 900#L24-2 [2024-10-24 23:47:15,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:15,622 INFO L85 PathProgramCache]: Analyzing trace with hash -697316797, now seen corresponding path program 4 times [2024-10-24 23:47:15,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:15,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551723774] [2024-10-24 23:47:15,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:15,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:47:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 23:47:15,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 23:47:15,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551723774] [2024-10-24 23:47:15,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551723774] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 23:47:15,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188556431] [2024-10-24 23:47:15,722 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-24 23:47:15,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 23:47:15,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:15,724 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 23:47:15,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2024-10-24 23:47:15,780 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-24 23:47:15,780 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 23:47:15,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 23:47:15,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:47:15,785 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-10-24 23:47:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-24 23:47:15,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 23:47:15,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188556431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 23:47:15,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 23:47:15,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-24 23:47:15,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868742312] [2024-10-24 23:47:15,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 23:47:15,817 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-24 23:47:15,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:15,817 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 3 times [2024-10-24 23:47:15,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:15,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545365288] [2024-10-24 23:47:15,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:15,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:15,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:47:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:15,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:47:15,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 23:47:15,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 23:47:15,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 23:47:15,868 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-10-24 23:47:15,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 23:47:15,882 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-10-24 23:47:15,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2024-10-24 23:47:15,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-10-24 23:47:15,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 36 transitions. [2024-10-24 23:47:15,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-10-24 23:47:15,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-24 23:47:15,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2024-10-24 23:47:15,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-24 23:47:15,883 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-10-24 23:47:15,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2024-10-24 23:47:15,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2024-10-24 23:47:15,885 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-10-24 23:47:15,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-10-24 23:47:15,885 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-24 23:47:15,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 23:47:15,886 INFO L425 stractBuchiCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-24 23:47:15,886 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-24 23:47:15,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2024-10-24 23:47:15,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-10-24 23:47:15,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:47:15,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:47:15,887 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1] [2024-10-24 23:47:15,887 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2024-10-24 23:47:15,887 INFO L745 eck$LassoCheckResult]: Stem: 1036#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1037#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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1040#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1035#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1030#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1031#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1034#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1041#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1042#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1038#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1039#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1049#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1046#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1045#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1044#L20 [2024-10-24 23:47:15,887 INFO L747 eck$LassoCheckResult]: Loop: 1044#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1043#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#1(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1032#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1033#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1028#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1029#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1056#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1055#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1054#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1053#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1052#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1051#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1047#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1048#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1044#L20 [2024-10-24 23:47:15,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:15,887 INFO L85 PathProgramCache]: Analyzing trace with hash -161041423, now seen corresponding path program 5 times [2024-10-24 23:47:15,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:15,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197309092] [2024-10-24 23:47:15,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:15,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:15,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:47:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:15,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:47:15,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:15,922 INFO L85 PathProgramCache]: Analyzing trace with hash -97586480, now seen corresponding path program 1 times [2024-10-24 23:47:15,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:15,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969580013] [2024-10-24 23:47:15,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:15,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:15,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:47:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:15,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:47:15,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:15,936 INFO L85 PathProgramCache]: Analyzing trace with hash 569106656, now seen corresponding path program 1 times [2024-10-24 23:47:15,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:15,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414364733] [2024-10-24 23:47:15,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:15,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:15,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:47:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:15,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:47:17,484 INFO L204 LassoAnalysis]: Preferences: [2024-10-24 23:47:17,485 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-24 23:47:17,485 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-24 23:47:17,485 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-24 23:47:17,485 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-24 23:47:17,485 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:17,485 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-24 23:47:17,485 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-24 23:47:17,485 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration7_Lasso [2024-10-24 23:47:17,485 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-24 23:47:17,485 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-24 23:47:17,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:17,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:17,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:17,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:17,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-24 23:47:18,207 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-24 23:47:18,207 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-24 23:47:18,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:18,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:18,208 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-10-24 23:47:18,210 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-10-24 23:47:18,211 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-10-24 23:47:18,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:18,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-24 23:47:18,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:18,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:18,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:18,221 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-24 23:47:18,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-24 23:47:18,222 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:18,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-10-24 23:47:18,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:18,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:18,232 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-10-24 23:47:18,245 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-10-24 23:47:18,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:47:18,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:18,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:18,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:18,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:18,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:18,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:18,261 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:18,270 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-10-24 23:47:18,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:18,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:18,283 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-10-24 23:47:18,284 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-10-24 23:47:18,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-10-24 23:47:18,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:18,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:18,294 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-24 23:47:18,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:18,298 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-10-24 23:47:18,298 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-24 23:47:18,307 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:18,316 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-10-24 23:47:18,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:18,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:18,318 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-10-24 23:47:18,318 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-10-24 23:47:18,319 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-10-24 23:47:18,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:18,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:18,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:18,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:18,331 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:18,331 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:18,335 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:18,344 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-10-24 23:47:18,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:18,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:18,346 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-10-24 23:47:18,347 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-10-24 23:47:18,348 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-10-24 23:47:18,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:18,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:18,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:18,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:18,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:18,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:18,364 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:18,374 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-10-24 23:47:18,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:18,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:18,375 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:47:18,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-24 23:47:18,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:47:18,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:18,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:18,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:18,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:18,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:18,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:18,391 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:18,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-10-24 23:47:18,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:18,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:18,402 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:47:18,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-24 23:47:18,403 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-10-24 23:47:18,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:18,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:18,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:18,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:18,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:18,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:18,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:18,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-24 23:47:18,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:18,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:18,430 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:47:18,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-24 23:47:18,432 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-10-24 23:47:18,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:18,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:18,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:18,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:18,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:18,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:18,452 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:18,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-10-24 23:47:18,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:18,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:18,464 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:47:18,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-24 23:47:18,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-24 23:47:18,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:18,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:18,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:18,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:18,477 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:18,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:18,479 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:18,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-24 23:47:18,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:18,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:18,490 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:47:18,491 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-10-24 23:47:18,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-24 23:47:18,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:18,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:18,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:18,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:18,502 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:18,502 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:18,506 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:18,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-10-24 23:47:18,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:18,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:18,517 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:47:18,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-24 23:47:18,518 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-10-24 23:47:18,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:18,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:18,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:18,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:18,530 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:18,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:18,533 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:18,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-10-24 23:47:18,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:18,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:18,544 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:47:18,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-24 23:47:18,545 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-10-24 23:47:18,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:18,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:18,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:18,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:18,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:18,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:18,560 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:18,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-10-24 23:47:18,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:18,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:18,570 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:47:18,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-24 23:47:18,572 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-10-24 23:47:18,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:18,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:18,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:18,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:18,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:18,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:18,588 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:18,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-10-24 23:47:18,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:18,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:18,600 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:47:18,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-24 23:47:18,603 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-10-24 23:47:18,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:18,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:18,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:18,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:18,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:18,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:18,618 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-24 23:47:18,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-10-24 23:47:18,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:18,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:18,629 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:47:18,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-24 23:47:18,631 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-10-24 23:47:18,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-24 23:47:18,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-24 23:47:18,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-24 23:47:18,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-24 23:47:18,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-24 23:47:18,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-24 23:47:18,645 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-24 23:47:18,647 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-10-24 23:47:18,648 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-10-24 23:47:18,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-24 23:47:18,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:18,649 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-24 23:47:18,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2024-10-24 23:47:18,650 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-24 23:47:18,660 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-24 23:47:18,661 INFO L474 LassoAnalysis]: Proved termination. [2024-10-24 23:47:18,661 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4) = -2*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_4 + 1 Supporting invariants [] [2024-10-24 23:47:18,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-10-24 23:47:18,753 INFO L156 tatePredicateManager]: 38 out of 38 supporting invariants were superfluous and have been removed [2024-10-24 23:47:18,754 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-24 23:47:18,754 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-24 23:47:18,754 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x2~0!base,]]] [2024-10-24 23:47:18,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:47:18,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 23:47:18,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:47:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:47:18,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 23:47:18,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:47:18,836 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 34 treesize of output 11 [2024-10-24 23:47:18,879 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 23:47:18,879 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-10-24 23:47:18,879 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-10-24 23:47:18,896 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-10-24 23:47:18,897 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-10-24 23:47:18,897 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-10-24 23:47:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2024-10-24 23:47:18,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 15 letters. [2024-10-24 23:47:18,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:47:18,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 30 letters. Loop has 15 letters. [2024-10-24 23:47:18,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:47:18,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 30 letters. [2024-10-24 23:47:18,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-24 23:47:18,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 77 transitions. [2024-10-24 23:47:18,899 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2024-10-24 23:47:18,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 77 transitions. [2024-10-24 23:47:18,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-10-24 23:47:18,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-10-24 23:47:18,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 77 transitions. [2024-10-24 23:47:18,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-24 23:47:18,900 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2024-10-24 23:47:18,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 77 transitions. [2024-10-24 23:47:18,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-24 23:47:18,903 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-10-24 23:47:18,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2024-10-24 23:47:18,904 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 77 transitions. [2024-10-24 23:47:18,904 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 77 transitions. [2024-10-24 23:47:18,904 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-24 23:47:18,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 77 transitions. [2024-10-24 23:47:18,905 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2024-10-24 23:47:18,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:47:18,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:47:18,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2024-10-24 23:47:18,905 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2024-10-24 23:47:18,906 INFO L745 eck$LassoCheckResult]: Stem: 1396#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1397#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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1402#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1400#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1401#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1436#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1435#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1434#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1433#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1394#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1395#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1391#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1392#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1441#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1423#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1424#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1407#L24 assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1408#L24-2 [2024-10-24 23:47:18,906 INFO L747 eck$LassoCheckResult]: Loop: 1408#L24-2 call main_#t~mem4#1 := read~int#0(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#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1440#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1438#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1439#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1437#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1403#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1404#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1398#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1399#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1444#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1445#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1443#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1419#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1420#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#1(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1408#L24-2 [2024-10-24 23:47:18,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:18,906 INFO L85 PathProgramCache]: Analyzing trace with hash -141984138, now seen corresponding path program 1 times [2024-10-24 23:47:18,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:18,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320806432] [2024-10-24 23:47:18,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:18,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:47:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 23:47:18,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 23:47:18,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320806432] [2024-10-24 23:47:18,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320806432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 23:47:18,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 23:47:18,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 23:47:18,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289499935] [2024-10-24 23:47:18,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 23:47:18,990 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-24 23:47:18,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:18,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1365622390, now seen corresponding path program 2 times [2024-10-24 23:47:18,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:18,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960304329] [2024-10-24 23:47:18,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:18,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:18,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:47:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:19,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:47:19,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-10-24 23:47:19,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 23:47:19,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 23:47:19,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 23:47:19,402 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-10-24 23:47:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 23:47:19,415 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2024-10-24 23:47:19,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 97 transitions. [2024-10-24 23:47:19,416 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2024-10-24 23:47:19,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 76 states and 88 transitions. [2024-10-24 23:47:19,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-10-24 23:47:19,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-10-24 23:47:19,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 88 transitions. [2024-10-24 23:47:19,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-24 23:47:19,417 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 88 transitions. [2024-10-24 23:47:19,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 88 transitions. [2024-10-24 23:47:19,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-10-24 23:47:19,419 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-10-24 23:47:19,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2024-10-24 23:47:19,420 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-10-24 23:47:19,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 23:47:19,420 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-10-24 23:47:19,420 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-24 23:47:19,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 86 transitions. [2024-10-24 23:47:19,421 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2024-10-24 23:47:19,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:47:19,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:47:19,421 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1, 1, 1, 1, 1] [2024-10-24 23:47:19,421 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-24 23:47:19,422 INFO L745 eck$LassoCheckResult]: Stem: 1555#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1556#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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1558#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1582#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1549#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1550#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1584#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1587#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1586#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1585#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1583#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1577#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1578#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1574#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1573#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1566#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1564#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#1(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1565#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1572#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1618#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1613#L24-2 [2024-10-24 23:47:19,422 INFO L747 eck$LassoCheckResult]: Loop: 1613#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1616#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1612#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1613#L24-2 [2024-10-24 23:47:19,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:19,422 INFO L85 PathProgramCache]: Analyzing trace with hash 693278934, now seen corresponding path program 2 times [2024-10-24 23:47:19,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:19,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187598243] [2024-10-24 23:47:19,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:19,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:19,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:47:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:19,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:47:19,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:19,449 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 4 times [2024-10-24 23:47:19,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:19,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990297158] [2024-10-24 23:47:19,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:19,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:19,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:47:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:19,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:47:19,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:19,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1024996556, now seen corresponding path program 3 times [2024-10-24 23:47:19,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:19,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418583584] [2024-10-24 23:47:19,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:19,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:47:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 23:47:19,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 23:47:19,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418583584] [2024-10-24 23:47:19,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418583584] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 23:47:19,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321529521] [2024-10-24 23:47:19,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 23:47:19,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 23:47:19,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:19,571 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 23:47:19,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2024-10-24 23:47:19,641 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-24 23:47:19,641 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 23:47:19,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 23:47:19,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:47:19,650 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-10-24 23:47:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-24 23:47:19,655 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 23:47:19,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321529521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 23:47:19,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 23:47:19,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-10-24 23:47:19,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841412815] [2024-10-24 23:47:19,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 23:47:19,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 23:47:19,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 23:47:19,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 23:47:19,699 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-10-24 23:47:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 23:47:19,712 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2024-10-24 23:47:19,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 80 transitions. [2024-10-24 23:47:19,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-10-24 23:47:19,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 74 states and 76 transitions. [2024-10-24 23:47:19,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-10-24 23:47:19,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2024-10-24 23:47:19,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 76 transitions. [2024-10-24 23:47:19,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-24 23:47:19,713 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 76 transitions. [2024-10-24 23:47:19,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 76 transitions. [2024-10-24 23:47:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2024-10-24 23:47:19,718 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-10-24 23:47:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2024-10-24 23:47:19,718 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 70 transitions. [2024-10-24 23:47:19,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 23:47:19,721 INFO L425 stractBuchiCegarLoop]: Abstraction has 68 states and 70 transitions. [2024-10-24 23:47:19,721 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-24 23:47:19,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 70 transitions. [2024-10-24 23:47:19,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2024-10-24 23:47:19,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-24 23:47:19,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-24 23:47:19,722 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 1, 1, 1, 1] [2024-10-24 23:47:19,722 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 4, 4, 2, 2, 1, 1] [2024-10-24 23:47:19,722 INFO L745 eck$LassoCheckResult]: Stem: 1786#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1787#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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1789#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1812#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1811#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1810#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1809#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1808#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1807#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1784#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1785#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1780#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1781#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1804#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1798#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1796#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1794#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#1(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1795#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1803#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1818#L24-2 call main_#t~mem4#1 := read~int#0(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#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1813#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1790#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1782#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1783#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1788#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1819#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1817#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1814#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1815#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1792#L24 assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1793#L24-2 [2024-10-24 23:47:19,722 INFO L747 eck$LassoCheckResult]: Loop: 1793#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1821#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(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#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1842#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1840#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1838#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1836#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1834#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1832#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1778#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1779#L24-2 call main_#t~mem4#1 := read~int#0(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#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1826#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1805#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1806#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int#1(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1822#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1845#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1843#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1841#L24-2 call main_#t~mem4#1 := read~int#0(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#3(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#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1835#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int#2(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1833#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1831#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1830#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int#3(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1829#L24-2 call main_#t~mem4#1 := read~int#0(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1827#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int#3(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 1825#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int#3(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int#2(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 1824#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int#2(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int#1(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 1823#L24 assume !(0 == main_#t~mem7#1);havoc main_#t~mem7#1;call write~int#1(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(1, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 1793#L24-2 [2024-10-24 23:47:19,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:19,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1450650533, now seen corresponding path program 1 times [2024-10-24 23:47:19,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:19,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169783705] [2024-10-24 23:47:19,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:19,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:19,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:47:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:19,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:47:19,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:19,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1011439773, now seen corresponding path program 1 times [2024-10-24 23:47:19,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:19,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172477045] [2024-10-24 23:47:19,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:19,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:19,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 23:47:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 23:47:19,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 23:47:19,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 23:47:19,783 INFO L85 PathProgramCache]: Analyzing trace with hash 783342599, now seen corresponding path program 2 times [2024-10-24 23:47:19,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 23:47:19,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056131902] [2024-10-24 23:47:19,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 23:47:19,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 23:47:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 23:47:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 227 proven. 20 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-10-24 23:47:20,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 23:47:20,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056131902] [2024-10-24 23:47:20,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056131902] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 23:47:20,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813908021] [2024-10-24 23:47:20,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 23:47:20,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 23:47:20,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 23:47:20,035 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 23:47:20,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2024-10-24 23:47:20,156 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 23:47:20,156 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 23:47:20,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 23:47:20,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 23:47:20,162 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-10-24 23:47:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 223 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-10-24 23:47:20,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 23:47:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 223 proven. 7 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-10-24 23:47:20,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813908021] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 23:47:20,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 23:47:20,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2024-10-24 23:47:20,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835098654] [2024-10-24 23:47:20,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 23:47:22,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 23:47:22,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 23:47:22,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 23:47:22,039 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-10-24 23:47:22,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 23:47:22,070 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2024-10-24 23:47:22,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 40 transitions. [2024-10-24 23:47:22,071 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-24 23:47:22,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2024-10-24 23:47:22,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-24 23:47:22,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-24 23:47:22,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-24 23:47:22,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-24 23:47:22,072 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 23:47:22,072 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 23:47:22,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 23:47:22,073 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 23:47:22,073 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-24 23:47:22,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-24 23:47:22,073 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-24 23:47:22,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-24 23:47:22,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 24.10 11:47:22 BoogieIcfgContainer [2024-10-24 23:47:22,079 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-24 23:47:22,080 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 23:47:22,080 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 23:47:22,080 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 23:47:22,080 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:47:07" (3/4) ... [2024-10-24 23:47:22,082 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 23:47:22,082 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 23:47:22,083 INFO L158 Benchmark]: Toolchain (without parser) took 15168.48ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 121.0MB in the beginning and 161.2MB in the end (delta: -40.2MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. [2024-10-24 23:47:22,083 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 100.7MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 23:47:22,083 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.28ms. Allocated memory is still 163.6MB. Free memory was 121.0MB in the beginning and 109.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 23:47:22,083 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.30ms. Allocated memory is still 163.6MB. Free memory was 109.1MB in the beginning and 107.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 23:47:22,084 INFO L158 Benchmark]: Boogie Preprocessor took 28.61ms. Allocated memory is still 163.6MB. Free memory was 107.8MB in the beginning and 105.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 23:47:22,084 INFO L158 Benchmark]: RCFGBuilder took 312.34ms. Allocated memory is still 163.6MB. Free memory was 105.7MB in the beginning and 126.7MB in the end (delta: -20.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-24 23:47:22,084 INFO L158 Benchmark]: BuchiAutomizer took 14600.96ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 126.7MB in the beginning and 161.2MB in the end (delta: -34.5MB). Peak memory consumption was 89.2MB. Max. memory is 16.1GB. [2024-10-24 23:47:22,084 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 285.2MB. Free memory is still 161.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 23:47:22,085 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.32ms. Allocated memory is still 100.7MB. Free memory is still 67.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.28ms. Allocated memory is still 163.6MB. Free memory was 121.0MB in the beginning and 109.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.30ms. Allocated memory is still 163.6MB. Free memory was 109.1MB in the beginning and 107.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.61ms. Allocated memory is still 163.6MB. Free memory was 107.8MB in the beginning and 105.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 312.34ms. Allocated memory is still 163.6MB. Free memory was 105.7MB in the beginning and 126.7MB in the end (delta: -20.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 14600.96ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 126.7MB in the beginning and 161.2MB in the end (delta: -34.5MB). Peak memory consumption was 89.2MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 285.2MB. Free memory is still 161.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~x0~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~mem6 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~x0~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x2~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.5s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 13.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 19 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 22/22 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 206 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 113 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 98 IncrementalHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 93 mSDtfsCounter, 98 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: 36ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-24 23:47:22,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2024-10-24 23:47:22,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2024-10-24 23:47:22,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2024-10-24 23:47:22,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE