./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 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_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/toy.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:16:14,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:16:14,694 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-12 02:16:14,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:16:14,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:16:14,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:16:14,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:16:14,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:16:14,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:16:14,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:16:14,748 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:16:14,748 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-12 02:16:14,749 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-12 02:16:14,751 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-12 02:16:14,751 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-12 02:16:14,752 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-12 02:16:14,752 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-12 02:16:14,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:16:14,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-12 02:16:14,754 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:16:14,755 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:16:14,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:16:14,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:16:14,757 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-12 02:16:14,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-12 02:16:14,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-12 02:16:14,758 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:16:14,759 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:16:14,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:16:14,759 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-12 02:16:14,761 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:16:14,761 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:16:14,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:16:14,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:16:14,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:16:14,762 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-12 02:16:14,763 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_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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 -> 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b [2023-11-12 02:16:15,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:16:15,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:16:15,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:16:15,125 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:16:15,126 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:16:15,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/systemc/toy.cil.c [2023-11-12 02:16:18,192 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:16:18,476 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:16:18,483 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/sv-benchmarks/c/systemc/toy.cil.c [2023-11-12 02:16:18,503 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/data/ed86eeebc/d8f039c3169f436d9f7ad31638edf024/FLAG3ce5d99c7 [2023-11-12 02:16:18,525 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/data/ed86eeebc/d8f039c3169f436d9f7ad31638edf024 [2023-11-12 02:16:18,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:16:18,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:16:18,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:16:18,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:16:18,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:16:18,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:16:18" (1/1) ... [2023-11-12 02:16:18,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43d04b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:18, skipping insertion in model container [2023-11-12 02:16:18,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:16:18" (1/1) ... [2023-11-12 02:16:18,608 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:16:18,840 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:16:18,855 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:16:18,906 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:16:18,925 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:16:18,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:18 WrapperNode [2023-11-12 02:16:18,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:16:18,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:16:18,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:16:18,928 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:16:18,937 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:16:18" (1/1) ... [2023-11-12 02:16:18,948 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:16:18" (1/1) ... [2023-11-12 02:16:18,982 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 362 [2023-11-12 02:16:18,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:16:18,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:16:18,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:16:18,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:16:18,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:18" (1/1) ... [2023-11-12 02:16:18,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:18" (1/1) ... [2023-11-12 02:16:18,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:18" (1/1) ... [2023-11-12 02:16:18,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:18" (1/1) ... [2023-11-12 02:16:19,019 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:18" (1/1) ... [2023-11-12 02:16:19,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:18" (1/1) ... [2023-11-12 02:16:19,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:18" (1/1) ... [2023-11-12 02:16:19,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:18" (1/1) ... [2023-11-12 02:16:19,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:16:19,050 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:16:19,051 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:16:19,051 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:16:19,052 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:18" (1/1) ... [2023-11-12 02:16:19,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:19,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:19,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:19,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:19,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:16:19,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:16:19,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:16:19,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:16:19,266 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:16:19,268 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:16:19,788 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:16:19,798 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:16:19,798 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-12 02:16:19,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:16:19 BoogieIcfgContainer [2023-11-12 02:16:19,801 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:16:19,802 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-12 02:16:19,803 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-12 02:16:19,807 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-12 02:16:19,808 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-12 02:16:19,808 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 02:16:18" (1/3) ... [2023-11-12 02:16:19,809 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b81f314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 02:16:19, skipping insertion in model container [2023-11-12 02:16:19,809 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-12 02:16:19,810 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:16:18" (2/3) ... [2023-11-12 02:16:19,810 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b81f314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 02:16:19, skipping insertion in model container [2023-11-12 02:16:19,810 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-12 02:16:19,810 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:16:19" (3/3) ... [2023-11-12 02:16:19,812 INFO L332 chiAutomizerObserver]: Analyzing ICFG toy.cil.c [2023-11-12 02:16:19,878 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-12 02:16:19,879 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-12 02:16:19,879 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-12 02:16:19,879 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-12 02:16:19,879 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-12 02:16:19,879 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-12 02:16:19,879 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-12 02:16:19,880 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-12 02:16:19,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 132 states, 131 states have (on average 1.8244274809160306) internal successors, (239), 131 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:19,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 97 [2023-11-12 02:16:19,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:16:19,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:16:19,923 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:16:19,923 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:16:19,923 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-12 02:16:19,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 132 states, 131 states have (on average 1.8244274809160306) internal successors, (239), 131 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:19,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 97 [2023-11-12 02:16:19,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:16:19,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:16:19,937 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:16:19,937 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:16:19,944 INFO L748 eck$LassoCheckResult]: Stem: 24#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 39#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 106#L408true assume !(1 == ~c_req_up~0); 85#L408-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 127#L419-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 126#L424-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 60#L429-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 121#L434-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 43#L439-1true assume !(0 == ~e_f~0); 5#L444-1true assume !(0 == ~e_g~0); 98#L449-1true assume !(0 == ~e_e~0); 53#L454-1true assume !(0 == ~e_c~0); 111#L459-1true assume !(0 == ~e_wl~0); 25#L464-1true assume !(1 == ~wl_pc~0); 100#$Ultimate##44true assume !(2 == ~wl_pc~0); 23#L477true assume !(1 == ~c1_pc~0); 18#L487true assume !(1 == ~c2_pc~0); 87#L496true assume !(1 == ~wb_pc~0); 29#L505true assume !(1 == ~e_c~0); 36#L514-1true assume !(1 == ~e_e~0); 133#L519-1true assume !(1 == ~e_f~0); 40#L524-1true assume !(1 == ~e_g~0); 131#L529-1true assume !(1 == ~e_c~0); 2#L534-1true assume !(1 == ~e_wl~0); 4#L676-1true [2023-11-12 02:16:19,945 INFO L750 eck$LassoCheckResult]: Loop: 4#L676-1true assume !false; 35#L546true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 70#L381true assume !true; 90#eval_returnLabel#1true havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 42#L552true assume !(1 == ~c_req_up~0); 59#L552-2true start_simulation_~kernel_st~0#1 := 3; 14#L564true assume 0 == ~e_f~0;~e_f~0 := 1; 17#L564-2true assume 0 == ~e_g~0;~e_g~0 := 1; 6#L569-1true assume 0 == ~e_e~0;~e_e~0 := 1; 130#L574-1true assume 0 == ~e_c~0;~e_c~0 := 1; 10#L579-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 94#L584-1true assume 1 == ~wl_pc~0; 46#L590true assume 1 == ~e_wl~0;~wl_st~0 := 0; 113#L597true assume !(1 == ~c1_pc~0); 27#L607true assume !(1 == ~c2_pc~0); 103#L616true assume !(1 == ~wb_pc~0); 123#L625true assume 1 == ~e_c~0;~r_st~0 := 0; 58#L634-1true assume 1 == ~e_e~0;~e_e~0 := 2; 52#L639-1true assume 1 == ~e_f~0;~e_f~0 := 2; 117#L644-1true assume 1 == ~e_g~0;~e_g~0 := 2; 77#L649-1true assume 1 == ~e_c~0;~e_c~0 := 2; 41#L654-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 21#L659-1true assume 0 == ~wl_st~0; 4#L676-1true [2023-11-12 02:16:19,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:19,951 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2023-11-12 02:16:19,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:19,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662812351] [2023-11-12 02:16:19,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:19,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:20,291 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:16:20,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:20,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662812351] [2023-11-12 02:16:20,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662812351] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:20,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:20,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:16:20,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793196543] [2023-11-12 02:16:20,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:20,303 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:16:20,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:20,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1307375692, now seen corresponding path program 1 times [2023-11-12 02:16:20,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:20,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934002076] [2023-11-12 02:16:20,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:20,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:20,347 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:16:20,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:20,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934002076] [2023-11-12 02:16:20,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934002076] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:20,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:20,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:16:20,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334277140] [2023-11-12 02:16:20,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:20,356 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-12 02:16:20,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:20,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:16:20,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:16:20,402 INFO L87 Difference]: Start difference. First operand has 132 states, 131 states have (on average 1.8244274809160306) internal successors, (239), 131 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:20,441 INFO L93 Difference]: Finished difference Result 130 states and 224 transitions. [2023-11-12 02:16:20,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 224 transitions. [2023-11-12 02:16:20,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2023-11-12 02:16:20,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 125 states and 219 transitions. [2023-11-12 02:16:20,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2023-11-12 02:16:20,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2023-11-12 02:16:20,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 219 transitions. [2023-11-12 02:16:20,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:16:20,471 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 219 transitions. [2023-11-12 02:16:20,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 219 transitions. [2023-11-12 02:16:20,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-11-12 02:16:20,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.752) internal successors, (219), 124 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 219 transitions. [2023-11-12 02:16:20,522 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 219 transitions. [2023-11-12 02:16:20,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:16:20,528 INFO L428 stractBuchiCegarLoop]: Abstraction has 125 states and 219 transitions. [2023-11-12 02:16:20,529 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-12 02:16:20,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 219 transitions. [2023-11-12 02:16:20,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2023-11-12 02:16:20,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:16:20,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:16:20,541 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:16:20,541 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:16:20,543 INFO L748 eck$LassoCheckResult]: Stem: 314#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 315#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 344#L408 assume !(1 == ~c_req_up~0); 307#L408-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 384#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 395#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 369#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 370#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 351#L439-1 assume !(0 == ~e_f~0); 274#L444-1 assume !(0 == ~e_g~0); 275#L449-1 assume !(0 == ~e_e~0); 364#L454-1 assume !(0 == ~e_c~0); 365#L459-1 assume !(0 == ~e_wl~0); 316#L464-1 assume !(1 == ~wl_pc~0); 317#$Ultimate##44 assume !(2 == ~wl_pc~0); 312#L477 assume !(1 == ~c1_pc~0); 300#L487 assume !(1 == ~c2_pc~0); 302#L496 assume !(1 == ~wb_pc~0); 328#L505 assume !(1 == ~e_c~0); 329#L514-1 assume !(1 == ~e_e~0); 340#L519-1 assume !(1 == ~e_f~0); 346#L524-1 assume !(1 == ~e_g~0); 347#L529-1 assume !(1 == ~e_c~0); 271#L534-1 assume !(1 == ~e_wl~0); 272#L676-1 [2023-11-12 02:16:20,549 INFO L750 eck$LassoCheckResult]: Loop: 272#L676-1 assume !false; 273#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 298#L381 assume !false; 341#L299 assume !(0 == ~wl_st~0); 342#L303 assume !(0 == ~c1_st~0); 394#L306 assume !(0 == ~c2_st~0); 387#L309 assume !(0 == ~wb_st~0); 388#L312 assume !(0 == ~r_st~0); 389#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 348#L552 assume !(1 == ~c_req_up~0); 349#L552-2 start_simulation_~kernel_st~0#1 := 3; 295#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 296#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 276#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 277#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 286#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 287#L584-1 assume 1 == ~wl_pc~0; 355#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 356#L597 assume !(1 == ~c1_pc~0); 322#L607 assume !(1 == ~c2_pc~0); 323#L616 assume !(1 == ~wb_pc~0); 376#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 368#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 362#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 363#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 377#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 345#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 308#L659-1 assume 0 == ~wl_st~0; 272#L676-1 [2023-11-12 02:16:20,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:20,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2023-11-12 02:16:20,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:20,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764374569] [2023-11-12 02:16:20,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:20,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:20,687 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:16:20,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:20,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764374569] [2023-11-12 02:16:20,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764374569] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:20,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:20,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:16:20,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920714053] [2023-11-12 02:16:20,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:20,690 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:16:20,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:20,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1329201933, now seen corresponding path program 1 times [2023-11-12 02:16:20,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:20,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291946011] [2023-11-12 02:16:20,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:20,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:20,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:16:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:20,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:16:21,106 INFO L210 LassoAnalysis]: Preferences: [2023-11-12 02:16:21,107 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-12 02:16:21,107 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-12 02:16:21,107 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-12 02:16:21,108 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-12 02:16:21,108 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:21,108 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-12 02:16:21,108 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-12 02:16:21,108 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration2_Loop [2023-11-12 02:16:21,109 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-12 02:16:21,109 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-12 02:16:21,129 INFO 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:16:21,141 INFO 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:16:21,148 INFO 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:16:21,151 INFO 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:16:21,155 INFO 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:16:21,161 INFO 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:16:21,164 INFO 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:16:21,168 INFO 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:16:21,171 INFO 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:16:21,173 INFO 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:16:21,177 INFO 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:16:21,180 INFO 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:16:21,182 INFO 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:16:21,189 INFO 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:16:21,192 INFO 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:16:21,195 INFO 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:16:21,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:16:21,204 INFO 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:16:21,208 INFO 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:16:21,214 INFO 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:16:21,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:16:21,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:16:21,227 INFO 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:16:21,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:16:21,233 INFO 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:16:21,239 INFO 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:16:21,542 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-12 02:16:21,543 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-12 02:16:21,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:21,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:21,552 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:21,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:21,564 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:16:21,564 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:16:21,590 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-12 02:16:21,591 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:16:21,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:16:21,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:21,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:21,606 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:21,614 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:16:21,615 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:16:21,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:21,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:21,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:21,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:21,665 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:21,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-12 02:16:21,669 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:16:21,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:21,707 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-12 02:16:21,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:21,711 INFO L210 LassoAnalysis]: Preferences: [2023-11-12 02:16:21,711 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-12 02:16:21,712 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-12 02:16:21,712 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-12 02:16:21,712 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-12 02:16:21,712 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:21,712 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-12 02:16:21,712 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-12 02:16:21,712 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration2_Loop [2023-11-12 02:16:21,712 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-12 02:16:21,712 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-12 02:16:21,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:16:21,733 INFO 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:16:21,739 INFO 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:16:21,741 INFO 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:16:21,745 INFO 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:16:21,747 INFO 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:16:21,751 INFO 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:16:21,756 INFO 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:16:21,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:16:21,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:16:21,777 INFO 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:16:21,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:21,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:21,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:16:21,790 INFO 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:16:21,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:16:21,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:16:21,806 INFO 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:16:21,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:16:21,815 INFO 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:16:21,825 INFO 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:16:21,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:16:21,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:16:21,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:16:21,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:21,843 INFO 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:16:22,077 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-12 02:16:22,081 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-12 02:16:22,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:22,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:22,084 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:22,098 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:16:22,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:16:22,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:16:22,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:16:22,111 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-12 02:16:22,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:16:22,114 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-12 02:16:22,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:16:22,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:22,117 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:16:22,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:22,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:22,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:22,126 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:22,136 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:16:22,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:16:22,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:16:22,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:16:22,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:16:22,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:16:22,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:16:22,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:16:22,161 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-12 02:16:22,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:22,164 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-12 02:16:22,164 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-12 02:16:22,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:22,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:22,187 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:22,198 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-12 02:16:22,198 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-12 02:16:22,198 INFO L513 LassoAnalysis]: Proved termination. [2023-11-12 02:16:22,198 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2023-11-12 02:16:22,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:22,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-12 02:16:22,210 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-12 02:16:22,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:22,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-12 02:16:22,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:16:22,337 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:22,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:16:22,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:16:22,507 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:16:22,511 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:16:22,512 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 219 transitions. cyclomatic complexity: 95 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:22,613 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 219 transitions. cyclomatic complexity: 95. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 413 states and 711 transitions. Complement of second has 5 states. [2023-11-12 02:16:22,614 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:16:22,615 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:16:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2023-11-12 02:16:22,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 383 transitions. Stem has 24 letters. Loop has 28 letters. [2023-11-12 02:16:22,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:16:22,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 383 transitions. Stem has 52 letters. Loop has 28 letters. [2023-11-12 02:16:22,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:16:22,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 383 transitions. Stem has 24 letters. Loop has 56 letters. [2023-11-12 02:16:22,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:16:22,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 413 states and 711 transitions. [2023-11-12 02:16:22,629 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 282 [2023-11-12 02:16:22,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 413 states to 413 states and 711 transitions. [2023-11-12 02:16:22,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 314 [2023-11-12 02:16:22,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 317 [2023-11-12 02:16:22,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 413 states and 711 transitions. [2023-11-12 02:16:22,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:16:22,637 INFO L218 hiAutomatonCegarLoop]: Abstraction has 413 states and 711 transitions. [2023-11-12 02:16:22,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states and 711 transitions. [2023-11-12 02:16:22,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 316. [2023-11-12 02:16:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.7278481012658229) internal successors, (546), 315 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 546 transitions. [2023-11-12 02:16:22,666 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 546 transitions. [2023-11-12 02:16:22,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:22,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:16:22,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:16:22,667 INFO L87 Difference]: Start difference. First operand 316 states and 546 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:22,688 INFO L93 Difference]: Finished difference Result 316 states and 545 transitions. [2023-11-12 02:16:22,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 545 transitions. [2023-11-12 02:16:22,692 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2023-11-12 02:16:22,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 545 transitions. [2023-11-12 02:16:22,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2023-11-12 02:16:22,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2023-11-12 02:16:22,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 545 transitions. [2023-11-12 02:16:22,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:16:22,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 316 states and 545 transitions. [2023-11-12 02:16:22,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 545 transitions. [2023-11-12 02:16:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2023-11-12 02:16:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.7246835443037976) internal successors, (545), 315 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 545 transitions. [2023-11-12 02:16:22,736 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 545 transitions. [2023-11-12 02:16:22,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:16:22,737 INFO L428 stractBuchiCegarLoop]: Abstraction has 316 states and 545 transitions. [2023-11-12 02:16:22,738 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-12 02:16:22,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 545 transitions. [2023-11-12 02:16:22,742 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2023-11-12 02:16:22,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:16:22,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:16:22,745 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:16:22,745 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:16:22,746 INFO L748 eck$LassoCheckResult]: Stem: 1696#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1697#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1748#L408 assume !(1 == ~c_req_up~0); 1685#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1830#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 1851#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1795#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 1796#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1760#L439-1 assume !(0 == ~e_f~0); 1624#L444-1 assume !(0 == ~e_g~0); 1625#L449-1 assume !(0 == ~e_e~0); 1785#L454-1 assume !(0 == ~e_c~0); 1786#L459-1 assume !(0 == ~e_wl~0); 1698#L464-1 assume !(1 == ~wl_pc~0); 1699#$Ultimate##44 assume !(2 == ~wl_pc~0); 1694#L477 assume !(1 == ~c1_pc~0); 1675#L487 assume !(1 == ~c2_pc~0); 1677#L496 assume !(1 == ~wb_pc~0); 1719#L505 assume !(1 == ~e_c~0); 1720#L514-1 assume !(1 == ~e_e~0); 1741#L519-1 assume !(1 == ~e_f~0); 1752#L524-1 assume !(1 == ~e_g~0); 1753#L529-1 assume !(1 == ~e_c~0); 1617#L534-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1618#L676-1 [2023-11-12 02:16:22,746 INFO L750 eck$LassoCheckResult]: Loop: 1618#L676-1 assume !false; 1867#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1807#L381 assume !false; 1742#L299 assume !(0 == ~wl_st~0); 1743#L303 assume !(0 == ~c1_st~0); 1852#L306 assume !(0 == ~c2_st~0); 1834#L309 assume !(0 == ~wb_st~0); 1835#L312 assume !(0 == ~r_st~0); 1853#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1859#L552 assume !(1 == ~c_req_up~0); 1794#L552-2 start_simulation_~kernel_st~0#1 := 3; 1664#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 1665#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1674#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1855#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1856#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1902#L584-1 assume 1 == ~wl_pc~0; 1900#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1898#L597 assume !(1 == ~c1_pc~0); 1894#L607 assume !(1 == ~c2_pc~0); 1889#L616 assume !(1 == ~wb_pc~0); 1888#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 1884#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1781#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1782#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1846#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1749#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1750#L659-1 assume 0 == ~wl_st~0; 1618#L676-1 [2023-11-12 02:16:22,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:22,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779217, now seen corresponding path program 1 times [2023-11-12 02:16:22,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:22,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523857779] [2023-11-12 02:16:22,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:22,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:22,859 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:16:22,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:22,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523857779] [2023-11-12 02:16:22,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523857779] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:22,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:22,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:16:22,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967633037] [2023-11-12 02:16:22,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:22,861 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:16:22,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:22,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1329201933, now seen corresponding path program 2 times [2023-11-12 02:16:22,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:22,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651879205] [2023-11-12 02:16:22,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:22,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:22,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:16:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:22,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:16:23,123 INFO L210 LassoAnalysis]: Preferences: [2023-11-12 02:16:23,123 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-12 02:16:23,123 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-12 02:16:23,123 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-12 02:16:23,123 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-12 02:16:23,124 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:23,124 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-12 02:16:23,124 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-12 02:16:23,124 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration3_Loop [2023-11-12 02:16:23,124 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-12 02:16:23,124 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-12 02:16:23,132 INFO 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:16:23,135 INFO 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:16:23,137 INFO 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:16:23,139 INFO 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:16:23,142 INFO 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:16:23,145 INFO 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:16:23,150 INFO 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:16:23,152 INFO 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:16:23,158 INFO 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:16:23,164 INFO 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:16:23,166 INFO 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:16:23,172 INFO 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:16:23,179 INFO 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:16:23,181 INFO 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:16:23,186 INFO 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:16:23,188 INFO 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:16:23,190 INFO 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:16:23,192 INFO 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:16:23,195 INFO 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:16:23,197 INFO 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:16:23,199 INFO 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:16:23,204 INFO 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:16:23,206 INFO 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:16:23,209 INFO 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:16:23,212 INFO 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:16:23,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:16:23,449 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-12 02:16:23,450 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-12 02:16:23,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:23,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:23,452 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:23,461 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:16:23,461 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:16:23,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:23,484 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-12 02:16:23,484 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:16:23,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:23,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:23,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:23,501 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:23,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:23,506 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:16:23,506 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:16:23,528 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-12 02:16:23,528 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:16:23,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-11-12 02:16:23,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:23,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:23,536 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:23,562 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:16:23,562 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:16:23,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:23,606 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-12 02:16:23,606 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:16:23,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:23,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:23,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:23,615 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:23,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:23,619 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:16:23,620 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:16:23,656 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-12 02:16:23,656 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:16:23,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:23,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:23,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:23,662 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:23,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:16:23,673 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:16:23,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:23,696 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-12 02:16:23,696 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:16:23,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:23,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:23,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:23,710 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:23,718 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:16:23,719 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:16:23,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:23,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:23,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:23,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:23,758 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:23,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:23,766 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-12 02:16:23,766 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:16:23,789 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-12 02:16:23,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:23,797 INFO L210 LassoAnalysis]: Preferences: [2023-11-12 02:16:23,797 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-12 02:16:23,797 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-12 02:16:23,797 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-12 02:16:23,797 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-12 02:16:23,797 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:23,797 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-12 02:16:23,797 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-12 02:16:23,797 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration3_Loop [2023-11-12 02:16:23,797 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-12 02:16:23,797 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-12 02:16:23,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:16:23,803 INFO 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:16:23,806 INFO 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:16:23,809 INFO 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:16:23,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:23,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:23,819 INFO 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:16:23,822 INFO 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:16:23,834 INFO 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:16:23,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:23,844 INFO 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:16:23,850 INFO 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:16:23,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:23,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:23,858 INFO 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:16:23,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:23,868 INFO 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:16:23,871 INFO 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:16:23,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:23,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:23,885 INFO 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:16:23,889 INFO 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:16:23,892 INFO 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:16:23,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:16:23,899 INFO 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:16:23,905 INFO 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:16:24,134 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-12 02:16:24,134 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-12 02:16:24,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:24,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:24,136 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:24,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:24,140 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:16:24,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:16:24,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:16:24,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:16:24,153 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-12 02:16:24,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:16:24,155 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-12 02:16:24,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:16:24,176 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:16:24,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:24,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:24,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:24,185 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:24,198 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:16:24,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:16:24,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:16:24,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:16:24,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:16:24,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:16:24,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:16:24,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:16:24,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:24,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:16:24,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:24,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:24,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:24,227 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:24,237 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:16:24,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:16:24,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:16:24,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:16:24,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:16:24,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:16:24,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:16:24,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:16:24,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:24,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:16:24,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:24,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:24,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:24,286 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:24,289 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:16:24,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:16:24,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:16:24,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:16:24,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:16:24,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:16:24,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:16:24,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:16:24,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:24,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:16:24,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:24,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:24,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:24,326 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:24,330 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:16:24,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:16:24,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:16:24,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:16:24,342 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-12 02:16:24,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:16:24,344 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-12 02:16:24,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:16:24,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:24,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:16:24,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:24,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:24,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:24,363 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:24,377 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:16:24,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:16:24,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:16:24,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:16:24,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:16:24,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:16:24,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:24,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:16:24,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:16:24,412 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-12 02:16:24,415 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-12 02:16:24,415 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-12 02:16:24,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:24,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:24,416 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:24,425 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-12 02:16:24,425 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-12 02:16:24,425 INFO L513 LassoAnalysis]: Proved termination. [2023-11-12 02:16:24,425 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2023-11-12 02:16:24,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:24,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:24,436 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-12 02:16:24,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:24,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-12 02:16:24,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:16:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:24,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:16:24,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:16:24,640 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:16:24,641 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:16:24,641 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 316 states and 545 transitions. cyclomatic complexity: 232 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:24,711 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 316 states and 545 transitions. cyclomatic complexity: 232. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 604 states and 1037 transitions. Complement of second has 5 states. [2023-11-12 02:16:24,711 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:16:24,713 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:16:24,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-11-12 02:16:24,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 382 transitions. Stem has 24 letters. Loop has 28 letters. [2023-11-12 02:16:24,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:16:24,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 382 transitions. Stem has 52 letters. Loop has 28 letters. [2023-11-12 02:16:24,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:16:24,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 382 transitions. Stem has 24 letters. Loop has 56 letters. [2023-11-12 02:16:24,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:16:24,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 604 states and 1037 transitions. [2023-11-12 02:16:24,725 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 376 [2023-11-12 02:16:24,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 604 states to 604 states and 1037 transitions. [2023-11-12 02:16:24,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2023-11-12 02:16:24,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 412 [2023-11-12 02:16:24,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 604 states and 1037 transitions. [2023-11-12 02:16:24,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:16:24,732 INFO L218 hiAutomatonCegarLoop]: Abstraction has 604 states and 1037 transitions. [2023-11-12 02:16:24,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states and 1037 transitions. [2023-11-12 02:16:24,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 316. [2023-11-12 02:16:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.7246835443037976) internal successors, (545), 315 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 545 transitions. [2023-11-12 02:16:24,748 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 545 transitions. [2023-11-12 02:16:24,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:24,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:16:24,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:16:24,749 INFO L87 Difference]: Start difference. First operand 316 states and 545 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:24,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:24,769 INFO L93 Difference]: Finished difference Result 316 states and 544 transitions. [2023-11-12 02:16:24,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 544 transitions. [2023-11-12 02:16:24,773 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2023-11-12 02:16:24,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 544 transitions. [2023-11-12 02:16:24,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2023-11-12 02:16:24,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2023-11-12 02:16:24,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 544 transitions. [2023-11-12 02:16:24,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:16:24,784 INFO L218 hiAutomatonCegarLoop]: Abstraction has 316 states and 544 transitions. [2023-11-12 02:16:24,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 544 transitions. [2023-11-12 02:16:24,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2023-11-12 02:16:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.7215189873417722) internal successors, (544), 315 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 544 transitions. [2023-11-12 02:16:24,792 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 544 transitions. [2023-11-12 02:16:24,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:16:24,795 INFO L428 stractBuchiCegarLoop]: Abstraction has 316 states and 544 transitions. [2023-11-12 02:16:24,795 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-12 02:16:24,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 544 transitions. [2023-11-12 02:16:24,798 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2023-11-12 02:16:24,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:16:24,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:16:24,799 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:16:24,799 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:16:24,799 INFO L748 eck$LassoCheckResult]: Stem: 3423#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 3424#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 3475#L408 assume !(1 == ~c_req_up~0); 3412#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3554#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3573#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3524#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 3525#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3486#L439-1 assume !(0 == ~e_f~0); 3351#L444-1 assume !(0 == ~e_g~0); 3352#L449-1 assume !(0 == ~e_e~0); 3511#L454-1 assume !(0 == ~e_c~0); 3512#L459-1 assume !(0 == ~e_wl~0); 3425#L464-1 assume !(1 == ~wl_pc~0); 3426#$Ultimate##44 assume !(2 == ~wl_pc~0); 3421#L477 assume !(1 == ~c1_pc~0); 3408#L487 assume !(1 == ~c2_pc~0); 3410#L496 assume !(1 == ~wb_pc~0); 3446#L505 assume !(1 == ~e_c~0); 3447#L514-1 assume !(1 == ~e_e~0); 3472#L519-1 assume !(1 == ~e_f~0); 3478#L524-1 assume !(1 == ~e_g~0); 3479#L529-1 assume !(1 == ~e_c~0); 3345#L534-1 assume !(1 == ~e_wl~0); 3346#L676-1 assume !false; 3348#L546 [2023-11-12 02:16:24,799 INFO L750 eck$LassoCheckResult]: Loop: 3348#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 3396#L381 assume !false; 3468#L299 assume !(0 == ~wl_st~0); 3469#L303 assume !(0 == ~c1_st~0); 3571#L306 assume !(0 == ~c2_st~0); 3558#L309 assume !(0 == ~wb_st~0); 3559#L312 assume !(0 == ~r_st~0); 3574#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 3580#L552 assume !(1 == ~c_req_up~0); 3520#L552-2 start_simulation_~kernel_st~0#1 := 3; 3521#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 3401#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3353#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3354#L574-1 assume !(0 == ~e_c~0); 3373#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3374#L584-1 assume 1 == ~wl_pc~0; 3493#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 3494#L597 assume !(1 == ~c1_pc~0); 3434#L607 assume !(1 == ~c2_pc~0); 3435#L616 assume !(1 == ~wb_pc~0); 3535#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 3518#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3507#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 3508#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3540#L649-1 assume !(1 == ~e_c~0); 3476#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3413#L659-1 assume 0 == ~wl_st~0; 3347#L676-1 assume !false; 3348#L546 [2023-11-12 02:16:24,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:24,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1939846590, now seen corresponding path program 1 times [2023-11-12 02:16:24,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:24,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159145927] [2023-11-12 02:16:24,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:24,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:24,842 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:16:24,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:24,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159145927] [2023-11-12 02:16:24,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159145927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:24,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:24,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:16:24,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530121647] [2023-11-12 02:16:24,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:24,844 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:16:24,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:24,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1635242511, now seen corresponding path program 1 times [2023-11-12 02:16:24,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:24,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246619036] [2023-11-12 02:16:24,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:24,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:24,867 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:16:24,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:24,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246619036] [2023-11-12 02:16:24,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246619036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:24,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:24,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:16:24,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637184054] [2023-11-12 02:16:24,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:24,871 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-12 02:16:24,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:24,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:16:24,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:16:24,872 INFO L87 Difference]: Start difference. First operand 316 states and 544 transitions. cyclomatic complexity: 231 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:24,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:24,881 INFO L93 Difference]: Finished difference Result 316 states and 543 transitions. [2023-11-12 02:16:24,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 543 transitions. [2023-11-12 02:16:24,885 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2023-11-12 02:16:24,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 543 transitions. [2023-11-12 02:16:24,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2023-11-12 02:16:24,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2023-11-12 02:16:24,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 543 transitions. [2023-11-12 02:16:24,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:16:24,889 INFO L218 hiAutomatonCegarLoop]: Abstraction has 316 states and 543 transitions. [2023-11-12 02:16:24,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 543 transitions. [2023-11-12 02:16:24,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2023-11-12 02:16:24,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.7183544303797469) internal successors, (543), 315 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:24,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 543 transitions. [2023-11-12 02:16:24,896 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 543 transitions. [2023-11-12 02:16:24,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:16:24,897 INFO L428 stractBuchiCegarLoop]: Abstraction has 316 states and 543 transitions. [2023-11-12 02:16:24,898 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-12 02:16:24,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 543 transitions. [2023-11-12 02:16:24,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2023-11-12 02:16:24,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:16:24,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:16:24,901 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:16:24,901 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:16:24,901 INFO L748 eck$LassoCheckResult]: Stem: 4062#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 4063#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 4115#L408 assume !(1 == ~c_req_up~0); 4051#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4191#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4211#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4161#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4162#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4126#L439-1 assume !(0 == ~e_f~0); 3990#L444-1 assume !(0 == ~e_g~0); 3991#L449-1 assume !(0 == ~e_e~0); 4151#L454-1 assume !(0 == ~e_c~0); 4152#L459-1 assume !(0 == ~e_wl~0); 4064#L464-1 assume !(1 == ~wl_pc~0); 4065#$Ultimate##44 assume !(2 == ~wl_pc~0); 4060#L477 assume !(1 == ~c1_pc~0); 4041#L487 assume !(1 == ~c2_pc~0); 4043#L496 assume !(1 == ~wb_pc~0); 4085#L505 assume !(1 == ~e_c~0); 4086#L514-1 assume !(1 == ~e_e~0); 4107#L519-1 assume !(1 == ~e_f~0); 4116#L524-1 assume !(1 == ~e_g~0); 4117#L529-1 assume !(1 == ~e_c~0); 3984#L534-1 assume !(1 == ~e_wl~0); 3985#L676-1 assume !false; 3987#L546 [2023-11-12 02:16:24,902 INFO L750 eck$LassoCheckResult]: Loop: 3987#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 4035#L381 assume !false; 4108#L299 assume !(0 == ~wl_st~0); 4110#L303 assume !(0 == ~c1_st~0); 4209#L306 assume !(0 == ~c2_st~0); 4196#L309 assume !(0 == ~wb_st~0); 4197#L312 assume !(0 == ~r_st~0); 4212#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 4218#L552 assume !(1 == ~c_req_up~0); 4159#L552-2 start_simulation_~kernel_st~0#1 := 3; 4160#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 4040#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 3992#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3993#L574-1 assume !(0 == ~e_c~0); 4012#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 4013#L584-1 assume 1 == ~wl_pc~0; 4133#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 4134#L597 assume !(1 == ~c1_pc~0); 4073#L607 assume !(1 == ~c2_pc~0); 4074#L616 assume !(1 == ~wb_pc~0); 4173#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 4157#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 4147#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 4148#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 4178#L649-1 assume !(1 == ~e_c~0); 4118#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4052#L659-1 assume 0 == ~wl_st~0; 3986#L676-1 assume !false; 3987#L546 [2023-11-12 02:16:24,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:24,902 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2023-11-12 02:16:24,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:24,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943722440] [2023-11-12 02:16:24,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:24,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:24,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:16:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:24,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:16:24,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:24,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1635242511, now seen corresponding path program 2 times [2023-11-12 02:16:24,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:24,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373739567] [2023-11-12 02:16:24,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:24,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:24,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:16:24,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:24,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373739567] [2023-11-12 02:16:24,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373739567] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:24,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:24,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:16:24,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550042412] [2023-11-12 02:16:24,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:24,972 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-12 02:16:24,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:24,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:16:24,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:16:24,981 INFO L87 Difference]: Start difference. First operand 316 states and 543 transitions. cyclomatic complexity: 230 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:24,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:25,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:25,017 INFO L93 Difference]: Finished difference Result 378 states and 658 transitions. [2023-11-12 02:16:25,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 378 states and 658 transitions. [2023-11-12 02:16:25,021 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 204 [2023-11-12 02:16:25,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 378 states to 363 states and 628 transitions. [2023-11-12 02:16:25,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2023-11-12 02:16:25,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2023-11-12 02:16:25,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 363 states and 628 transitions. [2023-11-12 02:16:25,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:16:25,026 INFO L218 hiAutomatonCegarLoop]: Abstraction has 363 states and 628 transitions. [2023-11-12 02:16:25,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states and 628 transitions. [2023-11-12 02:16:25,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2023-11-12 02:16:25,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 363 states have (on average 1.7300275482093663) internal successors, (628), 362 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 628 transitions. [2023-11-12 02:16:25,038 INFO L240 hiAutomatonCegarLoop]: Abstraction has 363 states and 628 transitions. [2023-11-12 02:16:25,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:16:25,039 INFO L428 stractBuchiCegarLoop]: Abstraction has 363 states and 628 transitions. [2023-11-12 02:16:25,040 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-12 02:16:25,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 363 states and 628 transitions. [2023-11-12 02:16:25,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 204 [2023-11-12 02:16:25,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:16:25,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:16:25,044 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:16:25,044 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:16:25,044 INFO L748 eck$LassoCheckResult]: Stem: 4761#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 4762#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 4816#L408 assume !(1 == ~c_req_up~0); 4750#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4899#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4919#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4863#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4864#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4827#L439-1 assume !(0 == ~e_f~0); 4690#L444-1 assume !(0 == ~e_g~0); 4691#L449-1 assume !(0 == ~e_e~0); 4852#L454-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4853#L459-1 assume !(0 == ~e_wl~0); 4988#L464-1 assume !(1 == ~wl_pc~0); 4986#$Ultimate##44 assume !(2 == ~wl_pc~0); 4984#L477 assume !(1 == ~c1_pc~0); 4982#L487 assume !(1 == ~c2_pc~0); 4900#L496 assume !(1 == ~wb_pc~0); 4784#L505 assume 1 == ~e_c~0;~r_st~0 := 0; 4785#L514-1 assume !(1 == ~e_e~0); 4923#L519-1 assume !(1 == ~e_f~0); 4922#L524-1 assume !(1 == ~e_g~0); 4921#L529-1 assume 1 == ~e_c~0;~e_c~0 := 2; 4684#L534-1 assume !(1 == ~e_wl~0); 4685#L676-1 assume !false; 4924#L546 [2023-11-12 02:16:25,044 INFO L750 eck$LassoCheckResult]: Loop: 4924#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 4958#L381 assume !false; 4807#L299 assume !(0 == ~wl_st~0); 4809#L303 assume !(0 == ~c1_st~0); 4917#L306 assume !(0 == ~c2_st~0); 4904#L309 assume !(0 == ~wb_st~0); 4905#L312 assume !(0 == ~r_st~0); 4908#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 4821#L552 assume !(1 == ~c_req_up~0); 4822#L552-2 start_simulation_~kernel_st~0#1 := 3; 4730#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 4731#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 4692#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 4693#L574-1 assume !(0 == ~e_c~0); 4712#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 4713#L584-1 assume 1 == ~wl_pc~0; 4834#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 4835#L597 assume !(1 == ~c1_pc~0); 4772#L607 assume !(1 == ~c2_pc~0); 4773#L616 assume !(1 == ~wb_pc~0); 4877#L625 assume !(1 == ~e_c~0); 4859#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 4848#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 4849#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 4882#L649-1 assume !(1 == ~e_c~0); 4883#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4968#L659-1 assume 0 == ~wl_st~0; 4963#L676-1 assume !false; 4924#L546 [2023-11-12 02:16:25,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:25,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1430068998, now seen corresponding path program 1 times [2023-11-12 02:16:25,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:25,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527151457] [2023-11-12 02:16:25,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:25,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:25,104 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:16:25,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:25,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527151457] [2023-11-12 02:16:25,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527151457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:25,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:25,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:16:25,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476662791] [2023-11-12 02:16:25,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:25,106 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:16:25,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:25,106 INFO L85 PathProgramCache]: Analyzing trace with hash 825895885, now seen corresponding path program 1 times [2023-11-12 02:16:25,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:25,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364205511] [2023-11-12 02:16:25,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:25,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:25,114 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:16:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:25,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:16:25,360 INFO L210 LassoAnalysis]: Preferences: [2023-11-12 02:16:25,361 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-12 02:16:25,361 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-12 02:16:25,361 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-12 02:16:25,361 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-12 02:16:25,361 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:25,361 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-12 02:16:25,361 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-12 02:16:25,361 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2023-11-12 02:16:25,361 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-12 02:16:25,362 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-12 02:16:25,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:25,371 INFO 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:16:25,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:25,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:25,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:25,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:16:25,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:25,388 INFO 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:16:25,391 INFO 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:16:25,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:16:25,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:25,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:25,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:25,406 INFO 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:16:25,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:16:25,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:16:25,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:16:25,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:16:25,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:25,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:16:25,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:16:25,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:25,434 INFO 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:16:25,436 INFO 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:16:25,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:16:25,458 INFO 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:16:25,709 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-12 02:16:25,710 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-12 02:16:25,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:25,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:25,711 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:25,721 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-12 02:16:25,721 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:16:25,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:25,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:25,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:25,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:25,747 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:25,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:25,750 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-12 02:16:25,750 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-12 02:16:25,771 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-12 02:16:25,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:25,779 INFO L210 LassoAnalysis]: Preferences: [2023-11-12 02:16:25,779 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-12 02:16:25,779 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-12 02:16:25,779 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-12 02:16:25,779 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-12 02:16:25,779 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:25,779 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-12 02:16:25,779 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-12 02:16:25,779 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2023-11-12 02:16:25,780 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-12 02:16:25,780 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-12 02:16:25,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:25,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:16:25,790 INFO 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:16:25,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:25,796 INFO 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:16:25,801 INFO 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:16:25,804 INFO 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:16:25,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:16:25,809 INFO 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:16:25,812 INFO 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:16:25,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:25,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:25,823 INFO 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:16:25,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:25,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:25,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:16:25,836 INFO 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:16:25,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:16:25,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:16:25,844 INFO 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:16:25,847 INFO 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:16:25,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:25,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:16:25,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:16:25,858 INFO 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:16:25,864 INFO 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:16:26,102 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-12 02:16:26,103 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-12 02:16:26,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:26,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:26,104 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:26,113 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:16:26,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:16:26,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:16:26,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:16:26,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:16:26,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:16:26,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:16:26,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:16:26,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:26,140 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:16:26,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:26,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:26,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:26,150 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:26,154 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:16:26,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:26,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:16:26,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:16:26,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:16:26,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:16:26,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:16:26,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:16:26,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:16:26,170 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-12 02:16:26,173 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-12 02:16:26,173 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-12 02:16:26,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:16:26,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:16:26,174 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:26,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:26,178 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-12 02:16:26,178 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-12 02:16:26,178 INFO L513 LassoAnalysis]: Proved termination. [2023-11-12 02:16:26,178 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_f~0) = -1*~e_f~0 + 1 Supporting invariants [] [2023-11-12 02:16:26,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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:16:26,189 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-12 02:16:26,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:26,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-12 02:16:26,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:16:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:26,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:16:26,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:16:26,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-11-12 02:16:26,412 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:16:26,413 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:16:26,413 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 363 states and 628 transitions. cyclomatic complexity: 268 Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:26,463 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 363 states and 628 transitions. cyclomatic complexity: 268. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 980 states and 1690 transitions. Complement of second has 5 states. [2023-11-12 02:16:26,464 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:16:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2023-11-12 02:16:26,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 212 transitions. Stem has 25 letters. Loop has 28 letters. [2023-11-12 02:16:26,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:16:26,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 212 transitions. Stem has 53 letters. Loop has 28 letters. [2023-11-12 02:16:26,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:16:26,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 212 transitions. Stem has 25 letters. Loop has 56 letters. [2023-11-12 02:16:26,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:16:26,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 980 states and 1690 transitions. [2023-11-12 02:16:26,479 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 388 [2023-11-12 02:16:26,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 980 states to 965 states and 1669 transitions. [2023-11-12 02:16:26,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 448 [2023-11-12 02:16:26,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 454 [2023-11-12 02:16:26,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 965 states and 1669 transitions. [2023-11-12 02:16:26,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:16:26,491 INFO L218 hiAutomatonCegarLoop]: Abstraction has 965 states and 1669 transitions. [2023-11-12 02:16:26,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states and 1669 transitions. [2023-11-12 02:16:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 944. [2023-11-12 02:16:26,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 944 states have (on average 1.7394067796610169) internal successors, (1642), 943 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:26,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1642 transitions. [2023-11-12 02:16:26,516 INFO L240 hiAutomatonCegarLoop]: Abstraction has 944 states and 1642 transitions. [2023-11-12 02:16:26,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:26,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:16:26,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:16:26,517 INFO L87 Difference]: Start difference. First operand 944 states and 1642 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:26,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:26,632 INFO L93 Difference]: Finished difference Result 1315 states and 2246 transitions. [2023-11-12 02:16:26,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1315 states and 2246 transitions. [2023-11-12 02:16:26,644 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 484 [2023-11-12 02:16:26,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1315 states to 1315 states and 2246 transitions. [2023-11-12 02:16:26,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 572 [2023-11-12 02:16:26,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 572 [2023-11-12 02:16:26,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1315 states and 2246 transitions. [2023-11-12 02:16:26,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:16:26,659 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1315 states and 2246 transitions. [2023-11-12 02:16:26,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states and 2246 transitions. [2023-11-12 02:16:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1125. [2023-11-12 02:16:26,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1125 states have (on average 1.7182222222222223) internal successors, (1933), 1124 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1933 transitions. [2023-11-12 02:16:26,691 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1125 states and 1933 transitions. [2023-11-12 02:16:26,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:16:26,692 INFO L428 stractBuchiCegarLoop]: Abstraction has 1125 states and 1933 transitions. [2023-11-12 02:16:26,692 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-12 02:16:26,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1125 states and 1933 transitions. [2023-11-12 02:16:26,699 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 400 [2023-11-12 02:16:26,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:16:26,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:16:26,700 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:16:26,700 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:26,700 INFO L748 eck$LassoCheckResult]: Stem: 8545#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 8546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 8600#L408 assume !(1 == ~c_req_up~0); 8712#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 8729#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 8730#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 8738#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 8737#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 8611#L439-1 assume !(0 == ~e_f~0); 8474#L444-1 assume !(0 == ~e_g~0); 8475#L449-1 assume !(0 == ~e_e~0); 8636#L454-1 assume !(0 == ~e_c~0); 8637#L459-1 assume !(0 == ~e_wl~0); 8547#L464-1 assume !(1 == ~wl_pc~0); 8548#$Ultimate##44 assume !(2 == ~wl_pc~0); 8542#L477 assume !(1 == ~c1_pc~0); 8544#L487 assume !(1 == ~c2_pc~0); 9087#L496 assume !(1 == ~wb_pc~0); 9085#L505 assume 1 == ~e_c~0;~r_st~0 := 0; 8569#L514-1 assume !(1 == ~e_e~0); 8597#L519-1 assume !(1 == ~e_f~0); 8603#L524-1 assume !(1 == ~e_g~0); 8604#L529-1 assume 1 == ~e_c~0;~e_c~0 := 2; 8468#L534-1 assume !(1 == ~e_wl~0); 8469#L676-1 assume !false; 8808#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 8519#L381 [2023-11-12 02:16:26,701 INFO L750 eck$LassoCheckResult]: Loop: 8519#L381 assume !false; 8592#L299 assume 0 == ~wl_st~0; 8550#L312-1 assume !(0 == ~wl_st~0); 8551#L321 assume !(0 == ~c1_st~0); 8512#L336 assume !(0 == ~c2_st~0); 8572#L351 assume !(0 == ~wb_st~0); 8481#L366 assume !(0 == ~r_st~0); 8519#L381 [2023-11-12 02:16:26,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:26,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1632637821, now seen corresponding path program 1 times [2023-11-12 02:16:26,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:26,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745150387] [2023-11-12 02:16:26,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:26,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:26,743 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:16:26,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:26,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745150387] [2023-11-12 02:16:26,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745150387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:26,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:26,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:16:26,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239057180] [2023-11-12 02:16:26,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:26,744 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:16:26,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:26,745 INFO L85 PathProgramCache]: Analyzing trace with hash 121813293, now seen corresponding path program 1 times [2023-11-12 02:16:26,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:26,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347147813] [2023-11-12 02:16:26,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:26,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:26,754 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:16:26,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:26,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347147813] [2023-11-12 02:16:26,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347147813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:26,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:26,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:16:26,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153316974] [2023-11-12 02:16:26,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:26,756 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-12 02:16:26,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:26,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:16:26,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:16:26,757 INFO L87 Difference]: Start difference. First operand 1125 states and 1933 transitions. cyclomatic complexity: 819 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:26,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:26,802 INFO L93 Difference]: Finished difference Result 1795 states and 3046 transitions. [2023-11-12 02:16:26,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1795 states and 3046 transitions. [2023-11-12 02:16:26,818 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 646 [2023-11-12 02:16:26,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1795 states to 1795 states and 3046 transitions. [2023-11-12 02:16:26,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 726 [2023-11-12 02:16:26,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 726 [2023-11-12 02:16:26,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1795 states and 3046 transitions. [2023-11-12 02:16:26,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:16:26,836 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1795 states and 3046 transitions. [2023-11-12 02:16:26,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states and 3046 transitions. [2023-11-12 02:16:26,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1795. [2023-11-12 02:16:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1795 states have (on average 1.6969359331476324) internal successors, (3046), 1794 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:26,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 3046 transitions. [2023-11-12 02:16:26,883 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1795 states and 3046 transitions. [2023-11-12 02:16:26,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:16:26,884 INFO L428 stractBuchiCegarLoop]: Abstraction has 1795 states and 3046 transitions. [2023-11-12 02:16:26,884 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-12 02:16:26,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1795 states and 3046 transitions. [2023-11-12 02:16:26,896 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 646 [2023-11-12 02:16:26,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:16:26,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:16:26,897 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:16:26,897 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:26,897 INFO L748 eck$LassoCheckResult]: Stem: 11472#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 11473#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 11525#L408 assume !(1 == ~c_req_up~0); 11461#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 11691#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 11690#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 11689#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 11688#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 11538#L439-1 assume !(0 == ~e_f~0); 11401#L444-1 assume !(0 == ~e_g~0); 11402#L449-1 assume !(0 == ~e_e~0); 11565#L454-1 assume !(0 == ~e_c~0); 11566#L459-1 assume !(0 == ~e_wl~0); 11474#L464-1 assume !(1 == ~wl_pc~0); 11475#$Ultimate##44 assume !(2 == ~wl_pc~0); 11470#L477 assume !(1 == ~c1_pc~0); 11452#L487 assume !(1 == ~c2_pc~0); 11454#L496 assume !(1 == ~wb_pc~0); 12093#L505 assume 1 == ~e_c~0;~r_st~0 := 0; 11494#L514-1 assume !(1 == ~e_e~0); 11693#L519-1 assume !(1 == ~e_f~0); 11692#L524-1 assume !(1 == ~e_g~0); 11680#L529-1 assume 1 == ~e_c~0;~e_c~0 := 2; 11395#L534-1 assume !(1 == ~e_wl~0); 11396#L676-1 assume !false; 12065#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 12417#L381 [2023-11-12 02:16:26,897 INFO L750 eck$LassoCheckResult]: Loop: 12417#L381 assume !false; 12907#L299 assume 0 == ~wl_st~0; 12905#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 12902#L325 assume !(0 != eval_~tmp~0#1); 11588#L321 assume !(0 == ~c1_st~0); 11439#L336 assume !(0 == ~c2_st~0); 11497#L351 assume !(0 == ~wb_st~0); 11408#L366 assume !(0 == ~r_st~0); 12417#L381 [2023-11-12 02:16:26,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:26,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1632637821, now seen corresponding path program 2 times [2023-11-12 02:16:26,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:26,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413771369] [2023-11-12 02:16:26,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:26,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:26,936 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:16:26,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:26,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413771369] [2023-11-12 02:16:26,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413771369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:26,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:26,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:16:26,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853097697] [2023-11-12 02:16:26,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:26,938 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:16:26,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:26,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1284632440, now seen corresponding path program 1 times [2023-11-12 02:16:26,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:26,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722981953] [2023-11-12 02:16:26,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:26,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:26,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:16:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:26,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:16:26,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:26,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:16:26,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:16:26,982 INFO L87 Difference]: Start difference. First operand 1795 states and 3046 transitions. cyclomatic complexity: 1262 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:27,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:27,037 INFO L93 Difference]: Finished difference Result 3100 states and 5202 transitions. [2023-11-12 02:16:27,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3100 states and 5202 transitions. [2023-11-12 02:16:27,064 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1226 [2023-11-12 02:16:27,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3100 states to 2525 states and 4241 transitions. [2023-11-12 02:16:27,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1311 [2023-11-12 02:16:27,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1343 [2023-11-12 02:16:27,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2525 states and 4241 transitions. [2023-11-12 02:16:27,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:16:27,090 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2525 states and 4241 transitions. [2023-11-12 02:16:27,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states and 4241 transitions. [2023-11-12 02:16:27,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 1638. [2023-11-12 02:16:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1638 states have (on average 1.6904761904761905) internal successors, (2769), 1637 states have internal predecessors, (2769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2769 transitions. [2023-11-12 02:16:27,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1638 states and 2769 transitions. [2023-11-12 02:16:27,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:16:27,183 INFO L428 stractBuchiCegarLoop]: Abstraction has 1638 states and 2769 transitions. [2023-11-12 02:16:27,183 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-12 02:16:27,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1638 states and 2769 transitions. [2023-11-12 02:16:27,193 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 646 [2023-11-12 02:16:27,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:16:27,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:16:27,194 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:16:27,194 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:27,194 INFO L748 eck$LassoCheckResult]: Stem: 16373#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 16374#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 16424#L408 assume !(1 == ~c_req_up~0); 16515#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 16516#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 16557#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 16558#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 16549#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 16436#L439-1 assume !(0 == ~e_f~0); 16302#L444-1 assume !(0 == ~e_g~0); 16303#L449-1 assume !(0 == ~e_e~0); 16463#L454-1 assume !(0 == ~e_c~0); 16464#L459-1 assume !(0 == ~e_wl~0); 16544#L464-1 assume !(1 == ~wl_pc~0); 16596#$Ultimate##44 assume !(2 == ~wl_pc~0); 16592#L477 assume !(1 == ~c1_pc~0); 16590#L487 assume !(1 == ~c2_pc~0); 16587#L496 assume !(1 == ~wb_pc~0); 16394#L505 assume !(1 == ~e_c~0); 16395#L514-1 assume !(1 == ~e_e~0); 16417#L519-1 assume 1 == ~e_f~0;~e_f~0 := 2; 16425#L524-1 assume !(1 == ~e_g~0); 16426#L529-1 assume !(1 == ~e_c~0); 16296#L534-1 assume !(1 == ~e_wl~0); 16297#L676-1 assume !false; 16733#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 16347#L381 [2023-11-12 02:16:27,194 INFO L750 eck$LassoCheckResult]: Loop: 16347#L381 assume !false; 17800#L299 assume 0 == ~wl_st~0; 17757#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 17794#L325 assume !(0 != eval_~tmp~0#1); 16487#L321 assume !(0 == ~c1_st~0); 16340#L336 assume !(0 == ~c2_st~0); 16398#L351 assume !(0 == ~wb_st~0); 16309#L366 assume !(0 == ~r_st~0); 16347#L381 [2023-11-12 02:16:27,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:27,195 INFO L85 PathProgramCache]: Analyzing trace with hash 766092475, now seen corresponding path program 1 times [2023-11-12 02:16:27,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:27,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960616453] [2023-11-12 02:16:27,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:27,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:27,236 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:16:27,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:27,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960616453] [2023-11-12 02:16:27,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960616453] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:27,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:27,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:16:27,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576415773] [2023-11-12 02:16:27,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:27,238 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:16:27,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:27,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1284632440, now seen corresponding path program 2 times [2023-11-12 02:16:27,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:27,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774493586] [2023-11-12 02:16:27,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:27,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:27,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:16:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:27,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:16:27,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:27,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:16:27,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:16:27,280 INFO L87 Difference]: Start difference. First operand 1638 states and 2769 transitions. cyclomatic complexity: 1138 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:27,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:27,423 INFO L93 Difference]: Finished difference Result 2129 states and 3576 transitions. [2023-11-12 02:16:27,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2129 states and 3576 transitions. [2023-11-12 02:16:27,440 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 870 [2023-11-12 02:16:27,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2129 states to 2129 states and 3576 transitions. [2023-11-12 02:16:27,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1079 [2023-11-12 02:16:27,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1079 [2023-11-12 02:16:27,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2129 states and 3576 transitions. [2023-11-12 02:16:27,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:16:27,460 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2129 states and 3576 transitions. [2023-11-12 02:16:27,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states and 3576 transitions. [2023-11-12 02:16:27,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1941. [2023-11-12 02:16:27,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1941 states have (on average 1.6867594023699124) internal successors, (3274), 1940 states have internal predecessors, (3274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 3274 transitions. [2023-11-12 02:16:27,510 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1941 states and 3274 transitions. [2023-11-12 02:16:27,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:16:27,511 INFO L428 stractBuchiCegarLoop]: Abstraction has 1941 states and 3274 transitions. [2023-11-12 02:16:27,511 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-12 02:16:27,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1941 states and 3274 transitions. [2023-11-12 02:16:27,520 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 728 [2023-11-12 02:16:27,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:16:27,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:16:27,521 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:16:27,521 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:27,521 INFO L748 eck$LassoCheckResult]: Stem: 20150#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 20151#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 20205#L408 assume !(1 == ~c_req_up~0); 20139#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 20366#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 20367#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 20259#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 20260#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 20217#L439-1 assume !(0 == ~e_f~0); 20079#L444-1 assume !(0 == ~e_g~0); 20080#L449-1 assume !(0 == ~e_e~0); 20243#L454-1 assume !(0 == ~e_c~0); 20244#L459-1 assume !(0 == ~e_wl~0); 20152#L464-1 assume !(1 == ~wl_pc~0); 20153#$Ultimate##44 assume !(2 == ~wl_pc~0); 20446#L477 assume !(1 == ~c1_pc~0); 20405#L487 assume !(1 == ~c2_pc~0); 20401#L496 assume !(1 == ~wb_pc~0); 20398#L505 assume !(1 == ~e_c~0); 20396#L514-1 assume !(1 == ~e_e~0); 20393#L519-1 assume !(1 == ~e_f~0); 20391#L524-1 assume !(1 == ~e_g~0); 20373#L529-1 assume !(1 == ~e_c~0); 20374#L534-1 assume !(1 == ~e_wl~0); 21328#L676-1 assume !false; 21011#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 20124#L381 [2023-11-12 02:16:27,521 INFO L750 eck$LassoCheckResult]: Loop: 20124#L381 assume !false; 20198#L299 assume 0 == ~wl_st~0; 20155#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 20156#L325 assume !(0 != eval_~tmp~0#1); 20271#L321 assume !(0 == ~c1_st~0); 20117#L336 assume !(0 == ~c2_st~0); 20175#L351 assume !(0 == ~wb_st~0); 20086#L366 assume !(0 == ~r_st~0); 20124#L381 [2023-11-12 02:16:27,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:27,522 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2023-11-12 02:16:27,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:27,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583689194] [2023-11-12 02:16:27,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:27,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:27,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:16:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:27,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:16:27,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:27,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1284632440, now seen corresponding path program 3 times [2023-11-12 02:16:27,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:27,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707066283] [2023-11-12 02:16:27,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:27,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:27,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:16:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:27,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:16:27,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:27,549 INFO L85 PathProgramCache]: Analyzing trace with hash 365677936, now seen corresponding path program 1 times [2023-11-12 02:16:27,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:27,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666173981] [2023-11-12 02:16:27,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:27,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:27,579 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:16:27,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:27,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666173981] [2023-11-12 02:16:27,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666173981] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:27,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:27,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:16:27,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050703343] [2023-11-12 02:16:27,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:27,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:27,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:16:27,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:16:27,616 INFO L87 Difference]: Start difference. First operand 1941 states and 3274 transitions. cyclomatic complexity: 1340 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:27,658 INFO L93 Difference]: Finished difference Result 3072 states and 5123 transitions. [2023-11-12 02:16:27,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3072 states and 5123 transitions. [2023-11-12 02:16:27,678 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1134 [2023-11-12 02:16:27,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3072 states to 3072 states and 5123 transitions. [2023-11-12 02:16:27,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1394 [2023-11-12 02:16:27,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1394 [2023-11-12 02:16:27,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3072 states and 5123 transitions. [2023-11-12 02:16:27,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:16:27,707 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3072 states and 5123 transitions. [2023-11-12 02:16:27,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states and 5123 transitions. [2023-11-12 02:16:27,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3072. [2023-11-12 02:16:27,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 3072 states have (on average 1.6676432291666667) internal successors, (5123), 3071 states have internal predecessors, (5123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 5123 transitions. [2023-11-12 02:16:27,807 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3072 states and 5123 transitions. [2023-11-12 02:16:27,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:16:27,808 INFO L428 stractBuchiCegarLoop]: Abstraction has 3072 states and 5123 transitions. [2023-11-12 02:16:27,808 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-12 02:16:27,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3072 states and 5123 transitions. [2023-11-12 02:16:27,819 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1134 [2023-11-12 02:16:27,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:16:27,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:16:27,820 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:16:27,820 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:27,821 INFO L748 eck$LassoCheckResult]: Stem: 25174#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 25175#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 25227#L408 assume !(1 == ~c_req_up~0); 25161#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 25376#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 25377#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 25282#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 25283#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 25239#L439-1 assume !(0 == ~e_f~0); 25240#L444-1 assume !(0 == ~e_g~0); 25447#L449-1 assume !(0 == ~e_e~0); 25440#L454-1 assume !(0 == ~e_c~0); 25439#L459-1 assume !(0 == ~e_wl~0); 25438#L464-1 assume !(1 == ~wl_pc~0); 25428#$Ultimate##44 assume !(2 == ~wl_pc~0); 25420#L477 assume !(1 == ~c1_pc~0); 25412#L487 assume !(1 == ~c2_pc~0); 25405#L496 assume !(1 == ~wb_pc~0); 25401#L505 assume !(1 == ~e_c~0); 25398#L514-1 assume !(1 == ~e_e~0); 25394#L519-1 assume !(1 == ~e_f~0); 25392#L524-1 assume !(1 == ~e_g~0); 25382#L529-1 assume !(1 == ~e_c~0); 25383#L534-1 assume !(1 == ~e_wl~0); 27458#L676-1 assume !false; 27459#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 25696#L381 [2023-11-12 02:16:27,821 INFO L750 eck$LassoCheckResult]: Loop: 25696#L381 assume !false; 27253#L299 assume 0 == ~wl_st~0; 27225#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 27222#L325 assume !(0 != eval_~tmp~0#1); 27221#L321 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 27204#L340 assume !(0 != eval_~tmp___0~0#1); 27220#L336 assume !(0 == ~c2_st~0); 27320#L351 assume !(0 == ~wb_st~0); 27295#L366 assume !(0 == ~r_st~0); 25696#L381 [2023-11-12 02:16:27,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:27,821 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2023-11-12 02:16:27,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:27,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722273580] [2023-11-12 02:16:27,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:27,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:27,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:16:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:27,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:16:27,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:27,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1117173442, now seen corresponding path program 1 times [2023-11-12 02:16:27,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:27,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863684786] [2023-11-12 02:16:27,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:27,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:27,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:16:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:27,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:16:27,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:27,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1600612406, now seen corresponding path program 1 times [2023-11-12 02:16:27,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:27,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048071062] [2023-11-12 02:16:27,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:27,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:27,884 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:16:27,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:27,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048071062] [2023-11-12 02:16:27,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048071062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:27,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:27,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:16:27,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832695946] [2023-11-12 02:16:27,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:27,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:27,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:16:27,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:16:27,922 INFO L87 Difference]: Start difference. First operand 3072 states and 5123 transitions. cyclomatic complexity: 2058 Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:27,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:27,972 INFO L93 Difference]: Finished difference Result 4987 states and 8221 transitions. [2023-11-12 02:16:27,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4987 states and 8221 transitions. [2023-11-12 02:16:28,001 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1784 [2023-11-12 02:16:28,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4987 states to 4987 states and 8221 transitions. [2023-11-12 02:16:28,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2289 [2023-11-12 02:16:28,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2289 [2023-11-12 02:16:28,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4987 states and 8221 transitions. [2023-11-12 02:16:28,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:16:28,043 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4987 states and 8221 transitions. [2023-11-12 02:16:28,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states and 8221 transitions. [2023-11-12 02:16:28,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4987. [2023-11-12 02:16:28,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4987 states, 4987 states have (on average 1.648486063765791) internal successors, (8221), 4986 states have internal predecessors, (8221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:28,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4987 states to 4987 states and 8221 transitions. [2023-11-12 02:16:28,151 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4987 states and 8221 transitions. [2023-11-12 02:16:28,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:16:28,152 INFO L428 stractBuchiCegarLoop]: Abstraction has 4987 states and 8221 transitions. [2023-11-12 02:16:28,152 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-12 02:16:28,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4987 states and 8221 transitions. [2023-11-12 02:16:28,176 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1784 [2023-11-12 02:16:28,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:16:28,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:16:28,177 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:16:28,177 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:28,177 INFO L748 eck$LassoCheckResult]: Stem: 33239#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 33240#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 33294#L408 assume !(1 == ~c_req_up~0); 33226#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 33436#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 33434#L424-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 33435#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 36847#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 36846#L439-1 assume !(0 == ~e_f~0); 36845#L444-1 assume !(0 == ~e_g~0); 36844#L449-1 assume !(0 == ~e_e~0); 36842#L454-1 assume !(0 == ~e_c~0); 36841#L459-1 assume !(0 == ~e_wl~0); 36840#L464-1 assume !(1 == ~wl_pc~0); 36838#$Ultimate##44 assume !(2 == ~wl_pc~0); 36836#L477 assume !(1 == ~c1_pc~0); 36829#L487 assume !(1 == ~c2_pc~0); 36826#L496 assume !(1 == ~wb_pc~0); 36823#L505 assume !(1 == ~e_c~0); 36822#L514-1 assume !(1 == ~e_e~0); 36819#L519-1 assume !(1 == ~e_f~0); 36814#L524-1 assume !(1 == ~e_g~0); 36813#L529-1 assume !(1 == ~e_c~0); 36812#L534-1 assume !(1 == ~e_wl~0); 36811#L676-1 assume !false; 36768#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 33715#L381 [2023-11-12 02:16:28,177 INFO L750 eck$LassoCheckResult]: Loop: 33715#L381 assume !false; 37859#L299 assume 0 == ~wl_st~0; 35885#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 35883#L325 assume !(0 != eval_~tmp~0#1); 35884#L321 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 37085#L340 assume !(0 != eval_~tmp___0~0#1); 37164#L336 assume !(0 == ~c2_st~0); 37879#L351 assume !(0 == ~wb_st~0); 37863#L366 assume !(0 == ~r_st~0); 33715#L381 [2023-11-12 02:16:28,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:28,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2023-11-12 02:16:28,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:28,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344623681] [2023-11-12 02:16:28,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:28,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:28,205 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:16:28,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:28,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344623681] [2023-11-12 02:16:28,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344623681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:28,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:28,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:16:28,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146583019] [2023-11-12 02:16:28,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:28,206 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:16:28,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:28,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1117173442, now seen corresponding path program 2 times [2023-11-12 02:16:28,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:28,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237623064] [2023-11-12 02:16:28,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:28,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:28,210 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:16:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:28,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:16:28,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:28,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:16:28,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:16:28,254 INFO L87 Difference]: Start difference. First operand 4987 states and 8221 transitions. cyclomatic complexity: 3241 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:28,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:28,367 INFO L93 Difference]: Finished difference Result 4887 states and 8039 transitions. [2023-11-12 02:16:28,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4887 states and 8039 transitions. [2023-11-12 02:16:28,396 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1784 [2023-11-12 02:16:28,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4887 states to 4887 states and 8039 transitions. [2023-11-12 02:16:28,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2190 [2023-11-12 02:16:28,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2190 [2023-11-12 02:16:28,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4887 states and 8039 transitions. [2023-11-12 02:16:28,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:16:28,439 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4887 states and 8039 transitions. [2023-11-12 02:16:28,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4887 states and 8039 transitions. [2023-11-12 02:16:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4887 to 4887. [2023-11-12 02:16:28,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4887 states, 4887 states have (on average 1.644976468180888) internal successors, (8039), 4886 states have internal predecessors, (8039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 8039 transitions. [2023-11-12 02:16:28,551 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4887 states and 8039 transitions. [2023-11-12 02:16:28,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:16:28,552 INFO L428 stractBuchiCegarLoop]: Abstraction has 4887 states and 8039 transitions. [2023-11-12 02:16:28,552 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-12 02:16:28,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4887 states and 8039 transitions. [2023-11-12 02:16:28,567 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1784 [2023-11-12 02:16:28,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:16:28,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:16:28,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:16:28,568 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:28,569 INFO L748 eck$LassoCheckResult]: Stem: 43120#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 43121#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 43175#L408 assume !(1 == ~c_req_up~0); 43108#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 43332#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 43333#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 43235#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 43236#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 43187#L439-1 assume !(0 == ~e_f~0); 43047#L444-1 assume !(0 == ~e_g~0); 43048#L449-1 assume !(0 == ~e_e~0); 43216#L454-1 assume !(0 == ~e_c~0); 43217#L459-1 assume !(0 == ~e_wl~0); 43122#L464-1 assume !(1 == ~wl_pc~0); 43123#$Ultimate##44 assume !(2 == ~wl_pc~0); 43118#L477 assume !(1 == ~c1_pc~0); 43104#L487 assume !(1 == ~c2_pc~0); 43106#L496 assume !(1 == ~wb_pc~0); 43141#L505 assume !(1 == ~e_c~0); 43142#L514-1 assume !(1 == ~e_e~0); 43385#L519-1 assume !(1 == ~e_f~0); 43384#L524-1 assume !(1 == ~e_g~0); 43343#L529-1 assume !(1 == ~e_c~0); 43344#L534-1 assume !(1 == ~e_wl~0); 44771#L676-1 assume !false; 44038#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 44039#L381 [2023-11-12 02:16:28,569 INFO L750 eck$LassoCheckResult]: Loop: 44039#L381 assume !false; 43165#L299 assume 0 == ~wl_st~0; 43166#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 45980#L325 assume !(0 != eval_~tmp~0#1); 43242#L321 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 43243#L340 assume !(0 != eval_~tmp___0~0#1); 43301#L336 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 47568#L355 assume !(0 != eval_~tmp___1~0#1); 47628#L351 assume !(0 == ~wb_st~0); 47692#L366 assume !(0 == ~r_st~0); 44039#L381 [2023-11-12 02:16:28,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:28,569 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2023-11-12 02:16:28,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:28,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66940358] [2023-11-12 02:16:28,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:28,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:28,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:16:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:28,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:16:28,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:28,585 INFO L85 PathProgramCache]: Analyzing trace with hash 270987588, now seen corresponding path program 1 times [2023-11-12 02:16:28,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:28,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82277788] [2023-11-12 02:16:28,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:28,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:28,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:16:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:28,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:16:28,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:28,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1918972220, now seen corresponding path program 1 times [2023-11-12 02:16:28,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:28,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461613562] [2023-11-12 02:16:28,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:28,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:16:28,623 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:16:28,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:16:28,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461613562] [2023-11-12 02:16:28,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461613562] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:16:28,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:16:28,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:16:28,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584578846] [2023-11-12 02:16:28,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:16:28,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:16:28,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:16:28,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:16:28,672 INFO L87 Difference]: Start difference. First operand 4887 states and 8039 transitions. cyclomatic complexity: 3159 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:28,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:16:28,735 INFO L93 Difference]: Finished difference Result 8309 states and 13515 transitions. [2023-11-12 02:16:28,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8309 states and 13515 transitions. [2023-11-12 02:16:28,776 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3066 [2023-11-12 02:16:28,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8309 states to 8309 states and 13515 transitions. [2023-11-12 02:16:28,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3674 [2023-11-12 02:16:28,875 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3674 [2023-11-12 02:16:28,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8309 states and 13515 transitions. [2023-11-12 02:16:28,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-12 02:16:28,879 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8309 states and 13515 transitions. [2023-11-12 02:16:28,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8309 states and 13515 transitions. [2023-11-12 02:16:28,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8309 to 8309. [2023-11-12 02:16:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8309 states, 8309 states have (on average 1.6265495246118666) internal successors, (13515), 8308 states have internal predecessors, (13515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:16:29,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8309 states to 8309 states and 13515 transitions. [2023-11-12 02:16:29,037 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8309 states and 13515 transitions. [2023-11-12 02:16:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:16:29,038 INFO L428 stractBuchiCegarLoop]: Abstraction has 8309 states and 13515 transitions. [2023-11-12 02:16:29,038 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-12 02:16:29,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8309 states and 13515 transitions. [2023-11-12 02:16:29,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3066 [2023-11-12 02:16:29,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:16:29,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:16:29,066 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:16:29,066 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:16:29,066 INFO L748 eck$LassoCheckResult]: Stem: 56322#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 56323#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 56379#L408 assume !(1 == ~c_req_up~0); 56313#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 56548#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 56549#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 56440#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 56441#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 56391#L439-1 assume !(0 == ~e_f~0); 56251#L444-1 assume !(0 == ~e_g~0); 56252#L449-1 assume !(0 == ~e_e~0); 56421#L454-1 assume !(0 == ~e_c~0); 56422#L459-1 assume !(0 == ~e_wl~0); 56324#L464-1 assume !(1 == ~wl_pc~0); 56325#$Ultimate##44 assume !(2 == ~wl_pc~0); 56320#L477 assume !(1 == ~c1_pc~0); 56309#L487 assume !(1 == ~c2_pc~0); 56311#L496 assume !(1 == ~wb_pc~0); 56343#L505 assume !(1 == ~e_c~0); 56344#L514-1 assume !(1 == ~e_e~0); 56603#L519-1 assume !(1 == ~e_f~0); 56602#L524-1 assume !(1 == ~e_g~0); 56560#L529-1 assume !(1 == ~e_c~0); 56245#L534-1 assume !(1 == ~e_wl~0); 56246#L676-1 assume !false; 61932#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 58760#L381 [2023-11-12 02:16:29,066 INFO L750 eck$LassoCheckResult]: Loop: 58760#L381 assume !false; 64390#L299 assume 0 == ~wl_st~0; 63024#L312-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 63021#L325 assume !(0 != eval_~tmp~0#1); 63022#L321 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 63721#L340 assume !(0 != eval_~tmp___0~0#1); 63717#L336 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 63681#L355 assume !(0 != eval_~tmp___1~0#1); 63710#L351 assume 0 == ~wb_st~0;havoc eval_#t~nondet7#1;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 63807#L370 assume !(0 != eval_~tmp___2~0#1); 63922#L366 assume !(0 == ~r_st~0); 58760#L381 [2023-11-12 02:16:29,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:29,067 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2023-11-12 02:16:29,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:29,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248474408] [2023-11-12 02:16:29,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:29,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:29,074 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:16:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:29,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:16:29,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:29,083 INFO L85 PathProgramCache]: Analyzing trace with hash -189354762, now seen corresponding path program 1 times [2023-11-12 02:16:29,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:29,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726578700] [2023-11-12 02:16:29,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:29,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:29,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:16:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:29,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:16:29,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:16:29,089 INFO L85 PathProgramCache]: Analyzing trace with hash -641438722, now seen corresponding path program 1 times [2023-11-12 02:16:29,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:16:29,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749751383] [2023-11-12 02:16:29,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:16:29,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:16:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:29,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:16:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:29,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:16:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:30,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:16:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:16:30,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.11 02:16:30 BoogieIcfgContainer [2023-11-12 02:16:30,523 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-12 02:16:30,524 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:16:30,524 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:16:30,524 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:16:30,524 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:16:19" (3/4) ... [2023-11-12 02:16:30,526 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-12 02:16:30,618 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:16:30,618 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:16:30,619 INFO L158 Benchmark]: Toolchain (without parser) took 12085.87ms. Allocated memory was 123.7MB in the beginning and 362.8MB in the end (delta: 239.1MB). Free memory was 79.1MB in the beginning and 261.0MB in the end (delta: -181.9MB). Peak memory consumption was 59.9MB. Max. memory is 16.1GB. [2023-11-12 02:16:30,619 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 123.7MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:16:30,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.99ms. Allocated memory is still 123.7MB. Free memory was 79.1MB in the beginning and 64.0MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-12 02:16:30,620 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.84ms. Allocated memory is still 123.7MB. Free memory was 64.0MB in the beginning and 61.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:16:30,620 INFO L158 Benchmark]: Boogie Preprocessor took 66.81ms. Allocated memory is still 123.7MB. Free memory was 61.9MB in the beginning and 59.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:16:30,620 INFO L158 Benchmark]: RCFGBuilder took 750.85ms. Allocated memory was 123.7MB in the beginning and 163.6MB in the end (delta: 39.8MB). Free memory was 59.8MB in the beginning and 119.7MB in the end (delta: -59.9MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2023-11-12 02:16:30,621 INFO L158 Benchmark]: BuchiAutomizer took 10720.63ms. Allocated memory was 163.6MB in the beginning and 362.8MB in the end (delta: 199.2MB). Free memory was 119.7MB in the beginning and 266.3MB in the end (delta: -146.6MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2023-11-12 02:16:30,622 INFO L158 Benchmark]: Witness Printer took 94.58ms. Allocated memory is still 362.8MB. Free memory was 266.3MB in the beginning and 261.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-12 02:16:30,624 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.68ms. Allocated memory is still 123.7MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.99ms. Allocated memory is still 123.7MB. Free memory was 79.1MB in the beginning and 64.0MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.84ms. Allocated memory is still 123.7MB. Free memory was 64.0MB in the beginning and 61.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.81ms. Allocated memory is still 123.7MB. Free memory was 61.9MB in the beginning and 59.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 750.85ms. Allocated memory was 123.7MB in the beginning and 163.6MB in the end (delta: 39.8MB). Free memory was 59.8MB in the beginning and 119.7MB in the end (delta: -59.9MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 10720.63ms. Allocated memory was 163.6MB in the beginning and 362.8MB in the end (delta: 199.2MB). Free memory was 119.7MB in the beginning and 266.3MB in the end (delta: -146.6MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. * Witness Printer took 94.58ms. Allocated memory is still 362.8MB. Free memory was 266.3MB in the beginning and 261.0MB 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 16 terminating modules (13 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_f) + 1) and consists of 3 locations. 13 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 8309 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.5s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 7.0s. Construction of modules took 0.3s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 1671 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3538 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3535 mSDsluCounter, 6482 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2390 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 280 IncrementalHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 4092 mSDtfsCounter, 280 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN3 SILU0 SILI3 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital79 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf96 smp100 dnf147 smp91 tf109 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 298]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L714] CALL start_simulation() [L404] int kernel_st ; [L407] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L408] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L419] COND TRUE (int )wl_i == 1 [L420] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L424] COND TRUE (int )c1_i == 1 [L425] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L429] COND TRUE (int )c2_i == 1 [L430] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L434] COND TRUE (int )wb_i == 1 [L435] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L439] COND FALSE !((int )r_i == 1) [L442] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L444] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L449] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L454] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L459] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L464] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L469] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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 == 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] [L487] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L496] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L505] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L514] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L519] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L524] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L529] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L534] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L539] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L545] COND TRUE 1 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L548] kernel_st = 1 [L549] CALL eval() [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L298] COND TRUE 1 [L300] COND TRUE (int )wl_st == 0 [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND FALSE !(\read(tmp)) [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND FALSE !(\read(tmp___0)) [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND FALSE !(\read(tmp___1)) [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND FALSE !(\read(tmp___2)) [L381] COND FALSE !((int )r_st == 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 298]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L714] CALL start_simulation() [L404] int kernel_st ; [L407] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L408] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L419] COND TRUE (int )wl_i == 1 [L420] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L424] COND TRUE (int )c1_i == 1 [L425] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L429] COND TRUE (int )c2_i == 1 [L430] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L434] COND TRUE (int )wb_i == 1 [L435] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L439] COND FALSE !((int )r_i == 1) [L442] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L444] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L449] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L454] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L459] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L464] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L469] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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 == 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] [L487] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L496] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L505] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L514] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L519] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L524] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L529] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L534] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L539] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L545] COND TRUE 1 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, 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] [L548] kernel_st = 1 [L549] CALL eval() [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L298] COND TRUE 1 [L300] COND TRUE (int )wl_st == 0 [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND FALSE !(\read(tmp)) [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND FALSE !(\read(tmp___0)) [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND FALSE !(\read(tmp___1)) [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND FALSE !(\read(tmp___2)) [L381] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-12 02:16:30,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e81ed9d-07b7-4914-bbd7-a01054d2c660/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)