./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/toy.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 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 16:08:54,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 16:08:54,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 16:08:54,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 16:08:54,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 16:08:54,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 16:08:54,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 16:08:54,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 16:08:54,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 16:08:54,417 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 16:08:54,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 16:08:54,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 16:08:54,418 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 16:08:54,418 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 16:08:54,419 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 16:08:54,419 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 16:08:54,419 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 16:08:54,419 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 16:08:54,419 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 16:08:54,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 16:08:54,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 16:08:54,423 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 16:08:54,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 16:08:54,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 16:08:54,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 16:08:54,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 16:08:54,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 16:08:54,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 16:08:54,425 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 16:08:54,425 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 16:08:54,425 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 16:08:54,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 16:08:54,426 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 16:08:54,426 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 16:08:54,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 16:08:54,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 16:08:54,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 16:08:54,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 16:08:54,427 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 16:08:54,427 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 -> 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b [2024-11-09 16:08:54,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 16:08:54,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 16:08:54,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 16:08:54,648 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 16:08:54,648 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 16:08:54,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy.cil.c [2024-11-09 16:08:55,902 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 16:08:56,066 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 16:08:56,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c [2024-11-09 16:08:56,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5931b41a8/31699b32e80a40928648edaf5799a1a5/FLAG0d72e2de2 [2024-11-09 16:08:56,467 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5931b41a8/31699b32e80a40928648edaf5799a1a5 [2024-11-09 16:08:56,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 16:08:56,471 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 16:08:56,472 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 16:08:56,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 16:08:56,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 16:08:56,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:08:56" (1/1) ... [2024-11-09 16:08:56,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368b29ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:08:56, skipping insertion in model container [2024-11-09 16:08:56,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:08:56" (1/1) ... [2024-11-09 16:08:56,517 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 16:08:56,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 16:08:56,705 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 16:08:56,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 16:08:56,790 INFO L204 MainTranslator]: Completed translation [2024-11-09 16:08:56,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:08:56 WrapperNode [2024-11-09 16:08:56,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 16:08:56,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 16:08:56,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 16:08:56,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 16:08:56,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:08:56" (1/1) ... [2024-11-09 16:08:56,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:08:56" (1/1) ... [2024-11-09 16:08:56,828 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 362 [2024-11-09 16:08:56,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 16:08:56,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 16:08:56,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 16:08:56,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 16:08:56,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:08:56" (1/1) ... [2024-11-09 16:08:56,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:08:56" (1/1) ... [2024-11-09 16:08:56,838 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:08:56" (1/1) ... [2024-11-09 16:08:56,853 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-09 16:08:56,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:08:56" (1/1) ... [2024-11-09 16:08:56,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:08:56" (1/1) ... [2024-11-09 16:08:56,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:08:56" (1/1) ... [2024-11-09 16:08:56,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:08:56" (1/1) ... [2024-11-09 16:08:56,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:08:56" (1/1) ... [2024-11-09 16:08:56,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:08:56" (1/1) ... [2024-11-09 16:08:56,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 16:08:56,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 16:08:56,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 16:08:56,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 16:08:56,874 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:08:56" (1/1) ... [2024-11-09 16:08:56,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:08:56,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:08:56,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:08:56,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-09 16:08:56,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 16:08:56,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 16:08:56,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 16:08:56,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 16:08:57,017 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 16:08:57,019 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 16:08:57,376 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-09 16:08:57,376 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 16:08:57,387 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 16:08:57,388 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-09 16:08:57,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:08:57 BoogieIcfgContainer [2024-11-09 16:08:57,388 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 16:08:57,389 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 16:08:57,389 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 16:08:57,392 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 16:08:57,392 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 16:08:57,393 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 04:08:56" (1/3) ... [2024-11-09 16:08:57,393 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c44b626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 04:08:57, skipping insertion in model container [2024-11-09 16:08:57,393 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 16:08:57,394 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:08:56" (2/3) ... [2024-11-09 16:08:57,394 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c44b626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 04:08:57, skipping insertion in model container [2024-11-09 16:08:57,394 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 16:08:57,394 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:08:57" (3/3) ... [2024-11-09 16:08:57,395 INFO L332 chiAutomizerObserver]: Analyzing ICFG toy.cil.c [2024-11-09 16:08:57,438 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 16:08:57,438 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 16:08:57,439 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 16:08:57,439 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 16:08:57,439 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 16:08:57,439 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 16:08:57,439 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 16:08:57,440 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 16:08:57,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 132 states, 131 states have (on average 1.8244274809160306) internal successors, (239), 131 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:08:57,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 97 [2024-11-09 16:08:57,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:08:57,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:08:57,482 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-09 16:08:57,482 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-09 16:08:57,482 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 16:08:57,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 132 states, 131 states have (on average 1.8244274809160306) internal successors, (239), 131 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:08:57,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 97 [2024-11-09 16:08:57,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:08:57,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:08:57,494 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-09 16:08:57,494 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-09 16:08:57,500 INFO L745 eck$LassoCheckResult]: Stem: 24#$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(10, 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; 39#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; 106#L408true assume !(1 == ~c_req_up~0); 85#L408-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 127#L419-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 126#L424-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 60#L429-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 121#L434-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 43#L439-1true assume !(0 == ~e_f~0); 5#L444-1true assume !(0 == ~e_g~0); 98#L449-1true assume !(0 == ~e_e~0); 53#L454-1true assume !(0 == ~e_c~0); 111#L459-1true assume !(0 == ~e_wl~0); 25#L464-1true assume !(1 == ~wl_pc~0); 100#$Ultimate##44true assume !(2 == ~wl_pc~0); 23#L477true assume !(1 == ~c1_pc~0); 18#L487true assume !(1 == ~c2_pc~0); 87#L496true assume !(1 == ~wb_pc~0); 29#L505true assume !(1 == ~e_c~0); 36#L514-1true assume !(1 == ~e_e~0); 133#L519-1true assume !(1 == ~e_f~0); 40#L524-1true assume !(1 == ~e_g~0); 131#L529-1true assume !(1 == ~e_c~0); 2#L534-1true assume !(1 == ~e_wl~0); 4#L676-1true [2024-11-09 16:08:57,501 INFO L747 eck$LassoCheckResult]: Loop: 4#L676-1true assume !false; 35#L546true 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; 70#L381true assume !true; 90#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; 42#L552true assume !(1 == ~c_req_up~0); 59#L552-2true start_simulation_~kernel_st~0#1 := 3; 14#L564true assume 0 == ~e_f~0;~e_f~0 := 1; 17#L564-2true assume 0 == ~e_g~0;~e_g~0 := 1; 6#L569-1true assume 0 == ~e_e~0;~e_e~0 := 1; 130#L574-1true assume 0 == ~e_c~0;~e_c~0 := 1; 10#L579-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 94#L584-1true assume 1 == ~wl_pc~0; 46#L590true assume 1 == ~e_wl~0;~wl_st~0 := 0; 113#L597true assume !(1 == ~c1_pc~0); 27#L607true assume !(1 == ~c2_pc~0); 103#L616true assume !(1 == ~wb_pc~0); 123#L625true assume 1 == ~e_c~0;~r_st~0 := 0; 58#L634-1true assume 1 == ~e_e~0;~e_e~0 := 2; 52#L639-1true assume 1 == ~e_f~0;~e_f~0 := 2; 117#L644-1true assume 1 == ~e_g~0;~e_g~0 := 2; 77#L649-1true assume 1 == ~e_c~0;~e_c~0 := 2; 41#L654-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 21#L659-1true assume 0 == ~wl_st~0; 4#L676-1true [2024-11-09 16:08:57,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:08:57,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2024-11-09 16:08:57,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:08:57,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017076487] [2024-11-09 16:08:57,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:08:57,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:08:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:08:57,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:08:57,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017076487] [2024-11-09 16:08:57,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017076487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:08:57,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:08:57,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 16:08:57,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122495112] [2024-11-09 16:08:57,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:08:57,761 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 16:08:57,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:08:57,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1307375692, now seen corresponding path program 1 times [2024-11-09 16:08:57,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:08:57,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977383041] [2024-11-09 16:08:57,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:08:57,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:08:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:08:57,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:08:57,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977383041] [2024-11-09 16:08:57,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977383041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:08:57,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:08:57,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 16:08:57,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134094992] [2024-11-09 16:08:57,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:08:57,781 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:08:57,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:08:57,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 16:08:57,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 16:08:57,808 INFO L87 Difference]: Start difference. First operand has 132 states, 131 states have (on average 1.8244274809160306) internal successors, (239), 131 states have internal predecessors, (239), 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-09 16:08:57,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:08:57,821 INFO L93 Difference]: Finished difference Result 130 states and 224 transitions. [2024-11-09 16:08:57,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 224 transitions. [2024-11-09 16:08:57,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2024-11-09 16:08:57,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 125 states and 219 transitions. [2024-11-09 16:08:57,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2024-11-09 16:08:57,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2024-11-09 16:08:57,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 219 transitions. [2024-11-09 16:08:57,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:08:57,832 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 219 transitions. [2024-11-09 16:08:57,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 219 transitions. [2024-11-09 16:08:57,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-09 16:08:57,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.752) internal successors, (219), 124 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-09 16:08:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 219 transitions. [2024-11-09 16:08:57,862 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 219 transitions. [2024-11-09 16:08:57,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 16:08:57,868 INFO L425 stractBuchiCegarLoop]: Abstraction has 125 states and 219 transitions. [2024-11-09 16:08:57,868 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 16:08:57,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 219 transitions. [2024-11-09 16:08:57,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2024-11-09 16:08:57,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:08:57,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:08:57,873 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-09 16:08:57,873 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-09 16:08:57,873 INFO L745 eck$LassoCheckResult]: Stem: 314#$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(10, 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; 315#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; 344#L408 assume !(1 == ~c_req_up~0); 307#L408-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 384#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 395#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 369#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 370#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 351#L439-1 assume !(0 == ~e_f~0); 274#L444-1 assume !(0 == ~e_g~0); 275#L449-1 assume !(0 == ~e_e~0); 364#L454-1 assume !(0 == ~e_c~0); 365#L459-1 assume !(0 == ~e_wl~0); 316#L464-1 assume !(1 == ~wl_pc~0); 317#$Ultimate##44 assume !(2 == ~wl_pc~0); 312#L477 assume !(1 == ~c1_pc~0); 300#L487 assume !(1 == ~c2_pc~0); 302#L496 assume !(1 == ~wb_pc~0); 328#L505 assume !(1 == ~e_c~0); 329#L514-1 assume !(1 == ~e_e~0); 340#L519-1 assume !(1 == ~e_f~0); 346#L524-1 assume !(1 == ~e_g~0); 347#L529-1 assume !(1 == ~e_c~0); 271#L534-1 assume !(1 == ~e_wl~0); 272#L676-1 [2024-11-09 16:08:57,875 INFO L747 eck$LassoCheckResult]: Loop: 272#L676-1 assume !false; 273#L546 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; 298#L381 assume !false; 341#L299 assume !(0 == ~wl_st~0); 342#L303 assume !(0 == ~c1_st~0); 394#L306 assume !(0 == ~c2_st~0); 387#L309 assume !(0 == ~wb_st~0); 388#L312 assume !(0 == ~r_st~0); 389#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; 348#L552 assume !(1 == ~c_req_up~0); 349#L552-2 start_simulation_~kernel_st~0#1 := 3; 295#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 296#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 276#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 277#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 286#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 287#L584-1 assume 1 == ~wl_pc~0; 355#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 356#L597 assume !(1 == ~c1_pc~0); 322#L607 assume !(1 == ~c2_pc~0); 323#L616 assume !(1 == ~wb_pc~0); 376#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 368#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 362#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 363#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 377#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 345#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 308#L659-1 assume 0 == ~wl_st~0; 272#L676-1 [2024-11-09 16:08:57,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:08:57,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2024-11-09 16:08:57,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:08:57,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142378037] [2024-11-09 16:08:57,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:08:57,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:08:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:08:57,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:08:57,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142378037] [2024-11-09 16:08:57,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142378037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:08:57,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:08:57,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 16:08:57,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223154283] [2024-11-09 16:08:57,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:08:57,972 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 16:08:57,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:08:57,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1329201933, now seen corresponding path program 1 times [2024-11-09 16:08:57,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:08:57,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849878044] [2024-11-09 16:08:57,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:08:57,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:08:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:08:57,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:08:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:08:58,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:08:58,283 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:08:58,283 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:08:58,283 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:08:58,284 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:08:58,284 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 16:08:58,284 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:08:58,284 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:08:58,284 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:08:58,284 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration2_Loop [2024-11-09 16:08:58,284 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:08:58,285 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:08:58,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,573 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:08:58,574 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 16:08:58,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:08:58,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:08:58,578 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:08:58,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-09 16:08:58,580 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:08:58,580 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:08:58,602 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 16:08:58,606 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-09 16:08:58,620 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-09 16:08:58,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:08:58,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:08:58,622 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:08:58,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-09 16:08:58,625 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:08:58,625 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:08:58,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-09 16:08:58,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:08:58,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:08:58,648 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:08:58,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-09 16:08:58,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 16:08:58,649 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:08:58,661 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 16:08:58,671 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-09 16:08:58,672 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:08:58,672 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:08:58,672 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:08:58,672 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:08:58,672 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 16:08:58,672 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:08:58,673 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:08:58,673 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:08:58,673 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration2_Loop [2024-11-09 16:08:58,674 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:08:58,674 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:08:58,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:58,908 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:08:58,913 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 16:08:58,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:08:58,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:08:58,916 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:08:58,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-09 16:08:58,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:08:58,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:08:58,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:08:58,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:08:58,930 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-09 16:08:58,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:08:58,932 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 16:08:58,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:08:58,934 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:08:58,946 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-09 16:08:58,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:08:58,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:08:58,949 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:08:58,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-09 16:08:58,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:08:58,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:08:58,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:08:58,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:08:58,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:08:58,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:08:58,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:08:58,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:08:58,965 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 16:08:58,968 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 16:08:58,968 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 16:08:58,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:08:58,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:08:58,973 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:08:58,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-09 16:08:58,975 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 16:08:58,975 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 16:08:58,975 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 16:08:58,975 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2024-11-09 16:08:58,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-09 16:08:58,990 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 16:08:59,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:08:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:59,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 16:08:59,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:08:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:59,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 16:08:59,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:08:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:08:59,181 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-09 16:08:59,182 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 219 transitions. cyclomatic complexity: 95 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-09 16:08:59,277 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 219 transitions. cyclomatic complexity: 95. 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 413 states and 711 transitions. Complement of second has 5 states. [2024-11-09 16:08:59,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 16:08:59,279 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-09 16:08:59,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2024-11-09 16:08:59,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 383 transitions. Stem has 24 letters. Loop has 28 letters. [2024-11-09 16:08:59,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:08:59,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 383 transitions. Stem has 52 letters. Loop has 28 letters. [2024-11-09 16:08:59,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:08:59,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 383 transitions. Stem has 24 letters. Loop has 56 letters. [2024-11-09 16:08:59,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:08:59,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 413 states and 711 transitions. [2024-11-09 16:08:59,288 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 282 [2024-11-09 16:08:59,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 413 states to 413 states and 711 transitions. [2024-11-09 16:08:59,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 314 [2024-11-09 16:08:59,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 317 [2024-11-09 16:08:59,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 413 states and 711 transitions. [2024-11-09 16:08:59,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:08:59,296 INFO L218 hiAutomatonCegarLoop]: Abstraction has 413 states and 711 transitions. [2024-11-09 16:08:59,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states and 711 transitions. [2024-11-09 16:08:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 316. [2024-11-09 16:08:59,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.7278481012658229) internal successors, (546), 315 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:08:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 546 transitions. [2024-11-09 16:08:59,313 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 546 transitions. [2024-11-09 16:08:59,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:08:59,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 16:08:59,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 16:08:59,314 INFO L87 Difference]: Start difference. First operand 316 states and 546 transitions. 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-09 16:08:59,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:08:59,332 INFO L93 Difference]: Finished difference Result 316 states and 545 transitions. [2024-11-09 16:08:59,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 545 transitions. [2024-11-09 16:08:59,334 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2024-11-09 16:08:59,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 545 transitions. [2024-11-09 16:08:59,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2024-11-09 16:08:59,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2024-11-09 16:08:59,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 545 transitions. [2024-11-09 16:08:59,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:08:59,336 INFO L218 hiAutomatonCegarLoop]: Abstraction has 316 states and 545 transitions. [2024-11-09 16:08:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 545 transitions. [2024-11-09 16:08:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2024-11-09 16:08:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.7246835443037976) internal successors, (545), 315 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:08:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 545 transitions. [2024-11-09 16:08:59,348 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 545 transitions. [2024-11-09 16:08:59,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 16:08:59,349 INFO L425 stractBuchiCegarLoop]: Abstraction has 316 states and 545 transitions. [2024-11-09 16:08:59,349 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 16:08:59,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 545 transitions. [2024-11-09 16:08:59,350 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2024-11-09 16:08:59,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:08:59,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:08:59,351 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-09 16:08:59,351 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-09 16:08:59,351 INFO L745 eck$LassoCheckResult]: Stem: 1696#$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(10, 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; 1697#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; 1748#L408 assume !(1 == ~c_req_up~0); 1685#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1830#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 1851#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1795#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 1796#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1760#L439-1 assume !(0 == ~e_f~0); 1624#L444-1 assume !(0 == ~e_g~0); 1625#L449-1 assume !(0 == ~e_e~0); 1785#L454-1 assume !(0 == ~e_c~0); 1786#L459-1 assume !(0 == ~e_wl~0); 1698#L464-1 assume !(1 == ~wl_pc~0); 1699#$Ultimate##44 assume !(2 == ~wl_pc~0); 1694#L477 assume !(1 == ~c1_pc~0); 1675#L487 assume !(1 == ~c2_pc~0); 1677#L496 assume !(1 == ~wb_pc~0); 1719#L505 assume !(1 == ~e_c~0); 1720#L514-1 assume !(1 == ~e_e~0); 1741#L519-1 assume !(1 == ~e_f~0); 1752#L524-1 assume !(1 == ~e_g~0); 1753#L529-1 assume !(1 == ~e_c~0); 1617#L534-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1618#L676-1 [2024-11-09 16:08:59,351 INFO L747 eck$LassoCheckResult]: Loop: 1618#L676-1 assume !false; 1867#L546 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; 1807#L381 assume !false; 1742#L299 assume !(0 == ~wl_st~0); 1743#L303 assume !(0 == ~c1_st~0); 1852#L306 assume !(0 == ~c2_st~0); 1834#L309 assume !(0 == ~wb_st~0); 1835#L312 assume !(0 == ~r_st~0); 1853#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; 1859#L552 assume !(1 == ~c_req_up~0); 1794#L552-2 start_simulation_~kernel_st~0#1 := 3; 1664#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 1665#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1674#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1855#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1856#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1902#L584-1 assume 1 == ~wl_pc~0; 1900#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1898#L597 assume !(1 == ~c1_pc~0); 1894#L607 assume !(1 == ~c2_pc~0); 1889#L616 assume !(1 == ~wb_pc~0); 1888#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 1884#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1781#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1782#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1846#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1749#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1750#L659-1 assume 0 == ~wl_st~0; 1618#L676-1 [2024-11-09 16:08:59,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:08:59,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779217, now seen corresponding path program 1 times [2024-11-09 16:08:59,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:08:59,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842266241] [2024-11-09 16:08:59,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:08:59,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:08:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:08:59,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:08:59,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842266241] [2024-11-09 16:08:59,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842266241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:08:59,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:08:59,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 16:08:59,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407595529] [2024-11-09 16:08:59,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:08:59,390 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 16:08:59,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:08:59,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1329201933, now seen corresponding path program 2 times [2024-11-09 16:08:59,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:08:59,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803095108] [2024-11-09 16:08:59,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:08:59,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:08:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:08:59,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:08:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:08:59,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:08:59,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-09 16:08:59,578 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:08:59,578 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:08:59,578 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:08:59,579 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:08:59,579 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 16:08:59,579 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:08:59,579 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:08:59,579 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:08:59,579 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration3_Loop [2024-11-09 16:08:59,579 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:08:59,579 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:08:59,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,786 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:08:59,786 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 16:08:59,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:08:59,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:08:59,791 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:08:59,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-09 16:08:59,792 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:08:59,793 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:08:59,811 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 16:08:59,811 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-09 16:08:59,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-09 16:08:59,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:08:59,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:08:59,824 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:08:59,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-09 16:08:59,825 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:08:59,825 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:08:59,836 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 16:08:59,837 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-09 16:08:59,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-09 16:08:59,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:08:59,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:08:59,848 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:08:59,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-09 16:08:59,849 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:08:59,849 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:08:59,861 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 16:08:59,861 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-09 16:08:59,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-09 16:08:59,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:08:59,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:08:59,875 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:08:59,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-09 16:08:59,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:08:59,878 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:08:59,896 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-09 16:08:59,896 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-09 16:08:59,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-09 16:08:59,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:08:59,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:08:59,910 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:08:59,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-09 16:08:59,912 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:08:59,913 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:08:59,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-09 16:08:59,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:08:59,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:08:59,935 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:08:59,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-09 16:08:59,936 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 16:08:59,936 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:08:59,949 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 16:08:59,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-09 16:08:59,959 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:08:59,959 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:08:59,959 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:08:59,959 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:08:59,959 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 16:08:59,959 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:08:59,959 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:08:59,959 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:08:59,959 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration3_Loop [2024-11-09 16:08:59,959 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:08:59,960 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:08:59,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:08:59,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,169 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:09:00,170 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 16:09:00,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:09:00,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:09:00,174 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:09:00,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-09 16:09:00,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:09:00,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:09:00,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:09:00,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:09:00,187 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-09 16:09:00,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:09:00,188 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 16:09:00,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:09:00,189 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:09:00,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-09 16:09:00,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:09:00,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:09:00,202 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:09:00,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-09 16:09:00,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:09:00,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:09:00,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:09:00,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:09:00,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:09:00,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:09:00,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:09:00,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:09:00,216 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:09:00,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-09 16:09:00,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:09:00,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:09:00,227 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:09:00,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-09 16:09:00,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:09:00,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:09:00,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:09:00,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:09:00,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:09:00,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:09:00,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:09:00,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:09:00,240 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:09:00,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-09 16:09:00,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:09:00,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:09:00,254 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:09:00,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-09 16:09:00,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:09:00,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:09:00,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:09:00,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:09:00,266 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-09 16:09:00,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:09:00,266 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-09 16:09:00,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:09:00,268 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:09:00,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-09 16:09:00,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:09:00,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:09:00,279 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:09:00,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-09 16:09:00,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:09:00,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:09:00,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:09:00,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:09:00,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:09:00,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:09:00,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:09:00,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:09:00,293 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 16:09:00,296 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 16:09:00,296 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 16:09:00,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:09:00,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:09:00,297 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:09:00,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-09 16:09:00,299 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 16:09:00,299 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 16:09:00,299 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 16:09:00,299 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2024-11-09 16:09:00,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-09 16:09:00,312 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 16:09:00,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:09:00,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 16:09:00,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:09:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:09:00,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 16:09:00,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:09:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:09:00,448 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-09 16:09:00,448 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 316 states and 545 transitions. cyclomatic complexity: 232 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-09 16:09:00,494 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 316 states and 545 transitions. cyclomatic complexity: 232. 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 604 states and 1037 transitions. Complement of second has 5 states. [2024-11-09 16:09:00,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 16:09:00,495 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-09 16:09:00,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2024-11-09 16:09:00,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 382 transitions. Stem has 24 letters. Loop has 28 letters. [2024-11-09 16:09:00,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:09:00,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 382 transitions. Stem has 52 letters. Loop has 28 letters. [2024-11-09 16:09:00,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:09:00,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 382 transitions. Stem has 24 letters. Loop has 56 letters. [2024-11-09 16:09:00,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:09:00,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 604 states and 1037 transitions. [2024-11-09 16:09:00,500 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 376 [2024-11-09 16:09:00,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 604 states to 604 states and 1037 transitions. [2024-11-09 16:09:00,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2024-11-09 16:09:00,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 412 [2024-11-09 16:09:00,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 604 states and 1037 transitions. [2024-11-09 16:09:00,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:09:00,503 INFO L218 hiAutomatonCegarLoop]: Abstraction has 604 states and 1037 transitions. [2024-11-09 16:09:00,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states and 1037 transitions. [2024-11-09 16:09:00,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 316. [2024-11-09 16:09:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.7246835443037976) internal successors, (545), 315 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:09:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 545 transitions. [2024-11-09 16:09:00,510 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 545 transitions. [2024-11-09 16:09:00,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:09:00,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 16:09:00,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 16:09:00,510 INFO L87 Difference]: Start difference. First operand 316 states and 545 transitions. 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-09 16:09:00,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:09:00,516 INFO L93 Difference]: Finished difference Result 316 states and 544 transitions. [2024-11-09 16:09:00,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 544 transitions. [2024-11-09 16:09:00,520 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2024-11-09 16:09:00,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 544 transitions. [2024-11-09 16:09:00,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2024-11-09 16:09:00,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2024-11-09 16:09:00,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 544 transitions. [2024-11-09 16:09:00,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:09:00,522 INFO L218 hiAutomatonCegarLoop]: Abstraction has 316 states and 544 transitions. [2024-11-09 16:09:00,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 544 transitions. [2024-11-09 16:09:00,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2024-11-09 16:09:00,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.7215189873417722) internal successors, (544), 315 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:09:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 544 transitions. [2024-11-09 16:09:00,529 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 544 transitions. [2024-11-09 16:09:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 16:09:00,531 INFO L425 stractBuchiCegarLoop]: Abstraction has 316 states and 544 transitions. [2024-11-09 16:09:00,532 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 16:09:00,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 544 transitions. [2024-11-09 16:09:00,533 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2024-11-09 16:09:00,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:09:00,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:09:00,534 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-09 16:09:00,534 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-09 16:09:00,535 INFO L745 eck$LassoCheckResult]: Stem: 3423#$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(10, 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; 3424#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; 3475#L408 assume !(1 == ~c_req_up~0); 3412#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3554#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3573#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3524#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 3525#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3486#L439-1 assume !(0 == ~e_f~0); 3351#L444-1 assume !(0 == ~e_g~0); 3352#L449-1 assume !(0 == ~e_e~0); 3511#L454-1 assume !(0 == ~e_c~0); 3512#L459-1 assume !(0 == ~e_wl~0); 3425#L464-1 assume !(1 == ~wl_pc~0); 3426#$Ultimate##44 assume !(2 == ~wl_pc~0); 3421#L477 assume !(1 == ~c1_pc~0); 3408#L487 assume !(1 == ~c2_pc~0); 3410#L496 assume !(1 == ~wb_pc~0); 3446#L505 assume !(1 == ~e_c~0); 3447#L514-1 assume !(1 == ~e_e~0); 3472#L519-1 assume !(1 == ~e_f~0); 3478#L524-1 assume !(1 == ~e_g~0); 3479#L529-1 assume !(1 == ~e_c~0); 3345#L534-1 assume !(1 == ~e_wl~0); 3346#L676-1 assume !false; 3348#L546 [2024-11-09 16:09:00,535 INFO L747 eck$LassoCheckResult]: Loop: 3348#L546 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; 3396#L381 assume !false; 3468#L299 assume !(0 == ~wl_st~0); 3469#L303 assume !(0 == ~c1_st~0); 3571#L306 assume !(0 == ~c2_st~0); 3558#L309 assume !(0 == ~wb_st~0); 3559#L312 assume !(0 == ~r_st~0); 3574#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; 3580#L552 assume !(1 == ~c_req_up~0); 3520#L552-2 start_simulation_~kernel_st~0#1 := 3; 3521#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 3401#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3353#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3354#L574-1 assume !(0 == ~e_c~0); 3373#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3374#L584-1 assume 1 == ~wl_pc~0; 3493#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 3494#L597 assume !(1 == ~c1_pc~0); 3434#L607 assume !(1 == ~c2_pc~0); 3435#L616 assume !(1 == ~wb_pc~0); 3535#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 3518#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3507#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3508#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3540#L649-1 assume !(1 == ~e_c~0); 3476#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3413#L659-1 assume 0 == ~wl_st~0; 3347#L676-1 assume !false; 3348#L546 [2024-11-09 16:09:00,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:00,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1939846590, now seen corresponding path program 1 times [2024-11-09 16:09:00,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:00,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148272165] [2024-11-09 16:09:00,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:00,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:09:00,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:09:00,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:09:00,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148272165] [2024-11-09 16:09:00,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148272165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:09:00,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:09:00,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 16:09:00,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112121042] [2024-11-09 16:09:00,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:09:00,580 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 16:09:00,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:00,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1635242511, now seen corresponding path program 1 times [2024-11-09 16:09:00,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:00,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028623346] [2024-11-09 16:09:00,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:00,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:00,586 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-09 16:09:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:09: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-09 16:09:00,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:09:00,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028623346] [2024-11-09 16:09:00,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028623346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:09:00,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:09:00,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 16:09:00,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901327254] [2024-11-09 16:09:00,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:09:00,604 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:09:00,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:09:00,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 16:09:00,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 16:09:00,605 INFO L87 Difference]: Start difference. First operand 316 states and 544 transitions. cyclomatic complexity: 231 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:09:00,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:09:00,613 INFO L93 Difference]: Finished difference Result 316 states and 543 transitions. [2024-11-09 16:09:00,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 543 transitions. [2024-11-09 16:09:00,614 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2024-11-09 16:09:00,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 543 transitions. [2024-11-09 16:09:00,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2024-11-09 16:09:00,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2024-11-09 16:09:00,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 543 transitions. [2024-11-09 16:09:00,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:09:00,617 INFO L218 hiAutomatonCegarLoop]: Abstraction has 316 states and 543 transitions. [2024-11-09 16:09:00,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 543 transitions. [2024-11-09 16:09:00,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2024-11-09 16:09:00,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.7183544303797469) internal successors, (543), 315 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:09:00,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 543 transitions. [2024-11-09 16:09:00,621 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 543 transitions. [2024-11-09 16:09:00,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 16:09:00,622 INFO L425 stractBuchiCegarLoop]: Abstraction has 316 states and 543 transitions. [2024-11-09 16:09:00,622 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 16:09:00,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 543 transitions. [2024-11-09 16:09:00,623 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2024-11-09 16:09:00,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:09:00,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:09:00,624 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-09 16:09:00,624 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-09 16:09:00,624 INFO L745 eck$LassoCheckResult]: Stem: 4062#$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(10, 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; 4063#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; 4115#L408 assume !(1 == ~c_req_up~0); 4051#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4191#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4211#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4161#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4162#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4126#L439-1 assume !(0 == ~e_f~0); 3990#L444-1 assume !(0 == ~e_g~0); 3991#L449-1 assume !(0 == ~e_e~0); 4151#L454-1 assume !(0 == ~e_c~0); 4152#L459-1 assume !(0 == ~e_wl~0); 4064#L464-1 assume !(1 == ~wl_pc~0); 4065#$Ultimate##44 assume !(2 == ~wl_pc~0); 4060#L477 assume !(1 == ~c1_pc~0); 4041#L487 assume !(1 == ~c2_pc~0); 4043#L496 assume !(1 == ~wb_pc~0); 4085#L505 assume !(1 == ~e_c~0); 4086#L514-1 assume !(1 == ~e_e~0); 4107#L519-1 assume !(1 == ~e_f~0); 4116#L524-1 assume !(1 == ~e_g~0); 4117#L529-1 assume !(1 == ~e_c~0); 3984#L534-1 assume !(1 == ~e_wl~0); 3985#L676-1 assume !false; 3987#L546 [2024-11-09 16:09:00,624 INFO L747 eck$LassoCheckResult]: Loop: 3987#L546 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; 4035#L381 assume !false; 4108#L299 assume !(0 == ~wl_st~0); 4110#L303 assume !(0 == ~c1_st~0); 4209#L306 assume !(0 == ~c2_st~0); 4196#L309 assume !(0 == ~wb_st~0); 4197#L312 assume !(0 == ~r_st~0); 4212#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; 4218#L552 assume !(1 == ~c_req_up~0); 4159#L552-2 start_simulation_~kernel_st~0#1 := 3; 4160#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 4040#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3992#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3993#L574-1 assume !(0 == ~e_c~0); 4012#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 4013#L584-1 assume 1 == ~wl_pc~0; 4133#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 4134#L597 assume !(1 == ~c1_pc~0); 4073#L607 assume !(1 == ~c2_pc~0); 4074#L616 assume !(1 == ~wb_pc~0); 4173#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 4157#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 4147#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 4148#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 4178#L649-1 assume !(1 == ~e_c~0); 4118#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4052#L659-1 assume 0 == ~wl_st~0; 3986#L676-1 assume !false; 3987#L546 [2024-11-09 16:09:00,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:00,625 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2024-11-09 16:09:00,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:00,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265586656] [2024-11-09 16:09:00,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:00,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:00,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:09:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:00,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:09:00,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:00,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1635242511, now seen corresponding path program 2 times [2024-11-09 16:09:00,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:00,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761849231] [2024-11-09 16:09:00,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:00,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:09:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:09:00,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:09:00,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761849231] [2024-11-09 16:09:00,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761849231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:09:00,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:09:00,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 16:09:00,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013789157] [2024-11-09 16:09:00,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:09:00,657 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:09:00,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:09:00,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 16:09:00,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 16:09:00,657 INFO L87 Difference]: Start difference. First operand 316 states and 543 transitions. cyclomatic complexity: 230 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-09 16:09:00,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:09:00,683 INFO L93 Difference]: Finished difference Result 378 states and 658 transitions. [2024-11-09 16:09:00,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 378 states and 658 transitions. [2024-11-09 16:09:00,685 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 204 [2024-11-09 16:09:00,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 378 states to 363 states and 628 transitions. [2024-11-09 16:09:00,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2024-11-09 16:09:00,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2024-11-09 16:09:00,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 363 states and 628 transitions. [2024-11-09 16:09:00,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:09:00,687 INFO L218 hiAutomatonCegarLoop]: Abstraction has 363 states and 628 transitions. [2024-11-09 16:09:00,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states and 628 transitions. [2024-11-09 16:09:00,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2024-11-09 16:09:00,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 363 states have (on average 1.7300275482093663) internal successors, (628), 362 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:09:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 628 transitions. [2024-11-09 16:09:00,693 INFO L240 hiAutomatonCegarLoop]: Abstraction has 363 states and 628 transitions. [2024-11-09 16:09:00,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 16:09:00,694 INFO L425 stractBuchiCegarLoop]: Abstraction has 363 states and 628 transitions. [2024-11-09 16:09:00,694 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 16:09:00,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 363 states and 628 transitions. [2024-11-09 16:09:00,696 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 204 [2024-11-09 16:09:00,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:09:00,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:09:00,698 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-09 16:09:00,698 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-09 16:09:00,698 INFO L745 eck$LassoCheckResult]: Stem: 4761#$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(10, 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; 4762#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; 4816#L408 assume !(1 == ~c_req_up~0); 4750#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4899#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4919#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4863#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4864#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4827#L439-1 assume !(0 == ~e_f~0); 4690#L444-1 assume !(0 == ~e_g~0); 4691#L449-1 assume !(0 == ~e_e~0); 4852#L454-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4853#L459-1 assume !(0 == ~e_wl~0); 4988#L464-1 assume !(1 == ~wl_pc~0); 4986#$Ultimate##44 assume !(2 == ~wl_pc~0); 4984#L477 assume !(1 == ~c1_pc~0); 4982#L487 assume !(1 == ~c2_pc~0); 4900#L496 assume !(1 == ~wb_pc~0); 4784#L505 assume 1 == ~e_c~0;~r_st~0 := 0; 4785#L514-1 assume !(1 == ~e_e~0); 4923#L519-1 assume !(1 == ~e_f~0); 4922#L524-1 assume !(1 == ~e_g~0); 4921#L529-1 assume 1 == ~e_c~0;~e_c~0 := 2; 4684#L534-1 assume !(1 == ~e_wl~0); 4685#L676-1 assume !false; 4924#L546 [2024-11-09 16:09:00,698 INFO L747 eck$LassoCheckResult]: Loop: 4924#L546 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; 4958#L381 assume !false; 4807#L299 assume !(0 == ~wl_st~0); 4809#L303 assume !(0 == ~c1_st~0); 4917#L306 assume !(0 == ~c2_st~0); 4904#L309 assume !(0 == ~wb_st~0); 4905#L312 assume !(0 == ~r_st~0); 4908#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; 4821#L552 assume !(1 == ~c_req_up~0); 4822#L552-2 start_simulation_~kernel_st~0#1 := 3; 4730#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 4731#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 4692#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 4693#L574-1 assume !(0 == ~e_c~0); 4712#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 4713#L584-1 assume 1 == ~wl_pc~0; 4834#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 4835#L597 assume !(1 == ~c1_pc~0); 4772#L607 assume !(1 == ~c2_pc~0); 4773#L616 assume !(1 == ~wb_pc~0); 4877#L625 assume !(1 == ~e_c~0); 4859#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 4848#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 4849#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 4882#L649-1 assume !(1 == ~e_c~0); 4883#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4968#L659-1 assume 0 == ~wl_st~0; 4963#L676-1 assume !false; 4924#L546 [2024-11-09 16:09:00,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:00,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1430068998, now seen corresponding path program 1 times [2024-11-09 16:09:00,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:00,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470357218] [2024-11-09 16:09:00,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:00,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:09:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:09:00,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:09:00,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470357218] [2024-11-09 16:09:00,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470357218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:09:00,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:09:00,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 16:09:00,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348018934] [2024-11-09 16:09:00,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:09:00,750 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 16:09:00,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:00,750 INFO L85 PathProgramCache]: Analyzing trace with hash 825895885, now seen corresponding path program 1 times [2024-11-09 16:09:00,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:00,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269574913] [2024-11-09 16:09:00,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:00,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:00,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:09:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:00,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:09:00,873 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:09:00,873 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:09:00,873 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:09:00,873 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:09:00,873 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-09 16:09:00,873 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:09:00,873 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:09:00,873 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:09:00,873 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2024-11-09 16:09:00,873 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:09:00,873 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:09:00,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:00,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,050 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:09:01,050 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-09 16:09:01,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:09:01,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:09:01,052 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:09:01,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-09 16:09:01,055 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-09 16:09:01,055 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:09:01,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-09 16:09:01,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:09:01,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:09:01,078 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:09:01,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-09 16:09:01,079 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-09 16:09:01,079 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-09 16:09:01,091 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-09 16:09:01,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-11-09 16:09:01,101 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:09:01,102 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:09:01,102 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:09:01,102 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:09:01,102 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 16:09:01,102 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:09:01,102 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:09:01,102 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:09:01,102 INFO L132 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2024-11-09 16:09:01,102 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:09:01,102 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:09:01,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:09:01,300 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:09:01,300 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 16:09:01,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:09:01,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:09:01,301 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:09:01,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-11-09 16:09:01,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:09:01,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:09:01,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:09:01,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:09:01,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:09:01,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:09:01,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:09:01,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:09:01,315 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:09:01,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-09 16:09:01,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:09:01,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:09:01,326 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:09:01,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-09 16:09:01,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:09:01,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:09:01,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:09:01,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:09:01,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:09:01,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:09:01,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:09:01,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:09:01,341 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 16:09:01,342 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-09 16:09:01,342 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-09 16:09:01,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:09:01,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:09:01,344 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:09:01,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-09 16:09:01,345 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 16:09:01,345 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-09 16:09:01,345 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 16:09:01,345 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_f~0) = -1*~e_f~0 + 1 Supporting invariants [] [2024-11-09 16:09:01,356 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-09 16:09:01,357 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-09 16:09:01,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:09:01,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 16:09:01,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:09:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:09:01,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 16:09:01,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:09:01,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:09:01,513 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-09 16:09:01,513 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 363 states and 628 transitions. cyclomatic complexity: 268 Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:09:01,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-09 16:09:01,570 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 363 states and 628 transitions. cyclomatic complexity: 268. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 980 states and 1690 transitions. Complement of second has 5 states. [2024-11-09 16:09:01,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-09 16:09:01,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:09:01,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2024-11-09 16:09:01,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 212 transitions. Stem has 25 letters. Loop has 28 letters. [2024-11-09 16:09:01,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:09:01,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 212 transitions. Stem has 53 letters. Loop has 28 letters. [2024-11-09 16:09:01,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:09:01,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 212 transitions. Stem has 25 letters. Loop has 56 letters. [2024-11-09 16:09:01,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:09:01,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 980 states and 1690 transitions. [2024-11-09 16:09:01,578 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 388 [2024-11-09 16:09:01,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 980 states to 965 states and 1669 transitions. [2024-11-09 16:09:01,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 448 [2024-11-09 16:09:01,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 454 [2024-11-09 16:09:01,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 965 states and 1669 transitions. [2024-11-09 16:09:01,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:09:01,584 INFO L218 hiAutomatonCegarLoop]: Abstraction has 965 states and 1669 transitions. [2024-11-09 16:09:01,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states and 1669 transitions. [2024-11-09 16:09:01,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 944. [2024-11-09 16:09:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 944 states have (on average 1.7394067796610169) internal successors, (1642), 943 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:09:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1642 transitions. [2024-11-09 16:09:01,596 INFO L240 hiAutomatonCegarLoop]: Abstraction has 944 states and 1642 transitions. [2024-11-09 16:09:01,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:09:01,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 16:09:01,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 16:09:01,597 INFO L87 Difference]: Start difference. First operand 944 states and 1642 transitions. 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-09 16:09:01,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:09:01,673 INFO L93 Difference]: Finished difference Result 1315 states and 2246 transitions. [2024-11-09 16:09:01,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1315 states and 2246 transitions. [2024-11-09 16:09:01,678 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 484 [2024-11-09 16:09:01,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1315 states to 1315 states and 2246 transitions. [2024-11-09 16:09:01,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 572 [2024-11-09 16:09:01,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 572 [2024-11-09 16:09:01,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1315 states and 2246 transitions. [2024-11-09 16:09:01,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:09:01,685 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1315 states and 2246 transitions. [2024-11-09 16:09:01,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states and 2246 transitions. [2024-11-09 16:09:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1125. [2024-11-09 16:09:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1125 states have (on average 1.7182222222222223) internal successors, (1933), 1124 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:09:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1933 transitions. [2024-11-09 16:09:01,701 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1125 states and 1933 transitions. [2024-11-09 16:09:01,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 16:09:01,702 INFO L425 stractBuchiCegarLoop]: Abstraction has 1125 states and 1933 transitions. [2024-11-09 16:09:01,702 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 16:09:01,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1125 states and 1933 transitions. [2024-11-09 16:09:01,705 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 400 [2024-11-09 16:09:01,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:09:01,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:09:01,709 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-09 16:09:01,709 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:09:01,710 INFO L745 eck$LassoCheckResult]: Stem: 8545#$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(10, 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; 8546#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; 8600#L408 assume !(1 == ~c_req_up~0); 8712#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 8729#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 8730#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 8738#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 8737#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 8611#L439-1 assume !(0 == ~e_f~0); 8474#L444-1 assume !(0 == ~e_g~0); 8475#L449-1 assume !(0 == ~e_e~0); 8636#L454-1 assume !(0 == ~e_c~0); 8637#L459-1 assume !(0 == ~e_wl~0); 8547#L464-1 assume !(1 == ~wl_pc~0); 8548#$Ultimate##44 assume !(2 == ~wl_pc~0); 8542#L477 assume !(1 == ~c1_pc~0); 8544#L487 assume !(1 == ~c2_pc~0); 9087#L496 assume !(1 == ~wb_pc~0); 9085#L505 assume 1 == ~e_c~0;~r_st~0 := 0; 8569#L514-1 assume !(1 == ~e_e~0); 8597#L519-1 assume !(1 == ~e_f~0); 8603#L524-1 assume !(1 == ~e_g~0); 8604#L529-1 assume 1 == ~e_c~0;~e_c~0 := 2; 8468#L534-1 assume !(1 == ~e_wl~0); 8469#L676-1 assume !false; 8808#L546 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; 8519#L381 [2024-11-09 16:09:01,710 INFO L747 eck$LassoCheckResult]: Loop: 8519#L381 assume !false; 8592#L299 assume 0 == ~wl_st~0; 8550#L312-1 assume !(0 == ~wl_st~0); 8551#L321 assume !(0 == ~c1_st~0); 8512#L336 assume !(0 == ~c2_st~0); 8572#L351 assume !(0 == ~wb_st~0); 8481#L366 assume !(0 == ~r_st~0); 8519#L381 [2024-11-09 16:09:01,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:01,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1632637821, now seen corresponding path program 1 times [2024-11-09 16:09:01,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:01,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423577087] [2024-11-09 16:09:01,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:01,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:09:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:09:01,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:09:01,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423577087] [2024-11-09 16:09:01,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423577087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:09:01,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:09:01,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 16:09:01,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896091851] [2024-11-09 16:09:01,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:09:01,745 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 16:09:01,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:01,745 INFO L85 PathProgramCache]: Analyzing trace with hash 121813293, now seen corresponding path program 1 times [2024-11-09 16:09:01,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:01,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858133897] [2024-11-09 16:09:01,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:01,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:09:01,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:09:01,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:09:01,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858133897] [2024-11-09 16:09:01,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858133897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:09:01,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:09:01,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 16:09:01,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408561635] [2024-11-09 16:09:01,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:09:01,756 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:09:01,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:09:01,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 16:09:01,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 16:09:01,756 INFO L87 Difference]: Start difference. First operand 1125 states and 1933 transitions. cyclomatic complexity: 819 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:09:01,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:09:01,784 INFO L93 Difference]: Finished difference Result 1795 states and 3046 transitions. [2024-11-09 16:09:01,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1795 states and 3046 transitions. [2024-11-09 16:09:01,791 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 646 [2024-11-09 16:09:01,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1795 states to 1795 states and 3046 transitions. [2024-11-09 16:09:01,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 726 [2024-11-09 16:09:01,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 726 [2024-11-09 16:09:01,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1795 states and 3046 transitions. [2024-11-09 16:09:01,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:09:01,798 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1795 states and 3046 transitions. [2024-11-09 16:09:01,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states and 3046 transitions. [2024-11-09 16:09:01,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1795. [2024-11-09 16:09:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1795 states have (on average 1.6969359331476324) internal successors, (3046), 1794 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:09:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 3046 transitions. [2024-11-09 16:09:01,819 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1795 states and 3046 transitions. [2024-11-09 16:09:01,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 16:09:01,820 INFO L425 stractBuchiCegarLoop]: Abstraction has 1795 states and 3046 transitions. [2024-11-09 16:09:01,820 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 16:09:01,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1795 states and 3046 transitions. [2024-11-09 16:09:01,824 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 646 [2024-11-09 16:09:01,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:09:01,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:09:01,825 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-09 16:09:01,825 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:09:01,825 INFO L745 eck$LassoCheckResult]: Stem: 11472#$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(10, 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; 11473#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; 11525#L408 assume !(1 == ~c_req_up~0); 11461#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 11691#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 11690#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 11689#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 11688#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 11538#L439-1 assume !(0 == ~e_f~0); 11401#L444-1 assume !(0 == ~e_g~0); 11402#L449-1 assume !(0 == ~e_e~0); 11565#L454-1 assume !(0 == ~e_c~0); 11566#L459-1 assume !(0 == ~e_wl~0); 11474#L464-1 assume !(1 == ~wl_pc~0); 11475#$Ultimate##44 assume !(2 == ~wl_pc~0); 11470#L477 assume !(1 == ~c1_pc~0); 11452#L487 assume !(1 == ~c2_pc~0); 11454#L496 assume !(1 == ~wb_pc~0); 12093#L505 assume 1 == ~e_c~0;~r_st~0 := 0; 11494#L514-1 assume !(1 == ~e_e~0); 11693#L519-1 assume !(1 == ~e_f~0); 11692#L524-1 assume !(1 == ~e_g~0); 11680#L529-1 assume 1 == ~e_c~0;~e_c~0 := 2; 11395#L534-1 assume !(1 == ~e_wl~0); 11396#L676-1 assume !false; 12065#L546 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; 12417#L381 [2024-11-09 16:09:01,825 INFO L747 eck$LassoCheckResult]: Loop: 12417#L381 assume !false; 12907#L299 assume 0 == ~wl_st~0; 12905#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 12902#L325 assume !(0 != eval_~tmp~0#1); 11588#L321 assume !(0 == ~c1_st~0); 11439#L336 assume !(0 == ~c2_st~0); 11497#L351 assume !(0 == ~wb_st~0); 11408#L366 assume !(0 == ~r_st~0); 12417#L381 [2024-11-09 16:09:01,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:01,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1632637821, now seen corresponding path program 2 times [2024-11-09 16:09:01,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:01,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489336987] [2024-11-09 16:09:01,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:01,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:09:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:09:01,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:09:01,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489336987] [2024-11-09 16:09:01,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489336987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:09:01,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:09:01,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 16:09:01,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21455458] [2024-11-09 16:09:01,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:09:01,848 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 16:09:01,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:01,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1284632440, now seen corresponding path program 1 times [2024-11-09 16:09:01,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:01,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745039835] [2024-11-09 16:09:01,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:01,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:01,851 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:09:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:01,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:09:01,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:09:01,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 16:09:01,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 16:09:01,875 INFO L87 Difference]: Start difference. First operand 1795 states and 3046 transitions. cyclomatic complexity: 1262 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-09 16:09:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:09:01,911 INFO L93 Difference]: Finished difference Result 3100 states and 5202 transitions. [2024-11-09 16:09:01,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3100 states and 5202 transitions. [2024-11-09 16:09:01,921 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1226 [2024-11-09 16:09:01,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3100 states to 2525 states and 4241 transitions. [2024-11-09 16:09:01,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1311 [2024-11-09 16:09:01,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1343 [2024-11-09 16:09:01,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2525 states and 4241 transitions. [2024-11-09 16:09:01,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:09:01,931 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2525 states and 4241 transitions. [2024-11-09 16:09:01,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states and 4241 transitions. [2024-11-09 16:09:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 1638. [2024-11-09 16:09:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1638 states have (on average 1.6904761904761905) internal successors, (2769), 1637 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:09:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2769 transitions. [2024-11-09 16:09:01,955 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1638 states and 2769 transitions. [2024-11-09 16:09:01,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 16:09:01,956 INFO L425 stractBuchiCegarLoop]: Abstraction has 1638 states and 2769 transitions. [2024-11-09 16:09:01,956 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 16:09:01,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1638 states and 2769 transitions. [2024-11-09 16:09:01,961 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 646 [2024-11-09 16:09:01,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:09:01,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:09:01,961 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-09 16:09:01,962 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:09:01,962 INFO L745 eck$LassoCheckResult]: Stem: 16373#$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(10, 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; 16374#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; 16424#L408 assume !(1 == ~c_req_up~0); 16515#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 16516#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 16557#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 16558#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 16549#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 16436#L439-1 assume !(0 == ~e_f~0); 16302#L444-1 assume !(0 == ~e_g~0); 16303#L449-1 assume !(0 == ~e_e~0); 16463#L454-1 assume !(0 == ~e_c~0); 16464#L459-1 assume !(0 == ~e_wl~0); 16544#L464-1 assume !(1 == ~wl_pc~0); 16596#$Ultimate##44 assume !(2 == ~wl_pc~0); 16592#L477 assume !(1 == ~c1_pc~0); 16590#L487 assume !(1 == ~c2_pc~0); 16587#L496 assume !(1 == ~wb_pc~0); 16394#L505 assume !(1 == ~e_c~0); 16395#L514-1 assume !(1 == ~e_e~0); 16417#L519-1 assume 1 == ~e_f~0;~e_f~0 := 2; 16425#L524-1 assume !(1 == ~e_g~0); 16426#L529-1 assume !(1 == ~e_c~0); 16296#L534-1 assume !(1 == ~e_wl~0); 16297#L676-1 assume !false; 16733#L546 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; 16347#L381 [2024-11-09 16:09:01,962 INFO L747 eck$LassoCheckResult]: Loop: 16347#L381 assume !false; 17800#L299 assume 0 == ~wl_st~0; 17757#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 17794#L325 assume !(0 != eval_~tmp~0#1); 16487#L321 assume !(0 == ~c1_st~0); 16340#L336 assume !(0 == ~c2_st~0); 16398#L351 assume !(0 == ~wb_st~0); 16309#L366 assume !(0 == ~r_st~0); 16347#L381 [2024-11-09 16:09:01,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:01,963 INFO L85 PathProgramCache]: Analyzing trace with hash 766092475, now seen corresponding path program 1 times [2024-11-09 16:09:01,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:01,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473774477] [2024-11-09 16:09:01,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:01,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:09:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:09:01,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:09:01,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473774477] [2024-11-09 16:09:01,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473774477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:09:01,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:09:01,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 16:09:01,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896909279] [2024-11-09 16:09:01,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:09:01,990 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 16:09:01,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:01,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1284632440, now seen corresponding path program 2 times [2024-11-09 16:09:01,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:01,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391744514] [2024-11-09 16:09:01,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:01,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:01,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:09:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:01,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:09:02,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:09:02,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 16:09:02,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 16:09:02,035 INFO L87 Difference]: Start difference. First operand 1638 states and 2769 transitions. cyclomatic complexity: 1138 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-09 16:09:02,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:09:02,116 INFO L93 Difference]: Finished difference Result 2129 states and 3576 transitions. [2024-11-09 16:09:02,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2129 states and 3576 transitions. [2024-11-09 16:09:02,124 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 870 [2024-11-09 16:09:02,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2129 states to 2129 states and 3576 transitions. [2024-11-09 16:09:02,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1079 [2024-11-09 16:09:02,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1079 [2024-11-09 16:09:02,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2129 states and 3576 transitions. [2024-11-09 16:09:02,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:09:02,132 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2129 states and 3576 transitions. [2024-11-09 16:09:02,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states and 3576 transitions. [2024-11-09 16:09:02,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1941. [2024-11-09 16:09:02,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1941 states have (on average 1.6867594023699124) internal successors, (3274), 1940 states have internal predecessors, (3274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:09:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 3274 transitions. [2024-11-09 16:09:02,159 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1941 states and 3274 transitions. [2024-11-09 16:09:02,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 16:09:02,161 INFO L425 stractBuchiCegarLoop]: Abstraction has 1941 states and 3274 transitions. [2024-11-09 16:09:02,161 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 16:09:02,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1941 states and 3274 transitions. [2024-11-09 16:09:02,167 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 728 [2024-11-09 16:09:02,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:09:02,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:09:02,168 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-09 16:09:02,168 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:09:02,168 INFO L745 eck$LassoCheckResult]: Stem: 20150#$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(10, 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; 20151#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; 20205#L408 assume !(1 == ~c_req_up~0); 20139#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 20366#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 20367#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 20259#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 20260#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 20217#L439-1 assume !(0 == ~e_f~0); 20079#L444-1 assume !(0 == ~e_g~0); 20080#L449-1 assume !(0 == ~e_e~0); 20243#L454-1 assume !(0 == ~e_c~0); 20244#L459-1 assume !(0 == ~e_wl~0); 20152#L464-1 assume !(1 == ~wl_pc~0); 20153#$Ultimate##44 assume !(2 == ~wl_pc~0); 20446#L477 assume !(1 == ~c1_pc~0); 20405#L487 assume !(1 == ~c2_pc~0); 20401#L496 assume !(1 == ~wb_pc~0); 20398#L505 assume !(1 == ~e_c~0); 20396#L514-1 assume !(1 == ~e_e~0); 20393#L519-1 assume !(1 == ~e_f~0); 20391#L524-1 assume !(1 == ~e_g~0); 20373#L529-1 assume !(1 == ~e_c~0); 20374#L534-1 assume !(1 == ~e_wl~0); 21328#L676-1 assume !false; 21011#L546 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; 20124#L381 [2024-11-09 16:09:02,168 INFO L747 eck$LassoCheckResult]: Loop: 20124#L381 assume !false; 20198#L299 assume 0 == ~wl_st~0; 20155#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 20156#L325 assume !(0 != eval_~tmp~0#1); 20271#L321 assume !(0 == ~c1_st~0); 20117#L336 assume !(0 == ~c2_st~0); 20175#L351 assume !(0 == ~wb_st~0); 20086#L366 assume !(0 == ~r_st~0); 20124#L381 [2024-11-09 16:09:02,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:02,168 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2024-11-09 16:09:02,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:02,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928622249] [2024-11-09 16:09:02,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:02,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:02,177 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:09:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:02,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:09:02,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:02,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1284632440, now seen corresponding path program 3 times [2024-11-09 16:09:02,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:02,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280196202] [2024-11-09 16:09:02,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:02,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:02,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:09:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:02,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:09:02,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:02,193 INFO L85 PathProgramCache]: Analyzing trace with hash 365677936, now seen corresponding path program 1 times [2024-11-09 16:09:02,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:02,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581942519] [2024-11-09 16:09:02,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:02,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:09:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:09:02,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:09:02,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581942519] [2024-11-09 16:09:02,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581942519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:09:02,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:09:02,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 16:09:02,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834353723] [2024-11-09 16:09:02,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:09:02,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:09:02,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 16:09:02,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 16:09:02,236 INFO L87 Difference]: Start difference. First operand 1941 states and 3274 transitions. cyclomatic complexity: 1340 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-09 16:09:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:09:02,264 INFO L93 Difference]: Finished difference Result 3072 states and 5123 transitions. [2024-11-09 16:09:02,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3072 states and 5123 transitions. [2024-11-09 16:09:02,272 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1134 [2024-11-09 16:09:02,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3072 states to 3072 states and 5123 transitions. [2024-11-09 16:09:02,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1394 [2024-11-09 16:09:02,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1394 [2024-11-09 16:09:02,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3072 states and 5123 transitions. [2024-11-09 16:09:02,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:09:02,283 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3072 states and 5123 transitions. [2024-11-09 16:09:02,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states and 5123 transitions. [2024-11-09 16:09:02,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3072. [2024-11-09 16:09:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 3072 states have (on average 1.6676432291666667) internal successors, (5123), 3071 states have internal predecessors, (5123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:09:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 5123 transitions. [2024-11-09 16:09:02,317 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3072 states and 5123 transitions. [2024-11-09 16:09:02,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 16:09:02,318 INFO L425 stractBuchiCegarLoop]: Abstraction has 3072 states and 5123 transitions. [2024-11-09 16:09:02,318 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-09 16:09:02,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3072 states and 5123 transitions. [2024-11-09 16:09:02,324 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1134 [2024-11-09 16:09:02,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:09:02,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:09:02,324 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-09 16:09:02,324 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:09:02,324 INFO L745 eck$LassoCheckResult]: Stem: 25174#$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(10, 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; 25175#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; 25227#L408 assume !(1 == ~c_req_up~0); 25161#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 25376#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 25377#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 25282#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 25283#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 25239#L439-1 assume !(0 == ~e_f~0); 25240#L444-1 assume !(0 == ~e_g~0); 25447#L449-1 assume !(0 == ~e_e~0); 25440#L454-1 assume !(0 == ~e_c~0); 25439#L459-1 assume !(0 == ~e_wl~0); 25438#L464-1 assume !(1 == ~wl_pc~0); 25428#$Ultimate##44 assume !(2 == ~wl_pc~0); 25420#L477 assume !(1 == ~c1_pc~0); 25412#L487 assume !(1 == ~c2_pc~0); 25405#L496 assume !(1 == ~wb_pc~0); 25401#L505 assume !(1 == ~e_c~0); 25398#L514-1 assume !(1 == ~e_e~0); 25394#L519-1 assume !(1 == ~e_f~0); 25392#L524-1 assume !(1 == ~e_g~0); 25382#L529-1 assume !(1 == ~e_c~0); 25383#L534-1 assume !(1 == ~e_wl~0); 27458#L676-1 assume !false; 27459#L546 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; 25696#L381 [2024-11-09 16:09:02,325 INFO L747 eck$LassoCheckResult]: Loop: 25696#L381 assume !false; 27253#L299 assume 0 == ~wl_st~0; 27225#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 27222#L325 assume !(0 != eval_~tmp~0#1); 27221#L321 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 27204#L340 assume !(0 != eval_~tmp___0~0#1); 27220#L336 assume !(0 == ~c2_st~0); 27320#L351 assume !(0 == ~wb_st~0); 27295#L366 assume !(0 == ~r_st~0); 25696#L381 [2024-11-09 16:09:02,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:02,325 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2024-11-09 16:09:02,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:02,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118883888] [2024-11-09 16:09:02,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:02,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:02,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:09:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:02,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:09:02,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:02,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1117173442, now seen corresponding path program 1 times [2024-11-09 16:09:02,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:02,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925336494] [2024-11-09 16:09:02,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:02,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:02,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:09:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:02,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:09:02,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:02,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1600612406, now seen corresponding path program 1 times [2024-11-09 16:09:02,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:02,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675533266] [2024-11-09 16:09:02,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:02,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:09:02,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:09:02,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:09:02,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675533266] [2024-11-09 16:09:02,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675533266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:09:02,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:09:02,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 16:09:02,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205866196] [2024-11-09 16:09:02,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:09:02,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:09:02,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 16:09:02,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 16:09:02,392 INFO L87 Difference]: Start difference. First operand 3072 states and 5123 transitions. cyclomatic complexity: 2058 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-09 16:09:02,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:09:02,425 INFO L93 Difference]: Finished difference Result 4987 states and 8221 transitions. [2024-11-09 16:09:02,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4987 states and 8221 transitions. [2024-11-09 16:09:02,440 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1784 [2024-11-09 16:09:02,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4987 states to 4987 states and 8221 transitions. [2024-11-09 16:09:02,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2289 [2024-11-09 16:09:02,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2289 [2024-11-09 16:09:02,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4987 states and 8221 transitions. [2024-11-09 16:09:02,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:09:02,489 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4987 states and 8221 transitions. [2024-11-09 16:09:02,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states and 8221 transitions. [2024-11-09 16:09:02,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4987. [2024-11-09 16:09:02,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4987 states, 4987 states have (on average 1.648486063765791) internal successors, (8221), 4986 states have internal predecessors, (8221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:09:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4987 states to 4987 states and 8221 transitions. [2024-11-09 16:09:02,546 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4987 states and 8221 transitions. [2024-11-09 16:09:02,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 16:09:02,547 INFO L425 stractBuchiCegarLoop]: Abstraction has 4987 states and 8221 transitions. [2024-11-09 16:09:02,547 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-09 16:09:02,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4987 states and 8221 transitions. [2024-11-09 16:09:02,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1784 [2024-11-09 16:09:02,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:09:02,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:09:02,556 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-09 16:09:02,556 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:09:02,556 INFO L745 eck$LassoCheckResult]: Stem: 33239#$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(10, 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; 33240#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; 33294#L408 assume !(1 == ~c_req_up~0); 33226#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 33436#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 33434#L424-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 33435#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 36847#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 36846#L439-1 assume !(0 == ~e_f~0); 36845#L444-1 assume !(0 == ~e_g~0); 36844#L449-1 assume !(0 == ~e_e~0); 36842#L454-1 assume !(0 == ~e_c~0); 36841#L459-1 assume !(0 == ~e_wl~0); 36840#L464-1 assume !(1 == ~wl_pc~0); 36838#$Ultimate##44 assume !(2 == ~wl_pc~0); 36836#L477 assume !(1 == ~c1_pc~0); 36829#L487 assume !(1 == ~c2_pc~0); 36826#L496 assume !(1 == ~wb_pc~0); 36823#L505 assume !(1 == ~e_c~0); 36822#L514-1 assume !(1 == ~e_e~0); 36819#L519-1 assume !(1 == ~e_f~0); 36814#L524-1 assume !(1 == ~e_g~0); 36813#L529-1 assume !(1 == ~e_c~0); 36812#L534-1 assume !(1 == ~e_wl~0); 36811#L676-1 assume !false; 36768#L546 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; 33715#L381 [2024-11-09 16:09:02,556 INFO L747 eck$LassoCheckResult]: Loop: 33715#L381 assume !false; 37859#L299 assume 0 == ~wl_st~0; 35885#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 35883#L325 assume !(0 != eval_~tmp~0#1); 35884#L321 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 37085#L340 assume !(0 != eval_~tmp___0~0#1); 37164#L336 assume !(0 == ~c2_st~0); 37879#L351 assume !(0 == ~wb_st~0); 37863#L366 assume !(0 == ~r_st~0); 33715#L381 [2024-11-09 16:09:02,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:02,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2024-11-09 16:09:02,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:02,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784410526] [2024-11-09 16:09:02,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:02,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:09:02,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:09:02,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:09:02,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784410526] [2024-11-09 16:09:02,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784410526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:09:02,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:09:02,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 16:09:02,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546784981] [2024-11-09 16:09:02,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:09:02,576 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-09 16:09:02,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:02,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1117173442, now seen corresponding path program 2 times [2024-11-09 16:09:02,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:02,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715344269] [2024-11-09 16:09:02,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:02,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:02,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:09:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:02,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:09:02,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:09:02,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 16:09:02,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 16:09:02,601 INFO L87 Difference]: Start difference. First operand 4987 states and 8221 transitions. cyclomatic complexity: 3241 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-09 16:09:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:09:02,615 INFO L93 Difference]: Finished difference Result 4887 states and 8039 transitions. [2024-11-09 16:09:02,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4887 states and 8039 transitions. [2024-11-09 16:09:02,627 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1784 [2024-11-09 16:09:02,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4887 states to 4887 states and 8039 transitions. [2024-11-09 16:09:02,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2190 [2024-11-09 16:09:02,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2190 [2024-11-09 16:09:02,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4887 states and 8039 transitions. [2024-11-09 16:09:02,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:09:02,644 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4887 states and 8039 transitions. [2024-11-09 16:09:02,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4887 states and 8039 transitions. [2024-11-09 16:09:02,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4887 to 4887. [2024-11-09 16:09:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4887 states, 4887 states have (on average 1.644976468180888) internal successors, (8039), 4886 states have internal predecessors, (8039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:09:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 8039 transitions. [2024-11-09 16:09:02,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4887 states and 8039 transitions. [2024-11-09 16:09:02,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 16:09:02,695 INFO L425 stractBuchiCegarLoop]: Abstraction has 4887 states and 8039 transitions. [2024-11-09 16:09:02,695 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-09 16:09:02,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4887 states and 8039 transitions. [2024-11-09 16:09:02,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1784 [2024-11-09 16:09:02,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:09:02,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:09:02,704 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-09 16:09:02,704 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:09:02,704 INFO L745 eck$LassoCheckResult]: Stem: 43120#$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(10, 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; 43121#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; 43175#L408 assume !(1 == ~c_req_up~0); 43108#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 43332#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 43333#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 43235#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 43236#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 43187#L439-1 assume !(0 == ~e_f~0); 43047#L444-1 assume !(0 == ~e_g~0); 43048#L449-1 assume !(0 == ~e_e~0); 43216#L454-1 assume !(0 == ~e_c~0); 43217#L459-1 assume !(0 == ~e_wl~0); 43122#L464-1 assume !(1 == ~wl_pc~0); 43123#$Ultimate##44 assume !(2 == ~wl_pc~0); 43118#L477 assume !(1 == ~c1_pc~0); 43104#L487 assume !(1 == ~c2_pc~0); 43106#L496 assume !(1 == ~wb_pc~0); 43141#L505 assume !(1 == ~e_c~0); 43142#L514-1 assume !(1 == ~e_e~0); 43385#L519-1 assume !(1 == ~e_f~0); 43384#L524-1 assume !(1 == ~e_g~0); 43343#L529-1 assume !(1 == ~e_c~0); 43344#L534-1 assume !(1 == ~e_wl~0); 44771#L676-1 assume !false; 44038#L546 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; 44039#L381 [2024-11-09 16:09:02,704 INFO L747 eck$LassoCheckResult]: Loop: 44039#L381 assume !false; 43165#L299 assume 0 == ~wl_st~0; 43166#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 45980#L325 assume !(0 != eval_~tmp~0#1); 43242#L321 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 43243#L340 assume !(0 != eval_~tmp___0~0#1); 43301#L336 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 47568#L355 assume !(0 != eval_~tmp___1~0#1); 47628#L351 assume !(0 == ~wb_st~0); 47692#L366 assume !(0 == ~r_st~0); 44039#L381 [2024-11-09 16:09:02,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:02,705 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2024-11-09 16:09:02,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:02,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494994450] [2024-11-09 16:09:02,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:02,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:02,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:09:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:02,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:09:02,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:02,718 INFO L85 PathProgramCache]: Analyzing trace with hash 270987588, now seen corresponding path program 1 times [2024-11-09 16:09:02,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:02,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803523745] [2024-11-09 16:09:02,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:02,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:02,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:09:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:02,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:09:02,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:02,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1918972220, now seen corresponding path program 1 times [2024-11-09 16:09:02,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:02,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347783292] [2024-11-09 16:09:02,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:02,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:09:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 16:09:02,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:09:02,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347783292] [2024-11-09 16:09:02,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347783292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:09:02,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:09:02,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 16:09:02,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284194497] [2024-11-09 16:09:02,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:09:02,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:09:02,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 16:09:02,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 16:09:02,802 INFO L87 Difference]: Start difference. First operand 4887 states and 8039 transitions. cyclomatic complexity: 3159 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-09 16:09:02,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:09:02,842 INFO L93 Difference]: Finished difference Result 8309 states and 13515 transitions. [2024-11-09 16:09:02,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8309 states and 13515 transitions. [2024-11-09 16:09:02,874 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3066 [2024-11-09 16:09:02,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8309 states to 8309 states and 13515 transitions. [2024-11-09 16:09:02,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3674 [2024-11-09 16:09:02,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3674 [2024-11-09 16:09:02,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8309 states and 13515 transitions. [2024-11-09 16:09:02,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:09:02,910 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8309 states and 13515 transitions. [2024-11-09 16:09:02,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8309 states and 13515 transitions. [2024-11-09 16:09:02,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8309 to 8309. [2024-11-09 16:09:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8309 states, 8309 states have (on average 1.6265495246118666) internal successors, (13515), 8308 states have internal predecessors, (13515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 16:09:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8309 states to 8309 states and 13515 transitions. [2024-11-09 16:09:03,002 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8309 states and 13515 transitions. [2024-11-09 16:09:03,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 16:09:03,003 INFO L425 stractBuchiCegarLoop]: Abstraction has 8309 states and 13515 transitions. [2024-11-09 16:09:03,003 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-09 16:09:03,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8309 states and 13515 transitions. [2024-11-09 16:09:03,019 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3066 [2024-11-09 16:09:03,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:09:03,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:09:03,020 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-09 16:09:03,020 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:09:03,020 INFO L745 eck$LassoCheckResult]: Stem: 56322#$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(10, 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; 56323#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; 56379#L408 assume !(1 == ~c_req_up~0); 56313#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 56548#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 56549#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 56440#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 56441#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 56391#L439-1 assume !(0 == ~e_f~0); 56251#L444-1 assume !(0 == ~e_g~0); 56252#L449-1 assume !(0 == ~e_e~0); 56421#L454-1 assume !(0 == ~e_c~0); 56422#L459-1 assume !(0 == ~e_wl~0); 56324#L464-1 assume !(1 == ~wl_pc~0); 56325#$Ultimate##44 assume !(2 == ~wl_pc~0); 56320#L477 assume !(1 == ~c1_pc~0); 56309#L487 assume !(1 == ~c2_pc~0); 56311#L496 assume !(1 == ~wb_pc~0); 56343#L505 assume !(1 == ~e_c~0); 56344#L514-1 assume !(1 == ~e_e~0); 56603#L519-1 assume !(1 == ~e_f~0); 56602#L524-1 assume !(1 == ~e_g~0); 56560#L529-1 assume !(1 == ~e_c~0); 56245#L534-1 assume !(1 == ~e_wl~0); 56246#L676-1 assume !false; 61932#L546 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; 58760#L381 [2024-11-09 16:09:03,020 INFO L747 eck$LassoCheckResult]: Loop: 58760#L381 assume !false; 64390#L299 assume 0 == ~wl_st~0; 63024#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 63021#L325 assume !(0 != eval_~tmp~0#1); 63022#L321 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 63721#L340 assume !(0 != eval_~tmp___0~0#1); 63717#L336 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 63681#L355 assume !(0 != eval_~tmp___1~0#1); 63710#L351 assume 0 == ~wb_st~0;havoc eval_#t~nondet7#1;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 63807#L370 assume !(0 != eval_~tmp___2~0#1); 63922#L366 assume !(0 == ~r_st~0); 58760#L381 [2024-11-09 16:09:03,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:03,021 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2024-11-09 16:09:03,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:03,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894612609] [2024-11-09 16:09:03,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:03,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:03,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:09:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:03,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:09:03,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:03,030 INFO L85 PathProgramCache]: Analyzing trace with hash -189354762, now seen corresponding path program 1 times [2024-11-09 16:09:03,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:03,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173081693] [2024-11-09 16:09:03,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:03,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:03,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:09:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:03,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:09:03,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:09:03,035 INFO L85 PathProgramCache]: Analyzing trace with hash -641438722, now seen corresponding path program 1 times [2024-11-09 16:09:03,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:09:03,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729743132] [2024-11-09 16:09:03,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:09:03,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:09:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:03,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:09:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:03,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:09:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:03,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:09:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:09:03,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 04:09:03 BoogieIcfgContainer [2024-11-09 16:09:03,776 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 16:09:03,777 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 16:09:03,777 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 16:09:03,777 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 16:09:03,778 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:08:57" (3/4) ... [2024-11-09 16:09:03,779 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-09 16:09:03,836 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 16:09:03,836 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 16:09:03,837 INFO L158 Benchmark]: Toolchain (without parser) took 7366.07ms. Allocated memory was 188.7MB in the beginning and 272.6MB in the end (delta: 83.9MB). Free memory was 120.0MB in the beginning and 77.3MB in the end (delta: 42.7MB). Peak memory consumption was 128.7MB. Max. memory is 16.1GB. [2024-11-09 16:09:03,837 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 16:09:03,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.54ms. Allocated memory is still 188.7MB. Free memory was 119.8MB in the beginning and 158.6MB in the end (delta: -38.8MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-11-09 16:09:03,837 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.43ms. Allocated memory is still 188.7MB. Free memory was 158.6MB in the beginning and 156.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 16:09:03,837 INFO L158 Benchmark]: Boogie Preprocessor took 43.40ms. Allocated memory is still 188.7MB. Free memory was 156.9MB in the beginning and 153.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 16:09:03,837 INFO L158 Benchmark]: RCFGBuilder took 515.61ms. Allocated memory is still 188.7MB. Free memory was 153.5MB in the beginning and 127.1MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 16:09:03,837 INFO L158 Benchmark]: BuchiAutomizer took 6387.45ms. Allocated memory was 188.7MB in the beginning and 272.6MB in the end (delta: 83.9MB). Free memory was 127.1MB in the beginning and 83.6MB in the end (delta: 43.5MB). Peak memory consumption was 129.5MB. Max. memory is 16.1GB. [2024-11-09 16:09:03,838 INFO L158 Benchmark]: Witness Printer took 59.39ms. Allocated memory is still 272.6MB. Free memory was 83.6MB in the beginning and 77.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 16:09:03,839 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 117.4MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.54ms. Allocated memory is still 188.7MB. Free memory was 119.8MB in the beginning and 158.6MB in the end (delta: -38.8MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.43ms. Allocated memory is still 188.7MB. Free memory was 158.6MB in the beginning and 156.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.40ms. Allocated memory is still 188.7MB. Free memory was 156.9MB in the beginning and 153.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 515.61ms. Allocated memory is still 188.7MB. Free memory was 153.5MB in the beginning and 127.1MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 6387.45ms. Allocated memory was 188.7MB in the beginning and 272.6MB in the end (delta: 83.9MB). Free memory was 127.1MB in the beginning and 83.6MB in the end (delta: 43.5MB). Peak memory consumption was 129.5MB. Max. memory is 16.1GB. * Witness Printer took 59.39ms. Allocated memory is still 272.6MB. Free memory was 83.6MB in the beginning and 77.3MB 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 16 terminating modules (13 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_f) + 1) and consists of 3 locations. 13 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 8309 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.2s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 4.2s. Construction of modules took 0.2s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 1671 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.2s 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, 3538 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3535 mSDsluCounter, 6482 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2390 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 280 IncrementalHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 4092 mSDtfsCounter, 280 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN3 SILU0 SILI3 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital76 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf96 smp100 dnf147 smp91 tf109 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 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: 298]: 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] [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L714] CALL start_simulation() [L404] int kernel_st ; [L407] 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] [L408] 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] [L419] COND TRUE (int )wl_i == 1 [L420] 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] [L424] COND TRUE (int )c1_i == 1 [L425] 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] [L429] COND TRUE (int )c2_i == 1 [L430] 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] [L434] COND TRUE (int )wb_i == 1 [L435] 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] [L439] COND FALSE !((int )r_i == 1) [L442] 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] [L444] 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] [L449] 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] [L454] 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] [L459] 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] [L464] 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] [L469] 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] [L477] 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] [L487] 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] [L496] 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] [L505] 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] [L514] 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] [L519] 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] [L524] 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] [L529] 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] [L534] 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] [L539] 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] [L545] 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] [L548] kernel_st = 1 [L549] CALL eval() [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] 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: [L298] COND TRUE 1 [L300] COND TRUE (int )wl_st == 0 [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND FALSE !(\read(tmp)) [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND FALSE !(\read(tmp___0)) [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND FALSE !(\read(tmp___1)) [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND FALSE !(\read(tmp___2)) [L381] COND FALSE !((int )r_st == 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 298]: 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] [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L714] CALL start_simulation() [L404] int kernel_st ; [L407] 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] [L408] 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] [L419] COND TRUE (int )wl_i == 1 [L420] 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] [L424] COND TRUE (int )c1_i == 1 [L425] 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] [L429] COND TRUE (int )c2_i == 1 [L430] 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] [L434] COND TRUE (int )wb_i == 1 [L435] 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] [L439] COND FALSE !((int )r_i == 1) [L442] 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] [L444] 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] [L449] 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] [L454] 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] [L459] 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] [L464] 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] [L469] 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] [L477] 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] [L487] 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] [L496] 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] [L505] 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] [L514] 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] [L519] 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] [L524] 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] [L529] 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] [L534] 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] [L539] 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] [L545] 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] [L548] kernel_st = 1 [L549] CALL eval() [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] 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: [L298] COND TRUE 1 [L300] COND TRUE (int )wl_st == 0 [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND FALSE !(\read(tmp)) [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND FALSE !(\read(tmp___0)) [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND FALSE !(\read(tmp___1)) [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND FALSE !(\read(tmp___2)) [L381] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 16:09:03,864 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)