./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/toy1.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c40ed6d21fe4d61cae011269f1fdb95d05149cea0f3470f42c6e8f2fc8fb0d6a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 15:03:53,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 15:03:53,835 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 15:03:53,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 15:03:53,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 15:03:53,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 15:03:53,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 15:03:53,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 15:03:53,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 15:03:53,865 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 15:03:53,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 15:03:53,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 15:03:53,866 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 15:03:53,866 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 15:03:53,866 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 15:03:53,867 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 15:03:53,867 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 15:03:53,867 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 15:03:53,867 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 15:03:53,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 15:03:53,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 15:03:53,870 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 15:03:53,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 15:03:53,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 15:03:53,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 15:03:53,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 15:03:53,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 15:03:53,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 15:03:53,871 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 15:03:53,871 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 15:03:53,872 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 15:03:53,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 15:03:53,872 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 15:03:53,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 15:03:53,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 15:03:53,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 15:03:53,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 15:03:53,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 15:03:53,874 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 15:03:53,874 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c40ed6d21fe4d61cae011269f1fdb95d05149cea0f3470f42c6e8f2fc8fb0d6a [2024-11-19 15:03:54,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 15:03:54,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 15:03:54,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 15:03:54,090 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 15:03:54,090 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 15:03:54,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy1.cil.c [2024-11-19 15:03:55,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 15:03:55,497 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 15:03:55,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c [2024-11-19 15:03:55,507 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09f3c1b01/0742fc5a6b9b410eb20e2655eea6ad1f/FLAG90e9c157f [2024-11-19 15:03:55,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09f3c1b01/0742fc5a6b9b410eb20e2655eea6ad1f [2024-11-19 15:03:55,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 15:03:55,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 15:03:55,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 15:03:55,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 15:03:55,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 15:03:55,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:03:55" (1/1) ... [2024-11-19 15:03:55,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e10d54d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:03:55, skipping insertion in model container [2024-11-19 15:03:55,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:03:55" (1/1) ... [2024-11-19 15:03:55,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 15:03:56,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 15:03:56,131 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 15:03:56,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 15:03:56,181 INFO L204 MainTranslator]: Completed translation [2024-11-19 15:03:56,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:03:56 WrapperNode [2024-11-19 15:03:56,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 15:03:56,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 15:03:56,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 15:03:56,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 15:03:56,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:03:56" (1/1) ... [2024-11-19 15:03:56,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:03:56" (1/1) ... [2024-11-19 15:03:56,212 INFO L138 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 369 [2024-11-19 15:03:56,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 15:03:56,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 15:03:56,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 15:03:56,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 15:03:56,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:03:56" (1/1) ... [2024-11-19 15:03:56,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:03:56" (1/1) ... [2024-11-19 15:03:56,223 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:03:56" (1/1) ... [2024-11-19 15:03:56,233 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-11-19 15:03:56,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:03:56" (1/1) ... [2024-11-19 15:03:56,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:03:56" (1/1) ... [2024-11-19 15:03:56,246 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:03:56" (1/1) ... [2024-11-19 15:03:56,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:03:56" (1/1) ... [2024-11-19 15:03:56,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:03:56" (1/1) ... [2024-11-19 15:03:56,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:03:56" (1/1) ... [2024-11-19 15:03:56,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 15:03:56,257 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 15:03:56,257 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 15:03:56,257 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 15:03:56,258 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:03:56" (1/1) ... [2024-11-19 15:03:56,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:56,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:56,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:03:56,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-19 15:03:56,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 15:03:56,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 15:03:56,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 15:03:56,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 15:03:56,385 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 15:03:56,386 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 15:03:56,777 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-19 15:03:56,777 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 15:03:56,795 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 15:03:56,795 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-19 15:03:56,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:03:56 BoogieIcfgContainer [2024-11-19 15:03:56,796 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 15:03:56,797 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 15:03:56,797 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 15:03:56,800 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 15:03:56,801 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 15:03:56,802 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 03:03:55" (1/3) ... [2024-11-19 15:03:56,803 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4edfdc61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 03:03:56, skipping insertion in model container [2024-11-19 15:03:56,803 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 15:03:56,803 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:03:56" (2/3) ... [2024-11-19 15:03:56,803 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4edfdc61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 03:03:56, skipping insertion in model container [2024-11-19 15:03:56,803 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 15:03:56,803 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:03:56" (3/3) ... [2024-11-19 15:03:56,804 INFO L332 chiAutomizerObserver]: Analyzing ICFG toy1.cil.c [2024-11-19 15:03:56,843 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 15:03:56,844 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 15:03:56,844 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 15:03:56,844 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 15:03:56,844 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 15:03:56,844 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 15:03:56,844 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 15:03:56,844 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 15:03:56,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 136 states, 135 states have (on average 1.8074074074074074) internal successors, (244), 135 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:03:56,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2024-11-19 15:03:56,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:03:56,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:03:56,872 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] [2024-11-19 15:03:56,872 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] [2024-11-19 15:03:56,872 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 15:03:56,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 136 states, 135 states have (on average 1.8074074074074074) internal successors, (244), 135 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:03:56,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2024-11-19 15:03:56,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:03:56,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:03:56,878 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] [2024-11-19 15:03:56,878 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] [2024-11-19 15:03:56,884 INFO L745 eck$LassoCheckResult]: Stem: 28#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 46#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 19#L416true assume !(1 == ~c_req_up~0); 116#L416-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 64#L427-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 74#L432-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 31#L437-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 45#L442-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 112#L447-1true assume !(0 == ~e_f~0); 34#L452-1true assume !(0 == ~e_g~0); 8#L457-1true assume !(0 == ~e_e~0); 124#L462-1true assume !(0 == ~e_c~0); 23#L467-1true assume !(0 == ~e_wl~0); 103#L472-1true assume !(1 == ~wl_pc~0); 100#$Ultimate##44true assume !(2 == ~wl_pc~0); 95#L485true assume !(1 == ~c1_pc~0); 24#L495true assume !(1 == ~c2_pc~0); 77#L504true assume !(1 == ~wb_pc~0); 99#L513true assume !(1 == ~e_c~0); 15#L522-1true assume !(1 == ~e_e~0); 109#L527-1true assume !(1 == ~e_f~0); 36#L532-1true assume !(1 == ~e_g~0); 85#L537-1true assume !(1 == ~e_c~0); 56#L542-1true assume !(1 == ~e_wl~0); 106#L684-1true [2024-11-19 15:03:56,884 INFO L747 eck$LassoCheckResult]: Loop: 106#L684-1true assume !false; 136#L554true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 17#L389true assume !true; 83#eval_returnLabel#1true havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 22#L560true assume !(1 == ~c_req_up~0); 102#L560-2true start_simulation_~kernel_st~0#1 := 3; 113#L572true assume 0 == ~e_f~0;~e_f~0 := 1; 21#L572-2true assume 0 == ~e_g~0;~e_g~0 := 1; 50#L577-1true assume 0 == ~e_e~0;~e_e~0 := 1; 32#L582-1true assume 0 == ~e_c~0;~e_c~0 := 1; 42#L587-1true assume !(0 == ~e_wl~0); 57#L592-1true assume !(1 == ~wl_pc~0); 41#$Ultimate##257true assume !(2 == ~wl_pc~0); 58#L605true assume !(1 == ~c1_pc~0); 7#L615true assume !(1 == ~c2_pc~0); 47#L624true assume !(1 == ~wb_pc~0); 130#L633true assume 1 == ~e_c~0;~r_st~0 := 0; 89#L642-1true assume 1 == ~e_e~0;~e_e~0 := 2; 25#L647-1true assume 1 == ~e_f~0;~e_f~0 := 2; 10#L652-1true assume 1 == ~e_g~0;~e_g~0 := 2; 90#L657-1true assume 1 == ~e_c~0;~e_c~0 := 2; 81#L662-1true assume !(1 == ~e_wl~0); 107#L667-1true assume 0 == ~wl_st~0; 106#L684-1true [2024-11-19 15:03:56,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:56,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2024-11-19 15:03:56,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:03:56,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489660215] [2024-11-19 15:03:56,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:03:56,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:03:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:03:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:03:57,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:03:57,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489660215] [2024-11-19 15:03:57,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489660215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:03:57,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:03:57,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:03:57,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905087525] [2024-11-19 15:03:57,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:03:57,172 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:03:57,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:57,173 INFO L85 PathProgramCache]: Analyzing trace with hash 2134822857, now seen corresponding path program 1 times [2024-11-19 15:03:57,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:03:57,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715328188] [2024-11-19 15:03:57,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:03:57,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:03:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:03:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:03:57,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:03:57,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715328188] [2024-11-19 15:03:57,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715328188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:03:57,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:03:57,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 15:03:57,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133191578] [2024-11-19 15:03:57,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:03:57,187 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:03:57,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:03:57,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 15:03:57,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 15:03:57,216 INFO L87 Difference]: Start difference. First operand has 136 states, 135 states have (on average 1.8074074074074074) internal successors, (244), 135 states have internal predecessors, (244), 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 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:03:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:03:57,228 INFO L93 Difference]: Finished difference Result 132 states and 226 transitions. [2024-11-19 15:03:57,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 226 transitions. [2024-11-19 15:03:57,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2024-11-19 15:03:57,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 126 states and 220 transitions. [2024-11-19 15:03:57,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2024-11-19 15:03:57,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2024-11-19 15:03:57,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 220 transitions. [2024-11-19 15:03:57,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:03:57,236 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 220 transitions. [2024-11-19 15:03:57,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 220 transitions. [2024-11-19 15:03:57,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-19 15:03:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.746031746031746) internal successors, (220), 125 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:03:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 220 transitions. [2024-11-19 15:03:57,265 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 220 transitions. [2024-11-19 15:03:57,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 15:03:57,272 INFO L425 stractBuchiCegarLoop]: Abstraction has 126 states and 220 transitions. [2024-11-19 15:03:57,275 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 15:03:57,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 220 transitions. [2024-11-19 15:03:57,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2024-11-19 15:03:57,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:03:57,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:03:57,278 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] [2024-11-19 15:03:57,278 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] [2024-11-19 15:03:57,278 INFO L745 eck$LassoCheckResult]: Stem: 329#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 330#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 309#L416 assume !(1 == ~c_req_up~0); 311#L416-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 372#L427-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 373#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 336#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 337#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 356#L447-1 assume !(0 == ~e_f~0); 342#L452-1 assume !(0 == ~e_g~0); 289#L457-1 assume !(0 == ~e_e~0); 290#L462-1 assume !(0 == ~e_c~0); 319#L467-1 assume !(0 == ~e_wl~0); 320#L472-1 assume !(1 == ~wl_pc~0); 395#$Ultimate##44 assume !(2 == ~wl_pc~0); 393#L485 assume !(1 == ~c1_pc~0); 321#L495 assume !(1 == ~c2_pc~0); 323#L504 assume !(1 == ~wb_pc~0); 382#L513 assume !(1 == ~e_c~0); 300#L522-1 assume !(1 == ~e_e~0); 301#L527-1 assume !(1 == ~e_f~0); 343#L532-1 assume !(1 == ~e_g~0); 344#L537-1 assume !(1 == ~e_c~0); 366#L542-1 assume !(1 == ~e_wl~0); 280#L684-1 [2024-11-19 15:03:57,279 INFO L747 eck$LassoCheckResult]: Loop: 280#L684-1 assume !false; 399#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 305#L389 assume !false; 306#L307 assume !(0 == ~wl_st~0); 361#L311 assume !(0 == ~c1_st~0); 362#L314 assume !(0 == ~c2_st~0); 281#L317 assume !(0 == ~wb_st~0); 283#L320 assume !(0 == ~r_st~0); 386#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 316#L560 assume !(1 == ~c_req_up~0); 317#L560-2 start_simulation_~kernel_st~0#1 := 3; 397#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 314#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 315#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 338#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 339#L587-1 assume !(0 == ~e_wl~0); 353#L592-1 assume !(1 == ~wl_pc~0); 352#$Ultimate##257 assume !(2 == ~wl_pc~0); 308#L605 assume !(1 == ~c1_pc~0); 286#L615 assume !(1 == ~c2_pc~0); 287#L624 assume !(1 == ~wb_pc~0); 358#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 390#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 324#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 293#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 294#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 387#L662-1 assume !(1 == ~e_wl~0); 388#L667-1 assume 0 == ~wl_st~0; 280#L684-1 [2024-11-19 15:03:57,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:57,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2024-11-19 15:03:57,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:03:57,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819994687] [2024-11-19 15:03:57,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:03:57,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:03:57,297 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 15:03:57,300 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:03:57,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:03:57,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:03:57,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819994687] [2024-11-19 15:03:57,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819994687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:03:57,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:03:57,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:03:57,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319837530] [2024-11-19 15:03:57,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:03:57,352 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:03:57,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:57,353 INFO L85 PathProgramCache]: Analyzing trace with hash -423214340, now seen corresponding path program 1 times [2024-11-19 15:03:57,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:03:57,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911162813] [2024-11-19 15:03:57,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:03:57,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:03:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:03:57,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:03:57,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:03:57,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911162813] [2024-11-19 15:03:57,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911162813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:03:57,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:03:57,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 15:03:57,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043565149] [2024-11-19 15:03:57,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:03:57,385 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:03:57,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:03:57,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:03:57,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:03:57,386 INFO L87 Difference]: Start difference. First operand 126 states and 220 transitions. cyclomatic complexity: 95 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:03:57,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:03:57,404 INFO L93 Difference]: Finished difference Result 126 states and 219 transitions. [2024-11-19 15:03:57,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 219 transitions. [2024-11-19 15:03:57,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2024-11-19 15:03:57,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 219 transitions. [2024-11-19 15:03:57,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2024-11-19 15:03:57,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2024-11-19 15:03:57,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 219 transitions. [2024-11-19 15:03:57,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:03:57,413 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 219 transitions. [2024-11-19 15:03:57,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 219 transitions. [2024-11-19 15:03:57,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-19 15:03:57,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.7380952380952381) internal successors, (219), 125 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:03:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 219 transitions. [2024-11-19 15:03:57,420 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 219 transitions. [2024-11-19 15:03:57,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:03:57,421 INFO L425 stractBuchiCegarLoop]: Abstraction has 126 states and 219 transitions. [2024-11-19 15:03:57,421 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 15:03:57,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 219 transitions. [2024-11-19 15:03:57,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2024-11-19 15:03:57,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:03:57,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:03:57,423 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] [2024-11-19 15:03:57,423 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] [2024-11-19 15:03:57,423 INFO L745 eck$LassoCheckResult]: Stem: 588#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 589#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 568#L416 assume !(1 == ~c_req_up~0); 570#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 631#L427-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 632#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 597#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 598#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 615#L447-1 assume !(0 == ~e_f~0); 601#L452-1 assume !(0 == ~e_g~0); 548#L457-1 assume !(0 == ~e_e~0); 549#L462-1 assume !(0 == ~e_c~0); 578#L467-1 assume !(0 == ~e_wl~0); 579#L472-1 assume !(1 == ~wl_pc~0); 654#$Ultimate##44 assume !(2 == ~wl_pc~0); 652#L485 assume !(1 == ~c1_pc~0); 580#L495 assume !(1 == ~c2_pc~0); 582#L504 assume !(1 == ~wb_pc~0); 641#L513 assume !(1 == ~e_c~0); 559#L522-1 assume !(1 == ~e_e~0); 560#L527-1 assume !(1 == ~e_f~0); 602#L532-1 assume !(1 == ~e_g~0); 603#L537-1 assume !(1 == ~e_c~0); 625#L542-1 assume !(1 == ~e_wl~0); 539#L684-1 [2024-11-19 15:03:57,424 INFO L747 eck$LassoCheckResult]: Loop: 539#L684-1 assume !false; 658#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 564#L389 assume !false; 565#L307 assume !(0 == ~wl_st~0); 620#L311 assume !(0 == ~c1_st~0); 621#L314 assume !(0 == ~c2_st~0); 540#L317 assume !(0 == ~wb_st~0); 542#L320 assume !(0 == ~r_st~0); 645#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 575#L560 assume !(1 == ~c_req_up~0); 576#L560-2 start_simulation_~kernel_st~0#1 := 3; 656#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 573#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 574#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 595#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 596#L587-1 assume !(0 == ~e_wl~0); 612#L592-1 assume 1 == ~wl_pc~0; 626#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 567#L605 assume !(1 == ~c1_pc~0); 545#L615 assume !(1 == ~c2_pc~0); 546#L624 assume !(1 == ~wb_pc~0); 617#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 649#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 583#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 552#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 553#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 646#L662-1 assume !(1 == ~e_wl~0); 647#L667-1 assume 0 == ~wl_st~0; 539#L684-1 [2024-11-19 15:03:57,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:57,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2024-11-19 15:03:57,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:03:57,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506349630] [2024-11-19 15:03:57,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:03:57,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:03:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:03:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:03:57,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:03:57,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506349630] [2024-11-19 15:03:57,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506349630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:03:57,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:03:57,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:03:57,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974604737] [2024-11-19 15:03:57,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:03:57,461 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:03:57,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:57,461 INFO L85 PathProgramCache]: Analyzing trace with hash -972474061, now seen corresponding path program 1 times [2024-11-19 15:03:57,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:03:57,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151086037] [2024-11-19 15:03:57,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:03:57,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:03:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:03:57,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:03:57,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:03:57,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151086037] [2024-11-19 15:03:57,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151086037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:03:57,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:03:57,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:03:57,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211614194] [2024-11-19 15:03:57,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:03:57,485 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:03:57,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:03:57,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:03:57,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:03:57,486 INFO L87 Difference]: Start difference. First operand 126 states and 219 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:03:57,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:03:57,501 INFO L93 Difference]: Finished difference Result 126 states and 218 transitions. [2024-11-19 15:03:57,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 218 transitions. [2024-11-19 15:03:57,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2024-11-19 15:03:57,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 218 transitions. [2024-11-19 15:03:57,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2024-11-19 15:03:57,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2024-11-19 15:03:57,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 218 transitions. [2024-11-19 15:03:57,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:03:57,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 218 transitions. [2024-11-19 15:03:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 218 transitions. [2024-11-19 15:03:57,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-19 15:03:57,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.7301587301587302) internal successors, (218), 125 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:03:57,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 218 transitions. [2024-11-19 15:03:57,511 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 218 transitions. [2024-11-19 15:03:57,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:03:57,513 INFO L425 stractBuchiCegarLoop]: Abstraction has 126 states and 218 transitions. [2024-11-19 15:03:57,513 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 15:03:57,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 218 transitions. [2024-11-19 15:03:57,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2024-11-19 15:03:57,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:03:57,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:03:57,515 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] [2024-11-19 15:03:57,515 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] [2024-11-19 15:03:57,516 INFO L745 eck$LassoCheckResult]: Stem: 847#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 848#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 827#L416 assume !(1 == ~c_req_up~0); 829#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 890#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 891#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 856#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 857#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 874#L447-1 assume !(0 == ~e_f~0); 860#L452-1 assume !(0 == ~e_g~0); 807#L457-1 assume !(0 == ~e_e~0); 808#L462-1 assume !(0 == ~e_c~0); 837#L467-1 assume !(0 == ~e_wl~0); 838#L472-1 assume !(1 == ~wl_pc~0); 913#$Ultimate##44 assume !(2 == ~wl_pc~0); 911#L485 assume !(1 == ~c1_pc~0); 839#L495 assume !(1 == ~c2_pc~0); 841#L504 assume !(1 == ~wb_pc~0); 900#L513 assume !(1 == ~e_c~0); 818#L522-1 assume !(1 == ~e_e~0); 819#L527-1 assume !(1 == ~e_f~0); 861#L532-1 assume !(1 == ~e_g~0); 862#L537-1 assume !(1 == ~e_c~0); 884#L542-1 assume !(1 == ~e_wl~0); 798#L684-1 [2024-11-19 15:03:57,516 INFO L747 eck$LassoCheckResult]: Loop: 798#L684-1 assume !false; 917#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 823#L389 assume !false; 824#L307 assume !(0 == ~wl_st~0); 879#L311 assume !(0 == ~c1_st~0); 880#L314 assume !(0 == ~c2_st~0); 799#L317 assume !(0 == ~wb_st~0); 801#L320 assume !(0 == ~r_st~0); 904#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 834#L560 assume !(1 == ~c_req_up~0); 835#L560-2 start_simulation_~kernel_st~0#1 := 3; 915#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 832#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 833#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 854#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 855#L587-1 assume !(0 == ~e_wl~0); 871#L592-1 assume 1 == ~wl_pc~0; 885#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 826#L605 assume !(1 == ~c1_pc~0); 804#L615 assume !(1 == ~c2_pc~0); 805#L624 assume !(1 == ~wb_pc~0); 876#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 908#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 842#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 811#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 812#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 905#L662-1 assume !(1 == ~e_wl~0); 906#L667-1 assume 0 == ~wl_st~0; 798#L684-1 [2024-11-19 15:03:57,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:57,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2024-11-19 15:03:57,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:03:57,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636278124] [2024-11-19 15:03:57,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:03:57,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:03:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:03:57,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:03:57,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:03:57,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636278124] [2024-11-19 15:03:57,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636278124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:03:57,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:03:57,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:03:57,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881905875] [2024-11-19 15:03:57,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:03:57,541 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:03:57,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:57,542 INFO L85 PathProgramCache]: Analyzing trace with hash -972474061, now seen corresponding path program 2 times [2024-11-19 15:03:57,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:03:57,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807720120] [2024-11-19 15:03:57,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:03:57,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:03:57,549 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 15:03:57,550 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:03:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:03:57,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:03:57,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807720120] [2024-11-19 15:03:57,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807720120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:03:57,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:03:57,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:03:57,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129684878] [2024-11-19 15:03:57,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:03:57,570 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:03:57,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:03:57,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:03:57,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:03:57,570 INFO L87 Difference]: Start difference. First operand 126 states and 218 transitions. cyclomatic complexity: 93 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:03:57,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:03:57,578 INFO L93 Difference]: Finished difference Result 126 states and 217 transitions. [2024-11-19 15:03:57,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 217 transitions. [2024-11-19 15:03:57,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2024-11-19 15:03:57,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 217 transitions. [2024-11-19 15:03:57,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2024-11-19 15:03:57,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2024-11-19 15:03:57,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 217 transitions. [2024-11-19 15:03:57,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:03:57,584 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 217 transitions. [2024-11-19 15:03:57,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 217 transitions. [2024-11-19 15:03:57,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-19 15:03:57,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.7222222222222223) internal successors, (217), 125 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:03:57,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 217 transitions. [2024-11-19 15:03:57,604 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 217 transitions. [2024-11-19 15:03:57,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:03:57,606 INFO L425 stractBuchiCegarLoop]: Abstraction has 126 states and 217 transitions. [2024-11-19 15:03:57,606 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 15:03:57,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 217 transitions. [2024-11-19 15:03:57,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2024-11-19 15:03:57,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:03:57,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:03:57,610 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] [2024-11-19 15:03:57,612 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] [2024-11-19 15:03:57,612 INFO L745 eck$LassoCheckResult]: Stem: 1106#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1107#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1086#L416 assume !(1 == ~c_req_up~0); 1088#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1149#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1150#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1115#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1116#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1133#L447-1 assume !(0 == ~e_f~0); 1119#L452-1 assume !(0 == ~e_g~0); 1066#L457-1 assume !(0 == ~e_e~0); 1067#L462-1 assume !(0 == ~e_c~0); 1096#L467-1 assume !(0 == ~e_wl~0); 1097#L472-1 assume !(1 == ~wl_pc~0); 1172#$Ultimate##44 assume !(2 == ~wl_pc~0); 1170#L485 assume !(1 == ~c1_pc~0); 1098#L495 assume !(1 == ~c2_pc~0); 1100#L504 assume !(1 == ~wb_pc~0); 1159#L513 assume !(1 == ~e_c~0); 1077#L522-1 assume !(1 == ~e_e~0); 1078#L527-1 assume !(1 == ~e_f~0); 1120#L532-1 assume !(1 == ~e_g~0); 1121#L537-1 assume !(1 == ~e_c~0); 1143#L542-1 assume !(1 == ~e_wl~0); 1057#L684-1 [2024-11-19 15:03:57,612 INFO L747 eck$LassoCheckResult]: Loop: 1057#L684-1 assume !false; 1176#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1082#L389 assume !false; 1083#L307 assume !(0 == ~wl_st~0); 1138#L311 assume !(0 == ~c1_st~0); 1139#L314 assume !(0 == ~c2_st~0); 1058#L317 assume !(0 == ~wb_st~0); 1060#L320 assume !(0 == ~r_st~0); 1163#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1093#L560 assume !(1 == ~c_req_up~0); 1094#L560-2 start_simulation_~kernel_st~0#1 := 3; 1174#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 1091#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1092#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1113#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1114#L587-1 assume !(0 == ~e_wl~0); 1130#L592-1 assume 1 == ~wl_pc~0; 1144#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1085#L605 assume !(1 == ~c1_pc~0); 1063#L615 assume !(1 == ~c2_pc~0); 1064#L624 assume !(1 == ~wb_pc~0); 1135#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 1167#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1101#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1070#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1071#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1164#L662-1 assume !(1 == ~e_wl~0); 1165#L667-1 assume 0 == ~wl_st~0; 1057#L684-1 [2024-11-19 15:03:57,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:57,613 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2024-11-19 15:03:57,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:03:57,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313494825] [2024-11-19 15:03:57,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:03:57,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:03:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:03:57,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:03:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:03:57,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:03:57,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:57,659 INFO L85 PathProgramCache]: Analyzing trace with hash -972474061, now seen corresponding path program 3 times [2024-11-19 15:03:57,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:03:57,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107460078] [2024-11-19 15:03:57,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 15:03:57,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:03:57,669 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 15:03:57,669 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:03:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:03:57,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:03:57,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107460078] [2024-11-19 15:03:57,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107460078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:03:57,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:03:57,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:03:57,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979361833] [2024-11-19 15:03:57,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:03:57,690 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:03:57,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:03:57,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:03:57,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:03:57,692 INFO L87 Difference]: Start difference. First operand 126 states and 217 transitions. cyclomatic complexity: 92 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:03:57,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:03:57,744 INFO L93 Difference]: Finished difference Result 230 states and 393 transitions. [2024-11-19 15:03:57,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 393 transitions. [2024-11-19 15:03:57,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 183 [2024-11-19 15:03:57,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 230 states and 393 transitions. [2024-11-19 15:03:57,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 230 [2024-11-19 15:03:57,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 230 [2024-11-19 15:03:57,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 393 transitions. [2024-11-19 15:03:57,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:03:57,749 INFO L218 hiAutomatonCegarLoop]: Abstraction has 230 states and 393 transitions. [2024-11-19 15:03:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 393 transitions. [2024-11-19 15:03:57,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2024-11-19 15:03:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 229 states have (on average 1.7117903930131004) internal successors, (392), 228 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:03:57,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 392 transitions. [2024-11-19 15:03:57,764 INFO L240 hiAutomatonCegarLoop]: Abstraction has 229 states and 392 transitions. [2024-11-19 15:03:57,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:03:57,765 INFO L425 stractBuchiCegarLoop]: Abstraction has 229 states and 392 transitions. [2024-11-19 15:03:57,765 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 15:03:57,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 229 states and 392 transitions. [2024-11-19 15:03:57,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 182 [2024-11-19 15:03:57,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:03:57,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:03:57,767 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] [2024-11-19 15:03:57,767 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] [2024-11-19 15:03:57,767 INFO L745 eck$LassoCheckResult]: Stem: 1470#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1471#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1448#L416 assume !(1 == ~c_req_up~0); 1450#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1515#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1516#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1478#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1479#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1498#L447-1 assume !(0 == ~e_f~0); 1484#L452-1 assume !(0 == ~e_g~0); 1428#L457-1 assume !(0 == ~e_e~0); 1429#L462-1 assume !(0 == ~e_c~0); 1459#L467-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1460#L472-1 assume !(1 == ~wl_pc~0); 1540#$Ultimate##44 assume !(2 == ~wl_pc~0); 1538#L485 assume !(1 == ~c1_pc~0); 1462#L495 assume !(1 == ~c2_pc~0); 1464#L504 assume !(1 == ~wb_pc~0); 1526#L513 assume !(1 == ~e_c~0); 1439#L522-1 assume !(1 == ~e_e~0); 1440#L527-1 assume !(1 == ~e_f~0); 1485#L532-1 assume !(1 == ~e_g~0); 1486#L537-1 assume !(1 == ~e_c~0); 1509#L542-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1422#L684-1 [2024-11-19 15:03:57,767 INFO L747 eck$LassoCheckResult]: Loop: 1422#L684-1 assume !false; 1544#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1444#L389 assume !false; 1445#L307 assume !(0 == ~wl_st~0); 1504#L311 assume !(0 == ~c1_st~0); 1505#L314 assume !(0 == ~c2_st~0); 1418#L317 assume !(0 == ~wb_st~0); 1420#L320 assume !(0 == ~r_st~0); 1530#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1456#L560 assume !(1 == ~c_req_up~0); 1457#L560-2 start_simulation_~kernel_st~0#1 := 3; 1542#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 1454#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1455#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1580#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1578#L587-1 assume !(0 == ~e_wl~0); 1575#L592-1 assume !(1 == ~wl_pc~0); 1571#$Ultimate##257 assume !(2 == ~wl_pc~0); 1567#L605 assume !(1 == ~c1_pc~0); 1562#L615 assume !(1 == ~c2_pc~0); 1560#L624 assume !(1 == ~wb_pc~0); 1557#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 1555#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1553#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1551#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1550#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1549#L662-1 assume !(1 == ~e_wl~0); 1532#L667-1 assume 0 == ~wl_st~0; 1422#L684-1 [2024-11-19 15:03:57,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:57,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2560361, now seen corresponding path program 1 times [2024-11-19 15:03:57,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:03:57,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247491657] [2024-11-19 15:03:57,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:03:57,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:03:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:03:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:03:57,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:03:57,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247491657] [2024-11-19 15:03:57,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247491657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:03:57,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:03:57,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 15:03:57,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321787327] [2024-11-19 15:03:57,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:03:57,830 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:03:57,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:57,831 INFO L85 PathProgramCache]: Analyzing trace with hash -423214340, now seen corresponding path program 2 times [2024-11-19 15:03:57,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:03:57,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381441442] [2024-11-19 15:03:57,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:03:57,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:03:57,836 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 15:03:57,837 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:03:57,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:03:57,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:03:57,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381441442] [2024-11-19 15:03:57,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381441442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:03:57,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:03:57,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 15:03:57,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947973407] [2024-11-19 15:03:57,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:03:57,853 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:03:57,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:03:57,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 15:03:57,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 15:03:57,854 INFO L87 Difference]: Start difference. First operand 229 states and 392 transitions. cyclomatic complexity: 164 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:03:57,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:03:57,954 INFO L93 Difference]: Finished difference Result 473 states and 794 transitions. [2024-11-19 15:03:57,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 473 states and 794 transitions. [2024-11-19 15:03:57,958 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 379 [2024-11-19 15:03:57,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 473 states to 473 states and 794 transitions. [2024-11-19 15:03:57,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 473 [2024-11-19 15:03:57,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 473 [2024-11-19 15:03:57,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 473 states and 794 transitions. [2024-11-19 15:03:57,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:03:57,961 INFO L218 hiAutomatonCegarLoop]: Abstraction has 473 states and 794 transitions. [2024-11-19 15:03:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states and 794 transitions. [2024-11-19 15:03:57,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 430. [2024-11-19 15:03:57,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 430 states have (on average 1.6837209302325582) internal successors, (724), 429 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:03:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 724 transitions. [2024-11-19 15:03:57,978 INFO L240 hiAutomatonCegarLoop]: Abstraction has 430 states and 724 transitions. [2024-11-19 15:03:57,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 15:03:57,981 INFO L425 stractBuchiCegarLoop]: Abstraction has 430 states and 724 transitions. [2024-11-19 15:03:57,981 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 15:03:57,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 430 states and 724 transitions. [2024-11-19 15:03:57,983 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 378 [2024-11-19 15:03:57,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:03:57,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:03:57,987 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] [2024-11-19 15:03:57,987 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] [2024-11-19 15:03:57,987 INFO L745 eck$LassoCheckResult]: Stem: 2181#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 2182#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 2160#L416 assume !(1 == ~c_req_up~0); 2162#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 2228#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 2229#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 2190#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 2191#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 2208#L447-1 assume !(0 == ~e_f~0); 2194#L452-1 assume !(0 == ~e_g~0); 2140#L457-1 assume !(0 == ~e_e~0); 2141#L462-1 assume !(0 == ~e_c~0); 2170#L467-1 assume !(0 == ~e_wl~0); 2171#L472-1 assume !(1 == ~wl_pc~0); 2260#$Ultimate##44 assume !(2 == ~wl_pc~0); 2256#L485 assume !(1 == ~c1_pc~0); 2251#L495 assume !(1 == ~c2_pc~0); 2241#L504 assume !(1 == ~wb_pc~0); 2242#L513 assume !(1 == ~e_c~0); 2151#L522-1 assume !(1 == ~e_e~0); 2152#L527-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2283#L532-1 assume !(1 == ~e_g~0); 2280#L537-1 assume !(1 == ~e_c~0); 2281#L542-1 assume !(1 == ~e_wl~0); 2221#L684-1 [2024-11-19 15:03:57,987 INFO L747 eck$LassoCheckResult]: Loop: 2221#L684-1 assume !false; 2265#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 2403#L389 assume !false; 2401#L307 assume !(0 == ~wl_st~0); 2399#L311 assume !(0 == ~c1_st~0); 2397#L314 assume !(0 == ~c2_st~0); 2395#L317 assume !(0 == ~wb_st~0); 2391#L320 assume !(0 == ~r_st~0); 2389#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 2384#L560 assume !(1 == ~c_req_up~0); 2381#L560-2 start_simulation_~kernel_st~0#1 := 3; 2378#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 2376#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 2377#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 2372#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 2373#L587-1 assume !(0 == ~e_wl~0); 2296#L592-1 assume 1 == ~wl_pc~0; 2292#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 2159#L605 assume !(1 == ~c1_pc~0); 2223#L615 assume !(1 == ~c2_pc~0); 2209#L624 assume !(1 == ~wb_pc~0); 2211#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 2253#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 2175#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2144#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 2145#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 2248#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2249#L667-1 assume 0 == ~wl_st~0; 2221#L684-1 [2024-11-19 15:03:57,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:57,988 INFO L85 PathProgramCache]: Analyzing trace with hash 255545497, now seen corresponding path program 1 times [2024-11-19 15:03:57,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:03:57,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193155707] [2024-11-19 15:03:57,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:03:57,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:03:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:03:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:03:58,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:03:58,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193155707] [2024-11-19 15:03:58,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193155707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:03:58,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:03:58,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 15:03:58,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529110286] [2024-11-19 15:03:58,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:03:58,032 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:03:58,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:58,032 INFO L85 PathProgramCache]: Analyzing trace with hash -972474123, now seen corresponding path program 1 times [2024-11-19 15:03:58,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:03:58,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530836947] [2024-11-19 15:03:58,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:03:58,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:03:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:03:58,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:03:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:03:58,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:03:58,302 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:03:58,303 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:03:58,303 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:03:58,303 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:03:58,303 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 15:03:58,303 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:58,303 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:03:58,303 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:03:58,304 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration7_Loop [2024-11-19 15:03:58,304 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:03:58,304 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:03:58,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,570 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:03:58,570 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 15:03:58,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:58,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:58,573 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:03:58,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-19 15:03:58,577 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:03:58,577 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:03:58,598 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 15:03:58,599 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 15:03:58,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-19 15:03:58,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:58,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:58,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:03:58,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-19 15:03:58,613 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:03:58,613 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:03:58,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-19 15:03:58,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:58,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:58,636 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:03:58,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-19 15:03:58,637 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 15:03:58,637 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:03:58,649 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 15:03:58,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-19 15:03:58,666 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:03:58,666 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:03:58,666 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:03:58,666 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:03:58,666 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 15:03:58,666 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:58,666 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:03:58,666 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:03:58,666 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration7_Loop [2024-11-19 15:03:58,666 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:03:58,666 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:03:58,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:58,883 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:03:58,887 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 15:03:58,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:58,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:58,890 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:03:58,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-19 15:03:58,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:03:58,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:58,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:58,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:58,904 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-19 15:03:58,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:58,906 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-19 15:03:58,906 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:58,908 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:58,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-19 15:03:58,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:58,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:58,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:03:58,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-19 15:03:58,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:03:58,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:58,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:58,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:58,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:58,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:58,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:58,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:58,936 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 15:03:58,940 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 15:03:58,940 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 15:03:58,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:58,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:58,959 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:03:58,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-19 15:03:58,965 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 15:03:58,966 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 15:03:58,966 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 15:03:58,966 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2024-11-19 15:03:58,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-19 15:03:58,979 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 15:03:59,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:03:59,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 15:03:59,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:03:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:03:59,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 15:03:59,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:03:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:03:59,161 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-19 15:03:59,162 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 430 states and 724 transitions. cyclomatic complexity: 297 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:03:59,246 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 430 states and 724 transitions. cyclomatic complexity: 297. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 1467 states and 2452 transitions. Complement of second has 5 states. [2024-11-19 15:03:59,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 15:03:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:03:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2024-11-19 15:03:59,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 380 transitions. Stem has 24 letters. Loop has 28 letters. [2024-11-19 15:03:59,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:03:59,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 380 transitions. Stem has 52 letters. Loop has 28 letters. [2024-11-19 15:03:59,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:03:59,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 380 transitions. Stem has 24 letters. Loop has 56 letters. [2024-11-19 15:03:59,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:03:59,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1467 states and 2452 transitions. [2024-11-19 15:03:59,266 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1009 [2024-11-19 15:03:59,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1467 states to 1467 states and 2452 transitions. [2024-11-19 15:03:59,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1069 [2024-11-19 15:03:59,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1076 [2024-11-19 15:03:59,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1467 states and 2452 transitions. [2024-11-19 15:03:59,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:03:59,275 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1467 states and 2452 transitions. [2024-11-19 15:03:59,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states and 2452 transitions. [2024-11-19 15:03:59,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1207. [2024-11-19 15:03:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1207 states have (on average 1.671913835956918) internal successors, (2018), 1206 states have internal predecessors, (2018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:03:59,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 2018 transitions. [2024-11-19 15:03:59,295 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1207 states and 2018 transitions. [2024-11-19 15:03:59,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:03:59,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 15:03:59,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 15:03:59,297 INFO L87 Difference]: Start difference. First operand 1207 states and 2018 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:03:59,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:03:59,382 INFO L93 Difference]: Finished difference Result 2357 states and 3868 transitions. [2024-11-19 15:03:59,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2357 states and 3868 transitions. [2024-11-19 15:03:59,394 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1411 [2024-11-19 15:03:59,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2357 states to 2357 states and 3868 transitions. [2024-11-19 15:03:59,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1549 [2024-11-19 15:03:59,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1549 [2024-11-19 15:03:59,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2357 states and 3868 transitions. [2024-11-19 15:03:59,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:03:59,405 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2357 states and 3868 transitions. [2024-11-19 15:03:59,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states and 3868 transitions. [2024-11-19 15:03:59,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2294. [2024-11-19 15:03:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 2294 states have (on average 1.6547515257192678) internal successors, (3796), 2293 states have internal predecessors, (3796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:03:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 3796 transitions. [2024-11-19 15:03:59,466 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2294 states and 3796 transitions. [2024-11-19 15:03:59,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 15:03:59,471 INFO L425 stractBuchiCegarLoop]: Abstraction has 2294 states and 3796 transitions. [2024-11-19 15:03:59,471 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 15:03:59,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2294 states and 3796 transitions. [2024-11-19 15:03:59,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-19 15:03:59,482 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1405 [2024-11-19 15:03:59,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:03:59,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:03:59,483 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] [2024-11-19 15:03:59,483 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] [2024-11-19 15:03:59,483 INFO L745 eck$LassoCheckResult]: Stem: 7866#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 7867#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 7831#L416 assume !(1 == ~c_req_up~0); 7833#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 7963#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 7964#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 7878#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 7879#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 8046#L447-1 assume !(0 == ~e_f~0); 8047#L452-1 assume !(0 == ~e_g~0); 7793#L457-1 assume !(0 == ~e_e~0); 7794#L462-1 assume 0 == ~e_c~0;~e_c~0 := 1; 8073#L467-1 assume !(0 == ~e_wl~0); 8035#L472-1 assume !(1 == ~wl_pc~0); 8036#$Ultimate##44 assume !(2 == ~wl_pc~0); 8106#L485 assume !(1 == ~c1_pc~0); 8103#L495 assume !(1 == ~c2_pc~0); 8102#L504 assume !(1 == ~wb_pc~0); 8028#L513 assume !(1 == ~e_c~0); 8029#L522-1 assume !(1 == ~e_e~0); 8043#L527-1 assume !(1 == ~e_f~0); 8044#L532-1 assume !(1 == ~e_g~0); 8088#L537-1 assume !(1 == ~e_c~0); 8089#L542-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7945#L684-1 [2024-11-19 15:03:59,484 INFO L747 eck$LassoCheckResult]: Loop: 7945#L684-1 assume !false; 8898#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 8896#L389 assume !false; 8853#L307 assume !(0 == ~wl_st~0); 8854#L311 assume !(0 == ~c1_st~0); 8846#L314 assume !(0 == ~c2_st~0); 8848#L317 assume !(0 == ~wb_st~0); 9045#L320 assume !(0 == ~r_st~0); 9042#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 9041#L560 assume !(1 == ~c_req_up~0); 8824#L560-2 start_simulation_~kernel_st~0#1 := 3; 8801#L572 assume !(0 == ~e_f~0); 8802#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 9049#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 9048#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 8815#L587-1 assume !(0 == ~e_wl~0); 8811#L592-1 assume 1 == ~wl_pc~0; 8808#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 8809#L605 assume !(1 == ~c1_pc~0); 8930#L615 assume !(1 == ~c2_pc~0); 8928#L624 assume !(1 == ~wb_pc~0); 8925#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 8923#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 8921#L647-1 assume !(1 == ~e_f~0); 8919#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 8918#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 8913#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 8903#L667-1 assume 0 == ~wl_st~0; 7945#L684-1 [2024-11-19 15:03:59,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:59,484 INFO L85 PathProgramCache]: Analyzing trace with hash 842411091, now seen corresponding path program 1 times [2024-11-19 15:03:59,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:03:59,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559489275] [2024-11-19 15:03:59,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:03:59,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:03:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:03:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:03:59,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:03:59,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559489275] [2024-11-19 15:03:59,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559489275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:03:59,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:03:59,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 15:03:59,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719783321] [2024-11-19 15:03:59,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:03:59,520 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:03:59,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:59,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1735992313, now seen corresponding path program 1 times [2024-11-19 15:03:59,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:03:59,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839609935] [2024-11-19 15:03:59,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:03:59,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:03:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:03:59,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:03:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:03:59,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:03:59,739 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:03:59,739 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:03:59,739 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:03:59,739 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:03:59,739 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 15:03:59,739 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:59,739 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:03:59,739 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:03:59,739 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration8_Loop [2024-11-19 15:03:59,740 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:03:59,740 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:03:59,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:59,949 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:03:59,952 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 15:03:59,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:59,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:59,954 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:03:59,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-19 15:03:59,957 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:03:59,957 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:03:59,976 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 15:03:59,976 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 15:03:59,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-11-19 15:03:59,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:59,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:59,989 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:03:59,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-19 15:03:59,992 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:03:59,992 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:04:00,004 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 15:04:00,004 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet6#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 15:04:00,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-19 15:04:00,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:00,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:04:00,018 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:04:00,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-19 15:04:00,021 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:04:00,021 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:04:00,033 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 15:04:00,033 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet8#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 15:04:00,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-19 15:04:00,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:00,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:04:00,045 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:04:00,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-19 15:04:00,047 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:04:00,047 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:04:00,065 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 15:04:00,065 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 15:04:00,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-19 15:04:00,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:00,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:04:00,077 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:04:00,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-19 15:04:00,079 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:04:00,079 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:04:00,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-19 15:04:00,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:00,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:04:00,101 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:04:00,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-19 15:04:00,102 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 15:04:00,102 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:04:00,115 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 15:04:00,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-19 15:04:00,126 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:04:00,126 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:04:00,126 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:04:00,126 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:04:00,126 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 15:04:00,126 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:00,126 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:04:00,127 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:04:00,127 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration8_Loop [2024-11-19 15:04:00,127 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:04:00,127 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:04:00,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:00,334 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:04:00,334 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 15:04:00,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:00,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:04:00,336 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:04:00,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-19 15:04:00,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:04:00,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:04:00,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:04:00,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:04:00,349 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-19 15:04:00,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:04:00,350 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-19 15:04:00,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:04:00,352 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:04:00,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-19 15:04:00,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:00,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:04:00,364 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:04:00,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-19 15:04:00,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:04:00,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:04:00,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:04:00,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:04:00,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:04:00,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:04:00,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:04:00,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:04:00,378 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:04:00,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-19 15:04:00,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:00,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:04:00,390 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:04:00,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-19 15:04:00,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:04:00,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:04:00,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:04:00,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:04:00,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:04:00,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:04:00,403 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:04:00,403 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:04:00,404 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:04:00,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-19 15:04:00,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:00,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:04:00,418 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:04:00,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-19 15:04:00,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:04:00,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:04:00,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:04:00,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:04:00,432 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-19 15:04:00,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:04:00,434 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-19 15:04:00,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:04:00,436 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:04:00,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-19 15:04:00,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:00,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:04:00,448 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:04:00,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-19 15:04:00,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:04:00,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:04:00,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:04:00,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:04:00,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:04:00,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:04:00,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:04:00,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:04:00,468 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 15:04:00,470 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 15:04:00,470 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 15:04:00,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:00,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:04:00,472 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:04:00,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-19 15:04:00,476 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 15:04:00,476 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 15:04:00,477 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 15:04:00,477 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2024-11-19 15:04:00,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-19 15:04:00,490 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 15:04:00,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:04:00,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 15:04:00,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:04:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:04:00,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 15:04:00,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:04:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:04:00,623 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-19 15:04:00,623 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2294 states and 3796 transitions. cyclomatic complexity: 1518 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:00,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-19 15:04:00,669 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2294 states and 3796 transitions. cyclomatic complexity: 1518. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 3420 states and 5673 transitions. Complement of second has 5 states. [2024-11-19 15:04:00,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 15:04:00,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2024-11-19 15:04:00,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 377 transitions. Stem has 24 letters. Loop has 28 letters. [2024-11-19 15:04:00,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:04:00,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 377 transitions. Stem has 52 letters. Loop has 28 letters. [2024-11-19 15:04:00,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:04:00,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 377 transitions. Stem has 24 letters. Loop has 56 letters. [2024-11-19 15:04:00,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:04:00,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3420 states and 5673 transitions. [2024-11-19 15:04:00,687 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1999 [2024-11-19 15:04:00,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3420 states to 3420 states and 5673 transitions. [2024-11-19 15:04:00,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2103 [2024-11-19 15:04:00,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2110 [2024-11-19 15:04:00,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3420 states and 5673 transitions. [2024-11-19 15:04:00,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:04:00,701 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3420 states and 5673 transitions. [2024-11-19 15:04:00,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3420 states and 5673 transitions. [2024-11-19 15:04:00,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3420 to 2078. [2024-11-19 15:04:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2078 states, 2078 states have (on average 1.6544754571703562) internal successors, (3438), 2077 states have internal predecessors, (3438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 3438 transitions. [2024-11-19 15:04:00,731 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2078 states and 3438 transitions. [2024-11-19 15:04:00,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:04:00,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 15:04:00,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 15:04:00,732 INFO L87 Difference]: Start difference. First operand 2078 states and 3438 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:00,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:04:00,794 INFO L93 Difference]: Finished difference Result 2143 states and 3497 transitions. [2024-11-19 15:04:00,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2143 states and 3497 transitions. [2024-11-19 15:04:00,803 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1220 [2024-11-19 15:04:00,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2143 states to 2143 states and 3497 transitions. [2024-11-19 15:04:00,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1345 [2024-11-19 15:04:00,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1345 [2024-11-19 15:04:00,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2143 states and 3497 transitions. [2024-11-19 15:04:00,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:04:00,813 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2143 states and 3497 transitions. [2024-11-19 15:04:00,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states and 3497 transitions. [2024-11-19 15:04:00,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 1973. [2024-11-19 15:04:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1973 states, 1973 states have (on average 1.6426761277242778) internal successors, (3241), 1972 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 3241 transitions. [2024-11-19 15:04:00,836 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1973 states and 3241 transitions. [2024-11-19 15:04:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 15:04:00,837 INFO L425 stractBuchiCegarLoop]: Abstraction has 1973 states and 3241 transitions. [2024-11-19 15:04:00,837 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-19 15:04:00,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1973 states and 3241 transitions. [2024-11-19 15:04:00,843 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1220 [2024-11-19 15:04:00,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:04:00,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:04:00,844 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] [2024-11-19 15:04:00,844 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] [2024-11-19 15:04:00,844 INFO L745 eck$LassoCheckResult]: Stem: 17981#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 17982#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 17948#L416 assume !(1 == ~c_req_up~0); 17950#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 18065#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 18066#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 18084#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 18029#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 18030#L447-1 assume !(0 == ~e_f~0); 18162#L452-1 assume !(0 == ~e_g~0); 17907#L457-1 assume !(0 == ~e_e~0); 17908#L462-1 assume !(0 == ~e_c~0); 18150#L467-1 assume !(0 == ~e_wl~0); 18126#L472-1 assume !(1 == ~wl_pc~0); 18127#$Ultimate##44 assume !(2 == ~wl_pc~0); 18183#L485 assume !(1 == ~c1_pc~0); 18180#L495 assume !(1 == ~c2_pc~0); 18179#L504 assume !(1 == ~wb_pc~0); 18119#L513 assume !(1 == ~e_c~0); 18120#L522-1 assume !(1 == ~e_e~0); 18169#L527-1 assume !(1 == ~e_f~0); 18170#L532-1 assume !(1 == ~e_g~0); 18105#L537-1 assume !(1 == ~e_c~0); 18106#L542-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 18052#L684-1 assume !false; 19485#L554 [2024-11-19 15:04:00,844 INFO L747 eck$LassoCheckResult]: Loop: 19485#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 19481#L389 assume !false; 19479#L307 assume !(0 == ~wl_st~0); 19477#L311 assume !(0 == ~c1_st~0); 19475#L314 assume !(0 == ~c2_st~0); 19473#L317 assume !(0 == ~wb_st~0); 19469#L320 assume !(0 == ~r_st~0); 19467#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 19200#L560 assume !(1 == ~c_req_up~0); 19201#L560-2 start_simulation_~kernel_st~0#1 := 3; 19743#L572 assume !(0 == ~e_f~0); 19738#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 19736#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 19734#L582-1 assume !(0 == ~e_c~0); 19732#L587-1 assume !(0 == ~e_wl~0); 19603#L592-1 assume !(1 == ~wl_pc~0); 19729#$Ultimate##257 assume !(2 == ~wl_pc~0); 19726#L605 assume !(1 == ~c1_pc~0); 19721#L615 assume !(1 == ~c2_pc~0); 19720#L624 assume !(1 == ~wb_pc~0); 19696#L633 assume !(1 == ~e_c~0); 19695#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 19694#L647-1 assume !(1 == ~e_f~0); 19693#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 19692#L657-1 assume !(1 == ~e_c~0); 19691#L662-1 assume !(1 == ~e_wl~0); 18098#L667-1 assume 0 == ~wl_st~0; 19496#L684-1 assume !false; 19485#L554 [2024-11-19 15:04:00,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:00,845 INFO L85 PathProgramCache]: Analyzing trace with hash -666177026, now seen corresponding path program 1 times [2024-11-19 15:04:00,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:00,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5515686] [2024-11-19 15:04:00,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:04:00,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:04:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:04:00,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:04:00,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5515686] [2024-11-19 15:04:00,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5515686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:04:00,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:04:00,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 15:04:00,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828340813] [2024-11-19 15:04:00,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:04:00,873 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:04:00,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:00,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1204821088, now seen corresponding path program 1 times [2024-11-19 15:04:00,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:00,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147842020] [2024-11-19 15:04:00,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:04:00,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:04:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:04:00,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:04:00,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147842020] [2024-11-19 15:04:00,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147842020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:04:00,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:04:00,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:04:00,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67638722] [2024-11-19 15:04:00,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:04:00,892 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:04:00,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:04:00,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 15:04:00,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 15:04:00,893 INFO L87 Difference]: Start difference. First operand 1973 states and 3241 transitions. cyclomatic complexity: 1281 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-11-19 15:04:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:04:00,947 INFO L93 Difference]: Finished difference Result 1696 states and 2752 transitions. [2024-11-19 15:04:00,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1696 states and 2752 transitions. [2024-11-19 15:04:00,953 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 973 [2024-11-19 15:04:00,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1696 states to 1696 states and 2752 transitions. [2024-11-19 15:04:00,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1038 [2024-11-19 15:04:00,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1038 [2024-11-19 15:04:00,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1696 states and 2752 transitions. [2024-11-19 15:04:00,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:04:00,960 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1696 states and 2752 transitions. [2024-11-19 15:04:00,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states and 2752 transitions. [2024-11-19 15:04:00,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1692. [2024-11-19 15:04:00,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1692 states have (on average 1.624113475177305) internal successors, (2748), 1691 states have internal predecessors, (2748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:00,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 2748 transitions. [2024-11-19 15:04:00,980 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1692 states and 2748 transitions. [2024-11-19 15:04:00,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 15:04:00,981 INFO L425 stractBuchiCegarLoop]: Abstraction has 1692 states and 2748 transitions. [2024-11-19 15:04:00,981 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-19 15:04:00,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1692 states and 2748 transitions. [2024-11-19 15:04:00,985 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 973 [2024-11-19 15:04:00,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:04:00,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:04:00,987 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] [2024-11-19 15:04:00,987 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] [2024-11-19 15:04:00,987 INFO L745 eck$LassoCheckResult]: Stem: 21663#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 21664#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 21628#L416 assume !(1 == ~c_req_up~0); 21630#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 21828#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 21852#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 21851#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 21710#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 21711#L447-1 assume !(0 == ~e_f~0); 21848#L452-1 assume !(0 == ~e_g~0); 21587#L457-1 assume !(0 == ~e_e~0); 21588#L462-1 assume !(0 == ~e_c~0); 21837#L467-1 assume !(0 == ~e_wl~0); 21808#L472-1 assume !(1 == ~wl_pc~0); 21809#$Ultimate##44 assume !(2 == ~wl_pc~0); 21798#L485 assume !(1 == ~c1_pc~0); 21783#L495 assume !(1 == ~c2_pc~0); 21854#L504 assume !(1 == ~wb_pc~0); 21801#L513 assume !(1 == ~e_c~0); 21614#L522-1 assume !(1 == ~e_e~0); 21615#L527-1 assume !(1 == ~e_f~0); 21849#L532-1 assume !(1 == ~e_g~0); 21785#L537-1 assume !(1 == ~e_c~0); 21732#L542-1 assume !(1 == ~e_wl~0); 21733#L684-1 assume !false; 22135#L554 [2024-11-19 15:04:00,988 INFO L747 eck$LassoCheckResult]: Loop: 22135#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 22932#L389 assume !false; 22921#L307 assume !(0 == ~wl_st~0); 22922#L311 assume !(0 == ~c1_st~0); 22927#L314 assume !(0 == ~c2_st~0); 22928#L317 assume !(0 == ~wb_st~0); 22923#L320 assume !(0 == ~r_st~0); 22924#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 23017#L560 assume !(1 == ~c_req_up~0); 23011#L560-2 start_simulation_~kernel_st~0#1 := 3; 23001#L572 assume !(0 == ~e_f~0); 23002#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 22996#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 22997#L582-1 assume !(0 == ~e_c~0); 22992#L587-1 assume !(0 == ~e_wl~0); 22993#L592-1 assume !(1 == ~wl_pc~0); 22988#$Ultimate##257 assume !(2 == ~wl_pc~0); 22986#L605 assume !(1 == ~c1_pc~0); 22985#L615 assume !(1 == ~c2_pc~0); 22980#L624 assume !(1 == ~wb_pc~0); 22978#L633 assume !(1 == ~e_c~0); 22977#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 22976#L647-1 assume !(1 == ~e_f~0); 22975#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 22974#L657-1 assume !(1 == ~e_c~0); 22972#L662-1 assume !(1 == ~e_wl~0); 22973#L667-1 assume 0 == ~wl_st~0; 23023#L684-1 assume !false; 22135#L554 [2024-11-19 15:04:00,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:00,988 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2024-11-19 15:04:00,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:00,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520212136] [2024-11-19 15:04:00,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:04:00,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:00,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:04:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:01,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:04:01,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:01,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1204821088, now seen corresponding path program 2 times [2024-11-19 15:04:01,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:01,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868369223] [2024-11-19 15:04:01,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:04:01,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:01,006 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 15:04:01,007 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:04:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:04:01,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:04:01,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868369223] [2024-11-19 15:04:01,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868369223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:04:01,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:04:01,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:04:01,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113202042] [2024-11-19 15:04:01,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:04:01,026 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:04:01,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:04:01,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:04:01,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:04:01,027 INFO L87 Difference]: Start difference. First operand 1692 states and 2748 transitions. cyclomatic complexity: 1068 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:01,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:04:01,056 INFO L93 Difference]: Finished difference Result 2704 states and 4341 transitions. [2024-11-19 15:04:01,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2704 states and 4341 transitions. [2024-11-19 15:04:01,076 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1569 [2024-11-19 15:04:01,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2704 states to 2704 states and 4341 transitions. [2024-11-19 15:04:01,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1632 [2024-11-19 15:04:01,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1632 [2024-11-19 15:04:01,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2704 states and 4341 transitions. [2024-11-19 15:04:01,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:04:01,086 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2704 states and 4341 transitions. [2024-11-19 15:04:01,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states and 4341 transitions. [2024-11-19 15:04:01,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2024-11-19 15:04:01,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2704 states have (on average 1.6053994082840237) internal successors, (4341), 2703 states have internal predecessors, (4341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 4341 transitions. [2024-11-19 15:04:01,116 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2704 states and 4341 transitions. [2024-11-19 15:04:01,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:04:01,116 INFO L425 stractBuchiCegarLoop]: Abstraction has 2704 states and 4341 transitions. [2024-11-19 15:04:01,116 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-19 15:04:01,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2704 states and 4341 transitions. [2024-11-19 15:04:01,121 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1569 [2024-11-19 15:04:01,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:04:01,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:04:01,121 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] [2024-11-19 15:04:01,121 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-11-19 15:04:01,122 INFO L745 eck$LassoCheckResult]: Stem: 26070#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 26071#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 26036#L416 assume !(1 == ~c_req_up~0); 26038#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 26257#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 26285#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 26284#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 26116#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 26117#L447-1 assume !(0 == ~e_f~0); 26281#L452-1 assume !(0 == ~e_g~0); 25990#L457-1 assume !(0 == ~e_e~0); 25991#L462-1 assume !(0 == ~e_c~0); 26266#L467-1 assume !(0 == ~e_wl~0); 26235#L472-1 assume !(1 == ~wl_pc~0); 26236#$Ultimate##44 assume !(2 == ~wl_pc~0); 26224#L485 assume !(1 == ~c1_pc~0); 26204#L495 assume !(1 == ~c2_pc~0); 26287#L504 assume !(1 == ~wb_pc~0); 26227#L513 assume !(1 == ~e_c~0); 26018#L522-1 assume !(1 == ~e_e~0); 26019#L527-1 assume !(1 == ~e_f~0); 26282#L532-1 assume !(1 == ~e_g~0); 26207#L537-1 assume !(1 == ~e_c~0); 26140#L542-1 assume !(1 == ~e_wl~0); 26141#L684-1 assume !false; 26604#L554 [2024-11-19 15:04:01,122 INFO L747 eck$LassoCheckResult]: Loop: 26604#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 28137#L389 assume !false; 27695#L307 assume !(0 == ~wl_st~0); 27696#L311 assume !(0 == ~c1_st~0); 27830#L314 assume !(0 == ~c2_st~0); 27825#L317 assume !(0 == ~wb_st~0); 27826#L320 assume !(0 == ~r_st~0); 28114#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 28096#L560 assume !(1 == ~c_req_up~0); 28097#L560-2 start_simulation_~kernel_st~0#1 := 3; 28421#L572 assume !(0 == ~e_f~0); 28413#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 28403#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 28402#L582-1 assume !(0 == ~e_c~0); 28401#L587-1 assume !(0 == ~e_wl~0); 28400#L592-1 assume !(1 == ~wl_pc~0); 28398#$Ultimate##257 assume 2 == ~wl_pc~0; 28396#L606 assume 1 == ~e_e~0;~wl_st~0 := 0; 28397#L605 assume !(1 == ~c1_pc~0); 28419#L615 assume !(1 == ~c2_pc~0); 28411#L624 assume !(1 == ~wb_pc~0); 28409#L633 assume !(1 == ~e_c~0); 28408#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 28377#L647-1 assume !(1 == ~e_f~0); 28370#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 28367#L657-1 assume !(1 == ~e_c~0); 28119#L662-1 assume !(1 == ~e_wl~0); 28118#L667-1 assume 0 == ~wl_st~0; 27750#L684-1 assume !false; 26604#L554 [2024-11-19 15:04:01,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:01,122 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 2 times [2024-11-19 15:04:01,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:01,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607241450] [2024-11-19 15:04:01,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:04:01,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:01,127 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 15:04:01,127 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:04:01,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:04:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:01,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:04:01,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:01,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2054308466, now seen corresponding path program 1 times [2024-11-19 15:04:01,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:01,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551308591] [2024-11-19 15:04:01,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:04:01,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:01,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:04:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:01,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:04:01,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:01,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1416914637, now seen corresponding path program 1 times [2024-11-19 15:04:01,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:01,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037194366] [2024-11-19 15:04:01,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:04:01,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:04:01,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:04:01,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:04:01,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037194366] [2024-11-19 15:04:01,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037194366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:04:01,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:04:01,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:04:01,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722508657] [2024-11-19 15:04:01,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:04:01,335 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:04:01,335 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:04:01,335 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:04:01,335 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:04:01,335 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 15:04:01,335 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:01,335 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:04:01,335 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:04:01,335 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration11_Loop [2024-11-19 15:04:01,335 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:04:01,335 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:04:01,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,540 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:04:01,540 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 15:04:01,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:01,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:04:01,542 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:04:01,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-19 15:04:01,544 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:04:01,544 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:04:01,555 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 15:04:01,555 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet4#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 15:04:01,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-19 15:04:01,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:01,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:04:01,568 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:04:01,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-19 15:04:01,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:04:01,570 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:04:01,583 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 15:04:01,583 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 15:04:01,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-19 15:04:01,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:01,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:04:01,596 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:04:01,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-19 15:04:01,598 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:04:01,598 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:04:01,617 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 15:04:01,617 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=-1} Honda state: {~r_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 15:04:01,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-19 15:04:01,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:01,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:04:01,631 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:04:01,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-19 15:04:01,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 15:04:01,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:04:01,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-19 15:04:01,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:01,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:04:01,657 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:04:01,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-19 15:04:01,659 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 15:04:01,659 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 15:04:01,671 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 15:04:01,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-19 15:04:01,682 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:04:01,682 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:04:01,682 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:04:01,682 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:04:01,682 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 15:04:01,682 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:01,682 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:04:01,682 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:04:01,682 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration11_Loop [2024-11-19 15:04:01,682 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:04:01,682 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:04:01,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:04:01,886 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:04:01,886 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 15:04:01,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:01,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:04:01,889 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:04:01,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-19 15:04:01,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:04:01,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:04:01,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:04:01,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:04:01,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:04:01,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:04:01,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:04:01,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:04:01,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:04:01,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-19 15:04:01,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:01,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:04:01,916 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:04:01,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-19 15:04:01,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:04:01,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:04:01,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:04:01,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:04:01,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:04:01,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:04:01,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:04:01,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:04:01,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:04:01,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-19 15:04:01,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:01,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:04:01,943 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:04:01,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-19 15:04:01,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:04:01,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:04:01,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:04:01,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:04:01,955 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-19 15:04:01,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:04:01,956 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-19 15:04:01,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:04:01,957 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:04:01,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-19 15:04:01,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:01,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:04:01,969 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:04:01,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-19 15:04:01,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:04:01,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:04:01,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:04:01,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:04:01,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:04:01,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:04:01,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:04:01,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:04:01,986 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 15:04:01,987 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 15:04:01,987 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 15:04:01,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:04:01,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:04:01,988 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:04:01,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-19 15:04:01,990 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 15:04:01,990 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 15:04:01,990 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 15:04:01,990 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2024-11-19 15:04:02,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-11-19 15:04:02,001 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 15:04:02,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:04:02,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 15:04:02,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:04:02,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-19 15:04:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:04:02,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 15:04:02,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:04:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:04:02,152 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-19 15:04:02,152 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2704 states and 4341 transitions. cyclomatic complexity: 1649 Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:02,201 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2704 states and 4341 transitions. cyclomatic complexity: 1649. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 7241 states and 11630 transitions. Complement of second has 5 states. [2024-11-19 15:04:02,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 15:04:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions. [2024-11-19 15:04:02,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 205 transitions. Stem has 25 letters. Loop has 29 letters. [2024-11-19 15:04:02,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:04:02,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 205 transitions. Stem has 54 letters. Loop has 29 letters. [2024-11-19 15:04:02,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:04:02,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 205 transitions. Stem has 25 letters. Loop has 58 letters. [2024-11-19 15:04:02,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:04:02,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7241 states and 11630 transitions. [2024-11-19 15:04:02,225 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2875 [2024-11-19 15:04:02,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7241 states to 7241 states and 11630 transitions. [2024-11-19 15:04:02,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2947 [2024-11-19 15:04:02,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2984 [2024-11-19 15:04:02,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7241 states and 11630 transitions. [2024-11-19 15:04:02,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:04:02,257 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7241 states and 11630 transitions. [2024-11-19 15:04:02,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7241 states and 11630 transitions. [2024-11-19 15:04:02,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7241 to 7204. [2024-11-19 15:04:02,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7204 states, 7204 states have (on average 1.605774569683509) internal successors, (11568), 7203 states have internal predecessors, (11568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7204 states to 7204 states and 11568 transitions. [2024-11-19 15:04:02,349 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7204 states and 11568 transitions. [2024-11-19 15:04:02,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:04:02,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:04:02,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:04:02,350 INFO L87 Difference]: Start difference. First operand 7204 states and 11568 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:02,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:04:02,380 INFO L93 Difference]: Finished difference Result 5713 states and 9151 transitions. [2024-11-19 15:04:02,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5713 states and 9151 transitions. [2024-11-19 15:04:02,393 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2245 [2024-11-19 15:04:02,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5713 states to 5713 states and 9151 transitions. [2024-11-19 15:04:02,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2315 [2024-11-19 15:04:02,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2315 [2024-11-19 15:04:02,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5713 states and 9151 transitions. [2024-11-19 15:04:02,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:04:02,409 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5713 states and 9151 transitions. [2024-11-19 15:04:02,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5713 states and 9151 transitions. [2024-11-19 15:04:02,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5713 to 5485. [2024-11-19 15:04:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5485 states, 5485 states have (on average 1.6030993618960803) internal successors, (8793), 5484 states have internal predecessors, (8793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5485 states to 5485 states and 8793 transitions. [2024-11-19 15:04:02,560 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5485 states and 8793 transitions. [2024-11-19 15:04:02,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:04:02,560 INFO L425 stractBuchiCegarLoop]: Abstraction has 5485 states and 8793 transitions. [2024-11-19 15:04:02,561 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-19 15:04:02,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5485 states and 8793 transitions. [2024-11-19 15:04:02,572 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 2167 [2024-11-19 15:04:02,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:04:02,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:04:02,573 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] [2024-11-19 15:04:02,573 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:04:02,573 INFO L745 eck$LassoCheckResult]: Stem: 49105#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 49106#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 49074#L416 assume !(1 == ~c_req_up~0); 49076#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 49293#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 49318#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 49316#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 49160#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 49161#L447-1 assume !(0 == ~e_f~0); 49310#L452-1 assume !(0 == ~e_g~0); 49036#L457-1 assume !(0 == ~e_e~0); 49037#L462-1 assume !(0 == ~e_c~0); 49090#L467-1 assume !(0 == ~e_wl~0); 49091#L472-1 assume !(1 == ~wl_pc~0); 49273#$Ultimate##44 assume !(2 == ~wl_pc~0); 49264#L485 assume !(1 == ~c1_pc~0); 49250#L495 assume !(1 == ~c2_pc~0); 49312#L504 assume !(1 == ~wb_pc~0); 49267#L513 assume !(1 == ~e_c~0); 49056#L522-1 assume !(1 == ~e_e~0); 49057#L527-1 assume !(1 == ~e_f~0); 49314#L532-1 assume !(1 == ~e_g~0); 49253#L537-1 assume !(1 == ~e_c~0); 49254#L542-1 assume !(1 == ~e_wl~0); 50638#L684-1 assume !false; 50639#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 51995#L389 [2024-11-19 15:04:02,573 INFO L747 eck$LassoCheckResult]: Loop: 51995#L389 assume !false; 53330#L307 assume 0 == ~wl_st~0; 53329#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 49202#L333 assume !(0 != eval_~tmp~0#1); 49203#L329 assume !(0 == ~c1_st~0); 53339#L344 assume !(0 == ~c2_st~0); 53337#L359 assume !(0 == ~wb_st~0); 53331#L374 assume !(0 == ~r_st~0); 51995#L389 [2024-11-19 15:04:02,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:02,574 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2024-11-19 15:04:02,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:02,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425387102] [2024-11-19 15:04:02,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:04:02,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:02,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:04:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:02,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:04:02,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:02,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1296084100, now seen corresponding path program 1 times [2024-11-19 15:04:02,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:02,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226359311] [2024-11-19 15:04:02,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:04:02,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:02,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:04:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:02,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:04:02,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:02,598 INFO L85 PathProgramCache]: Analyzing trace with hash 377129596, now seen corresponding path program 1 times [2024-11-19 15:04:02,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:02,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43361909] [2024-11-19 15:04:02,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:04:02,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:04:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:04:02,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:04:02,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43361909] [2024-11-19 15:04:02,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43361909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:04:02,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:04:02,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:04:02,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256998334] [2024-11-19 15:04:02,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:04:02,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:04:02,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:04:02,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:04:02,681 INFO L87 Difference]: Start difference. First operand 5485 states and 8793 transitions. cyclomatic complexity: 3335 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:02,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:04:02,716 INFO L93 Difference]: Finished difference Result 8667 states and 13772 transitions. [2024-11-19 15:04:02,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8667 states and 13772 transitions. [2024-11-19 15:04:02,739 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 3460 [2024-11-19 15:04:02,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8667 states to 8667 states and 13772 transitions. [2024-11-19 15:04:02,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3538 [2024-11-19 15:04:02,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3538 [2024-11-19 15:04:02,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8667 states and 13772 transitions. [2024-11-19 15:04:02,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:04:02,764 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8667 states and 13772 transitions. [2024-11-19 15:04:02,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8667 states and 13772 transitions. [2024-11-19 15:04:02,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8667 to 8667. [2024-11-19 15:04:02,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8667 states, 8667 states have (on average 1.589015807084343) internal successors, (13772), 8666 states have internal predecessors, (13772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:02,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8667 states to 8667 states and 13772 transitions. [2024-11-19 15:04:02,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8667 states and 13772 transitions. [2024-11-19 15:04:02,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:04:02,848 INFO L425 stractBuchiCegarLoop]: Abstraction has 8667 states and 13772 transitions. [2024-11-19 15:04:02,848 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-19 15:04:02,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8667 states and 13772 transitions. [2024-11-19 15:04:02,893 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 3460 [2024-11-19 15:04:02,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:04:02,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:04:02,894 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] [2024-11-19 15:04:02,894 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:04:02,894 INFO L745 eck$LassoCheckResult]: Stem: 63267#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 63268#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 63234#L416 assume !(1 == ~c_req_up~0); 63236#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 63449#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 63482#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 63480#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 63319#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 63320#L447-1 assume !(0 == ~e_f~0); 63474#L452-1 assume !(0 == ~e_g~0); 63195#L457-1 assume !(0 == ~e_e~0); 63196#L462-1 assume !(0 == ~e_c~0); 63251#L467-1 assume !(0 == ~e_wl~0); 63252#L472-1 assume !(1 == ~wl_pc~0); 63430#$Ultimate##44 assume !(2 == ~wl_pc~0); 63420#L485 assume !(1 == ~c1_pc~0); 63406#L495 assume !(1 == ~c2_pc~0); 63476#L504 assume !(1 == ~wb_pc~0); 63424#L513 assume !(1 == ~e_c~0); 63216#L522-1 assume !(1 == ~e_e~0); 63217#L527-1 assume !(1 == ~e_f~0); 63478#L532-1 assume !(1 == ~e_g~0); 63407#L537-1 assume !(1 == ~e_c~0); 63344#L542-1 assume !(1 == ~e_wl~0); 63345#L684-1 assume !false; 65281#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 68123#L389 [2024-11-19 15:04:02,894 INFO L747 eck$LassoCheckResult]: Loop: 68123#L389 assume !false; 69892#L307 assume 0 == ~wl_st~0; 69891#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 69887#L333 assume !(0 != eval_~tmp~0#1); 69888#L329 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 70175#L348 assume !(0 != eval_~tmp___0~0#1); 70170#L344 assume !(0 == ~c2_st~0); 70154#L359 assume !(0 == ~wb_st~0); 69894#L374 assume !(0 == ~r_st~0); 68123#L389 [2024-11-19 15:04:02,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:02,894 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2024-11-19 15:04:02,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:02,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884774368] [2024-11-19 15:04:02,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:04:02,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:02,900 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 15:04:02,900 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:04:02,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:04:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:02,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:04:02,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:02,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1472174914, now seen corresponding path program 1 times [2024-11-19 15:04:02,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:02,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472894501] [2024-11-19 15:04:02,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:04:02,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:02,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:04:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:02,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:04:02,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:02,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1245610934, now seen corresponding path program 1 times [2024-11-19 15:04:02,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:02,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482245010] [2024-11-19 15:04:02,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:04:02,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:04:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:04:02,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:04:02,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482245010] [2024-11-19 15:04:02,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482245010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:04:02,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:04:02,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:04:02,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077060259] [2024-11-19 15:04:02,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:04:02,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:04:02,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:04:02,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:04:02,958 INFO L87 Difference]: Start difference. First operand 8667 states and 13772 transitions. cyclomatic complexity: 5132 Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:04:03,003 INFO L93 Difference]: Finished difference Result 13738 states and 21493 transitions. [2024-11-19 15:04:03,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13738 states and 21493 transitions. [2024-11-19 15:04:03,043 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 5512 [2024-11-19 15:04:03,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13738 states to 13738 states and 21493 transitions. [2024-11-19 15:04:03,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5656 [2024-11-19 15:04:03,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5656 [2024-11-19 15:04:03,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13738 states and 21493 transitions. [2024-11-19 15:04:03,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:04:03,085 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13738 states and 21493 transitions. [2024-11-19 15:04:03,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13738 states and 21493 transitions. [2024-11-19 15:04:03,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13738 to 13738. [2024-11-19 15:04:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13738 states, 13738 states have (on average 1.5644926481292765) internal successors, (21493), 13737 states have internal predecessors, (21493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13738 states to 13738 states and 21493 transitions. [2024-11-19 15:04:03,274 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13738 states and 21493 transitions. [2024-11-19 15:04:03,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:04:03,275 INFO L425 stractBuchiCegarLoop]: Abstraction has 13738 states and 21493 transitions. [2024-11-19 15:04:03,275 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-19 15:04:03,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13738 states and 21493 transitions. [2024-11-19 15:04:03,302 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 5512 [2024-11-19 15:04:03,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:04:03,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:04:03,302 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] [2024-11-19 15:04:03,302 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:04:03,302 INFO L745 eck$LassoCheckResult]: Stem: 85680#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 85681#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 85648#L416 assume !(1 == ~c_req_up~0); 85650#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 85778#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 85779#L432-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 85909#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 87974#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 87973#L447-1 assume !(0 == ~e_f~0); 87972#L452-1 assume !(0 == ~e_g~0); 87971#L457-1 assume !(0 == ~e_e~0); 87970#L462-1 assume !(0 == ~e_c~0); 87969#L467-1 assume !(0 == ~e_wl~0); 87968#L472-1 assume !(1 == ~wl_pc~0); 87965#$Ultimate##44 assume !(2 == ~wl_pc~0); 87964#L485 assume !(1 == ~c1_pc~0); 87962#L495 assume !(1 == ~c2_pc~0); 87960#L504 assume !(1 == ~wb_pc~0); 87958#L513 assume !(1 == ~e_c~0); 87957#L522-1 assume !(1 == ~e_e~0); 87956#L527-1 assume !(1 == ~e_f~0); 87955#L532-1 assume !(1 == ~e_g~0); 87952#L537-1 assume !(1 == ~e_c~0); 87951#L542-1 assume !(1 == ~e_wl~0); 87945#L684-1 assume !false; 87946#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 92894#L389 [2024-11-19 15:04:03,302 INFO L747 eck$LassoCheckResult]: Loop: 92894#L389 assume !false; 96096#L307 assume 0 == ~wl_st~0; 96094#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 96092#L333 assume !(0 != eval_~tmp~0#1); 96091#L329 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 96067#L348 assume !(0 != eval_~tmp___0~0#1); 96090#L344 assume !(0 == ~c2_st~0); 96103#L359 assume !(0 == ~wb_st~0); 96097#L374 assume !(0 == ~r_st~0); 92894#L389 [2024-11-19 15:04:03,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:03,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2024-11-19 15:04:03,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:03,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799317049] [2024-11-19 15:04:03,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:04:03,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:04:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:04:03,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:04:03,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799317049] [2024-11-19 15:04:03,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799317049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:04:03,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:04:03,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:04:03,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385870737] [2024-11-19 15:04:03,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:04:03,394 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 15:04:03,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:03,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1472174914, now seen corresponding path program 2 times [2024-11-19 15:04:03,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:03,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425131247] [2024-11-19 15:04:03,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:04:03,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:03,397 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 15:04:03,397 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:04:03,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:04:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:03,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:04:03,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:04:03,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:04:03,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:04:03,425 INFO L87 Difference]: Start difference. First operand 13738 states and 21493 transitions. cyclomatic complexity: 7782 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:03,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:04:03,462 INFO L93 Difference]: Finished difference Result 13686 states and 21406 transitions. [2024-11-19 15:04:03,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13686 states and 21406 transitions. [2024-11-19 15:04:03,510 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 5512 [2024-11-19 15:04:03,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13686 states to 13686 states and 21406 transitions. [2024-11-19 15:04:03,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5606 [2024-11-19 15:04:03,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5606 [2024-11-19 15:04:03,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13686 states and 21406 transitions. [2024-11-19 15:04:03,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:04:03,551 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13686 states and 21406 transitions. [2024-11-19 15:04:03,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13686 states and 21406 transitions. [2024-11-19 15:04:03,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13686 to 13686. [2024-11-19 15:04:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13686 states, 13686 states have (on average 1.5640800818354523) internal successors, (21406), 13685 states have internal predecessors, (21406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:03,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13686 states to 13686 states and 21406 transitions. [2024-11-19 15:04:03,815 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13686 states and 21406 transitions. [2024-11-19 15:04:03,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:04:03,816 INFO L425 stractBuchiCegarLoop]: Abstraction has 13686 states and 21406 transitions. [2024-11-19 15:04:03,816 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-19 15:04:03,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13686 states and 21406 transitions. [2024-11-19 15:04:03,840 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 5512 [2024-11-19 15:04:03,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:04:03,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:04:03,840 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] [2024-11-19 15:04:03,841 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:04:03,841 INFO L745 eck$LassoCheckResult]: Stem: 113107#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 113108#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 113076#L416 assume !(1 == ~c_req_up~0); 113078#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 113287#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 113318#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 113316#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 113157#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 113158#L447-1 assume !(0 == ~e_f~0); 113310#L452-1 assume !(0 == ~e_g~0); 113038#L457-1 assume !(0 == ~e_e~0); 113039#L462-1 assume !(0 == ~e_c~0); 113092#L467-1 assume !(0 == ~e_wl~0); 113093#L472-1 assume !(1 == ~wl_pc~0); 113269#$Ultimate##44 assume !(2 == ~wl_pc~0); 113260#L485 assume !(1 == ~c1_pc~0); 113243#L495 assume !(1 == ~c2_pc~0); 113312#L504 assume !(1 == ~wb_pc~0); 113263#L513 assume !(1 == ~e_c~0); 113058#L522-1 assume !(1 == ~e_e~0); 113059#L527-1 assume !(1 == ~e_f~0); 113314#L532-1 assume !(1 == ~e_g~0); 113246#L537-1 assume !(1 == ~e_c~0); 113247#L542-1 assume !(1 == ~e_wl~0); 115276#L684-1 assume !false; 115277#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 120536#L389 [2024-11-19 15:04:03,841 INFO L747 eck$LassoCheckResult]: Loop: 120536#L389 assume !false; 124841#L307 assume 0 == ~wl_st~0; 124840#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 124838#L333 assume !(0 != eval_~tmp~0#1); 124839#L329 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 123207#L348 assume !(0 != eval_~tmp___0~0#1); 123209#L344 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 123204#L363 assume !(0 != eval_~tmp___1~0#1); 123205#L359 assume !(0 == ~wb_st~0); 124843#L374 assume !(0 == ~r_st~0); 120536#L389 [2024-11-19 15:04:03,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:03,841 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2024-11-19 15:04:03,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:03,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64169868] [2024-11-19 15:04:03,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 15:04:03,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:03,846 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 15:04:03,846 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:04:03,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:04:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:03,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:04:03,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:03,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1608868656, now seen corresponding path program 1 times [2024-11-19 15:04:03,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:03,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457427742] [2024-11-19 15:04:03,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:04:03,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:03,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:04:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:03,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:04:03,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:03,854 INFO L85 PathProgramCache]: Analyzing trace with hash 39115976, now seen corresponding path program 1 times [2024-11-19 15:04:03,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:03,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533664072] [2024-11-19 15:04:03,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:04:03,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:04:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 15:04:03,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:04:03,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533664072] [2024-11-19 15:04:03,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533664072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:04:03,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:04:03,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 15:04:03,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093370388] [2024-11-19 15:04:03,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:04:03,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:04:03,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 15:04:03,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 15:04:03,894 INFO L87 Difference]: Start difference. First operand 13686 states and 21406 transitions. cyclomatic complexity: 7747 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:03,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:04:03,957 INFO L93 Difference]: Finished difference Result 23373 states and 36086 transitions. [2024-11-19 15:04:03,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23373 states and 36086 transitions. [2024-11-19 15:04:04,096 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 9446 [2024-11-19 15:04:04,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23373 states to 23373 states and 36086 transitions. [2024-11-19 15:04:04,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9572 [2024-11-19 15:04:04,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9572 [2024-11-19 15:04:04,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23373 states and 36086 transitions. [2024-11-19 15:04:04,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:04:04,179 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23373 states and 36086 transitions. [2024-11-19 15:04:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23373 states and 36086 transitions. [2024-11-19 15:04:04,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23373 to 23373. [2024-11-19 15:04:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23373 states, 23373 states have (on average 1.5439181962093014) internal successors, (36086), 23372 states have internal predecessors, (36086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:04:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23373 states to 23373 states and 36086 transitions. [2024-11-19 15:04:04,439 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23373 states and 36086 transitions. [2024-11-19 15:04:04,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 15:04:04,440 INFO L425 stractBuchiCegarLoop]: Abstraction has 23373 states and 36086 transitions. [2024-11-19 15:04:04,440 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-19 15:04:04,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23373 states and 36086 transitions. [2024-11-19 15:04:04,616 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 9446 [2024-11-19 15:04:04,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:04:04,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:04:04,619 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] [2024-11-19 15:04:04,620 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:04:04,620 INFO L745 eck$LassoCheckResult]: Stem: 150181#$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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 150182#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 150148#L416 assume !(1 == ~c_req_up~0); 150150#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 150382#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 150416#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 150415#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 150230#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 150231#L447-1 assume !(0 == ~e_f~0); 150412#L452-1 assume !(0 == ~e_g~0); 150103#L457-1 assume !(0 == ~e_e~0); 150104#L462-1 assume !(0 == ~e_c~0); 150395#L467-1 assume !(0 == ~e_wl~0); 150360#L472-1 assume !(1 == ~wl_pc~0); 150361#$Ultimate##44 assume !(2 == ~wl_pc~0); 150351#L485 assume !(1 == ~c1_pc~0); 150328#L495 assume !(1 == ~c2_pc~0); 150418#L504 assume !(1 == ~wb_pc~0); 150354#L513 assume !(1 == ~e_c~0); 150132#L522-1 assume !(1 == ~e_e~0); 150133#L527-1 assume !(1 == ~e_f~0); 150413#L532-1 assume !(1 == ~e_g~0); 150331#L537-1 assume !(1 == ~e_c~0); 150256#L542-1 assume !(1 == ~e_wl~0); 150257#L684-1 assume !false; 154799#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 166401#L389 [2024-11-19 15:04:04,620 INFO L747 eck$LassoCheckResult]: Loop: 166401#L389 assume !false; 169488#L307 assume 0 == ~wl_st~0; 169487#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 169485#L333 assume !(0 != eval_~tmp~0#1); 169484#L329 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 169442#L348 assume !(0 != eval_~tmp___0~0#1); 167167#L344 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 167162#L363 assume !(0 != eval_~tmp___1~0#1); 167161#L359 assume 0 == ~wb_st~0;havoc eval_#t~nondet7#1;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 167143#L378 assume !(0 != eval_~tmp___2~0#1); 167159#L374 assume !(0 == ~r_st~0); 166401#L389 [2024-11-19 15:04:04,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:04,620 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2024-11-19 15:04:04,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:04,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200412411] [2024-11-19 15:04:04,621 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 15:04:04,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:04,639 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 15:04:04,640 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:04:04,640 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:04:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:04,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:04:04,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:04,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1664643830, now seen corresponding path program 1 times [2024-11-19 15:04:04,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:04,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001068216] [2024-11-19 15:04:04,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:04:04,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:04,662 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:04:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:04,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:04:04,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:04:04,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1212559870, now seen corresponding path program 1 times [2024-11-19 15:04:04,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:04:04,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858446878] [2024-11-19 15:04:04,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:04:04,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:04:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:04,684 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:04:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:04,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:04:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:05,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:04:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:04:05,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 03:04:05 BoogieIcfgContainer [2024-11-19 15:04:05,536 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-19 15:04:05,536 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 15:04:05,537 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 15:04:05,537 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 15:04:05,538 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:03:56" (3/4) ... [2024-11-19 15:04:05,540 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-19 15:04:05,600 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 15:04:05,600 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 15:04:05,601 INFO L158 Benchmark]: Toolchain (without parser) took 9688.99ms. Allocated memory was 142.6MB in the beginning and 931.1MB in the end (delta: 788.5MB). Free memory was 85.5MB in the beginning and 774.6MB in the end (delta: -689.2MB). Peak memory consumption was 102.3MB. Max. memory is 16.1GB. [2024-11-19 15:04:05,601 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 15:04:05,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.44ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 68.2MB in the end (delta: 17.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 15:04:05,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.43ms. Allocated memory is still 142.6MB. Free memory was 68.2MB in the beginning and 65.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 15:04:05,602 INFO L158 Benchmark]: Boogie Preprocessor took 43.80ms. Allocated memory is still 142.6MB. Free memory was 65.9MB in the beginning and 63.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 15:04:05,602 INFO L158 Benchmark]: RCFGBuilder took 539.33ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 63.0MB in the beginning and 140.8MB in the end (delta: -77.9MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2024-11-19 15:04:05,602 INFO L158 Benchmark]: BuchiAutomizer took 8738.32ms. Allocated memory was 184.5MB in the beginning and 931.1MB in the end (delta: 746.6MB). Free memory was 140.8MB in the beginning and 780.9MB in the end (delta: -640.1MB). Peak memory consumption was 105.4MB. Max. memory is 16.1GB. [2024-11-19 15:04:05,602 INFO L158 Benchmark]: Witness Printer took 64.50ms. Allocated memory is still 931.1MB. Free memory was 780.9MB in the beginning and 774.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 15:04:05,603 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.15ms. Allocated memory is still 142.6MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.44ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 68.2MB in the end (delta: 17.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.43ms. Allocated memory is still 142.6MB. Free memory was 68.2MB in the beginning and 65.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.80ms. Allocated memory is still 142.6MB. Free memory was 65.9MB in the beginning and 63.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 539.33ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 63.0MB in the beginning and 140.8MB in the end (delta: -77.9MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 8738.32ms. Allocated memory was 184.5MB in the beginning and 931.1MB in the end (delta: 746.6MB). Free memory was 140.8MB in the beginning and 780.9MB in the end (delta: -640.1MB). Peak memory consumption was 105.4MB. Max. memory is 16.1GB. * Witness Printer took 64.50ms. Allocated memory is still 931.1MB. Free memory was 780.9MB in the beginning and 774.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 18 terminating modules (15 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (((long long) -1 * e_c) + 1) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -1 * e_c) + 1) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -1 * e_e) + 1) and consists of 3 locations. 15 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 23373 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.6s and 16 iterations. TraceHistogramMax:1. Analysis of lassos took 4.8s. Construction of modules took 0.3s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 12. Automata minimization 1.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 2148 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.6s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4438 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4435 mSDsluCounter, 7483 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2765 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 364 IncrementalHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 4718 mSDtfsCounter, 364 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT1 SILN1 SILU0 SILI6 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital78 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq182 hnf98 smp100 dnf156 smp82 tf109 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 306]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L701] int __retres1 ; [L705] e_wl = 2 [L706] e_c = e_wl [L707] e_g = e_c [L708] e_f = e_g [L709] e_e = e_f [L710] wl_pc = 0 [L711] c1_pc = 0 [L712] c2_pc = 0 [L713] wb_pc = 0 [L714] wb_i = 1 [L715] c2_i = wb_i [L716] c1_i = c2_i [L717] wl_i = c1_i [L718] r_i = 0 [L719] c_req_up = 0 [L720] d = 0 [L721] c = 0 [L722] CALL start_simulation() [L412] int kernel_st ; [L415] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L416] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L427] COND TRUE (int )wl_i == 1 [L428] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L432] COND TRUE (int )c1_i == 1 [L433] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L437] COND TRUE (int )c2_i == 1 [L438] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L442] COND TRUE (int )wb_i == 1 [L443] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L447] COND FALSE !((int )r_i == 1) [L450] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L452] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L457] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L462] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L467] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L472] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L477] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L485] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L495] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L504] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L513] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L522] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L527] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L532] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L537] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L542] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L547] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L553] COND TRUE 1 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L556] kernel_st = 1 [L557] CALL eval() [L298] int tmp ; [L299] int tmp___0 ; [L300] int tmp___1 ; [L301] int tmp___2 ; [L302] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L306] COND TRUE 1 [L308] COND TRUE (int )wl_st == 0 [L329] COND TRUE (int )wl_st == 0 [L331] tmp = __VERIFIER_nondet_int() [L333] COND FALSE !(\read(tmp)) [L344] COND TRUE (int )c1_st == 0 [L346] tmp___0 = __VERIFIER_nondet_int() [L348] COND FALSE !(\read(tmp___0)) [L359] COND TRUE (int )c2_st == 0 [L361] tmp___1 = __VERIFIER_nondet_int() [L363] COND FALSE !(\read(tmp___1)) [L374] COND TRUE (int )wb_st == 0 [L376] tmp___2 = __VERIFIER_nondet_int() [L378] COND FALSE !(\read(tmp___2)) [L389] COND FALSE !((int )r_st == 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 306]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L701] int __retres1 ; [L705] e_wl = 2 [L706] e_c = e_wl [L707] e_g = e_c [L708] e_f = e_g [L709] e_e = e_f [L710] wl_pc = 0 [L711] c1_pc = 0 [L712] c2_pc = 0 [L713] wb_pc = 0 [L714] wb_i = 1 [L715] c2_i = wb_i [L716] c1_i = c2_i [L717] wl_i = c1_i [L718] r_i = 0 [L719] c_req_up = 0 [L720] d = 0 [L721] c = 0 [L722] CALL start_simulation() [L412] int kernel_st ; [L415] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L416] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L427] COND TRUE (int )wl_i == 1 [L428] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L432] COND TRUE (int )c1_i == 1 [L433] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L437] COND TRUE (int )c2_i == 1 [L438] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L442] COND TRUE (int )wb_i == 1 [L443] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L447] COND FALSE !((int )r_i == 1) [L450] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L452] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L457] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L462] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L467] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L472] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L477] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L485] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L495] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L504] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L513] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L522] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L527] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L532] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L537] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L542] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L547] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L553] COND TRUE 1 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L556] kernel_st = 1 [L557] CALL eval() [L298] int tmp ; [L299] int tmp___0 ; [L300] int tmp___1 ; [L301] int tmp___2 ; [L302] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L306] COND TRUE 1 [L308] COND TRUE (int )wl_st == 0 [L329] COND TRUE (int )wl_st == 0 [L331] tmp = __VERIFIER_nondet_int() [L333] COND FALSE !(\read(tmp)) [L344] COND TRUE (int )c1_st == 0 [L346] tmp___0 = __VERIFIER_nondet_int() [L348] COND FALSE !(\read(tmp___0)) [L359] COND TRUE (int )c2_st == 0 [L361] tmp___1 = __VERIFIER_nondet_int() [L363] COND FALSE !(\read(tmp___1)) [L374] COND TRUE (int )wb_st == 0 [L376] tmp___2 = __VERIFIER_nondet_int() [L378] COND FALSE !(\read(tmp___2)) [L389] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-19 15:04:05,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)