./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/toy2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/toy2.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:53:25,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:53:25,543 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-06 21:53:25,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:53:25,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:53:25,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:53:25,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:53:25,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:53:25,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:53:25,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:53:25,582 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:53:25,593 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-06 21:53:25,594 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-06 21:53:25,599 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-06 21:53:25,599 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-06 21:53:25,600 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-06 21:53:25,601 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-06 21:53:25,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:53:25,603 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-06 21:53:25,604 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:53:25,604 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:53:25,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:53:25,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:53:25,606 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-06 21:53:25,606 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-06 21:53:25,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-06 21:53:25,607 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:53:25,608 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:53:25,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:53:25,609 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-06 21:53:25,610 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:53:25,610 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:53:25,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:53:25,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:53:25,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:53:25,613 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-06 21:53:25,613 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 [2023-11-06 21:53:25,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:53:25,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:53:25,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:53:25,911 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:53:25,912 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:53:25,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/systemc/toy2.cil.c [2023-11-06 21:53:29,021 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:53:29,240 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:53:29,241 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/sv-benchmarks/c/systemc/toy2.cil.c [2023-11-06 21:53:29,254 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/data/4858b3916/6de46e7e5e26419f85fdca8a6938904e/FLAG40b3eff7c [2023-11-06 21:53:29,269 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/data/4858b3916/6de46e7e5e26419f85fdca8a6938904e [2023-11-06 21:53:29,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:53:29,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:53:29,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:29,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:53:29,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:53:29,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4354cc82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29, skipping insertion in model container [2023-11-06 21:53:29,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,324 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:53:29,530 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:29,548 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:53:29,635 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:29,661 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:53:29,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29 WrapperNode [2023-11-06 21:53:29,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:29,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:29,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:53:29,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:53:29,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,741 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 361 [2023-11-06 21:53:29,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:29,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:53:29,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:53:29,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:53:29,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,782 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,814 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:53:29,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:53:29,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:53:29,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:53:29,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:29,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:29,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:29,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-06 21:53:29,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:53:29,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:53:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:53:29,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:53:29,989 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:53:29,991 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:53:30,520 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:53:30,549 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:53:30,550 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-06 21:53:30,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:30 BoogieIcfgContainer [2023-11-06 21:53:30,552 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:53:30,554 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-06 21:53:30,554 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-06 21:53:30,558 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-06 21:53:30,559 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 21:53:30,559 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.11 09:53:29" (1/3) ... [2023-11-06 21:53:30,560 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7070c473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.11 09:53:30, skipping insertion in model container [2023-11-06 21:53:30,560 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 21:53:30,560 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (2/3) ... [2023-11-06 21:53:30,561 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7070c473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.11 09:53:30, skipping insertion in model container [2023-11-06 21:53:30,561 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 21:53:30,561 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:30" (3/3) ... [2023-11-06 21:53:30,563 INFO L332 chiAutomizerObserver]: Analyzing ICFG toy2.cil.c [2023-11-06 21:53:30,622 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-06 21:53:30,622 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-06 21:53:30,623 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-06 21:53:30,623 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-06 21:53:30,623 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-06 21:53:30,623 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-06 21:53:30,623 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-06 21:53:30,624 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-06 21:53:30,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.823076923076923) internal successors, (237), 130 states have internal predecessors, (237), 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) [2023-11-06 21:53:30,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2023-11-06 21:53:30,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 21:53:30,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 21:53:30,666 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] [2023-11-06 21:53:30,666 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] [2023-11-06 21:53:30,667 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-06 21:53:30,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.823076923076923) internal successors, (237), 130 states have internal predecessors, (237), 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) [2023-11-06 21:53:30,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2023-11-06 21:53:30,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 21:53:30,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 21:53:30,678 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] [2023-11-06 21:53:30,678 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] [2023-11-06 21:53:30,687 INFO L748 eck$LassoCheckResult]: Stem: 32#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 42#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; 113#L404true assume !(1 == ~c_req_up~0); 61#L404-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 22#L415-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 50#L420-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 84#L425-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 39#L430-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 125#L435-1true assume !(0 == ~e_f~0); 26#L440-1true assume !(0 == ~e_g~0); 44#L445-1true assume !(0 == ~e_e~0); 47#L450-1true assume !(0 == ~e_c~0); 21#L455-1true assume !(0 == ~e_wl~0); 76#L460-1true assume !(1 == ~wl_pc~0); 96#$Ultimate##44true assume !(2 == ~wl_pc~0); 121#L473true assume !(1 == ~c1_pc~0); 103#L483true assume !(1 == ~c2_pc~0); 115#L492true assume !(1 == ~wb_pc~0); 52#L501true assume !(1 == ~e_c~0); 31#L510-1true assume !(1 == ~e_e~0); 23#L515-1true assume !(1 == ~e_f~0); 14#L520-1true assume !(1 == ~e_g~0); 45#L525-1true assume !(1 == ~e_c~0); 82#L530-1true assume !(1 == ~e_wl~0); 65#L672-1true [2023-11-06 21:53:30,688 INFO L750 eck$LassoCheckResult]: Loop: 65#L672-1true assume !false; 6#L542true 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; 128#L377true assume !true; 86#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; 64#L548true assume !(1 == ~c_req_up~0); 9#L548-2true start_simulation_~kernel_st~0#1 := 3; 25#L560true assume 0 == ~e_f~0;~e_f~0 := 1; 97#L560-2true assume 0 == ~e_g~0;~e_g~0 := 1; 18#L565-1true assume 0 == ~e_e~0;~e_e~0 := 1; 129#L570-1true assume 0 == ~e_c~0;~e_c~0 := 1; 35#L575-1true assume !(0 == ~e_wl~0); 122#L580-1true assume !(1 == ~wl_pc~0); 75#$Ultimate##251true assume !(2 == ~wl_pc~0); 80#L593true assume !(1 == ~c1_pc~0); 116#L603true assume !(1 == ~c2_pc~0); 3#L612true assume !(1 == ~wb_pc~0); 60#L621true assume 1 == ~e_c~0;~r_st~0 := 0; 58#L630-1true assume 1 == ~e_e~0;~e_e~0 := 2; 131#L635-1true assume 1 == ~e_f~0;~e_f~0 := 2; 130#L640-1true assume 1 == ~e_g~0;~e_g~0 := 2; 111#L645-1true assume 1 == ~e_c~0;~e_c~0 := 2; 11#L650-1true assume !(1 == ~e_wl~0); 40#L655-1true assume 0 == ~wl_st~0; 65#L672-1true [2023-11-06 21:53:30,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:30,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2023-11-06 21:53:30,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:30,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872304449] [2023-11-06 21:53:30,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:30,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:31,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:31,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872304449] [2023-11-06 21:53:31,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872304449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:31,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:31,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:53:31,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791153872] [2023-11-06 21:53:31,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:31,035 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 21:53:31,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:31,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1858065656, now seen corresponding path program 1 times [2023-11-06 21:53:31,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:31,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464006747] [2023-11-06 21:53:31,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:31,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:31,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:31,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464006747] [2023-11-06 21:53:31,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464006747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:31,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:31,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:53:31,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80937539] [2023-11-06 21:53:31,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:31,089 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 21:53:31,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:31,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:53:31,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:53:31,140 INFO L87 Difference]: Start difference. First operand has 131 states, 130 states have (on average 1.823076923076923) internal successors, (237), 130 states have internal predecessors, (237), 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) [2023-11-06 21:53:31,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:31,159 INFO L93 Difference]: Finished difference Result 129 states and 222 transitions. [2023-11-06 21:53:31,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 222 transitions. [2023-11-06 21:53:31,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2023-11-06 21:53:31,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 124 states and 217 transitions. [2023-11-06 21:53:31,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2023-11-06 21:53:31,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2023-11-06 21:53:31,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 217 transitions. [2023-11-06 21:53:31,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:53:31,176 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 217 transitions. [2023-11-06 21:53:31,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 217 transitions. [2023-11-06 21:53:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-06 21:53:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.75) internal successors, (217), 123 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:53:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 217 transitions. [2023-11-06 21:53:31,216 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 217 transitions. [2023-11-06 21:53:31,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:53:31,221 INFO L428 stractBuchiCegarLoop]: Abstraction has 124 states and 217 transitions. [2023-11-06 21:53:31,221 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-06 21:53:31,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 217 transitions. [2023-11-06 21:53:31,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2023-11-06 21:53:31,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 21:53:31,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 21:53:31,240 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] [2023-11-06 21:53:31,240 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] [2023-11-06 21:53:31,240 INFO L748 eck$LassoCheckResult]: Stem: 325#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 326#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; 340#L404 assume !(1 == ~c_req_up~0); 363#L404-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 309#L415-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 310#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 351#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 337#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 338#L435-1 assume !(0 == ~e_f~0); 315#L440-1 assume !(0 == ~e_g~0); 316#L445-1 assume !(0 == ~e_e~0); 343#L450-1 assume !(0 == ~e_c~0); 307#L455-1 assume !(0 == ~e_wl~0); 308#L460-1 assume !(1 == ~wl_pc~0); 376#$Ultimate##44 assume !(2 == ~wl_pc~0); 354#L473 assume !(1 == ~c1_pc~0); 386#L483 assume !(1 == ~c2_pc~0); 297#L492 assume !(1 == ~wb_pc~0); 342#L501 assume !(1 == ~e_c~0); 324#L510-1 assume !(1 == ~e_e~0); 311#L515-1 assume !(1 == ~e_f~0); 294#L520-1 assume !(1 == ~e_g~0); 295#L525-1 assume !(1 == ~e_c~0); 344#L530-1 assume !(1 == ~e_wl~0); 292#L672-1 [2023-11-06 21:53:31,241 INFO L750 eck$LassoCheckResult]: Loop: 292#L672-1 assume !false; 278#L542 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; 279#L377 assume !false; 275#L295 assume !(0 == ~wl_st~0); 277#L299 assume !(0 == ~c1_st~0); 336#L302 assume !(0 == ~c2_st~0); 366#L305 assume !(0 == ~wb_st~0); 286#L308 assume !(0 == ~r_st~0); 287#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; 365#L548 assume !(1 == ~c_req_up~0); 284#L548-2 start_simulation_~kernel_st~0#1 := 3; 285#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 314#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 304#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 305#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 332#L575-1 assume !(0 == ~e_wl~0); 333#L580-1 assume 1 == ~wl_pc~0; 385#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 375#L593 assume !(1 == ~c1_pc~0); 350#L603 assume !(1 == ~c2_pc~0); 269#L612 assume !(1 == ~wb_pc~0); 271#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 359#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 360#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 392#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 390#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 288#L650-1 assume !(1 == ~e_wl~0); 289#L655-1 assume 0 == ~wl_st~0; 292#L672-1 [2023-11-06 21:53:31,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:31,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2023-11-06 21:53:31,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:31,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384226627] [2023-11-06 21:53:31,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:31,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:31,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:31,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384226627] [2023-11-06 21:53:31,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384226627] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:31,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:31,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:53:31,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857862765] [2023-11-06 21:53:31,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:31,353 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 21:53:31,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:31,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233037, now seen corresponding path program 1 times [2023-11-06 21:53:31,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:31,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905510436] [2023-11-06 21:53:31,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:31,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:31,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:31,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905510436] [2023-11-06 21:53:31,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905510436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:31,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:31,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:53:31,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739180686] [2023-11-06 21:53:31,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:31,398 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 21:53:31,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:31,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:53:31,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:53:31,399 INFO L87 Difference]: Start difference. First operand 124 states and 217 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:53:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:31,420 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2023-11-06 21:53:31,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 216 transitions. [2023-11-06 21:53:31,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2023-11-06 21:53:31,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 216 transitions. [2023-11-06 21:53:31,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2023-11-06 21:53:31,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2023-11-06 21:53:31,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 216 transitions. [2023-11-06 21:53:31,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:53:31,427 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 216 transitions. [2023-11-06 21:53:31,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 216 transitions. [2023-11-06 21:53:31,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-06 21:53:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7419354838709677) internal successors, (216), 123 states have internal predecessors, (216), 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) [2023-11-06 21:53:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 216 transitions. [2023-11-06 21:53:31,436 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 216 transitions. [2023-11-06 21:53:31,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:53:31,438 INFO L428 stractBuchiCegarLoop]: Abstraction has 124 states and 216 transitions. [2023-11-06 21:53:31,438 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-06 21:53:31,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 216 transitions. [2023-11-06 21:53:31,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2023-11-06 21:53:31,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 21:53:31,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 21:53:31,442 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] [2023-11-06 21:53:31,442 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] [2023-11-06 21:53:31,442 INFO L748 eck$LassoCheckResult]: Stem: 580#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 581#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; 595#L404 assume !(1 == ~c_req_up~0); 618#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 564#L415-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 565#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 606#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 592#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 593#L435-1 assume !(0 == ~e_f~0); 570#L440-1 assume !(0 == ~e_g~0); 571#L445-1 assume !(0 == ~e_e~0); 598#L450-1 assume !(0 == ~e_c~0); 562#L455-1 assume !(0 == ~e_wl~0); 563#L460-1 assume !(1 == ~wl_pc~0); 631#$Ultimate##44 assume !(2 == ~wl_pc~0); 609#L473 assume !(1 == ~c1_pc~0); 641#L483 assume !(1 == ~c2_pc~0); 552#L492 assume !(1 == ~wb_pc~0); 597#L501 assume !(1 == ~e_c~0); 579#L510-1 assume !(1 == ~e_e~0); 566#L515-1 assume !(1 == ~e_f~0); 549#L520-1 assume !(1 == ~e_g~0); 550#L525-1 assume !(1 == ~e_c~0); 599#L530-1 assume !(1 == ~e_wl~0); 547#L672-1 [2023-11-06 21:53:31,443 INFO L750 eck$LassoCheckResult]: Loop: 547#L672-1 assume !false; 533#L542 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; 534#L377 assume !false; 530#L295 assume !(0 == ~wl_st~0); 532#L299 assume !(0 == ~c1_st~0); 591#L302 assume !(0 == ~c2_st~0); 621#L305 assume !(0 == ~wb_st~0); 541#L308 assume !(0 == ~r_st~0); 542#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; 620#L548 assume !(1 == ~c_req_up~0); 539#L548-2 start_simulation_~kernel_st~0#1 := 3; 540#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 569#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 559#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 560#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 587#L575-1 assume !(0 == ~e_wl~0); 588#L580-1 assume 1 == ~wl_pc~0; 640#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 630#L593 assume !(1 == ~c1_pc~0); 605#L603 assume !(1 == ~c2_pc~0); 524#L612 assume !(1 == ~wb_pc~0); 526#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 614#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 615#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 647#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 645#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 543#L650-1 assume !(1 == ~e_wl~0); 544#L655-1 assume 0 == ~wl_st~0; 547#L672-1 [2023-11-06 21:53:31,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:31,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2023-11-06 21:53:31,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:31,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130863853] [2023-11-06 21:53:31,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:31,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:31,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:31,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130863853] [2023-11-06 21:53:31,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130863853] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:31,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:31,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:53:31,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609388312] [2023-11-06 21:53:31,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:31,506 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 21:53:31,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:31,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233037, now seen corresponding path program 2 times [2023-11-06 21:53:31,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:31,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413324457] [2023-11-06 21:53:31,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:31,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:31,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:31,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413324457] [2023-11-06 21:53:31,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413324457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:31,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:31,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:53:31,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499142267] [2023-11-06 21:53:31,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:31,541 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 21:53:31,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:31,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:53:31,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:53:31,542 INFO L87 Difference]: Start difference. First operand 124 states and 216 transitions. cyclomatic complexity: 93 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:53:31,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:31,561 INFO L93 Difference]: Finished difference Result 124 states and 215 transitions. [2023-11-06 21:53:31,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 215 transitions. [2023-11-06 21:53:31,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2023-11-06 21:53:31,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 215 transitions. [2023-11-06 21:53:31,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2023-11-06 21:53:31,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2023-11-06 21:53:31,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 215 transitions. [2023-11-06 21:53:31,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:53:31,567 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 215 transitions. [2023-11-06 21:53:31,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 215 transitions. [2023-11-06 21:53:31,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-06 21:53:31,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 123 states have internal predecessors, (215), 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) [2023-11-06 21:53:31,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 215 transitions. [2023-11-06 21:53:31,577 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 215 transitions. [2023-11-06 21:53:31,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:53:31,578 INFO L428 stractBuchiCegarLoop]: Abstraction has 124 states and 215 transitions. [2023-11-06 21:53:31,578 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-06 21:53:31,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 215 transitions. [2023-11-06 21:53:31,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2023-11-06 21:53:31,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 21:53:31,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 21:53:31,581 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] [2023-11-06 21:53:31,581 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] [2023-11-06 21:53:31,596 INFO L748 eck$LassoCheckResult]: Stem: 835#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 836#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; 850#L404 assume !(1 == ~c_req_up~0); 873#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 819#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 820#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 861#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 847#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 848#L435-1 assume !(0 == ~e_f~0); 825#L440-1 assume !(0 == ~e_g~0); 826#L445-1 assume !(0 == ~e_e~0); 853#L450-1 assume !(0 == ~e_c~0); 817#L455-1 assume !(0 == ~e_wl~0); 818#L460-1 assume !(1 == ~wl_pc~0); 886#$Ultimate##44 assume !(2 == ~wl_pc~0); 864#L473 assume !(1 == ~c1_pc~0); 896#L483 assume !(1 == ~c2_pc~0); 807#L492 assume !(1 == ~wb_pc~0); 852#L501 assume !(1 == ~e_c~0); 834#L510-1 assume !(1 == ~e_e~0); 821#L515-1 assume !(1 == ~e_f~0); 804#L520-1 assume !(1 == ~e_g~0); 805#L525-1 assume !(1 == ~e_c~0); 854#L530-1 assume !(1 == ~e_wl~0); 802#L672-1 [2023-11-06 21:53:31,597 INFO L750 eck$LassoCheckResult]: Loop: 802#L672-1 assume !false; 788#L542 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; 789#L377 assume !false; 785#L295 assume !(0 == ~wl_st~0); 787#L299 assume !(0 == ~c1_st~0); 846#L302 assume !(0 == ~c2_st~0); 876#L305 assume !(0 == ~wb_st~0); 796#L308 assume !(0 == ~r_st~0); 797#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; 875#L548 assume !(1 == ~c_req_up~0); 794#L548-2 start_simulation_~kernel_st~0#1 := 3; 795#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 824#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 814#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 815#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 842#L575-1 assume !(0 == ~e_wl~0); 843#L580-1 assume !(1 == ~wl_pc~0); 883#$Ultimate##251 assume !(2 == ~wl_pc~0); 885#L593 assume !(1 == ~c1_pc~0); 860#L603 assume !(1 == ~c2_pc~0); 779#L612 assume !(1 == ~wb_pc~0); 781#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 869#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 870#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 902#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 900#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 798#L650-1 assume !(1 == ~e_wl~0); 799#L655-1 assume 0 == ~wl_st~0; 802#L672-1 [2023-11-06 21:53:31,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:31,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2023-11-06 21:53:31,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:31,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356842366] [2023-11-06 21:53:31,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:31,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:31,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:31,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356842366] [2023-11-06 21:53:31,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356842366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:31,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:31,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:53:31,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482406177] [2023-11-06 21:53:31,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:31,634 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 21:53:31,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:31,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1401973316, now seen corresponding path program 1 times [2023-11-06 21:53:31,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:31,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247894389] [2023-11-06 21:53:31,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:31,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:31,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:31,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247894389] [2023-11-06 21:53:31,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247894389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:31,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:31,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:53:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951771187] [2023-11-06 21:53:31,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:31,666 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 21:53:31,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:31,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:53:31,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:53:31,667 INFO L87 Difference]: Start difference. First operand 124 states and 215 transitions. cyclomatic complexity: 92 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) [2023-11-06 21:53:31,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:31,682 INFO L93 Difference]: Finished difference Result 124 states and 214 transitions. [2023-11-06 21:53:31,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 214 transitions. [2023-11-06 21:53:31,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2023-11-06 21:53:31,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 214 transitions. [2023-11-06 21:53:31,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2023-11-06 21:53:31,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2023-11-06 21:53:31,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 214 transitions. [2023-11-06 21:53:31,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:53:31,687 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 214 transitions. [2023-11-06 21:53:31,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 214 transitions. [2023-11-06 21:53:31,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-06 21:53:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7258064516129032) internal successors, (214), 123 states have internal predecessors, (214), 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) [2023-11-06 21:53:31,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 214 transitions. [2023-11-06 21:53:31,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 214 transitions. [2023-11-06 21:53:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:53:31,696 INFO L428 stractBuchiCegarLoop]: Abstraction has 124 states and 214 transitions. [2023-11-06 21:53:31,696 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-06 21:53:31,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 214 transitions. [2023-11-06 21:53:31,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2023-11-06 21:53:31,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 21:53:31,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 21:53:31,699 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] [2023-11-06 21:53:31,699 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] [2023-11-06 21:53:31,699 INFO L748 eck$LassoCheckResult]: Stem: 1090#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1091#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; 1105#L404 assume !(1 == ~c_req_up~0); 1128#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1074#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1075#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1116#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1102#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1103#L435-1 assume !(0 == ~e_f~0); 1080#L440-1 assume !(0 == ~e_g~0); 1081#L445-1 assume !(0 == ~e_e~0); 1108#L450-1 assume !(0 == ~e_c~0); 1072#L455-1 assume !(0 == ~e_wl~0); 1073#L460-1 assume !(1 == ~wl_pc~0); 1141#$Ultimate##44 assume !(2 == ~wl_pc~0); 1119#L473 assume !(1 == ~c1_pc~0); 1151#L483 assume !(1 == ~c2_pc~0); 1062#L492 assume !(1 == ~wb_pc~0); 1107#L501 assume !(1 == ~e_c~0); 1089#L510-1 assume !(1 == ~e_e~0); 1076#L515-1 assume !(1 == ~e_f~0); 1059#L520-1 assume !(1 == ~e_g~0); 1060#L525-1 assume !(1 == ~e_c~0); 1109#L530-1 assume !(1 == ~e_wl~0); 1057#L672-1 [2023-11-06 21:53:31,700 INFO L750 eck$LassoCheckResult]: Loop: 1057#L672-1 assume !false; 1043#L542 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; 1044#L377 assume !false; 1040#L295 assume !(0 == ~wl_st~0); 1042#L299 assume !(0 == ~c1_st~0); 1101#L302 assume !(0 == ~c2_st~0); 1131#L305 assume !(0 == ~wb_st~0); 1051#L308 assume !(0 == ~r_st~0); 1052#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; 1130#L548 assume !(1 == ~c_req_up~0); 1049#L548-2 start_simulation_~kernel_st~0#1 := 3; 1050#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1079#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1069#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1070#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1097#L575-1 assume !(0 == ~e_wl~0); 1098#L580-1 assume !(1 == ~wl_pc~0); 1138#$Ultimate##251 assume !(2 == ~wl_pc~0); 1140#L593 assume !(1 == ~c1_pc~0); 1115#L603 assume !(1 == ~c2_pc~0); 1034#L612 assume !(1 == ~wb_pc~0); 1036#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 1124#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1125#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1157#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1155#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1053#L650-1 assume !(1 == ~e_wl~0); 1054#L655-1 assume 0 == ~wl_st~0; 1057#L672-1 [2023-11-06 21:53:31,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:31,700 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2023-11-06 21:53:31,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:31,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871888580] [2023-11-06 21:53:31,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:31,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:31,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:53:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:31,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:53:31,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:31,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1401973316, now seen corresponding path program 2 times [2023-11-06 21:53:31,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:31,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930283552] [2023-11-06 21:53:31,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:31,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:31,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:31,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930283552] [2023-11-06 21:53:31,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930283552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:31,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:31,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:53:31,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096309922] [2023-11-06 21:53:31,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:31,816 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 21:53:31,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:31,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:53:31,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:53:31,818 INFO L87 Difference]: Start difference. First operand 124 states and 214 transitions. cyclomatic complexity: 91 Second operand has 3 states, 2 states have (on average 14.0) 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) [2023-11-06 21:53:31,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:31,907 INFO L93 Difference]: Finished difference Result 180 states and 306 transitions. [2023-11-06 21:53:31,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 306 transitions. [2023-11-06 21:53:31,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 149 [2023-11-06 21:53:31,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 180 states and 306 transitions. [2023-11-06 21:53:31,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2023-11-06 21:53:31,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2023-11-06 21:53:31,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 306 transitions. [2023-11-06 21:53:31,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:53:31,914 INFO L218 hiAutomatonCegarLoop]: Abstraction has 180 states and 306 transitions. [2023-11-06 21:53:31,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 306 transitions. [2023-11-06 21:53:31,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2023-11-06 21:53:31,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 180 states have (on average 1.7) internal successors, (306), 179 states have internal predecessors, (306), 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) [2023-11-06 21:53:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 306 transitions. [2023-11-06 21:53:31,931 INFO L240 hiAutomatonCegarLoop]: Abstraction has 180 states and 306 transitions. [2023-11-06 21:53:31,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:53:31,937 INFO L428 stractBuchiCegarLoop]: Abstraction has 180 states and 306 transitions. [2023-11-06 21:53:31,937 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-06 21:53:31,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 180 states and 306 transitions. [2023-11-06 21:53:31,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 149 [2023-11-06 21:53:31,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 21:53:31,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 21:53:31,944 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] [2023-11-06 21:53:31,945 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] [2023-11-06 21:53:31,945 INFO L748 eck$LassoCheckResult]: Stem: 1400#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1401#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; 1415#L404 assume !(1 == ~c_req_up~0); 1438#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1385#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1386#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1426#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1412#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1413#L435-1 assume !(0 == ~e_f~0); 1391#L440-1 assume !(0 == ~e_g~0); 1392#L445-1 assume !(0 == ~e_e~0); 1418#L450-1 assume !(0 == ~e_c~0); 1383#L455-1 assume !(0 == ~e_wl~0); 1384#L460-1 assume !(1 == ~wl_pc~0); 1453#$Ultimate##44 assume !(2 == ~wl_pc~0); 1429#L473 assume !(1 == ~c1_pc~0); 1465#L483 assume !(1 == ~c2_pc~0); 1373#L492 assume !(1 == ~wb_pc~0); 1417#L501 assume !(1 == ~e_c~0); 1399#L510-1 assume !(1 == ~e_e~0); 1387#L515-1 assume !(1 == ~e_f~0); 1370#L520-1 assume !(1 == ~e_g~0); 1371#L525-1 assume !(1 == ~e_c~0); 1419#L530-1 assume !(1 == ~e_wl~0); 1457#L672-1 [2023-11-06 21:53:31,947 INFO L750 eck$LassoCheckResult]: Loop: 1457#L672-1 assume !false; 1475#L542 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; 1474#L377 assume !false; 1473#L295 assume !(0 == ~wl_st~0); 1351#L299 assume !(0 == ~c1_st~0); 1411#L302 assume !(0 == ~c2_st~0); 1441#L305 assume !(0 == ~wb_st~0); 1361#L308 assume !(0 == ~r_st~0); 1363#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; 1440#L548 assume !(1 == ~c_req_up~0); 1359#L548-2 start_simulation_~kernel_st~0#1 := 3; 1360#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1390#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1374#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1375#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1403#L575-1 assume !(0 == ~e_wl~0); 1404#L580-1 assume 1 == ~wl_pc~0; 1464#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1462#L593 assume !(1 == ~c1_pc~0); 1521#L603 assume !(1 == ~c2_pc~0); 1520#L612 assume !(1 == ~wb_pc~0); 1518#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 1517#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1516#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1515#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1514#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1513#L650-1 assume !(1 == ~e_wl~0); 1511#L655-1 assume 0 == ~wl_st~0; 1457#L672-1 [2023-11-06 21:53:31,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:31,947 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 2 times [2023-11-06 21:53:31,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:31,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134531392] [2023-11-06 21:53:31,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:31,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:31,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:53:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:31,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:53:31,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233037, now seen corresponding path program 3 times [2023-11-06 21:53:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:31,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103599501] [2023-11-06 21:53:31,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:31,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:32,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:32,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103599501] [2023-11-06 21:53:32,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103599501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:32,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:32,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:53:32,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088246618] [2023-11-06 21:53:32,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:32,038 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 21:53:32,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:32,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:53:32,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:53:32,045 INFO L87 Difference]: Start difference. First operand 180 states and 306 transitions. cyclomatic complexity: 127 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) [2023-11-06 21:53:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:32,105 INFO L93 Difference]: Finished difference Result 335 states and 566 transitions. [2023-11-06 21:53:32,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 335 states and 566 transitions. [2023-11-06 21:53:32,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 288 [2023-11-06 21:53:32,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 335 states to 335 states and 566 transitions. [2023-11-06 21:53:32,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 335 [2023-11-06 21:53:32,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 335 [2023-11-06 21:53:32,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 335 states and 566 transitions. [2023-11-06 21:53:32,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:53:32,121 INFO L218 hiAutomatonCegarLoop]: Abstraction has 335 states and 566 transitions. [2023-11-06 21:53:32,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states and 566 transitions. [2023-11-06 21:53:32,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2023-11-06 21:53:32,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 333 states have (on average 1.6936936936936937) internal successors, (564), 332 states have internal predecessors, (564), 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) [2023-11-06 21:53:32,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 564 transitions. [2023-11-06 21:53:32,149 INFO L240 hiAutomatonCegarLoop]: Abstraction has 333 states and 564 transitions. [2023-11-06 21:53:32,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:53:32,152 INFO L428 stractBuchiCegarLoop]: Abstraction has 333 states and 564 transitions. [2023-11-06 21:53:32,152 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-06 21:53:32,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 333 states and 564 transitions. [2023-11-06 21:53:32,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 286 [2023-11-06 21:53:32,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 21:53:32,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 21:53:32,161 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] [2023-11-06 21:53:32,161 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] [2023-11-06 21:53:32,161 INFO L748 eck$LassoCheckResult]: Stem: 1925#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1926#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; 1943#L404 assume !(1 == ~c_req_up~0); 1965#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1907#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1908#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1952#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1938#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1939#L435-1 assume !(0 == ~e_f~0); 1913#L440-1 assume !(0 == ~e_g~0); 1914#L445-1 assume !(0 == ~e_e~0); 1944#L450-1 assume !(0 == ~e_c~0); 1904#L455-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1905#L460-1 assume !(1 == ~wl_pc~0); 2152#$Ultimate##44 assume !(2 == ~wl_pc~0); 2007#L473 assume !(1 == ~c1_pc~0); 2070#L483 assume !(1 == ~c2_pc~0); 2061#L492 assume !(1 == ~wb_pc~0); 1954#L501 assume !(1 == ~e_c~0); 1923#L510-1 assume !(1 == ~e_e~0); 1909#L515-1 assume !(1 == ~e_f~0); 1891#L520-1 assume !(1 == ~e_g~0); 1892#L525-1 assume !(1 == ~e_c~0); 1945#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1987#L672-1 [2023-11-06 21:53:32,162 INFO L750 eck$LassoCheckResult]: Loop: 1987#L672-1 assume !false; 2014#L542 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; 2015#L377 assume !false; 2084#L295 assume !(0 == ~wl_st~0); 1936#L299 assume !(0 == ~c1_st~0); 1937#L302 assume !(0 == ~c2_st~0); 1968#L305 assume !(0 == ~wb_st~0); 1882#L308 assume !(0 == ~r_st~0); 1884#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; 1967#L548 assume !(1 == ~c_req_up~0); 1880#L548-2 start_simulation_~kernel_st~0#1 := 3; 1881#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1912#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1901#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1902#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1931#L575-1 assume !(0 == ~e_wl~0); 1932#L580-1 assume 1 == ~wl_pc~0; 2004#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1997#L593 assume !(1 == ~c1_pc~0); 2039#L603 assume !(1 == ~c2_pc~0); 2038#L612 assume !(1 == ~wb_pc~0); 2036#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 2034#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 2031#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2028#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 2025#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 2022#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2019#L655-1 assume 0 == ~wl_st~0; 1987#L672-1 [2023-11-06 21:53:32,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:32,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2560361, now seen corresponding path program 1 times [2023-11-06 21:53:32,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:32,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021206047] [2023-11-06 21:53:32,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:32,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:32,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:32,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021206047] [2023-11-06 21:53:32,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021206047] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:32,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:32,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:53:32,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080728408] [2023-11-06 21:53:32,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:32,265 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 21:53:32,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:32,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233099, now seen corresponding path program 1 times [2023-11-06 21:53:32,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:32,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24308911] [2023-11-06 21:53:32,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:32,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:32,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:53:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:32,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:53:32,749 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 21:53:32,749 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 21:53:32,749 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 21:53:32,750 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 21:53:32,750 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 21:53:32,750 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:32,750 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 21:53:32,750 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 21:53:32,751 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration7_Loop [2023-11-06 21:53:32,751 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 21:53:32,751 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 21:53:32,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:32,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,202 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 21:53:33,203 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 21:53:33,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:33,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:33,211 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:33,228 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 21:53:33,228 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 21:53:33,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-06 21:53:33,256 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 21:53:33,256 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 21:53:33,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:33,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:33,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:33,271 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:33,279 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 21:53:33,280 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 21:53:33,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-06 21:53:33,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:33,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:33,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:33,325 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:33,334 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 21:53:33,334 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 21:53:33,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-06 21:53:33,363 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 21:53:33,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:33,372 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 21:53:33,372 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 21:53:33,372 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 21:53:33,372 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 21:53:33,372 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 21:53:33,372 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:33,373 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 21:53:33,373 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 21:53:33,373 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration7_Loop [2023-11-06 21:53:33,373 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 21:53:33,373 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 21:53:33,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:33,725 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 21:53:33,729 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 21:53:33,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:33,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:33,732 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:33,745 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 [2023-11-06 21:53:33,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 21:53:33,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 21:53:33,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-06 21:53:33,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 21:53:33,759 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-06 21:53:33,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 21:53:33,761 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-06 21:53:33,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 21:53:33,779 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 21:53:33,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:33,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:33,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:33,786 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:33,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-06 21:53:33,792 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 [2023-11-06 21:53:33,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 21:53:33,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 21:53:33,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 21:53:33,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 21:53:33,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 21:53:33,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 21:53:33,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 21:53:33,815 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 21:53:33,819 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 21:53:33,819 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-06 21:53:33,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:33,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:33,859 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:33,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-06 21:53:33,865 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 21:53:33,865 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 21:53:33,865 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 21:53:33,866 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2023-11-06 21:53:33,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-11-06 21:53:33,873 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 21:53:33,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 21:53:33,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 21:53:34,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:34,165 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 [2023-11-06 21:53:34,167 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 333 states and 564 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) [2023-11-06 21:53:34,284 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 333 states and 564 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 1203 states and 2018 transitions. Complement of second has 5 states. [2023-11-06 21:53:34,286 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 [2023-11-06 21:53:34,287 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) [2023-11-06 21:53:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-11-06 21:53:34,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 28 letters. [2023-11-06 21:53:34,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 21:53:34,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 52 letters. Loop has 28 letters. [2023-11-06 21:53:34,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 21:53:34,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 56 letters. [2023-11-06 21:53:34,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 21:53:34,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1203 states and 2018 transitions. [2023-11-06 21:53:34,307 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 858 [2023-11-06 21:53:34,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1203 states to 1203 states and 2018 transitions. [2023-11-06 21:53:34,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 906 [2023-11-06 21:53:34,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 911 [2023-11-06 21:53:34,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1203 states and 2018 transitions. [2023-11-06 21:53:34,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 21:53:34,322 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1203 states and 2018 transitions. [2023-11-06 21:53:34,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states and 2018 transitions. [2023-11-06 21:53:34,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 912. [2023-11-06 21:53:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 912 states have (on average 1.6798245614035088) internal successors, (1532), 911 states have internal predecessors, (1532), 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) [2023-11-06 21:53:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1532 transitions. [2023-11-06 21:53:34,348 INFO L240 hiAutomatonCegarLoop]: Abstraction has 912 states and 1532 transitions. [2023-11-06 21:53:34,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:34,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:53:34,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:53:34,349 INFO L87 Difference]: Start difference. First operand 912 states and 1532 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:53:34,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-11-06 21:53:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:34,499 INFO L93 Difference]: Finished difference Result 1522 states and 2526 transitions. [2023-11-06 21:53:34,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1522 states and 2526 transitions. [2023-11-06 21:53:34,513 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1015 [2023-11-06 21:53:34,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1522 states to 1522 states and 2526 transitions. [2023-11-06 21:53:34,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1118 [2023-11-06 21:53:34,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1118 [2023-11-06 21:53:34,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1522 states and 2526 transitions. [2023-11-06 21:53:34,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 21:53:34,531 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1522 states and 2526 transitions. [2023-11-06 21:53:34,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states and 2526 transitions. [2023-11-06 21:53:34,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1469. [2023-11-06 21:53:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1469 states have (on average 1.6589516678012253) internal successors, (2437), 1468 states have internal predecessors, (2437), 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) [2023-11-06 21:53:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2437 transitions. [2023-11-06 21:53:34,570 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1469 states and 2437 transitions. [2023-11-06 21:53:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:53:34,571 INFO L428 stractBuchiCegarLoop]: Abstraction has 1469 states and 2437 transitions. [2023-11-06 21:53:34,571 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-06 21:53:34,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1469 states and 2437 transitions. [2023-11-06 21:53:34,581 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1013 [2023-11-06 21:53:34,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 21:53:34,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 21:53:34,583 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] [2023-11-06 21:53:34,583 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] [2023-11-06 21:53:34,583 INFO L748 eck$LassoCheckResult]: Stem: 6118#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 6119#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; 6148#L404 assume !(1 == ~c_req_up~0); 6191#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6088#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6089#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6165#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 6142#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 6143#L435-1 assume !(0 == ~e_f~0); 6099#L440-1 assume !(0 == ~e_g~0); 6100#L445-1 assume !(0 == ~e_e~0); 6151#L450-1 assume !(0 == ~e_c~0); 6086#L455-1 assume !(0 == ~e_wl~0); 6087#L460-1 assume !(1 == ~wl_pc~0); 6227#$Ultimate##44 assume !(2 == ~wl_pc~0); 6173#L473 assume !(1 == ~c1_pc~0); 6291#L483 assume !(1 == ~c2_pc~0); 6287#L492 assume !(1 == ~wb_pc~0); 6150#L501 assume !(1 == ~e_c~0); 6116#L510-1 assume !(1 == ~e_e~0); 6117#L515-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6064#L520-1 assume !(1 == ~e_g~0); 6065#L525-1 assume !(1 == ~e_c~0); 6152#L530-1 assume !(1 == ~e_wl~0); 6196#L672-1 [2023-11-06 21:53:34,584 INFO L750 eck$LassoCheckResult]: Loop: 6196#L672-1 assume !false; 6030#L542 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; 6031#L377 assume !false; 6297#L295 assume !(0 == ~wl_st~0); 7264#L299 assume !(0 == ~c1_st~0); 7263#L302 assume !(0 == ~c2_st~0); 7262#L305 assume !(0 == ~wb_st~0); 7260#L308 assume !(0 == ~r_st~0); 7259#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; 7257#L548 assume !(1 == ~c_req_up~0); 7256#L548-2 start_simulation_~kernel_st~0#1 := 3; 7255#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 7130#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 6080#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 6081#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 6969#L575-1 assume !(0 == ~e_wl~0); 6898#L580-1 assume 1 == ~wl_pc~0; 6964#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 6235#L593 assume !(1 == ~c1_pc~0); 6162#L603 assume !(1 == ~c2_pc~0); 6014#L612 assume !(1 == ~wb_pc~0); 6016#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 6970#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 6925#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6924#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 6922#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 6921#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 6899#L655-1 assume 0 == ~wl_st~0; 6196#L672-1 [2023-11-06 21:53:34,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:34,584 INFO L85 PathProgramCache]: Analyzing trace with hash 255545497, now seen corresponding path program 1 times [2023-11-06 21:53:34,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:34,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574723079] [2023-11-06 21:53:34,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:34,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:34,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:34,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:34,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574723079] [2023-11-06 21:53:34,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574723079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:34,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:34,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:53:34,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974923003] [2023-11-06 21:53:34,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:34,637 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 21:53:34,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:34,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233099, now seen corresponding path program 2 times [2023-11-06 21:53:34,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:34,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345220296] [2023-11-06 21:53:34,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:34,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:34,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:53:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:34,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:53:34,978 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 21:53:34,978 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 21:53:34,978 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 21:53:34,978 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 21:53:34,979 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 21:53:34,979 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:34,979 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 21:53:34,979 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 21:53:34,979 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration8_Loop [2023-11-06 21:53:34,979 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 21:53:34,979 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 21:53:34,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:34,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:34,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:34,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:34,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:34,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,306 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 21:53:35,306 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 21:53:35,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:35,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:35,308 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:35,320 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 21:53:35,320 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 21:53:35,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-06 21:53:35,343 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 21:53:35,343 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 21:53:35,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:35,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:35,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:35,350 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:35,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-06 21:53:35,354 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 21:53:35,354 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 21:53:35,376 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 21:53:35,377 INFO L440 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: [] [2023-11-06 21:53:35,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:35,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:35,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:35,388 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:35,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-06 21:53:35,391 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 21:53:35,391 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 21:53:35,403 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 21:53:35,403 INFO L440 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: [] [2023-11-06 21:53:35,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:35,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:35,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:35,409 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:35,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-06 21:53:35,412 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 21:53:35,412 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 21:53:35,424 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 21:53:35,424 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 21:53:35,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:35,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:35,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:35,432 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:35,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-06 21:53:35,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 21:53:35,435 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 21:53:35,479 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 21:53:35,479 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 21:53:35,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:35,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:35,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:35,490 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:35,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-06 21:53:35,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 21:53:35,497 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 21:53:35,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:35,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:35,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:35,530 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:35,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-06 21:53:35,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 21:53:35,561 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 21:53:35,586 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 21:53:35,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:35,595 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 21:53:35,595 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 21:53:35,595 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 21:53:35,596 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 21:53:35,596 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 21:53:35,596 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:35,596 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 21:53:35,596 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 21:53:35,596 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration8_Loop [2023-11-06 21:53:35,596 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 21:53:35,597 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 21:53:35,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:35,927 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 21:53:35,927 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 21:53:35,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:35,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:35,930 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:35,940 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 [2023-11-06 21:53:35,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 21:53:35,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 21:53:35,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-06 21:53:35,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 21:53:35,954 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-06 21:53:35,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 21:53:35,955 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-06 21:53:35,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 21:53:35,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 21:53:35,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:35,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:35,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:35,993 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:36,004 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 [2023-11-06 21:53:36,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 21:53:36,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 21:53:36,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 21:53:36,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 21:53:36,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 21:53:36,018 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 21:53:36,018 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 21:53:36,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-06 21:53:36,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 21:53:36,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:36,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:36,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:36,041 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:36,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 21:53:36,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 21:53:36,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 21:53:36,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 21:53:36,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 21:53:36,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 21:53:36,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 21:53:36,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 21:53:36,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-06 21:53:36,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 21:53:36,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:36,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:36,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:36,095 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:36,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-06 21:53:36,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-06 21:53:36,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 21:53:36,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 21:53:36,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 21:53:36,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 21:53:36,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 21:53:36,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 21:53:36,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 21:53:36,122 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 21:53:36,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:36,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:36,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:36,132 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:36,145 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 [2023-11-06 21:53:36,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 21:53:36,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 21:53:36,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 21:53:36,158 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-06 21:53:36,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 21:53:36,159 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-06 21:53:36,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 21:53:36,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-06 21:53:36,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 21:53:36,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-11-06 21:53:36,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:36,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:36,192 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:36,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-06 21:53:36,201 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 [2023-11-06 21:53:36,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 21:53:36,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 21:53:36,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 21:53:36,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 21:53:36,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 21:53:36,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 21:53:36,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 21:53:36,225 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 21:53:36,228 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 21:53:36,228 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-06 21:53:36,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:36,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:36,230 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:36,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-06 21:53:36,236 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 21:53:36,236 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 21:53:36,236 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 21:53:36,237 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2023-11-06 21:53:36,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:36,246 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 21:53:36,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:36,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 21:53:36,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:36,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 21:53:36,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:36,443 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 [2023-11-06 21:53:36,443 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1469 states and 2437 transitions. cyclomatic complexity: 973 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) [2023-11-06 21:53:36,509 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1469 states and 2437 transitions. cyclomatic complexity: 973. 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 3132 states and 5186 transitions. Complement of second has 5 states. [2023-11-06 21:53:36,509 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 [2023-11-06 21:53:36,510 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) [2023-11-06 21:53:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-11-06 21:53:36,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 24 letters. Loop has 28 letters. [2023-11-06 21:53:36,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 21:53:36,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 52 letters. Loop has 28 letters. [2023-11-06 21:53:36,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 21:53:36,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 24 letters. Loop has 56 letters. [2023-11-06 21:53:36,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 21:53:36,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3132 states and 5186 transitions. [2023-11-06 21:53:36,545 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 2026 [2023-11-06 21:53:36,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3132 states to 3132 states and 5186 transitions. [2023-11-06 21:53:36,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2087 [2023-11-06 21:53:36,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2096 [2023-11-06 21:53:36,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3132 states and 5186 transitions. [2023-11-06 21:53:36,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 21:53:36,580 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3132 states and 5186 transitions. [2023-11-06 21:53:36,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states and 5186 transitions. [2023-11-06 21:53:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 1927. [2023-11-06 21:53:36,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1927 states have (on average 1.6564608199273483) internal successors, (3192), 1926 states have internal predecessors, (3192), 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) [2023-11-06 21:53:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 3192 transitions. [2023-11-06 21:53:36,639 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1927 states and 3192 transitions. [2023-11-06 21:53:36,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:36,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:53:36,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:53:36,640 INFO L87 Difference]: Start difference. First operand 1927 states and 3192 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:53:36,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:36,769 INFO L93 Difference]: Finished difference Result 3375 states and 5492 transitions. [2023-11-06 21:53:36,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3375 states and 5492 transitions. [2023-11-06 21:53:36,800 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1952 [2023-11-06 21:53:36,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3375 states to 3375 states and 5492 transitions. [2023-11-06 21:53:36,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2068 [2023-11-06 21:53:36,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2068 [2023-11-06 21:53:36,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3375 states and 5492 transitions. [2023-11-06 21:53:36,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 21:53:36,874 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3375 states and 5492 transitions. [2023-11-06 21:53:36,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3375 states and 5492 transitions. [2023-11-06 21:53:36,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:36,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3375 to 3342. [2023-11-06 21:53:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3342 states, 3342 states have (on average 1.6334530221424297) internal successors, (5459), 3341 states have internal predecessors, (5459), 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) [2023-11-06 21:53:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3342 states to 3342 states and 5459 transitions. [2023-11-06 21:53:36,988 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3342 states and 5459 transitions. [2023-11-06 21:53:36,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:53:36,989 INFO L428 stractBuchiCegarLoop]: Abstraction has 3342 states and 5459 transitions. [2023-11-06 21:53:36,990 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-06 21:53:36,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3342 states and 5459 transitions. [2023-11-06 21:53:37,012 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1946 [2023-11-06 21:53:37,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 21:53:37,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 21:53:37,013 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] [2023-11-06 21:53:37,014 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] [2023-11-06 21:53:37,014 INFO L748 eck$LassoCheckResult]: Stem: 16202#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 16203#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; 16235#L404 assume !(1 == ~c_req_up~0); 16284#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 16285#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 16256#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 16257#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 16230#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 16231#L435-1 assume !(0 == ~e_f~0); 16183#L440-1 assume !(0 == ~e_g~0); 16184#L445-1 assume !(0 == ~e_e~0); 16246#L450-1 assume 0 == ~e_c~0;~e_c~0 := 1; 16171#L455-1 assume !(0 == ~e_wl~0); 16172#L460-1 assume !(1 == ~wl_pc~0); 16358#$Ultimate##44 assume !(2 == ~wl_pc~0); 16266#L473 assume !(1 == ~c1_pc~0); 16371#L483 assume !(1 == ~c2_pc~0); 16152#L492 assume !(1 == ~wb_pc~0); 16263#L501 assume !(1 == ~e_c~0); 16264#L510-1 assume !(1 == ~e_e~0); 16422#L515-1 assume !(1 == ~e_f~0); 16423#L520-1 assume !(1 == ~e_g~0); 16418#L525-1 assume !(1 == ~e_c~0); 16419#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 16340#L672-1 assume !false; 16440#L542 [2023-11-06 21:53:37,014 INFO L750 eck$LassoCheckResult]: Loop: 16440#L542 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; 18351#L377 assume !false; 18352#L295 assume !(0 == ~wl_st~0); 18748#L299 assume !(0 == ~c1_st~0); 18747#L302 assume !(0 == ~c2_st~0); 18746#L305 assume !(0 == ~wb_st~0); 18094#L308 assume !(0 == ~r_st~0); 16347#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; 16348#L548 assume !(1 == ~c_req_up~0); 18470#L548-2 start_simulation_~kernel_st~0#1 := 3; 18471#L560 assume !(0 == ~e_f~0); 18744#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 18737#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 18738#L570-1 assume !(0 == ~e_c~0); 18728#L575-1 assume !(0 == ~e_wl~0); 18726#L580-1 assume 1 == ~wl_pc~0; 18724#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 18725#L593 assume !(1 == ~c1_pc~0); 18860#L603 assume !(1 == ~c2_pc~0); 18857#L612 assume !(1 == ~wb_pc~0); 18854#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 18852#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 18850#L635-1 assume !(1 == ~e_f~0); 18847#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 18845#L645-1 assume !(1 == ~e_c~0); 18844#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 17610#L655-1 assume 0 == ~wl_st~0; 18841#L672-1 assume !false; 16440#L542 [2023-11-06 21:53:37,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:37,015 INFO L85 PathProgramCache]: Analyzing trace with hash 344940224, now seen corresponding path program 1 times [2023-11-06 21:53:37,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:37,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247671076] [2023-11-06 21:53:37,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:37,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:37,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:37,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247671076] [2023-11-06 21:53:37,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247671076] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:37,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:37,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:53:37,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114690348] [2023-11-06 21:53:37,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:37,063 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 21:53:37,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:37,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1890226441, now seen corresponding path program 1 times [2023-11-06 21:53:37,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:37,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256319332] [2023-11-06 21:53:37,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:37,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:37,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:37,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256319332] [2023-11-06 21:53:37,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256319332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:37,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:37,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:53:37,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728282319] [2023-11-06 21:53:37,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:37,085 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 21:53:37,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:37,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:53:37,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:53:37,086 INFO L87 Difference]: Start difference. First operand 3342 states and 5459 transitions. cyclomatic complexity: 2132 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) [2023-11-06 21:53:37,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:37,181 INFO L93 Difference]: Finished difference Result 3395 states and 5500 transitions. [2023-11-06 21:53:37,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3395 states and 5500 transitions. [2023-11-06 21:53:37,208 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1979 [2023-11-06 21:53:37,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3395 states to 3395 states and 5500 transitions. [2023-11-06 21:53:37,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2098 [2023-11-06 21:53:37,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2098 [2023-11-06 21:53:37,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3395 states and 5500 transitions. [2023-11-06 21:53:37,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 21:53:37,240 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3395 states and 5500 transitions. [2023-11-06 21:53:37,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3395 states and 5500 transitions. [2023-11-06 21:53:37,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3395 to 3141. [2023-11-06 21:53:37,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3141 states have (on average 1.6275071633237823) internal successors, (5112), 3140 states have internal predecessors, (5112), 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) [2023-11-06 21:53:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 5112 transitions. [2023-11-06 21:53:37,318 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3141 states and 5112 transitions. [2023-11-06 21:53:37,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:53:37,320 INFO L428 stractBuchiCegarLoop]: Abstraction has 3141 states and 5112 transitions. [2023-11-06 21:53:37,320 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-06 21:53:37,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3141 states and 5112 transitions. [2023-11-06 21:53:37,336 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1979 [2023-11-06 21:53:37,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 21:53:37,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 21:53:37,337 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] [2023-11-06 21:53:37,337 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] [2023-11-06 21:53:37,338 INFO L748 eck$LassoCheckResult]: Stem: 22950#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 22951#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; 22980#L404 assume !(1 == ~c_req_up~0); 23044#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 22919#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 22920#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 23077#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 22975#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 22976#L435-1 assume !(0 == ~e_f~0); 22930#L440-1 assume !(0 == ~e_g~0); 22931#L445-1 assume !(0 == ~e_e~0); 22991#L450-1 assume !(0 == ~e_c~0); 22917#L455-1 assume !(0 == ~e_wl~0); 22918#L460-1 assume !(1 == ~wl_pc~0); 23086#$Ultimate##44 assume !(2 == ~wl_pc~0); 23010#L473 assume !(1 == ~c1_pc~0); 23157#L483 assume !(1 == ~c2_pc~0); 23156#L492 assume !(1 == ~wb_pc~0); 23150#L501 assume !(1 == ~e_c~0); 23151#L510-1 assume !(1 == ~e_e~0); 22921#L515-1 assume !(1 == ~e_f~0); 22922#L520-1 assume !(1 == ~e_g~0); 22985#L525-1 assume !(1 == ~e_c~0); 22986#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 23074#L672-1 assume !false; 25327#L542 [2023-11-06 21:53:37,338 INFO L750 eck$LassoCheckResult]: Loop: 25327#L542 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; 25326#L377 assume !false; 25325#L295 assume !(0 == ~wl_st~0); 24890#L299 assume !(0 == ~c1_st~0); 24884#L302 assume !(0 == ~c2_st~0); 24885#L305 assume !(0 == ~wb_st~0); 24876#L308 assume !(0 == ~r_st~0); 24878#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; 24546#L548 assume !(1 == ~c_req_up~0); 24547#L548-2 start_simulation_~kernel_st~0#1 := 3; 22927#L560 assume !(0 == ~e_f~0); 22928#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 23087#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 25820#L570-1 assume !(0 == ~e_c~0); 25415#L575-1 assume !(0 == ~e_wl~0); 25412#L580-1 assume 1 == ~wl_pc~0; 25411#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 23093#L593 assume !(1 == ~c1_pc~0); 25398#L603 assume !(1 == ~c2_pc~0); 25393#L612 assume !(1 == ~wb_pc~0); 25387#L621 assume !(1 == ~e_c~0); 25384#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 25381#L635-1 assume !(1 == ~e_f~0); 25378#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 25374#L645-1 assume !(1 == ~e_c~0); 25369#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 25360#L655-1 assume 0 == ~wl_st~0; 25358#L672-1 assume !false; 25327#L542 [2023-11-06 21:53:37,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:37,339 INFO L85 PathProgramCache]: Analyzing trace with hash -666177026, now seen corresponding path program 1 times [2023-11-06 21:53:37,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:37,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204798189] [2023-11-06 21:53:37,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:37,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:37,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:37,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204798189] [2023-11-06 21:53:37,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204798189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:37,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:37,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:53:37,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005482922] [2023-11-06 21:53:37,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:37,381 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 21:53:37,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:37,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1080879815, now seen corresponding path program 1 times [2023-11-06 21:53:37,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:37,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212704200] [2023-11-06 21:53:37,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:37,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:37,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:53:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:37,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:53:37,704 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 21:53:37,704 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 21:53:37,704 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 21:53:37,704 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 21:53:37,704 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-06 21:53:37,705 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:37,705 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 21:53:37,705 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 21:53:37,705 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration10_Loop [2023-11-06 21:53:37,705 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 21:53:37,705 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 21:53:37,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:37,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,048 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 21:53:38,048 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-06 21:53:38,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:38,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:38,049 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:38,060 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 21:53:38,060 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 21:53:38,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-06 21:53:38,083 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 21:53:38,083 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet4#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 21:53:38,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:38,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:38,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:38,093 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:38,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 21:53:38,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 21:53:38,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-06 21:53:38,139 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 21:53:38,139 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 21:53:38,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:38,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:38,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:38,149 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:38,154 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 21:53:38,154 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 21:53:38,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-06 21:53:38,183 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 21:53:38,183 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 21:53:38,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:38,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:38,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:38,194 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:38,200 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 21:53:38,200 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 21:53:38,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-06 21:53:38,239 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-06 21:53:38,239 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=-1} Honda state: {~r_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-06 21:53:38,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:38,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:38,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:38,250 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:38,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-06 21:53:38,254 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-06 21:53:38,254 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 21:53:38,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:38,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:38,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:38,296 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:38,300 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-06 21:53:38,300 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-06 21:53:38,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-06 21:53:38,322 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-06 21:53:38,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:38,327 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 21:53:38,327 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 21:53:38,328 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 21:53:38,328 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 21:53:38,328 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 21:53:38,328 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:38,328 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 21:53:38,328 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 21:53:38,328 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration10_Loop [2023-11-06 21:53:38,328 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 21:53:38,328 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 21:53:38,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,387 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-06 21:53:38,656 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 21:53:38,656 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 21:53:38,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:38,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:38,657 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:38,668 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 [2023-11-06 21:53:38,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 21:53:38,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 21:53:38,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 21:53:38,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 21:53:38,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 21:53:38,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 21:53:38,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 21:53:38,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-06 21:53:38,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 21:53:38,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:38,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:38,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:38,699 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:38,702 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 [2023-11-06 21:53:38,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-11-06 21:53:38,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 21:53:38,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 21:53:38,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 21:53:38,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 21:53:38,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 21:53:38,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 21:53:38,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 21:53:38,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 21:53:38,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2023-11-06 21:53:38,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:38,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:38,719 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:38,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-11-06 21:53:38,723 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 [2023-11-06 21:53:38,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 21:53:38,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 21:53:38,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 21:53:38,733 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-06 21:53:38,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 21:53:38,734 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-06 21:53:38,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 21:53:38,744 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 21:53:38,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-11-06 21:53:38,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:38,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:38,748 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:38,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-11-06 21:53:38,751 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 [2023-11-06 21:53:38,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 21:53:38,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 21:53:38,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 21:53:38,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 21:53:38,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 21:53:38,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 21:53:38,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 21:53:38,772 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 21:53:38,774 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-06 21:53:38,775 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-06 21:53:38,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 21:53:38,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:38,779 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:38,783 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 21:53:38,783 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-06 21:53:38,783 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 21:53:38,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-11-06 21:53:38,783 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2023-11-06 21:53:38,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:38,793 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-06 21:53:38,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 21:53:38,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:38,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 21:53:38,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:53:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:38,991 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 [2023-11-06 21:53:38,991 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3141 states and 5112 transitions. cyclomatic complexity: 1984 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) [2023-11-06 21:53:39,075 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3141 states and 5112 transitions. cyclomatic complexity: 1984. 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 6730 states and 10970 transitions. Complement of second has 5 states. [2023-11-06 21:53:39,076 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 [2023-11-06 21:53:39,078 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) [2023-11-06 21:53:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2023-11-06 21:53:39,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 25 letters. Loop has 28 letters. [2023-11-06 21:53:39,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 21:53:39,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 53 letters. Loop has 28 letters. [2023-11-06 21:53:39,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 21:53:39,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 25 letters. Loop has 56 letters. [2023-11-06 21:53:39,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 21:53:39,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6730 states and 10970 transitions. [2023-11-06 21:53:39,155 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 3115 [2023-11-06 21:53:39,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-11-06 21:53:39,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6730 states to 6730 states and 10970 transitions. [2023-11-06 21:53:39,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3227 [2023-11-06 21:53:39,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3262 [2023-11-06 21:53:39,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6730 states and 10970 transitions. [2023-11-06 21:53:39,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 21:53:39,217 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6730 states and 10970 transitions. [2023-11-06 21:53:39,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6730 states and 10970 transitions. [2023-11-06 21:53:39,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6730 to 6695. [2023-11-06 21:53:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6695 states, 6695 states have (on average 1.6298730395817775) internal successors, (10912), 6694 states have internal predecessors, (10912), 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) [2023-11-06 21:53:39,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6695 states to 6695 states and 10912 transitions. [2023-11-06 21:53:39,369 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6695 states and 10912 transitions. [2023-11-06 21:53:39,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:39,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:53:39,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:53:39,370 INFO L87 Difference]: Start difference. First operand 6695 states and 10912 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) [2023-11-06 21:53:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:39,481 INFO L93 Difference]: Finished difference Result 7180 states and 11526 transitions. [2023-11-06 21:53:39,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7180 states and 11526 transitions. [2023-11-06 21:53:39,523 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2859 [2023-11-06 21:53:39,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7180 states to 7180 states and 11526 transitions. [2023-11-06 21:53:39,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2935 [2023-11-06 21:53:39,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2935 [2023-11-06 21:53:39,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7180 states and 11526 transitions. [2023-11-06 21:53:39,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 21:53:39,587 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7180 states and 11526 transitions. [2023-11-06 21:53:39,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7180 states and 11526 transitions. [2023-11-06 21:53:39,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7180 to 7168. [2023-11-06 21:53:39,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7168 states, 7168 states have (on average 1.6063058035714286) internal successors, (11514), 7167 states have internal predecessors, (11514), 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) [2023-11-06 21:53:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7168 states to 7168 states and 11514 transitions. [2023-11-06 21:53:39,845 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7168 states and 11514 transitions. [2023-11-06 21:53:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:53:39,847 INFO L428 stractBuchiCegarLoop]: Abstraction has 7168 states and 11514 transitions. [2023-11-06 21:53:39,847 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-06 21:53:39,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7168 states and 11514 transitions. [2023-11-06 21:53:39,879 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2859 [2023-11-06 21:53:39,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 21:53:39,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 21:53:39,880 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] [2023-11-06 21:53:39,881 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:39,881 INFO L748 eck$LassoCheckResult]: Stem: 46881#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 46882#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; 46917#L404 assume !(1 == ~c_req_up~0); 46965#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 46849#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 46850#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 47017#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 46909#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 46910#L435-1 assume !(0 == ~e_f~0); 46861#L440-1 assume !(0 == ~e_g~0); 46862#L445-1 assume !(0 == ~e_e~0); 46920#L450-1 assume !(0 == ~e_c~0); 46847#L455-1 assume !(0 == ~e_wl~0); 46848#L460-1 assume !(1 == ~wl_pc~0); 47002#$Ultimate##44 assume !(2 == ~wl_pc~0); 46947#L473 assume !(1 == ~c1_pc~0); 47042#L483 assume !(1 == ~c2_pc~0); 46827#L492 assume !(1 == ~wb_pc~0); 46942#L501 assume !(1 == ~e_c~0); 46943#L510-1 assume !(1 == ~e_e~0); 46851#L515-1 assume !(1 == ~e_f~0); 46852#L520-1 assume !(1 == ~e_g~0); 46921#L525-1 assume !(1 == ~e_c~0); 46922#L530-1 assume !(1 == ~e_wl~0); 47014#L672-1 assume !false; 49051#L542 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; 51668#L377 [2023-11-06 21:53:39,881 INFO L750 eck$LassoCheckResult]: Loop: 51668#L377 assume !false; 51666#L295 assume 0 == ~wl_st~0; 51663#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 51664#L321 assume !(0 != eval_~tmp~0#1); 51801#L317 assume !(0 == ~c1_st~0); 51794#L332 assume !(0 == ~c2_st~0); 51005#L347 assume !(0 == ~wb_st~0); 51002#L362 assume !(0 == ~r_st~0); 51668#L377 [2023-11-06 21:53:39,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:39,884 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2023-11-06 21:53:39,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:39,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141058640] [2023-11-06 21:53:39,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:39,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:39,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:53:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:39,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:53:39,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:39,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1279860915, now seen corresponding path program 1 times [2023-11-06 21:53:39,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:39,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955109020] [2023-11-06 21:53:39,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:39,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:39,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:53:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:39,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:53:39,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:39,928 INFO L85 PathProgramCache]: Analyzing trace with hash 360906411, now seen corresponding path program 1 times [2023-11-06 21:53:39,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:39,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825583993] [2023-11-06 21:53:39,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:39,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:39,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:39,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:39,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825583993] [2023-11-06 21:53:39,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825583993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:39,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:39,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:53:39,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742620978] [2023-11-06 21:53:39,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:40,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:40,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:53:40,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:53:40,005 INFO L87 Difference]: Start difference. First operand 7168 states and 11514 transitions. cyclomatic complexity: 4382 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) [2023-11-06 21:53:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:40,201 INFO L93 Difference]: Finished difference Result 11016 states and 17576 transitions. [2023-11-06 21:53:40,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11016 states and 17576 transitions. [2023-11-06 21:53:40,254 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4438 [2023-11-06 21:53:40,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11016 states to 11016 states and 17576 transitions. [2023-11-06 21:53:40,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4518 [2023-11-06 21:53:40,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4518 [2023-11-06 21:53:40,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11016 states and 17576 transitions. [2023-11-06 21:53:40,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 21:53:40,303 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11016 states and 17576 transitions. [2023-11-06 21:53:40,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11016 states and 17576 transitions. [2023-11-06 21:53:40,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11016 to 11016. [2023-11-06 21:53:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11016 states, 11016 states have (on average 1.5954974582425563) internal successors, (17576), 11015 states have internal predecessors, (17576), 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) [2023-11-06 21:53:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11016 states to 11016 states and 17576 transitions. [2023-11-06 21:53:40,578 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11016 states and 17576 transitions. [2023-11-06 21:53:40,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:53:40,579 INFO L428 stractBuchiCegarLoop]: Abstraction has 11016 states and 17576 transitions. [2023-11-06 21:53:40,579 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-06 21:53:40,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11016 states and 17576 transitions. [2023-11-06 21:53:40,615 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4438 [2023-11-06 21:53:40,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 21:53:40,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 21:53:40,616 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] [2023-11-06 21:53:40,616 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:40,617 INFO L748 eck$LassoCheckResult]: Stem: 65075#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 65076#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; 65105#L404 assume !(1 == ~c_req_up~0); 65158#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 65044#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 65045#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 65213#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 65097#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 65098#L435-1 assume !(0 == ~e_f~0); 65054#L440-1 assume !(0 == ~e_g~0); 65055#L445-1 assume !(0 == ~e_e~0); 65108#L450-1 assume !(0 == ~e_c~0); 65042#L455-1 assume !(0 == ~e_wl~0); 65043#L460-1 assume !(1 == ~wl_pc~0); 65198#$Ultimate##44 assume !(2 == ~wl_pc~0); 65137#L473 assume !(1 == ~c1_pc~0); 65240#L483 assume !(1 == ~c2_pc~0); 65020#L492 assume !(1 == ~wb_pc~0); 65130#L501 assume !(1 == ~e_c~0); 65131#L510-1 assume !(1 == ~e_e~0); 65046#L515-1 assume !(1 == ~e_f~0); 65047#L520-1 assume !(1 == ~e_g~0); 65109#L525-1 assume !(1 == ~e_c~0); 65110#L530-1 assume !(1 == ~e_wl~0); 65210#L672-1 assume !false; 66474#L542 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; 70648#L377 [2023-11-06 21:53:40,617 INFO L750 eck$LassoCheckResult]: Loop: 70648#L377 assume !false; 72306#L295 assume 0 == ~wl_st~0; 72304#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 72300#L321 assume !(0 != eval_~tmp~0#1); 72301#L317 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 72321#L336 assume !(0 != eval_~tmp___0~0#1); 72316#L332 assume !(0 == ~c2_st~0); 72315#L347 assume !(0 == ~wb_st~0); 72311#L362 assume !(0 == ~r_st~0); 70648#L377 [2023-11-06 21:53:40,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:40,617 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2023-11-06 21:53:40,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:40,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106518161] [2023-11-06 21:53:40,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:40,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:40,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:53:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:40,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:53:40,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:40,724 INFO L85 PathProgramCache]: Analyzing trace with hash 969256162, now seen corresponding path program 1 times [2023-11-06 21:53:40,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:40,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343881706] [2023-11-06 21:53:40,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:40,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:40,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:53:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:40,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:53:40,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:40,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1748529686, now seen corresponding path program 1 times [2023-11-06 21:53:40,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:40,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549472196] [2023-11-06 21:53:40,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:40,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:40,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:40,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549472196] [2023-11-06 21:53:40,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549472196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:40,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:40,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:53:40,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745541827] [2023-11-06 21:53:40,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:40,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:40,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:53:40,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:53:40,800 INFO L87 Difference]: Start difference. First operand 11016 states and 17576 transitions. cyclomatic complexity: 6596 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) [2023-11-06 21:53:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:40,905 INFO L93 Difference]: Finished difference Result 17164 states and 27055 transitions. [2023-11-06 21:53:40,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17164 states and 27055 transitions. [2023-11-06 21:53:41,056 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 6956 [2023-11-06 21:53:41,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17164 states to 17164 states and 27055 transitions. [2023-11-06 21:53:41,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7102 [2023-11-06 21:53:41,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7102 [2023-11-06 21:53:41,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17164 states and 27055 transitions. [2023-11-06 21:53:41,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 21:53:41,143 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17164 states and 27055 transitions. [2023-11-06 21:53:41,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17164 states and 27055 transitions. [2023-11-06 21:53:41,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17164 to 17164. [2023-11-06 21:53:41,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17164 states, 17164 states have (on average 1.5762642740619903) internal successors, (27055), 17163 states have internal predecessors, (27055), 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) [2023-11-06 21:53:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17164 states to 17164 states and 27055 transitions. [2023-11-06 21:53:41,491 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17164 states and 27055 transitions. [2023-11-06 21:53:41,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:53:41,492 INFO L428 stractBuchiCegarLoop]: Abstraction has 17164 states and 27055 transitions. [2023-11-06 21:53:41,493 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-06 21:53:41,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17164 states and 27055 transitions. [2023-11-06 21:53:41,553 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 6956 [2023-11-06 21:53:41,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 21:53:41,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 21:53:41,554 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] [2023-11-06 21:53:41,554 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:41,554 INFO L748 eck$LassoCheckResult]: Stem: 93260#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 93261#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; 93291#L404 assume !(1 == ~c_req_up~0); 93361#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 93230#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 93231#L420-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 93470#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 95171#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 95170#L435-1 assume !(0 == ~e_f~0); 95169#L440-1 assume !(0 == ~e_g~0); 95168#L445-1 assume !(0 == ~e_e~0); 95167#L450-1 assume !(0 == ~e_c~0); 95166#L455-1 assume !(0 == ~e_wl~0); 95165#L460-1 assume !(1 == ~wl_pc~0); 95162#$Ultimate##44 assume !(2 == ~wl_pc~0); 95161#L473 assume !(1 == ~c1_pc~0); 95159#L483 assume !(1 == ~c2_pc~0); 93478#L492 assume !(1 == ~wb_pc~0); 93318#L501 assume !(1 == ~e_c~0); 93319#L510-1 assume !(1 == ~e_e~0); 93232#L515-1 assume !(1 == ~e_f~0); 93233#L520-1 assume !(1 == ~e_g~0); 93295#L525-1 assume !(1 == ~e_c~0); 93296#L530-1 assume !(1 == ~e_wl~0); 93398#L672-1 assume !false; 95172#L542 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; 104314#L377 [2023-11-06 21:53:41,554 INFO L750 eck$LassoCheckResult]: Loop: 104314#L377 assume !false; 107940#L295 assume 0 == ~wl_st~0; 107941#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 105989#L321 assume !(0 != eval_~tmp~0#1); 105990#L317 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 107010#L336 assume !(0 != eval_~tmp___0~0#1); 107388#L332 assume !(0 == ~c2_st~0); 107419#L347 assume !(0 == ~wb_st~0); 107414#L362 assume !(0 == ~r_st~0); 104314#L377 [2023-11-06 21:53:41,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:41,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2023-11-06 21:53:41,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:41,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621213476] [2023-11-06 21:53:41,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:41,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:41,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:41,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621213476] [2023-11-06 21:53:41,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621213476] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:41,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:41,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:53:41,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006656852] [2023-11-06 21:53:41,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:41,599 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 21:53:41,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:41,600 INFO L85 PathProgramCache]: Analyzing trace with hash 969256162, now seen corresponding path program 2 times [2023-11-06 21:53:41,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:41,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369191082] [2023-11-06 21:53:41,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:41,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:41,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:53:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:41,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:53:41,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:41,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:53:41,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:53:41,657 INFO L87 Difference]: Start difference. First operand 17164 states and 27055 transitions. cyclomatic complexity: 9927 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) [2023-11-06 21:53:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:41,760 INFO L93 Difference]: Finished difference Result 17112 states and 26968 transitions. [2023-11-06 21:53:41,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17112 states and 26968 transitions. [2023-11-06 21:53:41,949 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 6956 [2023-11-06 21:53:42,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17112 states to 17112 states and 26968 transitions. [2023-11-06 21:53:42,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7052 [2023-11-06 21:53:42,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7052 [2023-11-06 21:53:42,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17112 states and 26968 transitions. [2023-11-06 21:53:42,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 21:53:42,023 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17112 states and 26968 transitions. [2023-11-06 21:53:42,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states and 26968 transitions. [2023-11-06 21:53:42,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 17112. [2023-11-06 21:53:42,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17112 states, 17112 states have (on average 1.575970079476391) internal successors, (26968), 17111 states have internal predecessors, (26968), 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) [2023-11-06 21:53:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17112 states to 17112 states and 26968 transitions. [2023-11-06 21:53:42,375 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17112 states and 26968 transitions. [2023-11-06 21:53:42,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:53:42,377 INFO L428 stractBuchiCegarLoop]: Abstraction has 17112 states and 26968 transitions. [2023-11-06 21:53:42,377 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-06 21:53:42,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17112 states and 26968 transitions. [2023-11-06 21:53:42,435 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 6956 [2023-11-06 21:53:42,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 21:53:42,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 21:53:42,436 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] [2023-11-06 21:53:42,436 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:42,437 INFO L748 eck$LassoCheckResult]: Stem: 127544#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 127545#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; 127576#L404 assume !(1 == ~c_req_up~0); 127626#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 127511#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 127512#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 127686#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 127571#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 127572#L435-1 assume !(0 == ~e_f~0); 127524#L440-1 assume !(0 == ~e_g~0); 127525#L445-1 assume !(0 == ~e_e~0); 127579#L450-1 assume !(0 == ~e_c~0); 127509#L455-1 assume !(0 == ~e_wl~0); 127510#L460-1 assume !(1 == ~wl_pc~0); 127671#$Ultimate##44 assume !(2 == ~wl_pc~0); 127607#L473 assume !(1 == ~c1_pc~0); 127713#L483 assume !(1 == ~c2_pc~0); 127487#L492 assume !(1 == ~wb_pc~0); 127602#L501 assume !(1 == ~e_c~0); 127603#L510-1 assume !(1 == ~e_e~0); 127513#L515-1 assume !(1 == ~e_f~0); 127514#L520-1 assume !(1 == ~e_g~0); 127580#L525-1 assume !(1 == ~e_c~0); 127581#L530-1 assume !(1 == ~e_wl~0); 127683#L672-1 assume !false; 129632#L542 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; 137103#L377 [2023-11-06 21:53:42,437 INFO L750 eck$LassoCheckResult]: Loop: 137103#L377 assume !false; 141877#L295 assume 0 == ~wl_st~0; 141378#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 141377#L321 assume !(0 != eval_~tmp~0#1); 141376#L317 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 141336#L336 assume !(0 != eval_~tmp___0~0#1); 141024#L332 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 141020#L351 assume !(0 != eval_~tmp___1~0#1); 140965#L347 assume !(0 == ~wb_st~0); 140960#L362 assume !(0 == ~r_st~0); 137103#L377 [2023-11-06 21:53:42,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:42,437 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2023-11-06 21:53:42,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:42,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349816254] [2023-11-06 21:53:42,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:42,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:42,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:53:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:42,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:53:42,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:42,462 INFO L85 PathProgramCache]: Analyzing trace with hash -19480801, now seen corresponding path program 1 times [2023-11-06 21:53:42,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:42,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424670914] [2023-11-06 21:53:42,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:42,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:42,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:53:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:42,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:53:42,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:42,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1628503831, now seen corresponding path program 1 times [2023-11-06 21:53:42,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:42,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194693921] [2023-11-06 21:53:42,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:42,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:42,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:42,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194693921] [2023-11-06 21:53:42,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194693921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:42,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:42,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:53:42,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769789172] [2023-11-06 21:53:42,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:42,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:42,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:53:42,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:53:42,566 INFO L87 Difference]: Start difference. First operand 17112 states and 26968 transitions. cyclomatic complexity: 9892 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) [2023-11-06 21:53:42,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:42,849 INFO L93 Difference]: Finished difference Result 29109 states and 45435 transitions. [2023-11-06 21:53:42,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29109 states and 45435 transitions. [2023-11-06 21:53:43,001 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 11874 [2023-11-06 21:53:43,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29109 states to 29109 states and 45435 transitions. [2023-11-06 21:53:43,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12004 [2023-11-06 21:53:43,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12004 [2023-11-06 21:53:43,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29109 states and 45435 transitions. [2023-11-06 21:53:43,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 21:53:43,208 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29109 states and 45435 transitions. [2023-11-06 21:53:43,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29109 states and 45435 transitions. [2023-11-06 21:53:43,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29109 to 29109. [2023-11-06 21:53:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29109 states, 29109 states have (on average 1.5608574667628567) internal successors, (45435), 29108 states have internal predecessors, (45435), 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) [2023-11-06 21:53:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29109 states to 29109 states and 45435 transitions. [2023-11-06 21:53:44,015 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29109 states and 45435 transitions. [2023-11-06 21:53:44,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:53:44,019 INFO L428 stractBuchiCegarLoop]: Abstraction has 29109 states and 45435 transitions. [2023-11-06 21:53:44,019 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-11-06 21:53:44,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29109 states and 45435 transitions. [2023-11-06 21:53:44,107 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 11874 [2023-11-06 21:53:44,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 21:53:44,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 21:53:44,108 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] [2023-11-06 21:53:44,108 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:44,109 INFO L748 eck$LassoCheckResult]: Stem: 173774#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 173775#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; 173805#L404 assume !(1 == ~c_req_up~0); 173858#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 173741#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 173742#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 173919#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 173799#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 173800#L435-1 assume !(0 == ~e_f~0); 173754#L440-1 assume !(0 == ~e_g~0); 173755#L445-1 assume !(0 == ~e_e~0); 173808#L450-1 assume !(0 == ~e_c~0); 173739#L455-1 assume !(0 == ~e_wl~0); 173740#L460-1 assume !(1 == ~wl_pc~0); 173902#$Ultimate##44 assume !(2 == ~wl_pc~0); 173836#L473 assume !(1 == ~c1_pc~0); 173953#L483 assume !(1 == ~c2_pc~0); 173717#L492 assume !(1 == ~wb_pc~0); 173831#L501 assume !(1 == ~e_c~0); 173832#L510-1 assume !(1 == ~e_e~0); 173743#L515-1 assume !(1 == ~e_f~0); 173744#L520-1 assume !(1 == ~e_g~0); 173809#L525-1 assume !(1 == ~e_c~0); 173810#L530-1 assume !(1 == ~e_wl~0); 176228#L672-1 assume !false; 176229#L542 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; 188613#L377 [2023-11-06 21:53:44,109 INFO L750 eck$LassoCheckResult]: Loop: 188613#L377 assume !false; 197188#L295 assume 0 == ~wl_st~0; 197186#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 197184#L321 assume !(0 != eval_~tmp~0#1); 195819#L317 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 195816#L336 assume !(0 != eval_~tmp___0~0#1); 195814#L332 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 195765#L351 assume !(0 != eval_~tmp___1~0#1); 195811#L347 assume 0 == ~wb_st~0;havoc eval_#t~nondet7#1;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 196125#L366 assume !(0 != eval_~tmp___2~0#1); 196135#L362 assume !(0 == ~r_st~0); 188613#L377 [2023-11-06 21:53:44,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:44,110 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2023-11-06 21:53:44,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:44,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164365457] [2023-11-06 21:53:44,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:44,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:44,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:53:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:44,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:53:44,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:44,127 INFO L85 PathProgramCache]: Analyzing trace with hash -603940234, now seen corresponding path program 1 times [2023-11-06 21:53:44,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:44,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204950977] [2023-11-06 21:53:44,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:44,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:44,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:53:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:44,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:53:44,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:44,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1056024194, now seen corresponding path program 1 times [2023-11-06 21:53:44,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:44,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362538953] [2023-11-06 21:53:44,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:44,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:44,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:53:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:44,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:53:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:45,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:53:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:53:45,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.11 09:53:45 BoogieIcfgContainer [2023-11-06 21:53:45,816 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-06 21:53:45,817 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:53:45,817 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:53:45,817 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:53:45,818 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:30" (3/4) ... [2023-11-06 21:53:45,819 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-06 21:53:45,895 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 21:53:45,895 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:53:45,896 INFO L158 Benchmark]: Toolchain (without parser) took 16622.35ms. Allocated memory was 130.0MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 91.3MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 420.2MB. Max. memory is 16.1GB. [2023-11-06 21:53:45,896 INFO L158 Benchmark]: CDTParser took 0.90ms. Allocated memory is still 130.0MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:53:45,897 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.02ms. Allocated memory is still 130.0MB. Free memory was 90.9MB in the beginning and 75.9MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 21:53:45,897 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.32ms. Allocated memory is still 130.0MB. Free memory was 75.9MB in the beginning and 73.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:53:45,898 INFO L158 Benchmark]: Boogie Preprocessor took 67.35ms. Allocated memory is still 130.0MB. Free memory was 73.8MB in the beginning and 71.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:53:45,898 INFO L158 Benchmark]: RCFGBuilder took 737.05ms. Allocated memory was 130.0MB in the beginning and 174.1MB in the end (delta: 44.0MB). Free memory was 71.7MB in the beginning and 143.9MB in the end (delta: -72.3MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2023-11-06 21:53:45,899 INFO L158 Benchmark]: BuchiAutomizer took 15262.55ms. Allocated memory was 174.1MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 143.9MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 421.3MB. Max. memory is 16.1GB. [2023-11-06 21:53:45,899 INFO L158 Benchmark]: Witness Printer took 78.82ms. Allocated memory is still 2.9GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:53:45,902 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.90ms. Allocated memory is still 130.0MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.02ms. Allocated memory is still 130.0MB. Free memory was 90.9MB in the beginning and 75.9MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.32ms. Allocated memory is still 130.0MB. Free memory was 75.9MB in the beginning and 73.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.35ms. Allocated memory is still 130.0MB. Free memory was 73.8MB in the beginning and 71.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 737.05ms. Allocated memory was 130.0MB in the beginning and 174.1MB in the end (delta: 44.0MB). Free memory was 71.7MB in the beginning and 143.9MB in the end (delta: -72.3MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 15262.55ms. Allocated memory was 174.1MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 143.9MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 421.3MB. Max. memory is 16.1GB. * Witness Printer took 78.82ms. Allocated memory is still 2.9GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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 17 terminating modules (14 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function ((-1 * e_c) + 1) and consists of 3 locations. One deterministic module has affine ranking function ((-1 * e_c) + 1) and consists of 3 locations. One deterministic module has affine ranking function ((-1 * e_e) + 1) and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 29109 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.0s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 7.9s. Construction of modules took 0.4s. Büchi inclusion checks took 5.7s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 11. Automata minimization 2.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 1885 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 1.4s 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, 4258 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4255 mSDsluCounter, 7039 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2579 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 357 IncrementalHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 4460 mSDtfsCounter, 357 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT0 SILN1 SILU0 SILI5 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital80 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf96 smp100 dnf147 smp91 tf109 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 49ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 294]: 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] [L689] int __retres1 ; [L693] e_wl = 2 [L694] e_c = e_wl [L695] e_g = e_c [L696] e_f = e_g [L697] e_e = e_f [L698] wl_pc = 0 [L699] c1_pc = 0 [L700] c2_pc = 0 [L701] wb_pc = 0 [L702] wb_i = 1 [L703] c2_i = wb_i [L704] c1_i = c2_i [L705] wl_i = c1_i [L706] r_i = 0 [L707] c_req_up = 0 [L708] d = 0 [L709] c = 0 [L710] CALL start_simulation() [L400] int kernel_st ; [L403] 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, kernel_st=0, 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] [L404] 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, kernel_st=0, 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] [L415] COND TRUE (int )wl_i == 1 [L416] 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, kernel_st=0, 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] [L420] COND TRUE (int )c1_i == 1 [L421] 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, kernel_st=0, 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] [L425] COND TRUE (int )c2_i == 1 [L426] 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, kernel_st=0, 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] [L430] COND TRUE (int )wb_i == 1 [L431] 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, kernel_st=0, 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] [L435] COND FALSE !((int )r_i == 1) [L438] 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, kernel_st=0, 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] [L440] 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, kernel_st=0, 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] [L445] 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, kernel_st=0, 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] [L450] 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, kernel_st=0, 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] [L455] 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, kernel_st=0, 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] [L460] 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, kernel_st=0, 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] [L465] 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, kernel_st=0, 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] [L473] 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, kernel_st=0, 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] [L483] 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, kernel_st=0, 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] [L492] 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, kernel_st=0, 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] [L501] 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, kernel_st=0, 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] [L510] 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, kernel_st=0, 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] [L515] 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, kernel_st=0, 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] [L520] 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, kernel_st=0, 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] [L525] 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, kernel_st=0, 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] [L530] 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, kernel_st=0, 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] [L535] 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, kernel_st=0, 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] [L541] 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, kernel_st=0, 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] [L544] kernel_st = 1 [L545] CALL eval() [L286] int tmp ; [L287] int tmp___0 ; [L288] int tmp___1 ; [L289] int tmp___2 ; [L290] 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: [L294] COND TRUE 1 [L296] COND TRUE (int )wl_st == 0 [L317] COND TRUE (int )wl_st == 0 [L319] tmp = __VERIFIER_nondet_int() [L321] COND FALSE !(\read(tmp)) [L332] COND TRUE (int )c1_st == 0 [L334] tmp___0 = __VERIFIER_nondet_int() [L336] COND FALSE !(\read(tmp___0)) [L347] COND TRUE (int )c2_st == 0 [L349] tmp___1 = __VERIFIER_nondet_int() [L351] COND FALSE !(\read(tmp___1)) [L362] COND TRUE (int )wb_st == 0 [L364] tmp___2 = __VERIFIER_nondet_int() [L366] COND FALSE !(\read(tmp___2)) [L377] COND FALSE !((int )r_st == 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 294]: 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] [L689] int __retres1 ; [L693] e_wl = 2 [L694] e_c = e_wl [L695] e_g = e_c [L696] e_f = e_g [L697] e_e = e_f [L698] wl_pc = 0 [L699] c1_pc = 0 [L700] c2_pc = 0 [L701] wb_pc = 0 [L702] wb_i = 1 [L703] c2_i = wb_i [L704] c1_i = c2_i [L705] wl_i = c1_i [L706] r_i = 0 [L707] c_req_up = 0 [L708] d = 0 [L709] c = 0 [L710] CALL start_simulation() [L400] int kernel_st ; [L403] 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, kernel_st=0, 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] [L404] 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, kernel_st=0, 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] [L415] COND TRUE (int )wl_i == 1 [L416] 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, kernel_st=0, 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] [L420] COND TRUE (int )c1_i == 1 [L421] 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, kernel_st=0, 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] [L425] COND TRUE (int )c2_i == 1 [L426] 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, kernel_st=0, 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] [L430] COND TRUE (int )wb_i == 1 [L431] 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, kernel_st=0, 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] [L435] COND FALSE !((int )r_i == 1) [L438] 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, kernel_st=0, 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] [L440] 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, kernel_st=0, 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] [L445] 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, kernel_st=0, 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] [L450] 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, kernel_st=0, 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] [L455] 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, kernel_st=0, 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] [L460] 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, kernel_st=0, 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] [L465] 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, kernel_st=0, 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] [L473] 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, kernel_st=0, 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] [L483] 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, kernel_st=0, 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] [L492] 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, kernel_st=0, 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] [L501] 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, kernel_st=0, 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] [L510] 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, kernel_st=0, 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] [L515] 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, kernel_st=0, 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] [L520] 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, kernel_st=0, 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] [L525] 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, kernel_st=0, 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] [L530] 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, kernel_st=0, 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] [L535] 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, kernel_st=0, 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] [L541] 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, kernel_st=0, 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] [L544] kernel_st = 1 [L545] CALL eval() [L286] int tmp ; [L287] int tmp___0 ; [L288] int tmp___1 ; [L289] int tmp___2 ; [L290] 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: [L294] COND TRUE 1 [L296] COND TRUE (int )wl_st == 0 [L317] COND TRUE (int )wl_st == 0 [L319] tmp = __VERIFIER_nondet_int() [L321] COND FALSE !(\read(tmp)) [L332] COND TRUE (int )c1_st == 0 [L334] tmp___0 = __VERIFIER_nondet_int() [L336] COND FALSE !(\read(tmp___0)) [L347] COND TRUE (int )c2_st == 0 [L349] tmp___1 = __VERIFIER_nondet_int() [L351] COND FALSE !(\read(tmp___1)) [L362] COND TRUE (int )wb_st == 0 [L364] tmp___2 = __VERIFIER_nondet_int() [L366] COND FALSE !(\read(tmp___2)) [L377] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-06 21:53:45,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58f425da-8a5d-4586-8edf-6716233e7411/bin/uautomizer-verify-WvqO1wxjHP/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)