./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 708f088db085ec098a8544d76f8abbece9dbe61a183e0bc1703749c9af891b6b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 01:05:08,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 01:05:08,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 01:05:08,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 01:05:08,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 01:05:08,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 01:05:08,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 01:05:08,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 01:05:08,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 01:05:08,534 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 01:05:08,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 01:05:08,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 01:05:08,535 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 01:05:08,535 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 01:05:08,535 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 01:05:08,536 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 01:05:08,536 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 01:05:08,537 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 01:05:08,537 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 01:05:08,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 01:05:08,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 01:05:08,538 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 01:05:08,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 01:05:08,539 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 01:05:08,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 01:05:08,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 01:05:08,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 01:05:08,540 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 01:05:08,541 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 01:05:08,545 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 01:05:08,545 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 01:05:08,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 01:05:08,546 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 01:05:08,546 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 01:05:08,546 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 01:05:08,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 01:05:08,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 01:05:08,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 01:05:08,548 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 01:05:08,548 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 708f088db085ec098a8544d76f8abbece9dbe61a183e0bc1703749c9af891b6b [2024-10-12 01:05:08,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 01:05:08,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 01:05:08,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 01:05:08,817 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 01:05:08,817 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 01:05:08,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2024-10-12 01:05:10,215 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 01:05:10,434 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 01:05:10,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2024-10-12 01:05:10,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/90a899c23/b68f6aa5b2c14f00b2724cd76a151c63/FLAG3e831507c [2024-10-12 01:05:10,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/90a899c23/b68f6aa5b2c14f00b2724cd76a151c63 [2024-10-12 01:05:10,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 01:05:10,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 01:05:10,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 01:05:10,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 01:05:10,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 01:05:10,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:05:10" (1/1) ... [2024-10-12 01:05:10,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6acb33af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:10, skipping insertion in model container [2024-10-12 01:05:10,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 01:05:10" (1/1) ... [2024-10-12 01:05:10,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 01:05:11,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 01:05:11,076 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 01:05:11,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 01:05:11,174 INFO L204 MainTranslator]: Completed translation [2024-10-12 01:05:11,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:11 WrapperNode [2024-10-12 01:05:11,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 01:05:11,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 01:05:11,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 01:05:11,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 01:05:11,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:11" (1/1) ... [2024-10-12 01:05:11,197 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:11" (1/1) ... [2024-10-12 01:05:11,232 INFO L138 Inliner]: procedures = 21, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 433 [2024-10-12 01:05:11,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 01:05:11,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 01:05:11,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 01:05:11,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 01:05:11,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:11" (1/1) ... [2024-10-12 01:05:11,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:11" (1/1) ... [2024-10-12 01:05:11,254 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:11" (1/1) ... [2024-10-12 01:05:11,271 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 01:05:11,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:11" (1/1) ... [2024-10-12 01:05:11,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:11" (1/1) ... [2024-10-12 01:05:11,287 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:11" (1/1) ... [2024-10-12 01:05:11,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:11" (1/1) ... [2024-10-12 01:05:11,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:11" (1/1) ... [2024-10-12 01:05:11,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:11" (1/1) ... [2024-10-12 01:05:11,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 01:05:11,303 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 01:05:11,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 01:05:11,303 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 01:05:11,304 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:11" (1/1) ... [2024-10-12 01:05:11,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:11,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:05:11,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:05:11,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 01:05:11,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 01:05:11,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 01:05:11,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 01:05:11,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 01:05:11,504 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 01:05:11,505 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 01:05:12,035 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-10-12 01:05:12,035 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 01:05:12,051 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 01:05:12,051 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 01:05:12,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:05:12 BoogieIcfgContainer [2024-10-12 01:05:12,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 01:05:12,053 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 01:05:12,053 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 01:05:12,059 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 01:05:12,061 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:05:12,064 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 01:05:10" (1/3) ... [2024-10-12 01:05:12,065 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d6416d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 01:05:12, skipping insertion in model container [2024-10-12 01:05:12,065 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:05:12,066 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 01:05:11" (2/3) ... [2024-10-12 01:05:12,066 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d6416d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 01:05:12, skipping insertion in model container [2024-10-12 01:05:12,066 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 01:05:12,066 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:05:12" (3/3) ... [2024-10-12 01:05:12,068 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2024-10-12 01:05:12,131 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 01:05:12,131 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 01:05:12,132 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 01:05:12,132 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 01:05:12,132 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 01:05:12,132 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 01:05:12,133 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 01:05:12,133 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 01:05:12,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 119 states, 118 states have (on average 1.771186440677966) internal successors, (209), 118 states have internal predecessors, (209), 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-12 01:05:12,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2024-10-12 01:05:12,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:05:12,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:05:12,182 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:05:12,182 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:05:12,183 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 01:05:12,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 119 states, 118 states have (on average 1.771186440677966) internal successors, (209), 118 states have internal predecessors, (209), 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-12 01:05:12,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2024-10-12 01:05:12,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:05:12,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:05:12,197 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:05:12,197 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:05:12,207 INFO L745 eck$LassoCheckResult]: Stem: 34#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 40#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_#t~post33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1); 84#L228true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 43#L231-1true init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 31#L241true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 27#L244-1true init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 51#L254true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 54#L257-1true init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 25#L267true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 13#L270-1true init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 92#L280true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 72#L283-1true init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 108#L293true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 70#L296-1true init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 117#L306true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 105#L306-1true init_#res#1 := init_~tmp___5~0#1; 89#init_returnLabel#1true main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1; 44#L509true assume !(0 == main_~i2~0#1); 79#L509-2true ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 32#L523-2true [2024-10-12 01:05:12,208 INFO L747 eck$LassoCheckResult]: Loop: 32#L523-2true assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true; 60#L75true assume !(0 != ~mode1~0 % 256); 56#L100true assume !(~r1~0 < 2); 74#L100-1true ~mode1~0 := 1; 106#L75-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 91#L118true assume !(0 != ~mode2~0 % 256); 95#L143true assume !(~r2~0 < 2); 85#L143-1true ~mode2~0 := 1; 57#L118-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 12#L161true assume !(0 != ~mode3~0 % 256); 65#L186true assume !(~r3~0 < 2); 26#L186-1true ~mode3~0 := 1; 5#L161-2true assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 19#L423true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 62#L423-1true check_#res#1 := check_~tmp~1#1; 17#check_returnLabel#1true main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 77#L553true assume !(0 == assert_~arg#1 % 256); 63#L548true havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post33#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1; 32#L523-2true [2024-10-12 01:05:12,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:05:12,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 1 times [2024-10-12 01:05:12,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:05:12,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194364864] [2024-10-12 01:05:12,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:05:12,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:05:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:05:12,675 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-12 01:05:12,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:05:12,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194364864] [2024-10-12 01:05:12,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194364864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:05:12,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:05:12,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 01:05:12,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962613292] [2024-10-12 01:05:12,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:05:12,685 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:05:12,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:05:12,686 INFO L85 PathProgramCache]: Analyzing trace with hash -310748305, now seen corresponding path program 1 times [2024-10-12 01:05:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:05:12,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526374330] [2024-10-12 01:05:12,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:05:12,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:05:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:05:12,955 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-12 01:05:12,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:05:12,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526374330] [2024-10-12 01:05:12,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526374330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:05:12,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:05:12,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 01:05:12,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023659516] [2024-10-12 01:05:12,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:05:12,957 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:05:12,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:05:12,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 01:05:12,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 01:05:12,994 INFO L87 Difference]: Start difference. First operand has 119 states, 118 states have (on average 1.771186440677966) internal successors, (209), 118 states have internal predecessors, (209), 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 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-12 01:05:13,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:05:13,059 INFO L93 Difference]: Finished difference Result 121 states and 208 transitions. [2024-10-12 01:05:13,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 208 transitions. [2024-10-12 01:05:13,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2024-10-12 01:05:13,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 113 states and 192 transitions. [2024-10-12 01:05:13,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2024-10-12 01:05:13,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2024-10-12 01:05:13,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 192 transitions. [2024-10-12 01:05:13,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:05:13,076 INFO L218 hiAutomatonCegarLoop]: Abstraction has 113 states and 192 transitions. [2024-10-12 01:05:13,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 192 transitions. [2024-10-12 01:05:13,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-12 01:05:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.6991150442477876) internal successors, (192), 112 states have internal predecessors, (192), 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-12 01:05:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 192 transitions. [2024-10-12 01:05:13,113 INFO L240 hiAutomatonCegarLoop]: Abstraction has 113 states and 192 transitions. [2024-10-12 01:05:13,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 01:05:13,119 INFO L425 stractBuchiCegarLoop]: Abstraction has 113 states and 192 transitions. [2024-10-12 01:05:13,121 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 01:05:13,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 192 transitions. [2024-10-12 01:05:13,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2024-10-12 01:05:13,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:05:13,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:05:13,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:05:13,128 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:05:13,128 INFO L745 eck$LassoCheckResult]: Stem: 309#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 310#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_#t~post33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1); 319#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 322#L231-1 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 304#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 264#L244-1 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 302#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 312#L257-1 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 300#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 268#L270-1 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 278#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 342#L283-1 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 348#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 314#L296-1 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 346#L306 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 256#L306-1 init_#res#1 := init_~tmp___5~0#1; 357#init_returnLabel#1 main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1; 323#L509 assume !(0 == main_~i2~0#1); 324#L509-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 305#L523-2 [2024-10-12 01:05:13,129 INFO L747 eck$LassoCheckResult]: Loop: 305#L523-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true; 306#L75 assume !(0 != ~mode1~0 % 256); 335#L100 assume !(~r1~0 < 2); 337#L100-1 ~mode1~0 := 1; 297#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 358#L118 assume !(0 != ~mode2~0 % 256); 359#L143 assume !(~r2~0 < 2); 347#L143-1 ~mode2~0 := 1; 338#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 275#L161 assume !(0 != ~mode3~0 % 256); 277#L186 assume !(~r3~0 < 2); 301#L186-1 ~mode3~0 := 1; 259#L161-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 260#L423 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 290#L424 assume ~st1~0 + ~nl1~0 <= 1; 363#L425 assume ~st2~0 + ~nl2~0 <= 1; 364#L426 assume ~st3~0 + ~nl3~0 <= 1; 356#L427 assume ~r1~0 >= 2; 284#$Ultimate##248 assume ~r1~0 < 2; 279#$Ultimate##252 assume ~r1~0 >= 2; 280#$Ultimate##256 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 318#L423-1 check_#res#1 := check_~tmp~1#1; 285#check_returnLabel#1 main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 286#L553 assume !(0 == assert_~arg#1 % 256); 340#L548 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post33#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1; 305#L523-2 [2024-10-12 01:05:13,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:05:13,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1727567734, now seen corresponding path program 2 times [2024-10-12 01:05:13,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:05:13,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176092564] [2024-10-12 01:05:13,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:05:13,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:05:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:05:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 01:05:13,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:05:13,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176092564] [2024-10-12 01:05:13,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176092564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:05:13,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:05:13,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 01:05:13,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066302377] [2024-10-12 01:05:13,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:05:13,256 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 01:05:13,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:05:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1234927194, now seen corresponding path program 1 times [2024-10-12 01:05:13,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:05:13,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599972793] [2024-10-12 01:05:13,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:05:13,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:05:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:05:13,284 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-12 01:05:13,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:05:13,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599972793] [2024-10-12 01:05:13,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599972793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:05:13,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:05:13,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:05:13,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518575237] [2024-10-12 01:05:13,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:05:13,286 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:05:13,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:05:13,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 01:05:13,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 01:05:13,287 INFO L87 Difference]: Start difference. First operand 113 states and 192 transitions. cyclomatic complexity: 80 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:05:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:05:13,362 INFO L93 Difference]: Finished difference Result 172 states and 284 transitions. [2024-10-12 01:05:13,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 172 states and 284 transitions. [2024-10-12 01:05:13,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2024-10-12 01:05:13,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 172 states to 169 states and 255 transitions. [2024-10-12 01:05:13,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 169 [2024-10-12 01:05:13,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2024-10-12 01:05:13,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 255 transitions. [2024-10-12 01:05:13,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:05:13,372 INFO L218 hiAutomatonCegarLoop]: Abstraction has 169 states and 255 transitions. [2024-10-12 01:05:13,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 255 transitions. [2024-10-12 01:05:13,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 113. [2024-10-12 01:05:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.4601769911504425) internal successors, (165), 112 states have internal predecessors, (165), 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-12 01:05:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2024-10-12 01:05:13,382 INFO L240 hiAutomatonCegarLoop]: Abstraction has 113 states and 165 transitions. [2024-10-12 01:05:13,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 01:05:13,384 INFO L425 stractBuchiCegarLoop]: Abstraction has 113 states and 165 transitions. [2024-10-12 01:05:13,384 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 01:05:13,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 165 transitions. [2024-10-12 01:05:13,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2024-10-12 01:05:13,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:05:13,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:05:13,388 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:05:13,389 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:05:13,389 INFO L745 eck$LassoCheckResult]: Stem: 603#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 604#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_#t~post33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1); 613#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 616#L231-1 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 598#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 557#L244-1 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 595#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 606#L257-1 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 593#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 561#L270-1 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 571#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 636#L283-1 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 642#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 608#L296-1 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 641#L306 assume ~id1~0 != ~id2~0; 644#L307 assume ~id1~0 != ~id3~0; 566#L308 assume ~id2~0 != ~id3~0; 567#L309 assume ~id1~0 >= 0; 643#L310 assume ~id2~0 >= 0; 622#L311 assume ~id3~0 >= 0; 623#L312 assume 0 == ~r1~0; 591#L313 assume 0 == ~r2~0; 592#L314 assume 0 == ~r3~0; 614#L315 assume 0 != init_~r122~0#1 % 256; 615#L316 assume 0 != init_~r132~0#1 % 256; 550#L317 assume 0 != init_~r212~0#1 % 256; 551#L318 assume 0 != init_~r232~0#1 % 256; 660#L319 assume 0 != init_~r312~0#1 % 256; 647#L320 assume 0 != init_~r322~0#1 % 256; 638#L321 assume ~max1~0 == ~id1~0; 639#L322 assume ~max2~0 == ~id2~0; 548#L323 assume ~max3~0 == ~id3~0; 549#L324 assume 0 == ~st1~0; 577#L325 assume 0 == ~st2~0; 597#L326 assume 0 == ~st3~0; 584#L327 assume 0 == ~nl1~0; 585#L328 assume 0 == ~nl2~0; 609#L329 assume 0 == ~nl3~0; 610#L330 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 564#L331 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 565#L332 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296);init_~tmp___5~0#1 := 1; 596#L306-1 init_#res#1 := init_~tmp___5~0#1; 651#init_returnLabel#1 main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1; 617#L509 assume !(0 == main_~i2~0#1); 618#L509-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 601#L523-2 [2024-10-12 01:05:13,390 INFO L747 eck$LassoCheckResult]: Loop: 601#L523-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true; 602#L75 assume !(0 != ~mode1~0 % 256); 630#L100 assume !(~r1~0 < 2); 632#L100-1 ~mode1~0 := 1; 590#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 652#L118 assume !(0 != ~mode2~0 % 256); 653#L143 assume !(~r2~0 < 2); 640#L143-1 ~mode2~0 := 1; 629#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 568#L161 assume !(0 != ~mode3~0 % 256); 570#L186 assume !(~r3~0 < 2); 594#L186-1 ~mode3~0 := 1; 552#L161-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 553#L423 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 583#L424 assume ~st1~0 + ~nl1~0 <= 1; 657#L425 assume ~st2~0 + ~nl2~0 <= 1; 658#L426 assume ~st3~0 + ~nl3~0 <= 1; 650#L427 assume ~r1~0 >= 2; 576#$Ultimate##248 assume ~r1~0 < 2; 572#$Ultimate##252 assume ~r1~0 >= 2; 573#$Ultimate##256 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 612#L423-1 check_#res#1 := check_~tmp~1#1; 578#check_returnLabel#1 main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 579#L553 assume !(0 == assert_~arg#1 % 256); 634#L548 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post33#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1; 601#L523-2 [2024-10-12 01:05:13,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:05:13,392 INFO L85 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 1 times [2024-10-12 01:05:13,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:05:13,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951475712] [2024-10-12 01:05:13,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:05:13,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:05:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:05:13,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:05:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:05:13,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:05:13,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:05:13,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1234927194, now seen corresponding path program 2 times [2024-10-12 01:05:13,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:05:13,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186188409] [2024-10-12 01:05:13,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:05:13,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:05:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:05:13,605 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-12 01:05:13,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:05:13,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186188409] [2024-10-12 01:05:13,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186188409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:05:13,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:05:13,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:05:13,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981515022] [2024-10-12 01:05:13,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:05:13,607 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 01:05:13,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:05:13,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:05:13,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:05:13,607 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. cyclomatic complexity: 53 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 01:05:13,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:05:13,657 INFO L93 Difference]: Finished difference Result 156 states and 229 transitions. [2024-10-12 01:05:13,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 229 transitions. [2024-10-12 01:05:13,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2024-10-12 01:05:13,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 156 states and 229 transitions. [2024-10-12 01:05:13,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2024-10-12 01:05:13,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 156 [2024-10-12 01:05:13,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 229 transitions. [2024-10-12 01:05:13,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:05:13,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 156 states and 229 transitions. [2024-10-12 01:05:13,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 229 transitions. [2024-10-12 01:05:13,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-10-12 01:05:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 156 states have (on average 1.4679487179487178) internal successors, (229), 155 states have internal predecessors, (229), 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-12 01:05:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 229 transitions. [2024-10-12 01:05:13,671 INFO L240 hiAutomatonCegarLoop]: Abstraction has 156 states and 229 transitions. [2024-10-12 01:05:13,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 01:05:13,673 INFO L425 stractBuchiCegarLoop]: Abstraction has 156 states and 229 transitions. [2024-10-12 01:05:13,673 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 01:05:13,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 229 transitions. [2024-10-12 01:05:13,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2024-10-12 01:05:13,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 01:05:13,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 01:05:13,694 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:05:13,694 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 01:05:13,695 INFO L745 eck$LassoCheckResult]: Stem: 878#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0; 879#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~ret31#1, main_#t~ret32#1, main_#t~post33#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;~ep12~0 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;assume 0 == main_#t~nondet5#1 || 1 == main_#t~nondet5#1;~ep13~0 := (if 0 == main_#t~nondet5#1 % 256 then 0 else 1);havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;assume 0 == main_#t~nondet6#1 || 1 == main_#t~nondet6#1;~ep21~0 := (if 0 == main_#t~nondet6#1 % 256 then 0 else 1);havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;assume 0 == main_#t~nondet7#1 || 1 == main_#t~nondet7#1;~ep23~0 := (if 0 == main_#t~nondet7#1 % 256 then 0 else 1);havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;assume 0 == main_#t~nondet8#1 || 1 == main_#t~nondet8#1;~ep31~0 := (if 0 == main_#t~nondet8#1 % 256 then 0 else 1);havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;assume 0 == main_#t~nondet9#1 || 1 == main_#t~nondet9#1;~ep32~0 := (if 0 == main_#t~nondet9#1 % 256 then 0 else 1);havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_#t~nondet13#1;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_#t~nondet15#1;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;assume 0 == main_#t~nondet16#1 || 1 == main_#t~nondet16#1;~mode1~0 := (if 0 == main_#t~nondet16#1 % 256 then 0 else 1);havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_#t~nondet20#1;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;havoc main_#t~nondet21#1;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_#t~nondet22#1;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;havoc main_#t~nondet23#1;assume 0 == main_#t~nondet23#1 || 1 == main_#t~nondet23#1;~mode2~0 := (if 0 == main_#t~nondet23#1 % 256 then 0 else 1);havoc main_#t~nondet23#1;havoc main_#t~nondet24#1;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;havoc main_#t~nondet25#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;havoc main_#t~nondet26#1;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;havoc main_#t~nondet27#1;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;havoc main_#t~nondet28#1;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;havoc main_#t~nondet29#1;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;havoc main_#t~nondet30#1;assume 0 == main_#t~nondet30#1 || 1 == main_#t~nondet30#1;~mode3~0 := (if 0 == main_#t~nondet30#1 % 256 then 0 else 1);havoc main_#t~nondet30#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := (if 0 == ~ep12~0 % 256 then 0 else 1);init_~r131~0#1 := (if 0 == ~ep13~0 % 256 then 0 else 1);init_~r211~0#1 := (if 0 == ~ep21~0 % 256 then 0 else 1);init_~r231~0#1 := (if 0 == ~ep23~0 % 256 then 0 else 1);init_~r311~0#1 := (if 0 == ~ep31~0 % 256 then 0 else 1);init_~r321~0#1 := (if 0 == ~ep32~0 % 256 then 0 else 1); 888#L228 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 891#L231-1 init_~r122~0#1 := (if 0 == (if 0 == init_~tmp~0#1 then 0 else 1) % 256 then 0 else 1); 873#L241 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 832#L244-1 init_~r132~0#1 := (if 0 == (if 0 == init_~tmp___0~0#1 then 0 else 1) % 256 then 0 else 1); 870#L254 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 881#L257-1 init_~r212~0#1 := (if 0 == (if 0 == init_~tmp___1~0#1 then 0 else 1) % 256 then 0 else 1); 868#L267 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 836#L270-1 init_~r232~0#1 := (if 0 == (if 0 == init_~tmp___2~0#1 then 0 else 1) % 256 then 0 else 1); 846#L280 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 910#L283-1 init_~r312~0#1 := (if 0 == (if 0 == init_~tmp___3~0#1 then 0 else 1) % 256 then 0 else 1); 916#L293 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 883#L296-1 init_~r322~0#1 := (if 0 == (if 0 == init_~tmp___4~0#1 then 0 else 1) % 256 then 0 else 1); 914#L306 assume ~id1~0 != ~id2~0; 919#L307 assume ~id1~0 != ~id3~0; 841#L308 assume ~id2~0 != ~id3~0; 842#L309 assume ~id1~0 >= 0; 917#L310 assume ~id2~0 >= 0; 897#L311 assume ~id3~0 >= 0; 898#L312 assume 0 == ~r1~0; 866#L313 assume 0 == ~r2~0; 867#L314 assume 0 == ~r3~0; 889#L315 assume 0 != init_~r122~0#1 % 256; 890#L316 assume 0 != init_~r132~0#1 % 256; 825#L317 assume 0 != init_~r212~0#1 % 256; 826#L318 assume 0 != init_~r232~0#1 % 256; 940#L319 assume 0 != init_~r312~0#1 % 256; 923#L320 assume 0 != init_~r322~0#1 % 256; 912#L321 assume ~max1~0 == ~id1~0; 913#L322 assume ~max2~0 == ~id2~0; 823#L323 assume ~max3~0 == ~id3~0; 824#L324 assume 0 == ~st1~0; 851#L325 assume 0 == ~st2~0; 872#L326 assume 0 == ~st3~0; 858#L327 assume 0 == ~nl1~0; 859#L328 assume 0 == ~nl2~0; 884#L329 assume 0 == ~nl3~0; 885#L330 assume 0 == (if ~mode1~0 % 256 % 4294967296 <= 2147483647 then ~mode1~0 % 256 % 4294967296 else ~mode1~0 % 256 % 4294967296 - 4294967296); 839#L331 assume 0 == (if ~mode2~0 % 256 % 4294967296 <= 2147483647 then ~mode2~0 % 256 % 4294967296 else ~mode2~0 % 256 % 4294967296 - 4294967296); 840#L332 assume 0 == (if ~mode3~0 % 256 % 4294967296 <= 2147483647 then ~mode3~0 % 256 % 4294967296 else ~mode3~0 % 256 % 4294967296 - 4294967296);init_~tmp___5~0#1 := 1; 871#L306-1 init_#res#1 := init_~tmp___5~0#1; 928#init_returnLabel#1 main_#t~ret31#1 := init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret31#1;havoc main_#t~ret31#1; 892#L509 assume !(0 == main_~i2~0#1); 893#L509-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 922#L523-2 [2024-10-12 01:05:13,695 INFO L747 eck$LassoCheckResult]: Loop: 922#L523-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true; 942#L75 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); 907#L77 assume !(0 != ~ep21~0 % 256); 838#L77-1 assume !(0 != ~ep31~0 % 256); 903#L84 assume !(1 == ~r1~0); 864#L91 ~mode1~0 := 0; 865#L75-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true; 976#L118 assume !(0 != ~mode2~0 % 256); 972#L143 assume !(~r2~0 < 2); 967#L143-1 ~mode2~0 := 1; 966#L118-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true; 965#L161 assume !(0 != ~mode3~0 % 256); 957#L186 assume !(~r3~0 < 2); 954#L186-1 ~mode3~0 := 1; 953#L161-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 952#L423 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 951#L424 assume ~st1~0 + ~nl1~0 <= 1; 950#L425 assume ~st2~0 + ~nl2~0 <= 1; 949#L426 assume ~st3~0 + ~nl3~0 <= 1; 948#L427 assume !(~r1~0 >= 2); 849#L430 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 850#$Ultimate##248 assume ~r1~0 < 2; 947#$Ultimate##252 assume !(~r1~0 >= 2); 932#L440 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 933#$Ultimate##256 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 946#L423-1 check_#res#1 := check_~tmp~1#1; 945#check_returnLabel#1 main_#t~ret32#1 := check_#res#1;havoc check_~tmp~1#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret32#1;havoc main_#t~ret32#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 944#L553 assume !(0 == assert_~arg#1 % 256); 943#L548 havoc assert_~arg#1;havoc assert_#in~arg#1;assume { :end_inline_assert } true;main_#t~post33#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1; 922#L523-2 [2024-10-12 01:05:13,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:05:13,698 INFO L85 PathProgramCache]: Analyzing trace with hash -97176065, now seen corresponding path program 2 times [2024-10-12 01:05:13,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:05:13,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276843341] [2024-10-12 01:05:13,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:05:13,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:05:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:05:13,774 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:05:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:05:13,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:05:13,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:05:13,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1448004395, now seen corresponding path program 1 times [2024-10-12 01:05:13,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:05:13,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990753256] [2024-10-12 01:05:13,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:05:13,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:05:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:05:13,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 01:05:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 01:05:13,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 01:05:13,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:05:13,889 INFO L85 PathProgramCache]: Analyzing trace with hash -495556713, now seen corresponding path program 1 times [2024-10-12 01:05:13,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 01:05:13,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898642176] [2024-10-12 01:05:13,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 01:05:13,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 01:05:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:05:13,977 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-12 01:05:13,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 01:05:13,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898642176] [2024-10-12 01:05:13,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898642176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 01:05:13,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 01:05:13,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 01:05:13,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465524274] [2024-10-12 01:05:13,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 01:05:14,733 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:05:14,733 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:05:14,734 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:05:14,734 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:05:14,734 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 01:05:14,734 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:14,734 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:05:14,734 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:05:14,734 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2024-10-12 01:05:14,734 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:05:14,735 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:05:14,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:14,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:14,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:14,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:14,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:14,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:14,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:14,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:14,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:14,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:14,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:14,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:14,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:14,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:14,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:14,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:14,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:15,380 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:05:15,381 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 01:05:15,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:15,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:05:15,387 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:05:15,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 01:05:15,390 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 01:05:15,390 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:05:15,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 01:05:15,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:15,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:05:15,425 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:05:15,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 01:05:15,428 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 01:05:15,428 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 01:05:15,504 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 01:05:15,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 01:05:15,510 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 01:05:15,510 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 01:05:15,510 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 01:05:15,510 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 01:05:15,510 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 01:05:15,510 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:15,510 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 01:05:15,510 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 01:05:15,510 INFO L132 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2024-10-12 01:05:15,510 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 01:05:15,510 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 01:05:15,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:15,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:15,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:15,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:15,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:15,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:15,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:15,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:15,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:15,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:15,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:15,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:15,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:15,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:15,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:15,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:15,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 01:05:16,099 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 01:05:16,102 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 01:05:16,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:16,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:05:16,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:05:16,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 01:05:16,107 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-12 01:05:16,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:05:16,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:05:16,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:05:16,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:05:16,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:05:16,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:05:16,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:05:16,121 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:05:16,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-10-12 01:05:16,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:16,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:05:16,133 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:05:16,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 01:05:16,135 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-12 01:05:16,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:05:16,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:05:16,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:05:16,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:05:16,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:05:16,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:05:16,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:05:16,148 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:05:16,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-12 01:05:16,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:16,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:05:16,160 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:05:16,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 01:05:16,162 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-12 01:05:16,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:05:16,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:05:16,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:05:16,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:05:16,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:05:16,173 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:05:16,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:05:16,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:05:16,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 01:05:16,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:16,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:05:16,194 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:05:16,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 01:05:16,197 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-12 01:05:16,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:05:16,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:05:16,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:05:16,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:05:16,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:05:16,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:05:16,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:05:16,215 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:05:16,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 01:05:16,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:16,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:05:16,232 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:05:16,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 01:05:16,235 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-12 01:05:16,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:05:16,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:05:16,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:05:16,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:05:16,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:05:16,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:05:16,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:05:16,250 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:05:16,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 01:05:16,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:16,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:05:16,267 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:05:16,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 01:05:16,269 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-12 01:05:16,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:05:16,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:05:16,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:05:16,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:05:16,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:05:16,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:05:16,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:05:16,282 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:05:16,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-12 01:05:16,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:16,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:05:16,294 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:05:16,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 01:05:16,295 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-12 01:05:16,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:05:16,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:05:16,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:05:16,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:05:16,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:05:16,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:05:16,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:05:16,308 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:05:16,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-12 01:05:16,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:16,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:05:16,326 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:05:16,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 01:05:16,329 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-12 01:05:16,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:05:16,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:05:16,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:05:16,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:05:16,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:05:16,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:05:16,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:05:16,350 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:05:16,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 01:05:16,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:16,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:05:16,368 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:05:16,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 01:05:16,371 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-12 01:05:16,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:05:16,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:05:16,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:05:16,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:05:16,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:05:16,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:05:16,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:05:16,387 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:05:16,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-12 01:05:16,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:16,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:05:16,405 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:05:16,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 01:05:16,411 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-12 01:05:16,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:05:16,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:05:16,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:05:16,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:05:16,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:05:16,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:05:16,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:05:16,433 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:05:16,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 01:05:16,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:16,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:05:16,450 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:05:16,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 01:05:16,453 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-12 01:05:16,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:05:16,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:05:16,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:05:16,466 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 01:05:16,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:05:16,469 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-10-12 01:05:16,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:05:16,473 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:05:16,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 01:05:16,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:16,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:05:16,490 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:05:16,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 01:05:16,492 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-12 01:05:16,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:05:16,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:05:16,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:05:16,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:05:16,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:05:16,506 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:05:16,506 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:05:16,507 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:05:16,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-12 01:05:16,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:16,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:05:16,525 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:05:16,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 01:05:16,528 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-12 01:05:16,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:05:16,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:05:16,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:05:16,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:05:16,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:05:16,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:05:16,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:05:16,547 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:05:16,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-12 01:05:16,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:16,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:05:16,564 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:05:16,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 01:05:16,567 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-12 01:05:16,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:05:16,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:05:16,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:05:16,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:05:16,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:05:16,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:05:16,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:05:16,583 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 01:05:16,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-12 01:05:16,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:16,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:05:16,600 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:05:16,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 01:05:16,602 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-12 01:05:16,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 01:05:16,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 01:05:16,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 01:05:16,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 01:05:16,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 01:05:16,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 01:05:16,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 01:05:16,621 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 01:05:16,625 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 01:05:16,626 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 01:05:16,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 01:05:16,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 01:05:16,648 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 01:05:16,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 01:05:16,650 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 01:05:16,650 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 01:05:16,650 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 01:05:16,651 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 11 Supporting invariants [] [2024-10-12 01:05:16,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-12 01:05:16,668 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 01:05:16,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 01:05:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:05:16,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 01:05:16,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:05:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 01:05:16,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 01:05:16,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 01:05:16,978 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-12 01:05:16,982 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-12 01:05:16,983 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 156 states and 229 transitions. cyclomatic complexity: 74 Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-12 01:05:17,041 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 156 states and 229 transitions. cyclomatic complexity: 74. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 254 states and 383 transitions. Complement of second has 4 states. [2024-10-12 01:05:17,043 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-12 01:05:17,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-12 01:05:17,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2024-10-12 01:05:17,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 45 letters. Loop has 29 letters. [2024-10-12 01:05:17,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:05:17,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 74 letters. Loop has 29 letters. [2024-10-12 01:05:17,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:05:17,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 165 transitions. Stem has 45 letters. Loop has 58 letters. [2024-10-12 01:05:17,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 01:05:17,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 383 transitions. [2024-10-12 01:05:17,054 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 01:05:17,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 0 states and 0 transitions. [2024-10-12 01:05:17,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 01:05:17,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 01:05:17,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 01:05:17,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:05:17,055 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 01:05:17,055 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 01:05:17,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 01:05:17,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 01:05:17,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 01:05:17,056 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-12 01:05:17,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 01:05:17,056 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2024-10-12 01:05:17,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2024-10-12 01:05:17,056 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 01:05:17,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 01:05:17,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 01:05:17,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 01:05:17,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 01:05:17,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 01:05:17,057 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 01:05:17,057 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 01:05:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 01:05:17,058 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 01:05:17,058 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 01:05:17,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 01:05:17,059 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 01:05:17,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 01:05:17,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 01:05:17 BoogieIcfgContainer [2024-10-12 01:05:17,066 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 01:05:17,066 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 01:05:17,066 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 01:05:17,066 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 01:05:17,067 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 01:05:12" (3/4) ... [2024-10-12 01:05:17,068 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 01:05:17,072 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 01:05:17,072 INFO L158 Benchmark]: Toolchain (without parser) took 6282.99ms. Allocated memory was 134.2MB in the beginning and 230.7MB in the end (delta: 96.5MB). Free memory was 63.8MB in the beginning and 111.7MB in the end (delta: -47.9MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2024-10-12 01:05:17,079 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 01:05:17,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.88ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 63.5MB in the beginning and 155.8MB in the end (delta: -92.3MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2024-10-12 01:05:17,080 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.15ms. Allocated memory is still 188.7MB. Free memory was 155.8MB in the beginning and 152.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 01:05:17,080 INFO L158 Benchmark]: Boogie Preprocessor took 69.22ms. Allocated memory is still 188.7MB. Free memory was 152.9MB in the beginning and 149.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 01:05:17,081 INFO L158 Benchmark]: RCFGBuilder took 748.96ms. Allocated memory is still 188.7MB. Free memory was 149.8MB in the beginning and 113.1MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-12 01:05:17,081 INFO L158 Benchmark]: BuchiAutomizer took 5012.93ms. Allocated memory was 188.7MB in the beginning and 230.7MB in the end (delta: 41.9MB). Free memory was 113.1MB in the beginning and 111.7MB in the end (delta: 1.4MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2024-10-12 01:05:17,081 INFO L158 Benchmark]: Witness Printer took 5.64ms. Allocated memory is still 230.7MB. Free memory is still 111.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 01:05:17,083 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.16ms. Allocated memory is still 134.2MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.88ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 63.5MB in the beginning and 155.8MB in the end (delta: -92.3MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.15ms. Allocated memory is still 188.7MB. Free memory was 155.8MB in the beginning and 152.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.22ms. Allocated memory is still 188.7MB. Free memory was 152.9MB in the beginning and 149.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 748.96ms. Allocated memory is still 188.7MB. Free memory was 149.8MB in the beginning and 113.1MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 5012.93ms. Allocated memory was 188.7MB in the beginning and 230.7MB in the end (delta: 41.9MB). Free memory was 113.1MB in the beginning and 111.7MB in the end (delta: 1.4MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. * Witness Printer took 5.64ms. Allocated memory is still 230.7MB. Free memory is still 111.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i2) + 11) and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 56 StatesRemovedByMinimization, 1 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 301 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 300 mSDsluCounter, 2074 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1358 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60 IncrementalHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 716 mSDtfsCounter, 60 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital146 mio100 ax100 hnf100 lsp28 ukn100 mio100 lsp100 div165 bol100 ite100 ukn100 eq155 hnf98 smp71 dnf104 smp96 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-12 01:05:17,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 01:05:17,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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