./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/toy1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/toy1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c40ed6d21fe4d61cae011269f1fdb95d05149cea0f3470f42c6e8f2fc8fb0d6a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:04:39,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:04:39,400 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-12 02:04:39,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:04:39,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:04:39,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:04:39,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:04:39,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:04:39,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:04:39,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:04:39,463 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:04:39,463 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-12 02:04:39,464 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-12 02:04:39,466 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-12 02:04:39,466 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-12 02:04:39,467 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-12 02:04:39,467 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-12 02:04:39,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:04:39,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-12 02:04:39,469 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:04:39,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:04:39,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:04:39,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:04:39,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-12 02:04:39,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-12 02:04:39,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-12 02:04:39,473 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:04:39,473 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:04:39,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:04:39,474 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-12 02:04:39,476 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:04:39,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:04:39,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:04:39,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:04:39,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:04:39,478 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-12 02:04:39,479 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_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/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_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c40ed6d21fe4d61cae011269f1fdb95d05149cea0f3470f42c6e8f2fc8fb0d6a [2023-11-12 02:04:39,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:04:39,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:04:39,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:04:39,894 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:04:39,895 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:04:39,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/systemc/toy1.cil.c [2023-11-12 02:04:43,003 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:04:43,320 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:04:43,330 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/sv-benchmarks/c/systemc/toy1.cil.c [2023-11-12 02:04:43,350 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/data/e17de3b8f/0dc2be131cb244a9a3f2bbcb3140a8b3/FLAG0b0ccec46 [2023-11-12 02:04:43,373 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/data/e17de3b8f/0dc2be131cb244a9a3f2bbcb3140a8b3 [2023-11-12 02:04:43,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:04:43,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:04:43,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:04:43,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:04:43,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:04:43,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:04:43" (1/1) ... [2023-11-12 02:04:43,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aebb46e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:43, skipping insertion in model container [2023-11-12 02:04:43,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:04:43" (1/1) ... [2023-11-12 02:04:43,477 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:04:43,710 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:04:43,724 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:04:43,781 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:04:43,799 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:04:43,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:43 WrapperNode [2023-11-12 02:04:43,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:04:43,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:04:43,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:04:43,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:04:43,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:43" (1/1) ... [2023-11-12 02:04:43,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:43" (1/1) ... [2023-11-12 02:04:43,858 INFO L138 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 369 [2023-11-12 02:04:43,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:04:43,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:04:43,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:04:43,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:04:43,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:43" (1/1) ... [2023-11-12 02:04:43,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:43" (1/1) ... [2023-11-12 02:04:43,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:43" (1/1) ... [2023-11-12 02:04:43,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:43" (1/1) ... [2023-11-12 02:04:43,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:43" (1/1) ... [2023-11-12 02:04:43,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:43" (1/1) ... [2023-11-12 02:04:43,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:43" (1/1) ... [2023-11-12 02:04:43,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:43" (1/1) ... [2023-11-12 02:04:43,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:04:43,915 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:04:43,915 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:04:43,915 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:04:43,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:43" (1/1) ... [2023-11-12 02:04:43,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:43,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:43,980 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:43,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-12 02:04:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:04:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:04:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:04:44,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:04:44,135 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:04:44,138 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:04:44,677 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:04:44,687 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:04:44,687 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-12 02:04:44,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:04:44 BoogieIcfgContainer [2023-11-12 02:04:44,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:04:44,703 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-12 02:04:44,704 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-12 02:04:44,708 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-12 02:04:44,708 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-12 02:04:44,709 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 02:04:43" (1/3) ... [2023-11-12 02:04:44,710 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@628d6566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 02:04:44, skipping insertion in model container [2023-11-12 02:04:44,710 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-12 02:04:44,710 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:43" (2/3) ... [2023-11-12 02:04:44,710 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@628d6566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 02:04:44, skipping insertion in model container [2023-11-12 02:04:44,711 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-12 02:04:44,711 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:04:44" (3/3) ... [2023-11-12 02:04:44,712 INFO L332 chiAutomizerObserver]: Analyzing ICFG toy1.cil.c [2023-11-12 02:04:44,778 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-12 02:04:44,778 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-12 02:04:44,778 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-12 02:04:44,778 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-12 02:04:44,778 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-12 02:04:44,778 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-12 02:04:44,779 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-12 02:04:44,779 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-12 02:04:44,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 136 states, 135 states have (on average 1.8074074074074074) internal successors, (244), 135 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:44,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2023-11-12 02:04:44,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:04:44,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:04:44,819 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-12 02:04:44,820 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-12 02:04:44,820 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-12 02:04:44,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 136 states, 135 states have (on average 1.8074074074074074) internal successors, (244), 135 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:44,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2023-11-12 02:04:44,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:04:44,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:04:44,836 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-12 02:04:44,836 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-12 02:04:44,845 INFO L748 eck$LassoCheckResult]: Stem: 28#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(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; 46#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 19#L416true assume !(1 == ~c_req_up~0); 116#L416-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 64#L427-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 74#L432-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 31#L437-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 45#L442-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 112#L447-1true assume !(0 == ~e_f~0); 34#L452-1true assume !(0 == ~e_g~0); 8#L457-1true assume !(0 == ~e_e~0); 124#L462-1true assume !(0 == ~e_c~0); 23#L467-1true assume !(0 == ~e_wl~0); 103#L472-1true assume !(1 == ~wl_pc~0); 100#$Ultimate##44true assume !(2 == ~wl_pc~0); 95#L485true assume !(1 == ~c1_pc~0); 24#L495true assume !(1 == ~c2_pc~0); 77#L504true assume !(1 == ~wb_pc~0); 99#L513true assume !(1 == ~e_c~0); 15#L522-1true assume !(1 == ~e_e~0); 109#L527-1true assume !(1 == ~e_f~0); 36#L532-1true assume !(1 == ~e_g~0); 85#L537-1true assume !(1 == ~e_c~0); 56#L542-1true assume !(1 == ~e_wl~0); 106#L684-1true [2023-11-12 02:04:44,846 INFO L750 eck$LassoCheckResult]: Loop: 106#L684-1true assume !false; 136#L554true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 17#L389true assume !true; 83#eval_returnLabel#1true havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 22#L560true assume !(1 == ~c_req_up~0); 102#L560-2true start_simulation_~kernel_st~0#1 := 3; 113#L572true assume 0 == ~e_f~0;~e_f~0 := 1; 21#L572-2true assume 0 == ~e_g~0;~e_g~0 := 1; 50#L577-1true assume 0 == ~e_e~0;~e_e~0 := 1; 32#L582-1true assume 0 == ~e_c~0;~e_c~0 := 1; 42#L587-1true assume !(0 == ~e_wl~0); 57#L592-1true assume !(1 == ~wl_pc~0); 41#$Ultimate##257true assume !(2 == ~wl_pc~0); 58#L605true assume !(1 == ~c1_pc~0); 7#L615true assume !(1 == ~c2_pc~0); 47#L624true assume !(1 == ~wb_pc~0); 130#L633true assume 1 == ~e_c~0;~r_st~0 := 0; 89#L642-1true assume 1 == ~e_e~0;~e_e~0 := 2; 25#L647-1true assume 1 == ~e_f~0;~e_f~0 := 2; 10#L652-1true assume 1 == ~e_g~0;~e_g~0 := 2; 90#L657-1true assume 1 == ~e_c~0;~e_c~0 := 2; 81#L662-1true assume !(1 == ~e_wl~0); 107#L667-1true assume 0 == ~wl_st~0; 106#L684-1true [2023-11-12 02:04:44,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:44,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2023-11-12 02:04:44,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:44,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046731558] [2023-11-12 02:04:44,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:44,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:45,212 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-12 02:04:45,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:45,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046731558] [2023-11-12 02:04:45,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046731558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:45,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:45,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:45,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650840319] [2023-11-12 02:04:45,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:45,222 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:04:45,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:45,223 INFO L85 PathProgramCache]: Analyzing trace with hash 2134822857, now seen corresponding path program 1 times [2023-11-12 02:04:45,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:45,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436519394] [2023-11-12 02:04:45,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:45,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:45,246 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-12 02:04:45,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:45,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436519394] [2023-11-12 02:04:45,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436519394] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:45,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:45,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:04:45,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094111700] [2023-11-12 02:04:45,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:45,249 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-12 02:04:45,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:45,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:04:45,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:04:45,289 INFO L87 Difference]: Start difference. First operand has 136 states, 135 states have (on average 1.8074074074074074) internal successors, (244), 135 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:45,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:45,311 INFO L93 Difference]: Finished difference Result 132 states and 226 transitions. [2023-11-12 02:04:45,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 226 transitions. [2023-11-12 02:04:45,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2023-11-12 02:04:45,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 126 states and 220 transitions. [2023-11-12 02:04:45,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2023-11-12 02:04:45,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2023-11-12 02:04:45,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 220 transitions. [2023-11-12 02:04:45,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:04:45,332 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 220 transitions. [2023-11-12 02:04:45,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 220 transitions. [2023-11-12 02:04:45,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-11-12 02:04:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.746031746031746) internal successors, (220), 125 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 220 transitions. [2023-11-12 02:04:45,374 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 220 transitions. [2023-11-12 02:04:45,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:04:45,380 INFO L428 stractBuchiCegarLoop]: Abstraction has 126 states and 220 transitions. [2023-11-12 02:04:45,380 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-12 02:04:45,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 220 transitions. [2023-11-12 02:04:45,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2023-11-12 02:04:45,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:04:45,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:04:45,386 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-12 02:04:45,386 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-12 02:04:45,387 INFO L748 eck$LassoCheckResult]: Stem: 329#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(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; 330#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 309#L416 assume !(1 == ~c_req_up~0); 311#L416-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 372#L427-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 373#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 336#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 337#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 356#L447-1 assume !(0 == ~e_f~0); 342#L452-1 assume !(0 == ~e_g~0); 289#L457-1 assume !(0 == ~e_e~0); 290#L462-1 assume !(0 == ~e_c~0); 319#L467-1 assume !(0 == ~e_wl~0); 320#L472-1 assume !(1 == ~wl_pc~0); 395#$Ultimate##44 assume !(2 == ~wl_pc~0); 393#L485 assume !(1 == ~c1_pc~0); 321#L495 assume !(1 == ~c2_pc~0); 323#L504 assume !(1 == ~wb_pc~0); 382#L513 assume !(1 == ~e_c~0); 300#L522-1 assume !(1 == ~e_e~0); 301#L527-1 assume !(1 == ~e_f~0); 343#L532-1 assume !(1 == ~e_g~0); 344#L537-1 assume !(1 == ~e_c~0); 366#L542-1 assume !(1 == ~e_wl~0); 280#L684-1 [2023-11-12 02:04:45,387 INFO L750 eck$LassoCheckResult]: Loop: 280#L684-1 assume !false; 399#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 305#L389 assume !false; 306#L307 assume !(0 == ~wl_st~0); 361#L311 assume !(0 == ~c1_st~0); 362#L314 assume !(0 == ~c2_st~0); 281#L317 assume !(0 == ~wb_st~0); 283#L320 assume !(0 == ~r_st~0); 386#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 316#L560 assume !(1 == ~c_req_up~0); 317#L560-2 start_simulation_~kernel_st~0#1 := 3; 397#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 314#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 315#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 338#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 339#L587-1 assume !(0 == ~e_wl~0); 353#L592-1 assume !(1 == ~wl_pc~0); 352#$Ultimate##257 assume !(2 == ~wl_pc~0); 308#L605 assume !(1 == ~c1_pc~0); 286#L615 assume !(1 == ~c2_pc~0); 287#L624 assume !(1 == ~wb_pc~0); 358#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 390#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 324#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 293#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 294#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 387#L662-1 assume !(1 == ~e_wl~0); 388#L667-1 assume 0 == ~wl_st~0; 280#L684-1 [2023-11-12 02:04:45,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:45,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2023-11-12 02:04:45,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:45,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812617155] [2023-11-12 02:04:45,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:45,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:45,522 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-12 02:04:45,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:45,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812617155] [2023-11-12 02:04:45,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812617155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:45,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:45,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:45,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068536679] [2023-11-12 02:04:45,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:45,524 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:04:45,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:45,526 INFO L85 PathProgramCache]: Analyzing trace with hash -423214340, now seen corresponding path program 1 times [2023-11-12 02:04:45,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:45,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372443704] [2023-11-12 02:04:45,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:45,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:45,610 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-12 02:04:45,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:45,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372443704] [2023-11-12 02:04:45,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372443704] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:45,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:45,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:04:45,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057666484] [2023-11-12 02:04:45,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:45,613 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-12 02:04:45,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:45,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:04:45,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:45,614 INFO L87 Difference]: Start difference. First operand 126 states and 220 transitions. cyclomatic complexity: 95 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:45,640 INFO L93 Difference]: Finished difference Result 126 states and 219 transitions. [2023-11-12 02:04:45,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 219 transitions. [2023-11-12 02:04:45,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2023-11-12 02:04:45,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 219 transitions. [2023-11-12 02:04:45,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2023-11-12 02:04:45,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2023-11-12 02:04:45,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 219 transitions. [2023-11-12 02:04:45,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:04:45,648 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 219 transitions. [2023-11-12 02:04:45,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 219 transitions. [2023-11-12 02:04:45,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-11-12 02:04:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.7380952380952381) internal successors, (219), 125 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 219 transitions. [2023-11-12 02:04:45,659 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 219 transitions. [2023-11-12 02:04:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:04:45,660 INFO L428 stractBuchiCegarLoop]: Abstraction has 126 states and 219 transitions. [2023-11-12 02:04:45,661 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-12 02:04:45,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 219 transitions. [2023-11-12 02:04:45,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2023-11-12 02:04:45,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:04:45,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:04:45,665 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-12 02:04:45,665 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-12 02:04:45,665 INFO L748 eck$LassoCheckResult]: Stem: 588#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(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; 589#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 568#L416 assume !(1 == ~c_req_up~0); 570#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 631#L427-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 632#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 597#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 598#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 615#L447-1 assume !(0 == ~e_f~0); 601#L452-1 assume !(0 == ~e_g~0); 548#L457-1 assume !(0 == ~e_e~0); 549#L462-1 assume !(0 == ~e_c~0); 578#L467-1 assume !(0 == ~e_wl~0); 579#L472-1 assume !(1 == ~wl_pc~0); 654#$Ultimate##44 assume !(2 == ~wl_pc~0); 652#L485 assume !(1 == ~c1_pc~0); 580#L495 assume !(1 == ~c2_pc~0); 582#L504 assume !(1 == ~wb_pc~0); 641#L513 assume !(1 == ~e_c~0); 559#L522-1 assume !(1 == ~e_e~0); 560#L527-1 assume !(1 == ~e_f~0); 602#L532-1 assume !(1 == ~e_g~0); 603#L537-1 assume !(1 == ~e_c~0); 625#L542-1 assume !(1 == ~e_wl~0); 539#L684-1 [2023-11-12 02:04:45,666 INFO L750 eck$LassoCheckResult]: Loop: 539#L684-1 assume !false; 658#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 564#L389 assume !false; 565#L307 assume !(0 == ~wl_st~0); 620#L311 assume !(0 == ~c1_st~0); 621#L314 assume !(0 == ~c2_st~0); 540#L317 assume !(0 == ~wb_st~0); 542#L320 assume !(0 == ~r_st~0); 645#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 575#L560 assume !(1 == ~c_req_up~0); 576#L560-2 start_simulation_~kernel_st~0#1 := 3; 656#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 573#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 574#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 595#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 596#L587-1 assume !(0 == ~e_wl~0); 612#L592-1 assume 1 == ~wl_pc~0; 626#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 567#L605 assume !(1 == ~c1_pc~0); 545#L615 assume !(1 == ~c2_pc~0); 546#L624 assume !(1 == ~wb_pc~0); 617#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 649#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 583#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 552#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 553#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 646#L662-1 assume !(1 == ~e_wl~0); 647#L667-1 assume 0 == ~wl_st~0; 539#L684-1 [2023-11-12 02:04:45,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:45,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2023-11-12 02:04:45,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:45,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966955322] [2023-11-12 02:04:45,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:45,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:45,788 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-12 02:04:45,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:45,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966955322] [2023-11-12 02:04:45,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966955322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:45,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:45,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:45,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115576068] [2023-11-12 02:04:45,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:45,790 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:04:45,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:45,791 INFO L85 PathProgramCache]: Analyzing trace with hash -972474061, now seen corresponding path program 1 times [2023-11-12 02:04:45,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:45,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959741838] [2023-11-12 02:04:45,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:45,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:45,824 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-12 02:04:45,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:45,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959741838] [2023-11-12 02:04:45,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959741838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:45,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:45,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:45,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654755598] [2023-11-12 02:04:45,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:45,826 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-12 02:04:45,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:45,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:04:45,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:45,827 INFO L87 Difference]: Start difference. First operand 126 states and 219 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:45,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:45,846 INFO L93 Difference]: Finished difference Result 126 states and 218 transitions. [2023-11-12 02:04:45,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 218 transitions. [2023-11-12 02:04:45,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2023-11-12 02:04:45,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 218 transitions. [2023-11-12 02:04:45,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2023-11-12 02:04:45,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2023-11-12 02:04:45,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 218 transitions. [2023-11-12 02:04:45,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:04:45,853 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 218 transitions. [2023-11-12 02:04:45,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 218 transitions. [2023-11-12 02:04:45,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-11-12 02:04:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.7301587301587302) internal successors, (218), 125 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 218 transitions. [2023-11-12 02:04:45,865 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 218 transitions. [2023-11-12 02:04:45,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:04:45,866 INFO L428 stractBuchiCegarLoop]: Abstraction has 126 states and 218 transitions. [2023-11-12 02:04:45,866 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-12 02:04:45,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 218 transitions. [2023-11-12 02:04:45,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2023-11-12 02:04:45,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:04:45,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:04:45,870 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-12 02:04:45,870 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-12 02:04:45,871 INFO L748 eck$LassoCheckResult]: Stem: 847#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(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; 848#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 827#L416 assume !(1 == ~c_req_up~0); 829#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 890#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 891#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 856#L437-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 857#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 874#L447-1 assume !(0 == ~e_f~0); 860#L452-1 assume !(0 == ~e_g~0); 807#L457-1 assume !(0 == ~e_e~0); 808#L462-1 assume !(0 == ~e_c~0); 837#L467-1 assume !(0 == ~e_wl~0); 838#L472-1 assume !(1 == ~wl_pc~0); 913#$Ultimate##44 assume !(2 == ~wl_pc~0); 911#L485 assume !(1 == ~c1_pc~0); 839#L495 assume !(1 == ~c2_pc~0); 841#L504 assume !(1 == ~wb_pc~0); 900#L513 assume !(1 == ~e_c~0); 818#L522-1 assume !(1 == ~e_e~0); 819#L527-1 assume !(1 == ~e_f~0); 861#L532-1 assume !(1 == ~e_g~0); 862#L537-1 assume !(1 == ~e_c~0); 884#L542-1 assume !(1 == ~e_wl~0); 798#L684-1 [2023-11-12 02:04:45,871 INFO L750 eck$LassoCheckResult]: Loop: 798#L684-1 assume !false; 917#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 823#L389 assume !false; 824#L307 assume !(0 == ~wl_st~0); 879#L311 assume !(0 == ~c1_st~0); 880#L314 assume !(0 == ~c2_st~0); 799#L317 assume !(0 == ~wb_st~0); 801#L320 assume !(0 == ~r_st~0); 904#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 834#L560 assume !(1 == ~c_req_up~0); 835#L560-2 start_simulation_~kernel_st~0#1 := 3; 915#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 832#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 833#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 854#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 855#L587-1 assume !(0 == ~e_wl~0); 871#L592-1 assume 1 == ~wl_pc~0; 885#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 826#L605 assume !(1 == ~c1_pc~0); 804#L615 assume !(1 == ~c2_pc~0); 805#L624 assume !(1 == ~wb_pc~0); 876#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 908#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 842#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 811#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 812#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 905#L662-1 assume !(1 == ~e_wl~0); 906#L667-1 assume 0 == ~wl_st~0; 798#L684-1 [2023-11-12 02:04:45,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:45,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2023-11-12 02:04:45,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:45,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944785013] [2023-11-12 02:04:45,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:45,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:45,912 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-12 02:04:45,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:45,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944785013] [2023-11-12 02:04:45,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944785013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:45,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:45,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:45,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302957668] [2023-11-12 02:04:45,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:45,914 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:04:45,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:45,915 INFO L85 PathProgramCache]: Analyzing trace with hash -972474061, now seen corresponding path program 2 times [2023-11-12 02:04:45,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:45,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817712513] [2023-11-12 02:04:45,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:45,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:45,979 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-12 02:04:45,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:45,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817712513] [2023-11-12 02:04:45,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817712513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:45,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:45,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:45,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015142394] [2023-11-12 02:04:45,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:45,981 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-12 02:04:45,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:45,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:04:45,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:45,982 INFO L87 Difference]: Start difference. First operand 126 states and 218 transitions. cyclomatic complexity: 93 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:46,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:46,007 INFO L93 Difference]: Finished difference Result 126 states and 217 transitions. [2023-11-12 02:04:46,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 217 transitions. [2023-11-12 02:04:46,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2023-11-12 02:04:46,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 217 transitions. [2023-11-12 02:04:46,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2023-11-12 02:04:46,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2023-11-12 02:04:46,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 217 transitions. [2023-11-12 02:04:46,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:04:46,038 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 217 transitions. [2023-11-12 02:04:46,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 217 transitions. [2023-11-12 02:04:46,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-11-12 02:04:46,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.7222222222222223) internal successors, (217), 125 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:46,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 217 transitions. [2023-11-12 02:04:46,070 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 217 transitions. [2023-11-12 02:04:46,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:04:46,073 INFO L428 stractBuchiCegarLoop]: Abstraction has 126 states and 217 transitions. [2023-11-12 02:04:46,074 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-12 02:04:46,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 217 transitions. [2023-11-12 02:04:46,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2023-11-12 02:04:46,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:04:46,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:04:46,080 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-12 02:04:46,080 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-12 02:04:46,081 INFO L748 eck$LassoCheckResult]: Stem: 1106#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(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; 1107#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1086#L416 assume !(1 == ~c_req_up~0); 1088#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1149#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1150#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1115#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1116#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1133#L447-1 assume !(0 == ~e_f~0); 1119#L452-1 assume !(0 == ~e_g~0); 1066#L457-1 assume !(0 == ~e_e~0); 1067#L462-1 assume !(0 == ~e_c~0); 1096#L467-1 assume !(0 == ~e_wl~0); 1097#L472-1 assume !(1 == ~wl_pc~0); 1172#$Ultimate##44 assume !(2 == ~wl_pc~0); 1170#L485 assume !(1 == ~c1_pc~0); 1098#L495 assume !(1 == ~c2_pc~0); 1100#L504 assume !(1 == ~wb_pc~0); 1159#L513 assume !(1 == ~e_c~0); 1077#L522-1 assume !(1 == ~e_e~0); 1078#L527-1 assume !(1 == ~e_f~0); 1120#L532-1 assume !(1 == ~e_g~0); 1121#L537-1 assume !(1 == ~e_c~0); 1143#L542-1 assume !(1 == ~e_wl~0); 1057#L684-1 [2023-11-12 02:04:46,081 INFO L750 eck$LassoCheckResult]: Loop: 1057#L684-1 assume !false; 1176#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1082#L389 assume !false; 1083#L307 assume !(0 == ~wl_st~0); 1138#L311 assume !(0 == ~c1_st~0); 1139#L314 assume !(0 == ~c2_st~0); 1058#L317 assume !(0 == ~wb_st~0); 1060#L320 assume !(0 == ~r_st~0); 1163#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1093#L560 assume !(1 == ~c_req_up~0); 1094#L560-2 start_simulation_~kernel_st~0#1 := 3; 1174#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 1091#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1092#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1113#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1114#L587-1 assume !(0 == ~e_wl~0); 1130#L592-1 assume 1 == ~wl_pc~0; 1144#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1085#L605 assume !(1 == ~c1_pc~0); 1063#L615 assume !(1 == ~c2_pc~0); 1064#L624 assume !(1 == ~wb_pc~0); 1135#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 1167#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1101#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1070#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1071#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1164#L662-1 assume !(1 == ~e_wl~0); 1165#L667-1 assume 0 == ~wl_st~0; 1057#L684-1 [2023-11-12 02:04:46,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:46,082 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2023-11-12 02:04:46,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:46,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847104504] [2023-11-12 02:04:46,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:46,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:46,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:04:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:46,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:04:46,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:46,173 INFO L85 PathProgramCache]: Analyzing trace with hash -972474061, now seen corresponding path program 3 times [2023-11-12 02:04:46,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:46,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249235707] [2023-11-12 02:04:46,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:46,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:46,235 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-12 02:04:46,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:46,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249235707] [2023-11-12 02:04:46,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249235707] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:46,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:46,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:46,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229293212] [2023-11-12 02:04:46,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:46,238 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-12 02:04:46,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:46,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:04:46,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:46,241 INFO L87 Difference]: Start difference. First operand 126 states and 217 transitions. cyclomatic complexity: 92 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:46,320 INFO L93 Difference]: Finished difference Result 230 states and 393 transitions. [2023-11-12 02:04:46,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 393 transitions. [2023-11-12 02:04:46,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 183 [2023-11-12 02:04:46,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 230 states and 393 transitions. [2023-11-12 02:04:46,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 230 [2023-11-12 02:04:46,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 230 [2023-11-12 02:04:46,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 393 transitions. [2023-11-12 02:04:46,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:04:46,340 INFO L218 hiAutomatonCegarLoop]: Abstraction has 230 states and 393 transitions. [2023-11-12 02:04:46,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 393 transitions. [2023-11-12 02:04:46,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2023-11-12 02:04:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 229 states have (on average 1.7117903930131004) internal successors, (392), 228 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 392 transitions. [2023-11-12 02:04:46,368 INFO L240 hiAutomatonCegarLoop]: Abstraction has 229 states and 392 transitions. [2023-11-12 02:04:46,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:04:46,371 INFO L428 stractBuchiCegarLoop]: Abstraction has 229 states and 392 transitions. [2023-11-12 02:04:46,372 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-12 02:04:46,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 229 states and 392 transitions. [2023-11-12 02:04:46,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 182 [2023-11-12 02:04:46,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:04:46,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:04:46,380 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-12 02:04:46,380 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-12 02:04:46,381 INFO L748 eck$LassoCheckResult]: Stem: 1470#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(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; 1471#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1448#L416 assume !(1 == ~c_req_up~0); 1450#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1515#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1516#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1478#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1479#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1498#L447-1 assume !(0 == ~e_f~0); 1484#L452-1 assume !(0 == ~e_g~0); 1428#L457-1 assume !(0 == ~e_e~0); 1429#L462-1 assume !(0 == ~e_c~0); 1459#L467-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1460#L472-1 assume !(1 == ~wl_pc~0); 1540#$Ultimate##44 assume !(2 == ~wl_pc~0); 1538#L485 assume !(1 == ~c1_pc~0); 1462#L495 assume !(1 == ~c2_pc~0); 1464#L504 assume !(1 == ~wb_pc~0); 1526#L513 assume !(1 == ~e_c~0); 1439#L522-1 assume !(1 == ~e_e~0); 1440#L527-1 assume !(1 == ~e_f~0); 1485#L532-1 assume !(1 == ~e_g~0); 1486#L537-1 assume !(1 == ~e_c~0); 1509#L542-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1422#L684-1 [2023-11-12 02:04:46,383 INFO L750 eck$LassoCheckResult]: Loop: 1422#L684-1 assume !false; 1544#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1444#L389 assume !false; 1445#L307 assume !(0 == ~wl_st~0); 1504#L311 assume !(0 == ~c1_st~0); 1505#L314 assume !(0 == ~c2_st~0); 1418#L317 assume !(0 == ~wb_st~0); 1420#L320 assume !(0 == ~r_st~0); 1530#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1456#L560 assume !(1 == ~c_req_up~0); 1457#L560-2 start_simulation_~kernel_st~0#1 := 3; 1542#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 1454#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1455#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1580#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1578#L587-1 assume !(0 == ~e_wl~0); 1575#L592-1 assume !(1 == ~wl_pc~0); 1571#$Ultimate##257 assume !(2 == ~wl_pc~0); 1567#L605 assume !(1 == ~c1_pc~0); 1562#L615 assume !(1 == ~c2_pc~0); 1560#L624 assume !(1 == ~wb_pc~0); 1557#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 1555#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1553#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1551#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1550#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1549#L662-1 assume !(1 == ~e_wl~0); 1532#L667-1 assume 0 == ~wl_st~0; 1422#L684-1 [2023-11-12 02:04:46,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:46,386 INFO L85 PathProgramCache]: Analyzing trace with hash -2560361, now seen corresponding path program 1 times [2023-11-12 02:04:46,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:46,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595431980] [2023-11-12 02:04:46,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:46,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:46,456 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-12 02:04:46,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:46,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595431980] [2023-11-12 02:04:46,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595431980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:46,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:46,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:04:46,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206802846] [2023-11-12 02:04:46,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:46,459 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:04:46,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:46,459 INFO L85 PathProgramCache]: Analyzing trace with hash -423214340, now seen corresponding path program 2 times [2023-11-12 02:04:46,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:46,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236067711] [2023-11-12 02:04:46,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:46,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:46,488 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-12 02:04:46,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:46,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236067711] [2023-11-12 02:04:46,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236067711] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:46,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:46,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:04:46,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705936353] [2023-11-12 02:04:46,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:46,491 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-12 02:04:46,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:46,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:04:46,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:04:46,492 INFO L87 Difference]: Start difference. First operand 229 states and 392 transitions. cyclomatic complexity: 164 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:46,617 INFO L93 Difference]: Finished difference Result 473 states and 794 transitions. [2023-11-12 02:04:46,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 473 states and 794 transitions. [2023-11-12 02:04:46,623 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 379 [2023-11-12 02:04:46,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 473 states to 473 states and 794 transitions. [2023-11-12 02:04:46,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 473 [2023-11-12 02:04:46,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 473 [2023-11-12 02:04:46,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 473 states and 794 transitions. [2023-11-12 02:04:46,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:04:46,632 INFO L218 hiAutomatonCegarLoop]: Abstraction has 473 states and 794 transitions. [2023-11-12 02:04:46,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states and 794 transitions. [2023-11-12 02:04:46,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 430. [2023-11-12 02:04:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 430 states have (on average 1.6837209302325582) internal successors, (724), 429 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 724 transitions. [2023-11-12 02:04:46,651 INFO L240 hiAutomatonCegarLoop]: Abstraction has 430 states and 724 transitions. [2023-11-12 02:04:46,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:04:46,652 INFO L428 stractBuchiCegarLoop]: Abstraction has 430 states and 724 transitions. [2023-11-12 02:04:46,652 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-12 02:04:46,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 430 states and 724 transitions. [2023-11-12 02:04:46,656 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 378 [2023-11-12 02:04:46,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:04:46,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:04:46,658 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-12 02:04:46,658 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-12 02:04:46,658 INFO L748 eck$LassoCheckResult]: Stem: 2181#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(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; 2182#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 2160#L416 assume !(1 == ~c_req_up~0); 2162#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 2228#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 2229#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 2190#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 2191#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 2208#L447-1 assume !(0 == ~e_f~0); 2194#L452-1 assume !(0 == ~e_g~0); 2140#L457-1 assume !(0 == ~e_e~0); 2141#L462-1 assume !(0 == ~e_c~0); 2170#L467-1 assume !(0 == ~e_wl~0); 2171#L472-1 assume !(1 == ~wl_pc~0); 2260#$Ultimate##44 assume !(2 == ~wl_pc~0); 2256#L485 assume !(1 == ~c1_pc~0); 2251#L495 assume !(1 == ~c2_pc~0); 2241#L504 assume !(1 == ~wb_pc~0); 2242#L513 assume !(1 == ~e_c~0); 2151#L522-1 assume !(1 == ~e_e~0); 2152#L527-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2283#L532-1 assume !(1 == ~e_g~0); 2280#L537-1 assume !(1 == ~e_c~0); 2281#L542-1 assume !(1 == ~e_wl~0); 2221#L684-1 [2023-11-12 02:04:46,659 INFO L750 eck$LassoCheckResult]: Loop: 2221#L684-1 assume !false; 2265#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 2403#L389 assume !false; 2401#L307 assume !(0 == ~wl_st~0); 2399#L311 assume !(0 == ~c1_st~0); 2397#L314 assume !(0 == ~c2_st~0); 2395#L317 assume !(0 == ~wb_st~0); 2391#L320 assume !(0 == ~r_st~0); 2389#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 2384#L560 assume !(1 == ~c_req_up~0); 2381#L560-2 start_simulation_~kernel_st~0#1 := 3; 2378#L572 assume 0 == ~e_f~0;~e_f~0 := 1; 2376#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 2377#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 2372#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 2373#L587-1 assume !(0 == ~e_wl~0); 2296#L592-1 assume 1 == ~wl_pc~0; 2292#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 2159#L605 assume !(1 == ~c1_pc~0); 2223#L615 assume !(1 == ~c2_pc~0); 2209#L624 assume !(1 == ~wb_pc~0); 2211#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 2253#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 2175#L647-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2144#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 2145#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 2248#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2249#L667-1 assume 0 == ~wl_st~0; 2221#L684-1 [2023-11-12 02:04:46,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:46,659 INFO L85 PathProgramCache]: Analyzing trace with hash 255545497, now seen corresponding path program 1 times [2023-11-12 02:04:46,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:46,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351061053] [2023-11-12 02:04:46,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:46,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:46,716 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-12 02:04:46,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:46,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351061053] [2023-11-12 02:04:46,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351061053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:46,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:46,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:04:46,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847551342] [2023-11-12 02:04:46,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:46,719 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:04:46,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:46,720 INFO L85 PathProgramCache]: Analyzing trace with hash -972474123, now seen corresponding path program 1 times [2023-11-12 02:04:46,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:46,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581778356] [2023-11-12 02:04:46,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:46,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:46,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:04:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:46,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:04:47,172 INFO L210 LassoAnalysis]: Preferences: [2023-11-12 02:04:47,173 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-12 02:04:47,173 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-12 02:04:47,173 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-12 02:04:47,174 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-12 02:04:47,174 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:47,174 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-12 02:04:47,174 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-12 02:04:47,174 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration7_Loop [2023-11-12 02:04:47,174 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-12 02:04:47,175 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-12 02:04:47,198 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-12 02:04:47,210 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-12 02:04:47,216 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-12 02:04:47,220 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-12 02:04:47,223 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-12 02:04:47,226 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-12 02:04:47,230 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-12 02:04:47,236 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-12 02:04:47,240 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-12 02:04:47,243 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-12 02:04:47,246 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-12 02:04:47,249 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-12 02:04:47,252 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-12 02:04:47,259 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-12 02:04:47,262 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-12 02:04:47,266 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-12 02:04:47,269 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-12 02:04:47,275 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-12 02:04:47,279 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-12 02:04:47,290 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-12 02:04:47,292 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-12 02:04:47,296 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-12 02:04:47,303 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-12 02:04:47,305 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-12 02:04:47,308 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-12 02:04:47,314 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-12 02:04:47,683 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-12 02:04:47,684 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-12 02:04:47,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:47,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:47,693 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:47,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-12 02:04:47,702 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:04:47,702 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:04:47,746 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-12 02:04:47,746 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-12 02:04:47,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-11-12 02:04:47,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:47,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:47,755 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:47,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-12 02:04:47,761 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:04:47,762 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:04:47,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:47,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:47,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:47,796 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:47,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-12 02:04:47,805 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-12 02:04:47,805 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:04:47,848 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-12 02:04:47,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:47,853 INFO L210 LassoAnalysis]: Preferences: [2023-11-12 02:04:47,853 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-12 02:04:47,853 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-12 02:04:47,853 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-12 02:04:47,853 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-12 02:04:47,853 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:47,853 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-12 02:04:47,854 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-12 02:04:47,854 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration7_Loop [2023-11-12 02:04:47,854 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-12 02:04:47,854 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-12 02:04:47,857 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-12 02:04:47,863 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-12 02:04:47,869 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-12 02:04:47,880 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-12 02:04:47,884 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-12 02:04:47,886 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-12 02:04:47,891 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-12 02:04:47,895 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-12 02:04:47,901 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-12 02:04:47,903 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-12 02:04:47,907 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-12 02:04:47,909 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-12 02:04:47,912 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-12 02:04:47,915 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-12 02:04:47,920 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-12 02:04:47,924 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-12 02:04:47,927 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-12 02:04:47,934 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-12 02:04:47,938 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-12 02:04:47,944 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-12 02:04:47,947 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-12 02:04:47,950 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-12 02:04:47,953 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-12 02:04:47,984 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-12 02:04:47,986 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-12 02:04:47,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-12 02:04:48,280 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-12 02:04:48,285 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-12 02:04:48,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:48,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:48,288 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:48,293 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-12 02:04:48,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-12 02:04:48,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:04:48,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:04:48,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:04:48,311 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-12 02:04:48,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:04:48,314 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-12 02:04:48,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:04:48,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:04:48,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:48,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:48,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:48,342 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:48,350 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-12 02:04:48,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-12 02:04:48,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:04:48,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:04:48,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:04:48,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:04:48,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:04:48,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:04:48,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:04:48,376 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-12 02:04:48,380 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-12 02:04:48,380 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-12 02:04:48,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:48,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:48,432 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:48,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-12 02:04:48,439 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-12 02:04:48,439 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-12 02:04:48,440 INFO L513 LassoAnalysis]: Proved termination. [2023-11-12 02:04:48,440 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2023-11-12 02:04:48,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-11-12 02:04:48,449 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-12 02:04:48,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:48,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-12 02:04:48,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:04:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:48,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:04:48,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:04:48,727 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-12 02:04:48,733 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-12 02:04:48,734 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 430 states and 724 transitions. cyclomatic complexity: 297 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:48,886 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 430 states and 724 transitions. cyclomatic complexity: 297. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1467 states and 2452 transitions. Complement of second has 5 states. [2023-11-12 02:04:48,887 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-12 02:04:48,889 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-12 02:04:48,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-11-12 02:04:48,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 380 transitions. Stem has 24 letters. Loop has 28 letters. [2023-11-12 02:04:48,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:04:48,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 380 transitions. Stem has 52 letters. Loop has 28 letters. [2023-11-12 02:04:48,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:04:48,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 380 transitions. Stem has 24 letters. Loop has 56 letters. [2023-11-12 02:04:48,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:04:48,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1467 states and 2452 transitions. [2023-11-12 02:04:48,920 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1009 [2023-11-12 02:04:48,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1467 states to 1467 states and 2452 transitions. [2023-11-12 02:04:48,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1069 [2023-11-12 02:04:48,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1076 [2023-11-12 02:04:48,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1467 states and 2452 transitions. [2023-11-12 02:04:48,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:04:48,942 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1467 states and 2452 transitions. [2023-11-12 02:04:48,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states and 2452 transitions. [2023-11-12 02:04:48,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1207. [2023-11-12 02:04:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1207 states have (on average 1.671913835956918) internal successors, (2018), 1206 states have internal predecessors, (2018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:48,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 2018 transitions. [2023-11-12 02:04:48,977 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1207 states and 2018 transitions. [2023-11-12 02:04:48,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:48,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:04:48,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:04:48,983 INFO L87 Difference]: Start difference. First operand 1207 states and 2018 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:49,116 INFO L93 Difference]: Finished difference Result 2357 states and 3868 transitions. [2023-11-12 02:04:49,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2357 states and 3868 transitions. [2023-11-12 02:04:49,141 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1411 [2023-11-12 02:04:49,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2357 states to 2357 states and 3868 transitions. [2023-11-12 02:04:49,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1549 [2023-11-12 02:04:49,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1549 [2023-11-12 02:04:49,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2357 states and 3868 transitions. [2023-11-12 02:04:49,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:04:49,169 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2357 states and 3868 transitions. [2023-11-12 02:04:49,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states and 3868 transitions. [2023-11-12 02:04:49,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2294. [2023-11-12 02:04:49,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:49,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 2294 states have (on average 1.6547515257192678) internal successors, (3796), 2293 states have internal predecessors, (3796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:49,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 3796 transitions. [2023-11-12 02:04:49,264 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2294 states and 3796 transitions. [2023-11-12 02:04:49,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:04:49,265 INFO L428 stractBuchiCegarLoop]: Abstraction has 2294 states and 3796 transitions. [2023-11-12 02:04:49,266 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-12 02:04:49,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2294 states and 3796 transitions. [2023-11-12 02:04:49,282 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1405 [2023-11-12 02:04:49,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:04:49,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:04:49,283 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-12 02:04:49,283 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-12 02:04:49,284 INFO L748 eck$LassoCheckResult]: Stem: 7866#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(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; 7867#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 7831#L416 assume !(1 == ~c_req_up~0); 7833#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 7963#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 7964#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 7878#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 7879#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 8046#L447-1 assume !(0 == ~e_f~0); 8047#L452-1 assume !(0 == ~e_g~0); 7793#L457-1 assume !(0 == ~e_e~0); 7794#L462-1 assume 0 == ~e_c~0;~e_c~0 := 1; 8073#L467-1 assume !(0 == ~e_wl~0); 8035#L472-1 assume !(1 == ~wl_pc~0); 8036#$Ultimate##44 assume !(2 == ~wl_pc~0); 8106#L485 assume !(1 == ~c1_pc~0); 8103#L495 assume !(1 == ~c2_pc~0); 8102#L504 assume !(1 == ~wb_pc~0); 8028#L513 assume !(1 == ~e_c~0); 8029#L522-1 assume !(1 == ~e_e~0); 8043#L527-1 assume !(1 == ~e_f~0); 8044#L532-1 assume !(1 == ~e_g~0); 8088#L537-1 assume !(1 == ~e_c~0); 8089#L542-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 7945#L684-1 [2023-11-12 02:04:49,284 INFO L750 eck$LassoCheckResult]: Loop: 7945#L684-1 assume !false; 8898#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 8896#L389 assume !false; 8853#L307 assume !(0 == ~wl_st~0); 8854#L311 assume !(0 == ~c1_st~0); 8846#L314 assume !(0 == ~c2_st~0); 8848#L317 assume !(0 == ~wb_st~0); 9045#L320 assume !(0 == ~r_st~0); 9042#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 9041#L560 assume !(1 == ~c_req_up~0); 8824#L560-2 start_simulation_~kernel_st~0#1 := 3; 8801#L572 assume !(0 == ~e_f~0); 8802#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 9049#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 9048#L582-1 assume 0 == ~e_c~0;~e_c~0 := 1; 8815#L587-1 assume !(0 == ~e_wl~0); 8811#L592-1 assume 1 == ~wl_pc~0; 8808#L598 assume 1 == ~e_wl~0;~wl_st~0 := 0; 8809#L605 assume !(1 == ~c1_pc~0); 8930#L615 assume !(1 == ~c2_pc~0); 8928#L624 assume !(1 == ~wb_pc~0); 8925#L633 assume 1 == ~e_c~0;~r_st~0 := 0; 8923#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 8921#L647-1 assume !(1 == ~e_f~0); 8919#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 8918#L657-1 assume 1 == ~e_c~0;~e_c~0 := 2; 8913#L662-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 8903#L667-1 assume 0 == ~wl_st~0; 7945#L684-1 [2023-11-12 02:04:49,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:49,285 INFO L85 PathProgramCache]: Analyzing trace with hash 842411091, now seen corresponding path program 1 times [2023-11-12 02:04:49,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:49,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157970207] [2023-11-12 02:04:49,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:49,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:49,335 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-12 02:04:49,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:49,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157970207] [2023-11-12 02:04:49,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157970207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:49,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:49,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:04:49,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474573599] [2023-11-12 02:04:49,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:49,337 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:04:49,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:49,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1735992313, now seen corresponding path program 1 times [2023-11-12 02:04:49,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:49,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592745291] [2023-11-12 02:04:49,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:49,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:49,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:04:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:49,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:04:49,686 INFO L210 LassoAnalysis]: Preferences: [2023-11-12 02:04:49,686 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-12 02:04:49,686 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-12 02:04:49,686 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-12 02:04:49,686 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-12 02:04:49,687 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:49,687 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-12 02:04:49,687 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-12 02:04:49,687 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration8_Loop [2023-11-12 02:04:49,687 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-12 02:04:49,687 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-12 02:04:49,690 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-12 02:04:49,695 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-12 02:04:49,698 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-12 02:04:49,701 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-12 02:04:49,704 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-12 02:04:49,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-12 02:04:49,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-12 02:04:49,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-12 02:04:49,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-12 02:04:49,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-12 02:04:49,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-12 02:04:49,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-12 02:04:49,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-12 02:04:49,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-12 02:04:49,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-12 02:04:49,754 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-12 02:04:49,757 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-12 02:04:49,760 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-12 02:04:49,763 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-12 02:04:49,766 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-12 02:04:49,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-12 02:04:49,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-12 02:04:49,781 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-12 02:04:49,785 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-12 02:04:49,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-12 02:04:49,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-12 02:04:50,048 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-12 02:04:50,048 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-12 02:04:50,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:50,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:50,051 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:50,067 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:04:50,067 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:04:50,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-12 02:04:50,090 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-12 02:04:50,090 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-12 02:04:50,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:50,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:50,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:50,106 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:50,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-12 02:04:50,117 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:04:50,117 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:04:50,140 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-12 02:04:50,140 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-12 02:04:50,145 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:50,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:50,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:50,147 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:50,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-12 02:04:50,156 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:04:50,157 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:04:50,185 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-12 02:04:50,185 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-12 02:04:50,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:50,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:50,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:50,196 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:50,200 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:04:50,201 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:04:50,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-12 02:04:50,245 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-12 02:04:50,245 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-12 02:04:50,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:50,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:50,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:50,259 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:50,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-12 02:04:50,264 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:04:50,264 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:04:50,287 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-12 02:04:50,287 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-12 02:04:50,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:50,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:50,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:50,298 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:50,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-12 02:04:50,305 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:04:50,305 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:04:50,332 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:50,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:50,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:50,333 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:50,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-12 02:04:50,339 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-12 02:04:50,339 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:04:50,364 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-12 02:04:50,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:50,374 INFO L210 LassoAnalysis]: Preferences: [2023-11-12 02:04:50,374 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-12 02:04:50,374 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-12 02:04:50,374 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-12 02:04:50,374 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-12 02:04:50,374 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:50,374 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-12 02:04:50,374 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-12 02:04:50,374 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration8_Loop [2023-11-12 02:04:50,374 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-12 02:04:50,375 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-12 02:04:50,377 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-12 02:04:50,381 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-12 02:04:50,383 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-12 02:04:50,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-12 02:04:50,389 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-12 02:04:50,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-12 02:04:50,399 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-12 02:04:50,402 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-12 02:04:50,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-12 02:04:50,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-12 02:04:50,415 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-12 02:04:50,421 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-12 02:04:50,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-12 02:04:50,425 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-12 02:04:50,431 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-12 02:04:50,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-12 02:04:50,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-12 02:04:50,437 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-12 02:04:50,442 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-12 02:04:50,448 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-12 02:04:50,451 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-12 02:04:50,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-12 02:04:50,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-12 02:04:50,462 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-12 02:04:50,465 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-12 02:04:50,470 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-12 02:04:50,788 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-12 02:04:50,788 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-12 02:04:50,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:50,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:50,797 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:50,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:04:50,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-12 02:04:50,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:04:50,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:04:50,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:04:50,831 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-12 02:04:50,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:04:50,833 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-12 02:04:50,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:04:50,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:04:50,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:50,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:50,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:50,855 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:50,860 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-12 02:04:50,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-12 02:04:50,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:04:50,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:04:50,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:04:50,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:04:50,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:04:50,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:04:50,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:04:50,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:04:50,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:50,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:50,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:50,897 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:50,904 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-12 02:04:50,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-12 02:04:50,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:04:50,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:04:50,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:04:50,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:04:50,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:04:50,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:04:50,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:04:50,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:04:50,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:50,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:50,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:50,941 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:50,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-12 02:04:50,947 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-12 02:04:50,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:04:50,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:04:50,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:04:50,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:04:50,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:04:50,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:04:50,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:04:50,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:04:50,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:50,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:50,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:50,979 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:50,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-12 02:04:50,985 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-12 02:04:50,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:04:50,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:04:51,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:04:51,000 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-12 02:04:51,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:04:51,002 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-12 02:04:51,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:04:51,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:04:51,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:51,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:51,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:51,034 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:51,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-12 02:04:51,048 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-12 02:04:51,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:04:51,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:04:51,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:04:51,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:04:51,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:04:51,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:04:51,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:04:51,074 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-12 02:04:51,077 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-12 02:04:51,077 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-12 02:04:51,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:51,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:51,081 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:51,090 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-12 02:04:51,091 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-12 02:04:51,091 INFO L513 LassoAnalysis]: Proved termination. [2023-11-12 02:04:51,091 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2023-11-12 02:04:51,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-12 02:04:51,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:51,102 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-12 02:04:51,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:51,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-12 02:04:51,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:04:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:51,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:04:51,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:04:51,330 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-12 02:04:51,331 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-12 02:04:51,331 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2294 states and 3796 transitions. cyclomatic complexity: 1518 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:51,416 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2294 states and 3796 transitions. cyclomatic complexity: 1518. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3420 states and 5673 transitions. Complement of second has 5 states. [2023-11-12 02:04:51,416 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-12 02:04:51,417 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-12 02:04:51,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-11-12 02:04:51,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 377 transitions. Stem has 24 letters. Loop has 28 letters. [2023-11-12 02:04:51,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:04:51,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 377 transitions. Stem has 52 letters. Loop has 28 letters. [2023-11-12 02:04:51,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:04:51,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 377 transitions. Stem has 24 letters. Loop has 56 letters. [2023-11-12 02:04:51,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:04:51,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3420 states and 5673 transitions. [2023-11-12 02:04:51,458 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1999 [2023-11-12 02:04:51,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3420 states to 3420 states and 5673 transitions. [2023-11-12 02:04:51,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2103 [2023-11-12 02:04:51,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2110 [2023-11-12 02:04:51,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3420 states and 5673 transitions. [2023-11-12 02:04:51,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:04:51,498 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3420 states and 5673 transitions. [2023-11-12 02:04:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3420 states and 5673 transitions. [2023-11-12 02:04:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3420 to 2078. [2023-11-12 02:04:51,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2078 states, 2078 states have (on average 1.6544754571703562) internal successors, (3438), 2077 states have internal predecessors, (3438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 3438 transitions. [2023-11-12 02:04:51,569 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2078 states and 3438 transitions. [2023-11-12 02:04:51,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:51,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:04:51,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:04:51,570 INFO L87 Difference]: Start difference. First operand 2078 states and 3438 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:51,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:51,689 INFO L93 Difference]: Finished difference Result 2143 states and 3497 transitions. [2023-11-12 02:04:51,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2143 states and 3497 transitions. [2023-11-12 02:04:51,712 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1220 [2023-11-12 02:04:51,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2143 states to 2143 states and 3497 transitions. [2023-11-12 02:04:51,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1345 [2023-11-12 02:04:51,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1345 [2023-11-12 02:04:51,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2143 states and 3497 transitions. [2023-11-12 02:04:51,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:04:51,737 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2143 states and 3497 transitions. [2023-11-12 02:04:51,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states and 3497 transitions. [2023-11-12 02:04:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 1973. [2023-11-12 02:04:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1973 states, 1973 states have (on average 1.6426761277242778) internal successors, (3241), 1972 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 3241 transitions. [2023-11-12 02:04:51,795 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1973 states and 3241 transitions. [2023-11-12 02:04:51,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:04:51,796 INFO L428 stractBuchiCegarLoop]: Abstraction has 1973 states and 3241 transitions. [2023-11-12 02:04:51,796 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-12 02:04:51,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1973 states and 3241 transitions. [2023-11-12 02:04:51,809 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1220 [2023-11-12 02:04:51,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:04:51,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:04:51,812 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-12 02:04:51,812 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-12 02:04:51,813 INFO L748 eck$LassoCheckResult]: Stem: 17981#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(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; 17982#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 17948#L416 assume !(1 == ~c_req_up~0); 17950#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 18065#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 18066#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 18084#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 18029#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 18030#L447-1 assume !(0 == ~e_f~0); 18162#L452-1 assume !(0 == ~e_g~0); 17907#L457-1 assume !(0 == ~e_e~0); 17908#L462-1 assume !(0 == ~e_c~0); 18150#L467-1 assume !(0 == ~e_wl~0); 18126#L472-1 assume !(1 == ~wl_pc~0); 18127#$Ultimate##44 assume !(2 == ~wl_pc~0); 18183#L485 assume !(1 == ~c1_pc~0); 18180#L495 assume !(1 == ~c2_pc~0); 18179#L504 assume !(1 == ~wb_pc~0); 18119#L513 assume !(1 == ~e_c~0); 18120#L522-1 assume !(1 == ~e_e~0); 18169#L527-1 assume !(1 == ~e_f~0); 18170#L532-1 assume !(1 == ~e_g~0); 18105#L537-1 assume !(1 == ~e_c~0); 18106#L542-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 18052#L684-1 assume !false; 19485#L554 [2023-11-12 02:04:51,813 INFO L750 eck$LassoCheckResult]: Loop: 19485#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 19481#L389 assume !false; 19479#L307 assume !(0 == ~wl_st~0); 19477#L311 assume !(0 == ~c1_st~0); 19475#L314 assume !(0 == ~c2_st~0); 19473#L317 assume !(0 == ~wb_st~0); 19469#L320 assume !(0 == ~r_st~0); 19467#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 19200#L560 assume !(1 == ~c_req_up~0); 19201#L560-2 start_simulation_~kernel_st~0#1 := 3; 19743#L572 assume !(0 == ~e_f~0); 19738#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 19736#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 19734#L582-1 assume !(0 == ~e_c~0); 19732#L587-1 assume !(0 == ~e_wl~0); 19603#L592-1 assume !(1 == ~wl_pc~0); 19729#$Ultimate##257 assume !(2 == ~wl_pc~0); 19726#L605 assume !(1 == ~c1_pc~0); 19721#L615 assume !(1 == ~c2_pc~0); 19720#L624 assume !(1 == ~wb_pc~0); 19696#L633 assume !(1 == ~e_c~0); 19695#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 19694#L647-1 assume !(1 == ~e_f~0); 19693#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 19692#L657-1 assume !(1 == ~e_c~0); 19691#L662-1 assume !(1 == ~e_wl~0); 18098#L667-1 assume 0 == ~wl_st~0; 19496#L684-1 assume !false; 19485#L554 [2023-11-12 02:04:51,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:51,813 INFO L85 PathProgramCache]: Analyzing trace with hash -666177026, now seen corresponding path program 1 times [2023-11-12 02:04:51,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:51,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541576346] [2023-11-12 02:04:51,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:51,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:51,876 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-12 02:04:51,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:51,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541576346] [2023-11-12 02:04:51,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541576346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:51,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:51,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:04:51,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155472237] [2023-11-12 02:04:51,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:51,878 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:04:51,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:51,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1204821088, now seen corresponding path program 1 times [2023-11-12 02:04:51,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:51,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037464019] [2023-11-12 02:04:51,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:51,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:51,915 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-12 02:04:51,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:51,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037464019] [2023-11-12 02:04:51,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037464019] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:51,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:51,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:51,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640891329] [2023-11-12 02:04:51,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:51,920 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-12 02:04:51,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:51,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:04:51,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:04:51,921 INFO L87 Difference]: Start difference. First operand 1973 states and 3241 transitions. cyclomatic complexity: 1281 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:52,018 INFO L93 Difference]: Finished difference Result 1696 states and 2752 transitions. [2023-11-12 02:04:52,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1696 states and 2752 transitions. [2023-11-12 02:04:52,063 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 973 [2023-11-12 02:04:52,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:52,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1696 states to 1696 states and 2752 transitions. [2023-11-12 02:04:52,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1038 [2023-11-12 02:04:52,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1038 [2023-11-12 02:04:52,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1696 states and 2752 transitions. [2023-11-12 02:04:52,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:04:52,087 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1696 states and 2752 transitions. [2023-11-12 02:04:52,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states and 2752 transitions. [2023-11-12 02:04:52,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1692. [2023-11-12 02:04:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1692 states have (on average 1.624113475177305) internal successors, (2748), 1691 states have internal predecessors, (2748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:52,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 2748 transitions. [2023-11-12 02:04:52,135 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1692 states and 2748 transitions. [2023-11-12 02:04:52,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:04:52,136 INFO L428 stractBuchiCegarLoop]: Abstraction has 1692 states and 2748 transitions. [2023-11-12 02:04:52,137 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-12 02:04:52,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1692 states and 2748 transitions. [2023-11-12 02:04:52,150 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 973 [2023-11-12 02:04:52,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:04:52,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:04:52,151 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-12 02:04:52,152 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-12 02:04:52,152 INFO L748 eck$LassoCheckResult]: Stem: 21663#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(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; 21664#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 21628#L416 assume !(1 == ~c_req_up~0); 21630#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 21828#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 21852#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 21851#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 21710#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 21711#L447-1 assume !(0 == ~e_f~0); 21848#L452-1 assume !(0 == ~e_g~0); 21587#L457-1 assume !(0 == ~e_e~0); 21588#L462-1 assume !(0 == ~e_c~0); 21837#L467-1 assume !(0 == ~e_wl~0); 21808#L472-1 assume !(1 == ~wl_pc~0); 21809#$Ultimate##44 assume !(2 == ~wl_pc~0); 21798#L485 assume !(1 == ~c1_pc~0); 21783#L495 assume !(1 == ~c2_pc~0); 21854#L504 assume !(1 == ~wb_pc~0); 21801#L513 assume !(1 == ~e_c~0); 21614#L522-1 assume !(1 == ~e_e~0); 21615#L527-1 assume !(1 == ~e_f~0); 21849#L532-1 assume !(1 == ~e_g~0); 21785#L537-1 assume !(1 == ~e_c~0); 21732#L542-1 assume !(1 == ~e_wl~0); 21733#L684-1 assume !false; 22135#L554 [2023-11-12 02:04:52,152 INFO L750 eck$LassoCheckResult]: Loop: 22135#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 22932#L389 assume !false; 22921#L307 assume !(0 == ~wl_st~0); 22922#L311 assume !(0 == ~c1_st~0); 22927#L314 assume !(0 == ~c2_st~0); 22928#L317 assume !(0 == ~wb_st~0); 22923#L320 assume !(0 == ~r_st~0); 22924#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 23017#L560 assume !(1 == ~c_req_up~0); 23011#L560-2 start_simulation_~kernel_st~0#1 := 3; 23001#L572 assume !(0 == ~e_f~0); 23002#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 22996#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 22997#L582-1 assume !(0 == ~e_c~0); 22992#L587-1 assume !(0 == ~e_wl~0); 22993#L592-1 assume !(1 == ~wl_pc~0); 22988#$Ultimate##257 assume !(2 == ~wl_pc~0); 22986#L605 assume !(1 == ~c1_pc~0); 22985#L615 assume !(1 == ~c2_pc~0); 22980#L624 assume !(1 == ~wb_pc~0); 22978#L633 assume !(1 == ~e_c~0); 22977#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 22976#L647-1 assume !(1 == ~e_f~0); 22975#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 22974#L657-1 assume !(1 == ~e_c~0); 22972#L662-1 assume !(1 == ~e_wl~0); 22973#L667-1 assume 0 == ~wl_st~0; 23023#L684-1 assume !false; 22135#L554 [2023-11-12 02:04:52,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:52,153 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2023-11-12 02:04:52,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:52,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647358368] [2023-11-12 02:04:52,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:52,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:52,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:04:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:52,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:04:52,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:52,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1204821088, now seen corresponding path program 2 times [2023-11-12 02:04:52,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:52,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840903143] [2023-11-12 02:04:52,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:52,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:52,201 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-12 02:04:52,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:52,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840903143] [2023-11-12 02:04:52,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840903143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:52,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:52,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:52,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134026470] [2023-11-12 02:04:52,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:52,202 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-12 02:04:52,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:52,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:04:52,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:52,203 INFO L87 Difference]: Start difference. First operand 1692 states and 2748 transitions. cyclomatic complexity: 1068 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:52,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:52,251 INFO L93 Difference]: Finished difference Result 2704 states and 4341 transitions. [2023-11-12 02:04:52,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2704 states and 4341 transitions. [2023-11-12 02:04:52,270 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1569 [2023-11-12 02:04:52,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2704 states to 2704 states and 4341 transitions. [2023-11-12 02:04:52,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1632 [2023-11-12 02:04:52,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1632 [2023-11-12 02:04:52,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2704 states and 4341 transitions. [2023-11-12 02:04:52,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:04:52,298 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2704 states and 4341 transitions. [2023-11-12 02:04:52,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states and 4341 transitions. [2023-11-12 02:04:52,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2023-11-12 02:04:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2704 states have (on average 1.6053994082840237) internal successors, (4341), 2703 states have internal predecessors, (4341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 4341 transitions. [2023-11-12 02:04:52,370 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2704 states and 4341 transitions. [2023-11-12 02:04:52,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:04:52,371 INFO L428 stractBuchiCegarLoop]: Abstraction has 2704 states and 4341 transitions. [2023-11-12 02:04:52,371 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-12 02:04:52,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2704 states and 4341 transitions. [2023-11-12 02:04:52,384 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1569 [2023-11-12 02:04:52,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:04:52,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:04:52,385 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-12 02:04:52,385 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:52,385 INFO L748 eck$LassoCheckResult]: Stem: 26070#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(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; 26071#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 26036#L416 assume !(1 == ~c_req_up~0); 26038#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 26257#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 26285#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 26284#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 26116#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 26117#L447-1 assume !(0 == ~e_f~0); 26281#L452-1 assume !(0 == ~e_g~0); 25990#L457-1 assume !(0 == ~e_e~0); 25991#L462-1 assume !(0 == ~e_c~0); 26266#L467-1 assume !(0 == ~e_wl~0); 26235#L472-1 assume !(1 == ~wl_pc~0); 26236#$Ultimate##44 assume !(2 == ~wl_pc~0); 26224#L485 assume !(1 == ~c1_pc~0); 26204#L495 assume !(1 == ~c2_pc~0); 26287#L504 assume !(1 == ~wb_pc~0); 26227#L513 assume !(1 == ~e_c~0); 26018#L522-1 assume !(1 == ~e_e~0); 26019#L527-1 assume !(1 == ~e_f~0); 26282#L532-1 assume !(1 == ~e_g~0); 26207#L537-1 assume !(1 == ~e_c~0); 26140#L542-1 assume !(1 == ~e_wl~0); 26141#L684-1 assume !false; 26604#L554 [2023-11-12 02:04:52,386 INFO L750 eck$LassoCheckResult]: Loop: 26604#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 28137#L389 assume !false; 27695#L307 assume !(0 == ~wl_st~0); 27696#L311 assume !(0 == ~c1_st~0); 27830#L314 assume !(0 == ~c2_st~0); 27825#L317 assume !(0 == ~wb_st~0); 27826#L320 assume !(0 == ~r_st~0); 28114#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 28096#L560 assume !(1 == ~c_req_up~0); 28097#L560-2 start_simulation_~kernel_st~0#1 := 3; 28421#L572 assume !(0 == ~e_f~0); 28413#L572-2 assume 0 == ~e_g~0;~e_g~0 := 1; 28403#L577-1 assume 0 == ~e_e~0;~e_e~0 := 1; 28402#L582-1 assume !(0 == ~e_c~0); 28401#L587-1 assume !(0 == ~e_wl~0); 28400#L592-1 assume !(1 == ~wl_pc~0); 28398#$Ultimate##257 assume 2 == ~wl_pc~0; 28396#L606 assume 1 == ~e_e~0;~wl_st~0 := 0; 28397#L605 assume !(1 == ~c1_pc~0); 28419#L615 assume !(1 == ~c2_pc~0); 28411#L624 assume !(1 == ~wb_pc~0); 28409#L633 assume !(1 == ~e_c~0); 28408#L642-1 assume 1 == ~e_e~0;~e_e~0 := 2; 28377#L647-1 assume !(1 == ~e_f~0); 28370#L652-1 assume 1 == ~e_g~0;~e_g~0 := 2; 28367#L657-1 assume !(1 == ~e_c~0); 28119#L662-1 assume !(1 == ~e_wl~0); 28118#L667-1 assume 0 == ~wl_st~0; 27750#L684-1 assume !false; 26604#L554 [2023-11-12 02:04:52,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:52,386 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 2 times [2023-11-12 02:04:52,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:52,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893139164] [2023-11-12 02:04:52,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:52,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:52,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:04:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:52,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:04:52,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:52,410 INFO L85 PathProgramCache]: Analyzing trace with hash -2054308466, now seen corresponding path program 1 times [2023-11-12 02:04:52,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:52,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407796461] [2023-11-12 02:04:52,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:52,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:52,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:04:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:52,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:04:52,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:52,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1416914637, now seen corresponding path program 1 times [2023-11-12 02:04:52,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:52,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630164052] [2023-11-12 02:04:52,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:52,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:52,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:04:52,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:52,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630164052] [2023-11-12 02:04:52,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630164052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:52,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:52,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:52,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084270173] [2023-11-12 02:04:52,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:52,750 INFO L210 LassoAnalysis]: Preferences: [2023-11-12 02:04:52,750 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-12 02:04:52,750 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-12 02:04:52,750 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-12 02:04:52,750 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-12 02:04:52,751 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:52,751 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-12 02:04:52,751 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-12 02:04:52,751 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration11_Loop [2023-11-12 02:04:52,751 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-12 02:04:52,751 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-12 02:04:52,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-12 02:04:52,760 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-12 02:04:52,763 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-12 02:04:52,766 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-12 02:04:52,769 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-12 02:04:52,774 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-12 02:04:52,778 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-12 02:04:52,781 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-12 02:04:52,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-12 02:04:52,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-12 02:04:52,791 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-12 02:04:52,794 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-12 02:04:52,797 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-12 02:04:52,800 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-12 02:04:52,805 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-12 02:04:52,807 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-12 02:04:52,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-12 02:04:52,813 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-12 02:04:52,818 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-12 02:04:52,824 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-12 02:04:52,827 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-12 02:04:52,831 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-12 02:04:52,838 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-12 02:04:52,841 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-12 02:04:52,854 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-12 02:04:52,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-12 02:04:53,124 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-12 02:04:53,124 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-12 02:04:53,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:53,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:53,126 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:53,140 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:04:53,141 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:04:53,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-12 02:04:53,163 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-12 02:04:53,163 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-12 02:04:53,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:53,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:53,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:53,172 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:53,176 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:04:53,177 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:04:53,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-12 02:04:53,200 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-12 02:04:53,200 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-12 02:04:53,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:53,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:53,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:53,211 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:53,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:04:53,216 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:04:53,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-12 02:04:53,253 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-12 02:04:53,253 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-12 02:04:53,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:53,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:53,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:53,262 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:53,269 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:04:53,270 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:04:53,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-12 02:04:53,308 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-12 02:04:53,308 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-12 02:04:53,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:53,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:53,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:53,315 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:53,321 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:04:53,322 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:04:53,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-12 02:04:53,361 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:53,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:53,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:53,362 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:53,366 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-12 02:04:53,366 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:04:53,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-12 02:04:53,397 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-12 02:04:53,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:53,405 INFO L210 LassoAnalysis]: Preferences: [2023-11-12 02:04:53,405 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-12 02:04:53,405 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-12 02:04:53,405 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-12 02:04:53,405 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-12 02:04:53,406 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:53,406 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-12 02:04:53,406 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-12 02:04:53,406 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration11_Loop [2023-11-12 02:04:53,406 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-12 02:04:53,406 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-12 02:04:53,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-12 02:04:53,412 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-12 02:04:53,415 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-12 02:04:53,417 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-12 02:04:53,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-12 02:04:53,426 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-12 02:04:53,428 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-12 02:04:53,431 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-12 02:04:53,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-12 02:04:53,438 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-12 02:04:53,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-12 02:04:53,443 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-12 02:04:53,450 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-12 02:04:53,453 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-12 02:04:53,455 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-12 02:04:53,460 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-12 02:04:53,462 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-12 02:04:53,465 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-12 02:04:53,470 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-12 02:04:53,475 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-12 02:04:53,478 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-12 02:04:53,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-12 02:04:53,483 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-12 02:04:53,487 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-12 02:04:53,489 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-12 02:04:53,491 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-12 02:04:53,761 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-12 02:04:53,761 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-12 02:04:53,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:53,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:53,765 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:53,770 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-12 02:04:53,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-12 02:04:53,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:04:53,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:04:53,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:04:53,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:04:53,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:04:53,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:04:53,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:04:53,801 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:04:53,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:53,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:53,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:53,811 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:53,818 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-12 02:04:53,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-11-12 02:04:53,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:04:53,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:04:53,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:04:53,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:04:53,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:04:53,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:04:53,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:04:53,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:04:53,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:53,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:53,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:53,855 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:53,862 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-12 02:04:53,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-11-12 02:04:53,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:04:53,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:04:53,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:04:53,876 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-12 02:04:53,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:04:53,877 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-12 02:04:53,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:04:53,893 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:04:53,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:53,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:53,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:53,903 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:53,907 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-12 02:04:53,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:04:53,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:04:53,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:04:53,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:04:53,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:04:53,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-11-12 02:04:53,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:04:53,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:04:53,937 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-12 02:04:53,950 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-12 02:04:53,950 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-12 02:04:53,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:04:53,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:04:53,951 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:04:53,955 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-12 02:04:53,955 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-12 02:04:53,955 INFO L513 LassoAnalysis]: Proved termination. [2023-11-12 02:04:53,955 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2023-11-12 02:04:53,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-11-12 02:04:53,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:53,964 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-12 02:04:53,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:54,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-12 02:04:54,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:04:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:54,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:04:54,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:04:54,176 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-12 02:04:54,177 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-12 02:04:54,177 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2704 states and 4341 transitions. cyclomatic complexity: 1649 Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:54,261 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2704 states and 4341 transitions. cyclomatic complexity: 1649. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7241 states and 11630 transitions. Complement of second has 5 states. [2023-11-12 02:04:54,261 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-12 02:04:54,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:54,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions. [2023-11-12 02:04:54,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 205 transitions. Stem has 25 letters. Loop has 29 letters. [2023-11-12 02:04:54,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:04:54,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 205 transitions. Stem has 54 letters. Loop has 29 letters. [2023-11-12 02:04:54,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:04:54,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 205 transitions. Stem has 25 letters. Loop has 58 letters. [2023-11-12 02:04:54,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:04:54,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7241 states and 11630 transitions. [2023-11-12 02:04:54,308 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2875 [2023-11-12 02:04:54,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7241 states to 7241 states and 11630 transitions. [2023-11-12 02:04:54,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2947 [2023-11-12 02:04:54,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2984 [2023-11-12 02:04:54,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7241 states and 11630 transitions. [2023-11-12 02:04:54,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:04:54,373 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7241 states and 11630 transitions. [2023-11-12 02:04:54,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7241 states and 11630 transitions. [2023-11-12 02:04:54,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7241 to 7204. [2023-11-12 02:04:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7204 states, 7204 states have (on average 1.605774569683509) internal successors, (11568), 7203 states have internal predecessors, (11568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7204 states to 7204 states and 11568 transitions. [2023-11-12 02:04:54,562 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7204 states and 11568 transitions. [2023-11-12 02:04:54,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:54,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:04:54,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:54,563 INFO L87 Difference]: Start difference. First operand 7204 states and 11568 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:54,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-11-12 02:04:54,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:54,662 INFO L93 Difference]: Finished difference Result 5713 states and 9151 transitions. [2023-11-12 02:04:54,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5713 states and 9151 transitions. [2023-11-12 02:04:54,695 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2245 [2023-11-12 02:04:54,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5713 states to 5713 states and 9151 transitions. [2023-11-12 02:04:54,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2315 [2023-11-12 02:04:54,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2315 [2023-11-12 02:04:54,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5713 states and 9151 transitions. [2023-11-12 02:04:54,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:04:54,733 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5713 states and 9151 transitions. [2023-11-12 02:04:54,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5713 states and 9151 transitions. [2023-11-12 02:04:54,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5713 to 5485. [2023-11-12 02:04:54,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5485 states, 5485 states have (on average 1.6030993618960803) internal successors, (8793), 5484 states have internal predecessors, (8793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5485 states to 5485 states and 8793 transitions. [2023-11-12 02:04:54,869 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5485 states and 8793 transitions. [2023-11-12 02:04:54,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:04:54,871 INFO L428 stractBuchiCegarLoop]: Abstraction has 5485 states and 8793 transitions. [2023-11-12 02:04:54,871 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-12 02:04:54,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5485 states and 8793 transitions. [2023-11-12 02:04:54,894 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 2167 [2023-11-12 02:04:54,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:04:54,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:04:54,895 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-12 02:04:54,896 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:54,896 INFO L748 eck$LassoCheckResult]: Stem: 49105#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(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; 49106#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 49074#L416 assume !(1 == ~c_req_up~0); 49076#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 49293#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 49318#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 49316#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 49160#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 49161#L447-1 assume !(0 == ~e_f~0); 49310#L452-1 assume !(0 == ~e_g~0); 49036#L457-1 assume !(0 == ~e_e~0); 49037#L462-1 assume !(0 == ~e_c~0); 49090#L467-1 assume !(0 == ~e_wl~0); 49091#L472-1 assume !(1 == ~wl_pc~0); 49273#$Ultimate##44 assume !(2 == ~wl_pc~0); 49264#L485 assume !(1 == ~c1_pc~0); 49250#L495 assume !(1 == ~c2_pc~0); 49312#L504 assume !(1 == ~wb_pc~0); 49267#L513 assume !(1 == ~e_c~0); 49056#L522-1 assume !(1 == ~e_e~0); 49057#L527-1 assume !(1 == ~e_f~0); 49314#L532-1 assume !(1 == ~e_g~0); 49253#L537-1 assume !(1 == ~e_c~0); 49254#L542-1 assume !(1 == ~e_wl~0); 50638#L684-1 assume !false; 50639#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 51995#L389 [2023-11-12 02:04:54,896 INFO L750 eck$LassoCheckResult]: Loop: 51995#L389 assume !false; 53330#L307 assume 0 == ~wl_st~0; 53329#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 49202#L333 assume !(0 != eval_~tmp~0#1); 49203#L329 assume !(0 == ~c1_st~0); 53339#L344 assume !(0 == ~c2_st~0); 53337#L359 assume !(0 == ~wb_st~0); 53331#L374 assume !(0 == ~r_st~0); 51995#L389 [2023-11-12 02:04:54,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:54,897 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2023-11-12 02:04:54,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:54,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293421020] [2023-11-12 02:04:54,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:54,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:54,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:04:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:54,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:04:54,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:54,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1296084100, now seen corresponding path program 1 times [2023-11-12 02:04:54,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:54,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348821737] [2023-11-12 02:04:54,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:54,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:54,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:04:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:54,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:04:54,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:54,953 INFO L85 PathProgramCache]: Analyzing trace with hash 377129596, now seen corresponding path program 1 times [2023-11-12 02:04:54,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:54,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702693860] [2023-11-12 02:04:54,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:54,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:55,010 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-12 02:04:55,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:55,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702693860] [2023-11-12 02:04:55,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702693860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:55,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:55,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:55,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644655540] [2023-11-12 02:04:55,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:55,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:55,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:04:55,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:55,053 INFO L87 Difference]: Start difference. First operand 5485 states and 8793 transitions. cyclomatic complexity: 3335 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:55,123 INFO L93 Difference]: Finished difference Result 8667 states and 13772 transitions. [2023-11-12 02:04:55,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8667 states and 13772 transitions. [2023-11-12 02:04:55,166 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 3460 [2023-11-12 02:04:55,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8667 states to 8667 states and 13772 transitions. [2023-11-12 02:04:55,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3538 [2023-11-12 02:04:55,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3538 [2023-11-12 02:04:55,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8667 states and 13772 transitions. [2023-11-12 02:04:55,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:04:55,213 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8667 states and 13772 transitions. [2023-11-12 02:04:55,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8667 states and 13772 transitions. [2023-11-12 02:04:55,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8667 to 8667. [2023-11-12 02:04:55,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8667 states, 8667 states have (on average 1.589015807084343) internal successors, (13772), 8666 states have internal predecessors, (13772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8667 states to 8667 states and 13772 transitions. [2023-11-12 02:04:55,533 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8667 states and 13772 transitions. [2023-11-12 02:04:55,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:04:55,534 INFO L428 stractBuchiCegarLoop]: Abstraction has 8667 states and 13772 transitions. [2023-11-12 02:04:55,534 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-12 02:04:55,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8667 states and 13772 transitions. [2023-11-12 02:04:55,567 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 3460 [2023-11-12 02:04:55,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:04:55,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:04:55,568 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-12 02:04:55,568 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:55,569 INFO L748 eck$LassoCheckResult]: Stem: 63267#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(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; 63268#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 63234#L416 assume !(1 == ~c_req_up~0); 63236#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 63449#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 63482#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 63480#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 63319#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 63320#L447-1 assume !(0 == ~e_f~0); 63474#L452-1 assume !(0 == ~e_g~0); 63195#L457-1 assume !(0 == ~e_e~0); 63196#L462-1 assume !(0 == ~e_c~0); 63251#L467-1 assume !(0 == ~e_wl~0); 63252#L472-1 assume !(1 == ~wl_pc~0); 63430#$Ultimate##44 assume !(2 == ~wl_pc~0); 63420#L485 assume !(1 == ~c1_pc~0); 63406#L495 assume !(1 == ~c2_pc~0); 63476#L504 assume !(1 == ~wb_pc~0); 63424#L513 assume !(1 == ~e_c~0); 63216#L522-1 assume !(1 == ~e_e~0); 63217#L527-1 assume !(1 == ~e_f~0); 63478#L532-1 assume !(1 == ~e_g~0); 63407#L537-1 assume !(1 == ~e_c~0); 63344#L542-1 assume !(1 == ~e_wl~0); 63345#L684-1 assume !false; 65281#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 68123#L389 [2023-11-12 02:04:55,569 INFO L750 eck$LassoCheckResult]: Loop: 68123#L389 assume !false; 69892#L307 assume 0 == ~wl_st~0; 69891#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 69887#L333 assume !(0 != eval_~tmp~0#1); 69888#L329 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 70175#L348 assume !(0 != eval_~tmp___0~0#1); 70170#L344 assume !(0 == ~c2_st~0); 70154#L359 assume !(0 == ~wb_st~0); 69894#L374 assume !(0 == ~r_st~0); 68123#L389 [2023-11-12 02:04:55,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:55,570 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2023-11-12 02:04:55,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:55,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673367850] [2023-11-12 02:04:55,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:55,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:55,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:04:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:55,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:04:55,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:55,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1472174914, now seen corresponding path program 1 times [2023-11-12 02:04:55,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:55,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946138894] [2023-11-12 02:04:55,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:55,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:55,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:04:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:55,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:04:55,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:55,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1245610934, now seen corresponding path program 1 times [2023-11-12 02:04:55,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:55,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984119008] [2023-11-12 02:04:55,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:55,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:55,636 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-12 02:04:55,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:55,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984119008] [2023-11-12 02:04:55,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984119008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:55,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:55,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:55,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162449819] [2023-11-12 02:04:55,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:55,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:55,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:04:55,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:55,685 INFO L87 Difference]: Start difference. First operand 8667 states and 13772 transitions. cyclomatic complexity: 5132 Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:55,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:55,782 INFO L93 Difference]: Finished difference Result 13738 states and 21493 transitions. [2023-11-12 02:04:55,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13738 states and 21493 transitions. [2023-11-12 02:04:55,848 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 5512 [2023-11-12 02:04:55,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13738 states to 13738 states and 21493 transitions. [2023-11-12 02:04:55,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5656 [2023-11-12 02:04:55,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5656 [2023-11-12 02:04:55,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13738 states and 21493 transitions. [2023-11-12 02:04:55,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:04:55,920 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13738 states and 21493 transitions. [2023-11-12 02:04:55,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13738 states and 21493 transitions. [2023-11-12 02:04:56,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13738 to 13738. [2023-11-12 02:04:56,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13738 states, 13738 states have (on average 1.5644926481292765) internal successors, (21493), 13737 states have internal predecessors, (21493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13738 states to 13738 states and 21493 transitions. [2023-11-12 02:04:56,446 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13738 states and 21493 transitions. [2023-11-12 02:04:56,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:04:56,448 INFO L428 stractBuchiCegarLoop]: Abstraction has 13738 states and 21493 transitions. [2023-11-12 02:04:56,448 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-12 02:04:56,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13738 states and 21493 transitions. [2023-11-12 02:04:56,494 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 5512 [2023-11-12 02:04:56,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:04:56,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:04:56,495 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-12 02:04:56,495 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:56,495 INFO L748 eck$LassoCheckResult]: Stem: 85680#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(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; 85681#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 85648#L416 assume !(1 == ~c_req_up~0); 85650#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 85778#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 85779#L432-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 85909#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 87974#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 87973#L447-1 assume !(0 == ~e_f~0); 87972#L452-1 assume !(0 == ~e_g~0); 87971#L457-1 assume !(0 == ~e_e~0); 87970#L462-1 assume !(0 == ~e_c~0); 87969#L467-1 assume !(0 == ~e_wl~0); 87968#L472-1 assume !(1 == ~wl_pc~0); 87965#$Ultimate##44 assume !(2 == ~wl_pc~0); 87964#L485 assume !(1 == ~c1_pc~0); 87962#L495 assume !(1 == ~c2_pc~0); 87960#L504 assume !(1 == ~wb_pc~0); 87958#L513 assume !(1 == ~e_c~0); 87957#L522-1 assume !(1 == ~e_e~0); 87956#L527-1 assume !(1 == ~e_f~0); 87955#L532-1 assume !(1 == ~e_g~0); 87952#L537-1 assume !(1 == ~e_c~0); 87951#L542-1 assume !(1 == ~e_wl~0); 87945#L684-1 assume !false; 87946#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 92894#L389 [2023-11-12 02:04:56,495 INFO L750 eck$LassoCheckResult]: Loop: 92894#L389 assume !false; 96096#L307 assume 0 == ~wl_st~0; 96094#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 96092#L333 assume !(0 != eval_~tmp~0#1); 96091#L329 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 96067#L348 assume !(0 != eval_~tmp___0~0#1); 96090#L344 assume !(0 == ~c2_st~0); 96103#L359 assume !(0 == ~wb_st~0); 96097#L374 assume !(0 == ~r_st~0); 92894#L389 [2023-11-12 02:04:56,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:56,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2023-11-12 02:04:56,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:56,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045605743] [2023-11-12 02:04:56,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:56,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:56,539 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-12 02:04:56,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:56,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045605743] [2023-11-12 02:04:56,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045605743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:56,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:56,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:56,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053486874] [2023-11-12 02:04:56,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:56,541 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:04:56,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:56,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1472174914, now seen corresponding path program 2 times [2023-11-12 02:04:56,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:56,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987126981] [2023-11-12 02:04:56,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:56,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:56,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:04:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:56,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:04:56,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:56,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:04:56,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:56,598 INFO L87 Difference]: Start difference. First operand 13738 states and 21493 transitions. cyclomatic complexity: 7782 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:56,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:56,751 INFO L93 Difference]: Finished difference Result 13686 states and 21406 transitions. [2023-11-12 02:04:56,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13686 states and 21406 transitions. [2023-11-12 02:04:56,815 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 5512 [2023-11-12 02:04:56,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13686 states to 13686 states and 21406 transitions. [2023-11-12 02:04:56,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5606 [2023-11-12 02:04:56,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5606 [2023-11-12 02:04:56,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13686 states and 21406 transitions. [2023-11-12 02:04:56,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:04:56,882 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13686 states and 21406 transitions. [2023-11-12 02:04:56,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13686 states and 21406 transitions. [2023-11-12 02:04:57,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13686 to 13686. [2023-11-12 02:04:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13686 states, 13686 states have (on average 1.5640800818354523) internal successors, (21406), 13685 states have internal predecessors, (21406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13686 states to 13686 states and 21406 transitions. [2023-11-12 02:04:57,294 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13686 states and 21406 transitions. [2023-11-12 02:04:57,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:04:57,295 INFO L428 stractBuchiCegarLoop]: Abstraction has 13686 states and 21406 transitions. [2023-11-12 02:04:57,295 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-11-12 02:04:57,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13686 states and 21406 transitions. [2023-11-12 02:04:57,344 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 5512 [2023-11-12 02:04:57,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:04:57,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:04:57,345 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-12 02:04:57,345 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:57,346 INFO L748 eck$LassoCheckResult]: Stem: 113107#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(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; 113108#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 113076#L416 assume !(1 == ~c_req_up~0); 113078#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 113287#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 113318#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 113316#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 113157#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 113158#L447-1 assume !(0 == ~e_f~0); 113310#L452-1 assume !(0 == ~e_g~0); 113038#L457-1 assume !(0 == ~e_e~0); 113039#L462-1 assume !(0 == ~e_c~0); 113092#L467-1 assume !(0 == ~e_wl~0); 113093#L472-1 assume !(1 == ~wl_pc~0); 113269#$Ultimate##44 assume !(2 == ~wl_pc~0); 113260#L485 assume !(1 == ~c1_pc~0); 113243#L495 assume !(1 == ~c2_pc~0); 113312#L504 assume !(1 == ~wb_pc~0); 113263#L513 assume !(1 == ~e_c~0); 113058#L522-1 assume !(1 == ~e_e~0); 113059#L527-1 assume !(1 == ~e_f~0); 113314#L532-1 assume !(1 == ~e_g~0); 113246#L537-1 assume !(1 == ~e_c~0); 113247#L542-1 assume !(1 == ~e_wl~0); 115276#L684-1 assume !false; 115277#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 120536#L389 [2023-11-12 02:04:57,346 INFO L750 eck$LassoCheckResult]: Loop: 120536#L389 assume !false; 124841#L307 assume 0 == ~wl_st~0; 124840#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 124838#L333 assume !(0 != eval_~tmp~0#1); 124839#L329 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 123207#L348 assume !(0 != eval_~tmp___0~0#1); 123209#L344 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 123204#L363 assume !(0 != eval_~tmp___1~0#1); 123205#L359 assume !(0 == ~wb_st~0); 124843#L374 assume !(0 == ~r_st~0); 120536#L389 [2023-11-12 02:04:57,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:57,347 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2023-11-12 02:04:57,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:57,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785530894] [2023-11-12 02:04:57,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:57,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:57,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:04:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:57,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:04:57,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:57,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1608868656, now seen corresponding path program 1 times [2023-11-12 02:04:57,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:57,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178433760] [2023-11-12 02:04:57,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:57,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:57,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:04:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:57,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:04:57,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:57,384 INFO L85 PathProgramCache]: Analyzing trace with hash 39115976, now seen corresponding path program 1 times [2023-11-12 02:04:57,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:57,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519633902] [2023-11-12 02:04:57,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:57,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:57,449 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-12 02:04:57,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:57,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519633902] [2023-11-12 02:04:57,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519633902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:57,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:57,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:04:57,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273598634] [2023-11-12 02:04:57,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:57,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:57,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:04:57,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:04:57,502 INFO L87 Difference]: Start difference. First operand 13686 states and 21406 transitions. cyclomatic complexity: 7747 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:57,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:57,756 INFO L93 Difference]: Finished difference Result 23373 states and 36086 transitions. [2023-11-12 02:04:57,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23373 states and 36086 transitions. [2023-11-12 02:04:57,844 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 9446 [2023-11-12 02:04:57,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23373 states to 23373 states and 36086 transitions. [2023-11-12 02:04:57,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9572 [2023-11-12 02:04:57,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9572 [2023-11-12 02:04:57,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23373 states and 36086 transitions. [2023-11-12 02:04:57,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:04:57,949 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23373 states and 36086 transitions. [2023-11-12 02:04:57,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23373 states and 36086 transitions. [2023-11-12 02:04:58,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23373 to 23373. [2023-11-12 02:04:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23373 states, 23373 states have (on average 1.5439181962093014) internal successors, (36086), 23372 states have internal predecessors, (36086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:04:58,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23373 states to 23373 states and 36086 transitions. [2023-11-12 02:04:58,506 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23373 states and 36086 transitions. [2023-11-12 02:04:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:04:58,507 INFO L428 stractBuchiCegarLoop]: Abstraction has 23373 states and 36086 transitions. [2023-11-12 02:04:58,507 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-11-12 02:04:58,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23373 states and 36086 transitions. [2023-11-12 02:04:58,564 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 9446 [2023-11-12 02:04:58,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:04:58,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:04:58,564 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-12 02:04:58,565 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:58,565 INFO L748 eck$LassoCheckResult]: Stem: 150181#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(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; 150182#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 150148#L416 assume !(1 == ~c_req_up~0); 150150#L416-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 150382#L427-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 150416#L432-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 150415#L437-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 150230#L442-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 150231#L447-1 assume !(0 == ~e_f~0); 150412#L452-1 assume !(0 == ~e_g~0); 150103#L457-1 assume !(0 == ~e_e~0); 150104#L462-1 assume !(0 == ~e_c~0); 150395#L467-1 assume !(0 == ~e_wl~0); 150360#L472-1 assume !(1 == ~wl_pc~0); 150361#$Ultimate##44 assume !(2 == ~wl_pc~0); 150351#L485 assume !(1 == ~c1_pc~0); 150328#L495 assume !(1 == ~c2_pc~0); 150418#L504 assume !(1 == ~wb_pc~0); 150354#L513 assume !(1 == ~e_c~0); 150132#L522-1 assume !(1 == ~e_e~0); 150133#L527-1 assume !(1 == ~e_f~0); 150413#L532-1 assume !(1 == ~e_g~0); 150331#L537-1 assume !(1 == ~e_c~0); 150256#L542-1 assume !(1 == ~e_wl~0); 150257#L684-1 assume !false; 154799#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 166401#L389 [2023-11-12 02:04:58,565 INFO L750 eck$LassoCheckResult]: Loop: 166401#L389 assume !false; 169488#L307 assume 0 == ~wl_st~0; 169487#L320-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 169485#L333 assume !(0 != eval_~tmp~0#1); 169484#L329 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 169442#L348 assume !(0 != eval_~tmp___0~0#1); 167167#L344 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 167162#L363 assume !(0 != eval_~tmp___1~0#1); 167161#L359 assume 0 == ~wb_st~0;havoc eval_#t~nondet7#1;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 167143#L378 assume !(0 != eval_~tmp___2~0#1); 167159#L374 assume !(0 == ~r_st~0); 166401#L389 [2023-11-12 02:04:58,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:58,566 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2023-11-12 02:04:58,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:58,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418710603] [2023-11-12 02:04:58,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:58,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:58,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:04:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:58,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:04:58,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:58,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1664643830, now seen corresponding path program 1 times [2023-11-12 02:04:58,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:58,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62878256] [2023-11-12 02:04:58,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:58,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:58,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:04:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:58,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:04:58,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:58,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1212559870, now seen corresponding path program 1 times [2023-11-12 02:04:58,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:58,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124450272] [2023-11-12 02:04:58,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:58,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:58,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:04:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:04:58,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:05:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:05:00,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:05:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:05:00,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.11 02:05:00 BoogieIcfgContainer [2023-11-12 02:05:00,325 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-12 02:05:00,326 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:05:00,326 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:05:00,326 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:05:00,327 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:04:44" (3/4) ... [2023-11-12 02:05:00,328 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-12 02:05:00,411 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:05:00,411 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:05:00,412 INFO L158 Benchmark]: Toolchain (without parser) took 17027.76ms. Allocated memory was 132.1MB in the beginning and 1.0GB in the end (delta: 882.9MB). Free memory was 88.6MB in the beginning and 682.9MB in the end (delta: -594.3MB). Peak memory consumption was 291.5MB. Max. memory is 16.1GB. [2023-11-12 02:05:00,412 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 132.1MB. Free memory was 106.6MB in the beginning and 106.5MB in the end (delta: 27.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:05:00,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.67ms. Allocated memory is still 132.1MB. Free memory was 88.6MB in the beginning and 73.3MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-12 02:05:00,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.93ms. Allocated memory is still 132.1MB. Free memory was 73.3MB in the beginning and 71.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:05:00,414 INFO L158 Benchmark]: Boogie Preprocessor took 54.40ms. Allocated memory is still 132.1MB. Free memory was 71.2MB in the beginning and 104.3MB in the end (delta: -33.0MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2023-11-12 02:05:00,414 INFO L158 Benchmark]: RCFGBuilder took 787.64ms. Allocated memory was 132.1MB in the beginning and 190.8MB in the end (delta: 58.7MB). Free memory was 104.2MB in the beginning and 142.4MB in the end (delta: -38.2MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2023-11-12 02:05:00,415 INFO L158 Benchmark]: BuchiAutomizer took 15621.85ms. Allocated memory was 190.8MB in the beginning and 1.0GB in the end (delta: 824.2MB). Free memory was 142.4MB in the beginning and 688.2MB in the end (delta: -545.8MB). Peak memory consumption was 277.3MB. Max. memory is 16.1GB. [2023-11-12 02:05:00,415 INFO L158 Benchmark]: Witness Printer took 85.32ms. Allocated memory is still 1.0GB. Free memory was 688.2MB in the beginning and 682.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-12 02:05:00,417 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.75ms. Allocated memory is still 132.1MB. Free memory was 106.6MB in the beginning and 106.5MB in the end (delta: 27.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.67ms. Allocated memory is still 132.1MB. Free memory was 88.6MB in the beginning and 73.3MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.93ms. Allocated memory is still 132.1MB. Free memory was 73.3MB in the beginning and 71.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.40ms. Allocated memory is still 132.1MB. Free memory was 71.2MB in the beginning and 104.3MB in the end (delta: -33.0MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * RCFGBuilder took 787.64ms. Allocated memory was 132.1MB in the beginning and 190.8MB in the end (delta: 58.7MB). Free memory was 104.2MB in the beginning and 142.4MB in the end (delta: -38.2MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 15621.85ms. Allocated memory was 190.8MB in the beginning and 1.0GB in the end (delta: 824.2MB). Free memory was 142.4MB in the beginning and 688.2MB in the end (delta: -545.8MB). Peak memory consumption was 277.3MB. Max. memory is 16.1GB. * Witness Printer took 85.32ms. Allocated memory is still 1.0GB. Free memory was 688.2MB in the beginning and 682.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (15 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function ((-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. 15 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 23373 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.4s and 16 iterations. TraceHistogramMax:1. Analysis of lassos took 8.6s. Construction of modules took 0.4s. Büchi inclusion checks took 5.3s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 12. Automata minimization 2.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 2148 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 1.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4438 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4435 mSDsluCounter, 7483 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2765 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 364 IncrementalHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 4718 mSDtfsCounter, 364 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT1 SILN1 SILU0 SILI6 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq182 hnf98 smp100 dnf156 smp82 tf109 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 44ms 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: 306]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L701] int __retres1 ; [L705] e_wl = 2 [L706] e_c = e_wl [L707] e_g = e_c [L708] e_f = e_g [L709] e_e = e_f [L710] wl_pc = 0 [L711] c1_pc = 0 [L712] c2_pc = 0 [L713] wb_pc = 0 [L714] wb_i = 1 [L715] c2_i = wb_i [L716] c1_i = c2_i [L717] wl_i = c1_i [L718] r_i = 0 [L719] c_req_up = 0 [L720] d = 0 [L721] c = 0 [L722] CALL start_simulation() [L412] int kernel_st ; [L415] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L416] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L427] COND TRUE (int )wl_i == 1 [L428] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L432] COND TRUE (int )c1_i == 1 [L433] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L437] COND TRUE (int )c2_i == 1 [L438] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L442] COND TRUE (int )wb_i == 1 [L443] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L447] COND FALSE !((int )r_i == 1) [L450] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L452] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L457] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L462] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L467] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L472] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L477] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L485] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L495] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L504] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L513] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L522] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L527] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L532] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L537] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L542] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L547] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L553] COND TRUE 1 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L556] kernel_st = 1 [L557] CALL eval() [L298] int tmp ; [L299] int tmp___0 ; [L300] int tmp___1 ; [L301] int tmp___2 ; [L302] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L306] COND TRUE 1 [L308] COND TRUE (int )wl_st == 0 [L329] COND TRUE (int )wl_st == 0 [L331] tmp = __VERIFIER_nondet_int() [L333] COND FALSE !(\read(tmp)) [L344] COND TRUE (int )c1_st == 0 [L346] tmp___0 = __VERIFIER_nondet_int() [L348] COND FALSE !(\read(tmp___0)) [L359] COND TRUE (int )c2_st == 0 [L361] tmp___1 = __VERIFIER_nondet_int() [L363] COND FALSE !(\read(tmp___1)) [L374] COND TRUE (int )wb_st == 0 [L376] tmp___2 = __VERIFIER_nondet_int() [L378] COND FALSE !(\read(tmp___2)) [L389] COND FALSE !((int )r_st == 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 306]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L701] int __retres1 ; [L705] e_wl = 2 [L706] e_c = e_wl [L707] e_g = e_c [L708] e_f = e_g [L709] e_e = e_f [L710] wl_pc = 0 [L711] c1_pc = 0 [L712] c2_pc = 0 [L713] wb_pc = 0 [L714] wb_i = 1 [L715] c2_i = wb_i [L716] c1_i = c2_i [L717] wl_i = c1_i [L718] r_i = 0 [L719] c_req_up = 0 [L720] d = 0 [L721] c = 0 [L722] CALL start_simulation() [L412] int kernel_st ; [L415] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L416] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L427] COND TRUE (int )wl_i == 1 [L428] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L432] COND TRUE (int )c1_i == 1 [L433] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L437] COND TRUE (int )c2_i == 1 [L438] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L442] COND TRUE (int )wb_i == 1 [L443] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L447] COND FALSE !((int )r_i == 1) [L450] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L452] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L457] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L462] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L467] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L472] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L477] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L485] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L495] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L504] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L513] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L522] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L527] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L532] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L537] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L542] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L547] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L553] COND TRUE 1 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L556] kernel_st = 1 [L557] CALL eval() [L298] int tmp ; [L299] int tmp___0 ; [L300] int tmp___1 ; [L301] int tmp___2 ; [L302] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L306] COND TRUE 1 [L308] COND TRUE (int )wl_st == 0 [L329] COND TRUE (int )wl_st == 0 [L331] tmp = __VERIFIER_nondet_int() [L333] COND FALSE !(\read(tmp)) [L344] COND TRUE (int )c1_st == 0 [L346] tmp___0 = __VERIFIER_nondet_int() [L348] COND FALSE !(\read(tmp___0)) [L359] COND TRUE (int )c2_st == 0 [L361] tmp___1 = __VERIFIER_nondet_int() [L363] COND FALSE !(\read(tmp___1)) [L374] COND TRUE (int )wb_st == 0 [L376] tmp___2 = __VERIFIER_nondet_int() [L378] COND FALSE !(\read(tmp___2)) [L389] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-12 02:05:00,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c26b7329-9666-4a83-a265-c51daf16a9bc/bin/uautomizer-verify-uTZkv6EMXl/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)