./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/toy2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 527bcce2 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_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/toy2.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx --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 a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 21:00:31,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 21:00:31,277 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-21 21:00:31,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 21:00:31,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 21:00:31,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 21:00:31,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 21:00:31,326 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 21:00:31,327 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 21:00:31,332 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 21:00:31,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 21:00:31,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 21:00:31,341 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 21:00:31,345 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-21 21:00:31,345 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-21 21:00:31,346 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-21 21:00:31,346 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-21 21:00:31,347 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-21 21:00:31,347 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-21 21:00:31,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 21:00:31,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-21 21:00:31,349 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 21:00:31,349 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 21:00:31,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 21:00:31,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 21:00:31,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-21 21:00:31,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-21 21:00:31,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-21 21:00:31,352 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 21:00:31,352 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 21:00:31,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 21:00:31,354 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-21 21:00:31,354 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 21:00:31,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 21:00:31,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 21:00:31,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 21:00:31,356 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 21:00:31,356 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-21 21:00:31,357 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_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/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_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx 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 -> a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 [2023-11-21 21:00:31,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 21:00:31,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 21:00:31,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 21:00:31,746 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 21:00:31,747 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 21:00:31,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/systemc/toy2.cil.c [2023-11-21 21:00:34,902 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 21:00:35,221 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 21:00:35,222 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/sv-benchmarks/c/systemc/toy2.cil.c [2023-11-21 21:00:35,237 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/data/76f0c2cf5/96029e191f1f4dd7baa9d0574d625b72/FLAG3b496d4f6 [2023-11-21 21:00:35,255 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/data/76f0c2cf5/96029e191f1f4dd7baa9d0574d625b72 [2023-11-21 21:00:35,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 21:00:35,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 21:00:35,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 21:00:35,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 21:00:35,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 21:00:35,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:00:35" (1/1) ... [2023-11-21 21:00:35,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@727cdf0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:00:35, skipping insertion in model container [2023-11-21 21:00:35,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:00:35" (1/1) ... [2023-11-21 21:00:35,343 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 21:00:35,606 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:00:35,625 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 21:00:35,707 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:00:35,722 INFO L206 MainTranslator]: Completed translation [2023-11-21 21:00:35,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:00:35 WrapperNode [2023-11-21 21:00:35,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 21:00:35,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 21:00:35,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 21:00:35,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 21:00:35,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:00:35" (1/1) ... [2023-11-21 21:00:35,742 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:00:35" (1/1) ... [2023-11-21 21:00:35,774 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 361 [2023-11-21 21:00:35,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 21:00:35,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 21:00:35,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 21:00:35,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 21:00:35,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:00:35" (1/1) ... [2023-11-21 21:00:35,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:00:35" (1/1) ... [2023-11-21 21:00:35,790 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:00:35" (1/1) ... [2023-11-21 21:00:35,809 INFO L187 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-21 21:00:35,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:00:35" (1/1) ... [2023-11-21 21:00:35,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:00:35" (1/1) ... [2023-11-21 21:00:35,831 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:00:35" (1/1) ... [2023-11-21 21:00:35,841 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:00:35" (1/1) ... [2023-11-21 21:00:35,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:00:35" (1/1) ... [2023-11-21 21:00:35,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:00:35" (1/1) ... [2023-11-21 21:00:35,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 21:00:35,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 21:00:35,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 21:00:35,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 21:00:35,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:00:35" (1/1) ... [2023-11-21 21:00:35,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:35,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:35,907 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:35,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-21 21:00:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 21:00:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 21:00:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 21:00:35,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 21:00:36,031 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 21:00:36,035 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 21:00:36,559 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 21:00:36,572 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 21:00:36,572 INFO L308 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-21 21:00:36,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:00:36 BoogieIcfgContainer [2023-11-21 21:00:36,574 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 21:00:36,575 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-21 21:00:36,575 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-21 21:00:36,579 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-21 21:00:36,580 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 21:00:36,580 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 09:00:35" (1/3) ... [2023-11-21 21:00:36,581 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1162bc46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 09:00:36, skipping insertion in model container [2023-11-21 21:00:36,581 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 21:00:36,581 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:00:35" (2/3) ... [2023-11-21 21:00:36,582 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1162bc46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 09:00:36, skipping insertion in model container [2023-11-21 21:00:36,582 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 21:00:36,582 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:00:36" (3/3) ... [2023-11-21 21:00:36,583 INFO L332 chiAutomizerObserver]: Analyzing ICFG toy2.cil.c [2023-11-21 21:00:36,644 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-21 21:00:36,644 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-21 21:00:36,645 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-21 21:00:36,645 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-21 21:00:36,645 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-21 21:00:36,645 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-21 21:00:36,645 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-21 21:00:36,646 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-21 21:00:36,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.823076923076923) internal successors, (237), 130 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:36,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2023-11-21 21:00:36,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:00:36,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:00:36,688 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-21 21:00:36,688 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-21 21:00:36,688 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-21 21:00:36,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.823076923076923) internal successors, (237), 130 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:36,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2023-11-21 21:00:36,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:00:36,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:00:36,742 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-21 21:00:36,744 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-21 21:00:36,753 INFO L748 eck$LassoCheckResult]: Stem: 32#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 42#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 113#L404true assume !(1 == ~c_req_up~0); 61#L404-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 22#L415-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 50#L420-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 84#L425-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 39#L430-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 125#L435-1true assume !(0 == ~e_f~0); 26#L440-1true assume !(0 == ~e_g~0); 44#L445-1true assume !(0 == ~e_e~0); 47#L450-1true assume !(0 == ~e_c~0); 21#L455-1true assume !(0 == ~e_wl~0); 76#L460-1true assume !(1 == ~wl_pc~0); 96#$Ultimate##44true assume !(2 == ~wl_pc~0); 121#L473true assume !(1 == ~c1_pc~0); 103#L483true assume !(1 == ~c2_pc~0); 115#L492true assume !(1 == ~wb_pc~0); 52#L501true assume !(1 == ~e_c~0); 31#L510-1true assume !(1 == ~e_e~0); 23#L515-1true assume !(1 == ~e_f~0); 14#L520-1true assume !(1 == ~e_g~0); 45#L525-1true assume !(1 == ~e_c~0); 82#L530-1true assume !(1 == ~e_wl~0); 65#L672-1true [2023-11-21 21:00:36,755 INFO L750 eck$LassoCheckResult]: Loop: 65#L672-1true assume !false; 6#L542true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 128#L377true assume !true; 86#eval_returnLabel#1true havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 64#L548true assume !(1 == ~c_req_up~0); 9#L548-2true start_simulation_~kernel_st~0#1 := 3; 25#L560true assume 0 == ~e_f~0;~e_f~0 := 1; 97#L560-2true assume 0 == ~e_g~0;~e_g~0 := 1; 18#L565-1true assume 0 == ~e_e~0;~e_e~0 := 1; 129#L570-1true assume 0 == ~e_c~0;~e_c~0 := 1; 35#L575-1true assume !(0 == ~e_wl~0); 122#L580-1true assume !(1 == ~wl_pc~0); 75#$Ultimate##251true assume !(2 == ~wl_pc~0); 80#L593true assume !(1 == ~c1_pc~0); 116#L603true assume !(1 == ~c2_pc~0); 3#L612true assume !(1 == ~wb_pc~0); 60#L621true assume 1 == ~e_c~0;~r_st~0 := 0; 58#L630-1true assume 1 == ~e_e~0;~e_e~0 := 2; 131#L635-1true assume 1 == ~e_f~0;~e_f~0 := 2; 130#L640-1true assume 1 == ~e_g~0;~e_g~0 := 2; 111#L645-1true assume 1 == ~e_c~0;~e_c~0 := 2; 11#L650-1true assume !(1 == ~e_wl~0); 40#L655-1true assume 0 == ~wl_st~0; 65#L672-1true [2023-11-21 21:00:36,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:36,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2023-11-21 21:00:36,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:36,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014628796] [2023-11-21 21:00:36,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:36,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:37,156 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-21 21:00:37,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:00:37,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014628796] [2023-11-21 21:00:37,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014628796] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:00:37,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:00:37,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:00:37,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193023232] [2023-11-21 21:00:37,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:00:37,168 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 21:00:37,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:37,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1858065656, now seen corresponding path program 1 times [2023-11-21 21:00:37,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:37,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697914559] [2023-11-21 21:00:37,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:37,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:37,191 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-21 21:00:37,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:00:37,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697914559] [2023-11-21 21:00:37,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697914559] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:00:37,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:00:37,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:00:37,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31557472] [2023-11-21 21:00:37,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:00:37,195 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 21:00:37,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:00:37,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 21:00:37,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 21:00:37,247 INFO L87 Difference]: Start difference. First operand has 131 states, 130 states have (on average 1.823076923076923) internal successors, (237), 130 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:37,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:00:37,273 INFO L93 Difference]: Finished difference Result 129 states and 222 transitions. [2023-11-21 21:00:37,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 222 transitions. [2023-11-21 21:00:37,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2023-11-21 21:00:37,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 124 states and 217 transitions. [2023-11-21 21:00:37,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2023-11-21 21:00:37,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2023-11-21 21:00:37,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 217 transitions. [2023-11-21 21:00:37,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:00:37,292 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 217 transitions. [2023-11-21 21:00:37,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 217 transitions. [2023-11-21 21:00:37,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-21 21:00:37,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.75) internal successors, (217), 123 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 217 transitions. [2023-11-21 21:00:37,329 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 217 transitions. [2023-11-21 21:00:37,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:00:37,334 INFO L428 stractBuchiCegarLoop]: Abstraction has 124 states and 217 transitions. [2023-11-21 21:00:37,334 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-21 21:00:37,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 217 transitions. [2023-11-21 21:00:37,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2023-11-21 21:00:37,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:00:37,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:00:37,339 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-21 21:00:37,339 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-21 21:00:37,340 INFO L748 eck$LassoCheckResult]: Stem: 325#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 326#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 340#L404 assume !(1 == ~c_req_up~0); 363#L404-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 309#L415-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 310#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 351#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 337#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 338#L435-1 assume !(0 == ~e_f~0); 315#L440-1 assume !(0 == ~e_g~0); 316#L445-1 assume !(0 == ~e_e~0); 343#L450-1 assume !(0 == ~e_c~0); 307#L455-1 assume !(0 == ~e_wl~0); 308#L460-1 assume !(1 == ~wl_pc~0); 376#$Ultimate##44 assume !(2 == ~wl_pc~0); 354#L473 assume !(1 == ~c1_pc~0); 386#L483 assume !(1 == ~c2_pc~0); 297#L492 assume !(1 == ~wb_pc~0); 342#L501 assume !(1 == ~e_c~0); 324#L510-1 assume !(1 == ~e_e~0); 311#L515-1 assume !(1 == ~e_f~0); 294#L520-1 assume !(1 == ~e_g~0); 295#L525-1 assume !(1 == ~e_c~0); 344#L530-1 assume !(1 == ~e_wl~0); 292#L672-1 [2023-11-21 21:00:37,340 INFO L750 eck$LassoCheckResult]: Loop: 292#L672-1 assume !false; 278#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 279#L377 assume !false; 275#L295 assume !(0 == ~wl_st~0); 277#L299 assume !(0 == ~c1_st~0); 336#L302 assume !(0 == ~c2_st~0); 366#L305 assume !(0 == ~wb_st~0); 286#L308 assume !(0 == ~r_st~0); 287#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 365#L548 assume !(1 == ~c_req_up~0); 284#L548-2 start_simulation_~kernel_st~0#1 := 3; 285#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 314#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 304#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 305#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 332#L575-1 assume !(0 == ~e_wl~0); 333#L580-1 assume 1 == ~wl_pc~0; 385#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 375#L593 assume !(1 == ~c1_pc~0); 350#L603 assume !(1 == ~c2_pc~0); 269#L612 assume !(1 == ~wb_pc~0); 271#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 359#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 360#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 392#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 390#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 288#L650-1 assume !(1 == ~e_wl~0); 289#L655-1 assume 0 == ~wl_st~0; 292#L672-1 [2023-11-21 21:00:37,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:37,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2023-11-21 21:00:37,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:37,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051309524] [2023-11-21 21:00:37,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:37,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:37,457 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-21 21:00:37,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:00:37,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051309524] [2023-11-21 21:00:37,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051309524] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:00:37,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:00:37,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:00:37,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462861957] [2023-11-21 21:00:37,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:00:37,459 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 21:00:37,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:37,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233037, now seen corresponding path program 1 times [2023-11-21 21:00:37,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:37,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531192775] [2023-11-21 21:00:37,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:37,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:00:37,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:00:37,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531192775] [2023-11-21 21:00:37,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531192775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:00:37,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:00:37,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:00:37,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945825046] [2023-11-21 21:00:37,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:00:37,522 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 21:00:37,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:00:37,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:00:37,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:00:37,524 INFO L87 Difference]: Start difference. First operand 124 states and 217 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:37,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:00:37,546 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2023-11-21 21:00:37,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 216 transitions. [2023-11-21 21:00:37,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2023-11-21 21:00:37,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 216 transitions. [2023-11-21 21:00:37,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2023-11-21 21:00:37,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2023-11-21 21:00:37,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 216 transitions. [2023-11-21 21:00:37,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:00:37,555 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 216 transitions. [2023-11-21 21:00:37,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 216 transitions. [2023-11-21 21:00:37,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-21 21:00:37,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7419354838709677) internal successors, (216), 123 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 216 transitions. [2023-11-21 21:00:37,565 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 216 transitions. [2023-11-21 21:00:37,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:00:37,567 INFO L428 stractBuchiCegarLoop]: Abstraction has 124 states and 216 transitions. [2023-11-21 21:00:37,567 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-21 21:00:37,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 216 transitions. [2023-11-21 21:00:37,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2023-11-21 21:00:37,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:00:37,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:00:37,571 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-21 21:00:37,571 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-21 21:00:37,572 INFO L748 eck$LassoCheckResult]: Stem: 580#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 581#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 595#L404 assume !(1 == ~c_req_up~0); 618#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 564#L415-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 565#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 606#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 592#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 593#L435-1 assume !(0 == ~e_f~0); 570#L440-1 assume !(0 == ~e_g~0); 571#L445-1 assume !(0 == ~e_e~0); 598#L450-1 assume !(0 == ~e_c~0); 562#L455-1 assume !(0 == ~e_wl~0); 563#L460-1 assume !(1 == ~wl_pc~0); 631#$Ultimate##44 assume !(2 == ~wl_pc~0); 609#L473 assume !(1 == ~c1_pc~0); 641#L483 assume !(1 == ~c2_pc~0); 552#L492 assume !(1 == ~wb_pc~0); 597#L501 assume !(1 == ~e_c~0); 579#L510-1 assume !(1 == ~e_e~0); 566#L515-1 assume !(1 == ~e_f~0); 549#L520-1 assume !(1 == ~e_g~0); 550#L525-1 assume !(1 == ~e_c~0); 599#L530-1 assume !(1 == ~e_wl~0); 547#L672-1 [2023-11-21 21:00:37,572 INFO L750 eck$LassoCheckResult]: Loop: 547#L672-1 assume !false; 533#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 534#L377 assume !false; 530#L295 assume !(0 == ~wl_st~0); 532#L299 assume !(0 == ~c1_st~0); 591#L302 assume !(0 == ~c2_st~0); 621#L305 assume !(0 == ~wb_st~0); 541#L308 assume !(0 == ~r_st~0); 542#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 620#L548 assume !(1 == ~c_req_up~0); 539#L548-2 start_simulation_~kernel_st~0#1 := 3; 540#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 569#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 559#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 560#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 587#L575-1 assume !(0 == ~e_wl~0); 588#L580-1 assume 1 == ~wl_pc~0; 640#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 630#L593 assume !(1 == ~c1_pc~0); 605#L603 assume !(1 == ~c2_pc~0); 524#L612 assume !(1 == ~wb_pc~0); 526#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 614#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 615#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 647#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 645#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 543#L650-1 assume !(1 == ~e_wl~0); 544#L655-1 assume 0 == ~wl_st~0; 547#L672-1 [2023-11-21 21:00:37,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:37,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2023-11-21 21:00:37,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:37,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925724142] [2023-11-21 21:00:37,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:37,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:37,675 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-21 21:00:37,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:00:37,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925724142] [2023-11-21 21:00:37,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925724142] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:00:37,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:00:37,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:00:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593312891] [2023-11-21 21:00:37,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:00:37,679 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 21:00:37,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:37,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233037, now seen corresponding path program 2 times [2023-11-21 21:00:37,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:37,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591475950] [2023-11-21 21:00:37,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:37,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:37,737 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-21 21:00:37,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:00:37,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591475950] [2023-11-21 21:00:37,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591475950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:00:37,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:00:37,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:00:37,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55317129] [2023-11-21 21:00:37,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:00:37,741 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 21:00:37,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:00:37,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:00:37,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:00:37,745 INFO L87 Difference]: Start difference. First operand 124 states and 216 transitions. cyclomatic complexity: 93 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:37,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:00:37,790 INFO L93 Difference]: Finished difference Result 124 states and 215 transitions. [2023-11-21 21:00:37,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 215 transitions. [2023-11-21 21:00:37,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2023-11-21 21:00:37,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 215 transitions. [2023-11-21 21:00:37,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2023-11-21 21:00:37,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2023-11-21 21:00:37,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 215 transitions. [2023-11-21 21:00:37,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:00:37,803 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 215 transitions. [2023-11-21 21:00:37,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 215 transitions. [2023-11-21 21:00:37,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-21 21:00:37,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 123 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:37,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 215 transitions. [2023-11-21 21:00:37,820 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 215 transitions. [2023-11-21 21:00:37,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:00:37,822 INFO L428 stractBuchiCegarLoop]: Abstraction has 124 states and 215 transitions. [2023-11-21 21:00:37,823 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-21 21:00:37,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 215 transitions. [2023-11-21 21:00:37,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2023-11-21 21:00:37,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:00:37,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:00:37,828 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-21 21:00:37,829 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-21 21:00:37,829 INFO L748 eck$LassoCheckResult]: Stem: 835#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 836#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 850#L404 assume !(1 == ~c_req_up~0); 873#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 819#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 820#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 861#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 847#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 848#L435-1 assume !(0 == ~e_f~0); 825#L440-1 assume !(0 == ~e_g~0); 826#L445-1 assume !(0 == ~e_e~0); 853#L450-1 assume !(0 == ~e_c~0); 817#L455-1 assume !(0 == ~e_wl~0); 818#L460-1 assume !(1 == ~wl_pc~0); 886#$Ultimate##44 assume !(2 == ~wl_pc~0); 864#L473 assume !(1 == ~c1_pc~0); 896#L483 assume !(1 == ~c2_pc~0); 807#L492 assume !(1 == ~wb_pc~0); 852#L501 assume !(1 == ~e_c~0); 834#L510-1 assume !(1 == ~e_e~0); 821#L515-1 assume !(1 == ~e_f~0); 804#L520-1 assume !(1 == ~e_g~0); 805#L525-1 assume !(1 == ~e_c~0); 854#L530-1 assume !(1 == ~e_wl~0); 802#L672-1 [2023-11-21 21:00:37,830 INFO L750 eck$LassoCheckResult]: Loop: 802#L672-1 assume !false; 788#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 789#L377 assume !false; 785#L295 assume !(0 == ~wl_st~0); 787#L299 assume !(0 == ~c1_st~0); 846#L302 assume !(0 == ~c2_st~0); 876#L305 assume !(0 == ~wb_st~0); 796#L308 assume !(0 == ~r_st~0); 797#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 875#L548 assume !(1 == ~c_req_up~0); 794#L548-2 start_simulation_~kernel_st~0#1 := 3; 795#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 824#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 814#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 815#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 842#L575-1 assume !(0 == ~e_wl~0); 843#L580-1 assume !(1 == ~wl_pc~0); 883#$Ultimate##251 assume !(2 == ~wl_pc~0); 885#L593 assume !(1 == ~c1_pc~0); 860#L603 assume !(1 == ~c2_pc~0); 779#L612 assume !(1 == ~wb_pc~0); 781#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 869#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 870#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 902#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 900#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 798#L650-1 assume !(1 == ~e_wl~0); 799#L655-1 assume 0 == ~wl_st~0; 802#L672-1 [2023-11-21 21:00:37,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:37,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2023-11-21 21:00:37,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:37,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98420741] [2023-11-21 21:00:37,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:37,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:37,906 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-21 21:00:37,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:00:37,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98420741] [2023-11-21 21:00:37,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98420741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:00:37,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:00:37,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:00:37,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112856797] [2023-11-21 21:00:37,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:00:37,908 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 21:00:37,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:37,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1401973316, now seen corresponding path program 1 times [2023-11-21 21:00:37,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:37,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631187153] [2023-11-21 21:00:37,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:37,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:37,945 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-21 21:00:37,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:00:37,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631187153] [2023-11-21 21:00:37,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631187153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:00:37,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:00:37,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:00:37,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261295551] [2023-11-21 21:00:37,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:00:37,948 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 21:00:37,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:00:37,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:00:37,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:00:37,949 INFO L87 Difference]: Start difference. First operand 124 states and 215 transitions. cyclomatic complexity: 92 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:37,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:00:37,979 INFO L93 Difference]: Finished difference Result 124 states and 214 transitions. [2023-11-21 21:00:37,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 214 transitions. [2023-11-21 21:00:37,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2023-11-21 21:00:37,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 214 transitions. [2023-11-21 21:00:37,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2023-11-21 21:00:37,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2023-11-21 21:00:37,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 214 transitions. [2023-11-21 21:00:37,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:00:37,989 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 214 transitions. [2023-11-21 21:00:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 214 transitions. [2023-11-21 21:00:37,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-21 21:00:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7258064516129032) internal successors, (214), 123 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:38,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 214 transitions. [2023-11-21 21:00:38,004 INFO L240 hiAutomatonCegarLoop]: Abstraction has 124 states and 214 transitions. [2023-11-21 21:00:38,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:00:38,006 INFO L428 stractBuchiCegarLoop]: Abstraction has 124 states and 214 transitions. [2023-11-21 21:00:38,008 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-21 21:00:38,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 214 transitions. [2023-11-21 21:00:38,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2023-11-21 21:00:38,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:00:38,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:00:38,013 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:00:38,014 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:00:38,015 INFO L748 eck$LassoCheckResult]: Stem: 1090#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1091#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1105#L404 assume !(1 == ~c_req_up~0); 1128#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1074#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1075#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1116#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1102#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1103#L435-1 assume !(0 == ~e_f~0); 1080#L440-1 assume !(0 == ~e_g~0); 1081#L445-1 assume !(0 == ~e_e~0); 1108#L450-1 assume !(0 == ~e_c~0); 1072#L455-1 assume !(0 == ~e_wl~0); 1073#L460-1 assume !(1 == ~wl_pc~0); 1141#$Ultimate##44 assume !(2 == ~wl_pc~0); 1119#L473 assume !(1 == ~c1_pc~0); 1151#L483 assume !(1 == ~c2_pc~0); 1062#L492 assume !(1 == ~wb_pc~0); 1107#L501 assume !(1 == ~e_c~0); 1089#L510-1 assume !(1 == ~e_e~0); 1076#L515-1 assume !(1 == ~e_f~0); 1059#L520-1 assume !(1 == ~e_g~0); 1060#L525-1 assume !(1 == ~e_c~0); 1109#L530-1 assume !(1 == ~e_wl~0); 1057#L672-1 [2023-11-21 21:00:38,015 INFO L750 eck$LassoCheckResult]: Loop: 1057#L672-1 assume !false; 1043#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1044#L377 assume !false; 1040#L295 assume !(0 == ~wl_st~0); 1042#L299 assume !(0 == ~c1_st~0); 1101#L302 assume !(0 == ~c2_st~0); 1131#L305 assume !(0 == ~wb_st~0); 1051#L308 assume !(0 == ~r_st~0); 1052#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1130#L548 assume !(1 == ~c_req_up~0); 1049#L548-2 start_simulation_~kernel_st~0#1 := 3; 1050#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1079#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1069#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1070#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1097#L575-1 assume !(0 == ~e_wl~0); 1098#L580-1 assume !(1 == ~wl_pc~0); 1138#$Ultimate##251 assume !(2 == ~wl_pc~0); 1140#L593 assume !(1 == ~c1_pc~0); 1115#L603 assume !(1 == ~c2_pc~0); 1034#L612 assume !(1 == ~wb_pc~0); 1036#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 1124#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1125#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1157#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1155#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1053#L650-1 assume !(1 == ~e_wl~0); 1054#L655-1 assume 0 == ~wl_st~0; 1057#L672-1 [2023-11-21 21:00:38,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:38,016 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2023-11-21 21:00:38,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:38,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222214241] [2023-11-21 21:00:38,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:38,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:38,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:00:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:38,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:00:38,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:38,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1401973316, now seen corresponding path program 2 times [2023-11-21 21:00:38,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:38,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135438963] [2023-11-21 21:00:38,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:38,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:38,126 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-21 21:00:38,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:00:38,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135438963] [2023-11-21 21:00:38,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135438963] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:00:38,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:00:38,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:00:38,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806046391] [2023-11-21 21:00:38,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:00:38,129 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 21:00:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:00:38,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:00:38,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:00:38,130 INFO L87 Difference]: Start difference. First operand 124 states and 214 transitions. cyclomatic complexity: 91 Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:38,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:00:38,174 INFO L93 Difference]: Finished difference Result 180 states and 306 transitions. [2023-11-21 21:00:38,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 306 transitions. [2023-11-21 21:00:38,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 149 [2023-11-21 21:00:38,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 180 states and 306 transitions. [2023-11-21 21:00:38,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2023-11-21 21:00:38,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2023-11-21 21:00:38,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 306 transitions. [2023-11-21 21:00:38,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:00:38,182 INFO L218 hiAutomatonCegarLoop]: Abstraction has 180 states and 306 transitions. [2023-11-21 21:00:38,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 306 transitions. [2023-11-21 21:00:38,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2023-11-21 21:00:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 180 states have (on average 1.7) internal successors, (306), 179 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 306 transitions. [2023-11-21 21:00:38,199 INFO L240 hiAutomatonCegarLoop]: Abstraction has 180 states and 306 transitions. [2023-11-21 21:00:38,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:00:38,200 INFO L428 stractBuchiCegarLoop]: Abstraction has 180 states and 306 transitions. [2023-11-21 21:00:38,201 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-21 21:00:38,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 180 states and 306 transitions. [2023-11-21 21:00:38,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 149 [2023-11-21 21:00:38,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:00:38,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:00:38,204 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-21 21:00:38,204 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-21 21:00:38,204 INFO L748 eck$LassoCheckResult]: Stem: 1400#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1401#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1415#L404 assume !(1 == ~c_req_up~0); 1438#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1385#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1386#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1426#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1412#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1413#L435-1 assume !(0 == ~e_f~0); 1391#L440-1 assume !(0 == ~e_g~0); 1392#L445-1 assume !(0 == ~e_e~0); 1418#L450-1 assume !(0 == ~e_c~0); 1383#L455-1 assume !(0 == ~e_wl~0); 1384#L460-1 assume !(1 == ~wl_pc~0); 1453#$Ultimate##44 assume !(2 == ~wl_pc~0); 1429#L473 assume !(1 == ~c1_pc~0); 1465#L483 assume !(1 == ~c2_pc~0); 1373#L492 assume !(1 == ~wb_pc~0); 1417#L501 assume !(1 == ~e_c~0); 1399#L510-1 assume !(1 == ~e_e~0); 1387#L515-1 assume !(1 == ~e_f~0); 1370#L520-1 assume !(1 == ~e_g~0); 1371#L525-1 assume !(1 == ~e_c~0); 1419#L530-1 assume !(1 == ~e_wl~0); 1457#L672-1 [2023-11-21 21:00:38,204 INFO L750 eck$LassoCheckResult]: Loop: 1457#L672-1 assume !false; 1475#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1474#L377 assume !false; 1473#L295 assume !(0 == ~wl_st~0); 1351#L299 assume !(0 == ~c1_st~0); 1411#L302 assume !(0 == ~c2_st~0); 1441#L305 assume !(0 == ~wb_st~0); 1361#L308 assume !(0 == ~r_st~0); 1363#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1440#L548 assume !(1 == ~c_req_up~0); 1359#L548-2 start_simulation_~kernel_st~0#1 := 3; 1360#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1390#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1374#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1375#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1403#L575-1 assume !(0 == ~e_wl~0); 1404#L580-1 assume 1 == ~wl_pc~0; 1464#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1462#L593 assume !(1 == ~c1_pc~0); 1521#L603 assume !(1 == ~c2_pc~0); 1520#L612 assume !(1 == ~wb_pc~0); 1518#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 1517#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1516#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1515#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1514#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1513#L650-1 assume !(1 == ~e_wl~0); 1511#L655-1 assume 0 == ~wl_st~0; 1457#L672-1 [2023-11-21 21:00:38,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:38,205 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 2 times [2023-11-21 21:00:38,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:38,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427526590] [2023-11-21 21:00:38,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:38,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:38,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:00:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:38,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:00:38,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:38,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233037, now seen corresponding path program 3 times [2023-11-21 21:00:38,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:38,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440496163] [2023-11-21 21:00:38,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:38,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:38,271 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-21 21:00:38,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:00:38,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440496163] [2023-11-21 21:00:38,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440496163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:00:38,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:00:38,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:00:38,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72586387] [2023-11-21 21:00:38,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:00:38,276 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 21:00:38,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:00:38,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:00:38,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:00:38,280 INFO L87 Difference]: Start difference. First operand 180 states and 306 transitions. cyclomatic complexity: 127 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:38,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:00:38,328 INFO L93 Difference]: Finished difference Result 335 states and 566 transitions. [2023-11-21 21:00:38,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 335 states and 566 transitions. [2023-11-21 21:00:38,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 288 [2023-11-21 21:00:38,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 335 states to 335 states and 566 transitions. [2023-11-21 21:00:38,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 335 [2023-11-21 21:00:38,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 335 [2023-11-21 21:00:38,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 335 states and 566 transitions. [2023-11-21 21:00:38,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:00:38,338 INFO L218 hiAutomatonCegarLoop]: Abstraction has 335 states and 566 transitions. [2023-11-21 21:00:38,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states and 566 transitions. [2023-11-21 21:00:38,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2023-11-21 21:00:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 333 states have (on average 1.6936936936936937) internal successors, (564), 332 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:38,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 564 transitions. [2023-11-21 21:00:38,358 INFO L240 hiAutomatonCegarLoop]: Abstraction has 333 states and 564 transitions. [2023-11-21 21:00:38,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:00:38,361 INFO L428 stractBuchiCegarLoop]: Abstraction has 333 states and 564 transitions. [2023-11-21 21:00:38,361 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-21 21:00:38,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 333 states and 564 transitions. [2023-11-21 21:00:38,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 286 [2023-11-21 21:00:38,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:00:38,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:00:38,367 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-21 21:00:38,367 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-21 21:00:38,368 INFO L748 eck$LassoCheckResult]: Stem: 1925#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1926#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1943#L404 assume !(1 == ~c_req_up~0); 1965#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1907#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1908#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1952#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1938#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1939#L435-1 assume !(0 == ~e_f~0); 1913#L440-1 assume !(0 == ~e_g~0); 1914#L445-1 assume !(0 == ~e_e~0); 1944#L450-1 assume !(0 == ~e_c~0); 1904#L455-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1905#L460-1 assume !(1 == ~wl_pc~0); 2152#$Ultimate##44 assume !(2 == ~wl_pc~0); 2007#L473 assume !(1 == ~c1_pc~0); 2070#L483 assume !(1 == ~c2_pc~0); 2061#L492 assume !(1 == ~wb_pc~0); 1954#L501 assume !(1 == ~e_c~0); 1923#L510-1 assume !(1 == ~e_e~0); 1909#L515-1 assume !(1 == ~e_f~0); 1891#L520-1 assume !(1 == ~e_g~0); 1892#L525-1 assume !(1 == ~e_c~0); 1945#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1987#L672-1 [2023-11-21 21:00:38,368 INFO L750 eck$LassoCheckResult]: Loop: 1987#L672-1 assume !false; 2014#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 2015#L377 assume !false; 2084#L295 assume !(0 == ~wl_st~0); 1936#L299 assume !(0 == ~c1_st~0); 1937#L302 assume !(0 == ~c2_st~0); 1968#L305 assume !(0 == ~wb_st~0); 1882#L308 assume !(0 == ~r_st~0); 1884#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1967#L548 assume !(1 == ~c_req_up~0); 1880#L548-2 start_simulation_~kernel_st~0#1 := 3; 1881#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1912#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1901#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1902#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1931#L575-1 assume !(0 == ~e_wl~0); 1932#L580-1 assume 1 == ~wl_pc~0; 2004#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1997#L593 assume !(1 == ~c1_pc~0); 2039#L603 assume !(1 == ~c2_pc~0); 2038#L612 assume !(1 == ~wb_pc~0); 2036#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 2034#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 2031#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2028#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 2025#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 2022#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2019#L655-1 assume 0 == ~wl_st~0; 1987#L672-1 [2023-11-21 21:00:38,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:38,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2560361, now seen corresponding path program 1 times [2023-11-21 21:00:38,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:38,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120393718] [2023-11-21 21:00:38,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:38,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:38,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:00:38,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:00:38,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120393718] [2023-11-21 21:00:38,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120393718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:00:38,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:00:38,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 21:00:38,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861867] [2023-11-21 21:00:38,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:00:38,464 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 21:00:38,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:38,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233099, now seen corresponding path program 1 times [2023-11-21 21:00:38,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:38,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618879186] [2023-11-21 21:00:38,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:38,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:38,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:00:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:38,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:00:38,885 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 21:00:38,886 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 21:00:38,886 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 21:00:38,886 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 21:00:38,886 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-21 21:00:38,886 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:38,887 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 21:00:38,887 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 21:00:38,887 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration7_Loop [2023-11-21 21:00:38,887 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 21:00:38,887 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 21:00:38,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:38,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,298 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 21:00:39,298 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-21 21:00:39,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:39,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:39,303 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:39,315 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 21:00:39,315 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 21:00:39,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-21 21:00:39,348 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 21:00:39,349 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-21 21:00:39,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-11-21 21:00:39,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:39,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:39,373 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:39,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-21 21:00:39,379 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 21:00:39,379 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 21:00:39,429 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:39,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:39,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:39,431 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:39,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-21 21:00:39,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-21 21:00:39,436 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 21:00:39,459 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-21 21:00:39,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:39,478 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 21:00:39,478 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 21:00:39,478 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 21:00:39,478 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 21:00:39,479 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 21:00:39,479 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:39,479 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 21:00:39,479 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 21:00:39,479 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration7_Loop [2023-11-21 21:00:39,479 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 21:00:39,479 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 21:00:39,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:39,883 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 21:00:39,888 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 21:00:39,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:39,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:39,894 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:39,897 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-21 21:00:39,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-21 21:00:39,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:00:39,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 21:00:39,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:00:39,912 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-21 21:00:39,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:00:39,915 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-21 21:00:39,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 21:00:39,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:00:39,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:39,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:39,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:39,952 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:39,962 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-21 21:00:39,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-21 21:00:39,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:00:39,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 21:00:39,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:00:39,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:00:39,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:00:39,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 21:00:39,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 21:00:39,993 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 21:00:40,006 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-21 21:00:40,006 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-21 21:00:40,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:40,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:40,047 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:40,058 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 21:00:40,058 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-21 21:00:40,058 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 21:00:40,059 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2023-11-21 21:00:40,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-21 21:00:40,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:40,085 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-21 21:00:40,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:40,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 21:00:40,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:00:40,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:40,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 21:00:40,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:00:40,403 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-21 21:00:40,407 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-21 21:00:40,408 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 333 states and 564 transitions. cyclomatic complexity: 232 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:40,520 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 333 states and 564 transitions. cyclomatic complexity: 232. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1203 states and 2018 transitions. Complement of second has 5 states. [2023-11-21 21:00:40,521 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-21 21:00:40,521 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-21 21:00:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-11-21 21:00:40,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 28 letters. [2023-11-21 21:00:40,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 21:00:40,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 52 letters. Loop has 28 letters. [2023-11-21 21:00:40,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 21:00:40,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 56 letters. [2023-11-21 21:00:40,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 21:00:40,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1203 states and 2018 transitions. [2023-11-21 21:00:40,541 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 858 [2023-11-21 21:00:40,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1203 states to 1203 states and 2018 transitions. [2023-11-21 21:00:40,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 906 [2023-11-21 21:00:40,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 911 [2023-11-21 21:00:40,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1203 states and 2018 transitions. [2023-11-21 21:00:40,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 21:00:40,556 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1203 states and 2018 transitions. [2023-11-21 21:00:40,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states and 2018 transitions. [2023-11-21 21:00:40,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 912. [2023-11-21 21:00:40,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 912 states have (on average 1.6798245614035088) internal successors, (1532), 911 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1532 transitions. [2023-11-21 21:00:40,582 INFO L240 hiAutomatonCegarLoop]: Abstraction has 912 states and 1532 transitions. [2023-11-21 21:00:40,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:00:40,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 21:00:40,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 21:00:40,583 INFO L87 Difference]: Start difference. First operand 912 states and 1532 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:00:40,700 INFO L93 Difference]: Finished difference Result 1522 states and 2526 transitions. [2023-11-21 21:00:40,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1522 states and 2526 transitions. [2023-11-21 21:00:40,715 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1015 [2023-11-21 21:00:40,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1522 states to 1522 states and 2526 transitions. [2023-11-21 21:00:40,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1118 [2023-11-21 21:00:40,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1118 [2023-11-21 21:00:40,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1522 states and 2526 transitions. [2023-11-21 21:00:40,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 21:00:40,733 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1522 states and 2526 transitions. [2023-11-21 21:00:40,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states and 2526 transitions. [2023-11-21 21:00:40,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1469. [2023-11-21 21:00:40,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1469 states have (on average 1.6589516678012253) internal successors, (2437), 1468 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:40,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2437 transitions. [2023-11-21 21:00:40,773 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1469 states and 2437 transitions. [2023-11-21 21:00:40,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 21:00:40,774 INFO L428 stractBuchiCegarLoop]: Abstraction has 1469 states and 2437 transitions. [2023-11-21 21:00:40,774 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-21 21:00:40,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1469 states and 2437 transitions. [2023-11-21 21:00:40,784 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1013 [2023-11-21 21:00:40,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:00:40,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:00:40,786 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-21 21:00:40,786 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-21 21:00:40,786 INFO L748 eck$LassoCheckResult]: Stem: 6118#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 6119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 6148#L404 assume !(1 == ~c_req_up~0); 6191#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6088#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6089#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6165#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 6142#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 6143#L435-1 assume !(0 == ~e_f~0); 6099#L440-1 assume !(0 == ~e_g~0); 6100#L445-1 assume !(0 == ~e_e~0); 6151#L450-1 assume !(0 == ~e_c~0); 6086#L455-1 assume !(0 == ~e_wl~0); 6087#L460-1 assume !(1 == ~wl_pc~0); 6227#$Ultimate##44 assume !(2 == ~wl_pc~0); 6173#L473 assume !(1 == ~c1_pc~0); 6291#L483 assume !(1 == ~c2_pc~0); 6287#L492 assume !(1 == ~wb_pc~0); 6150#L501 assume !(1 == ~e_c~0); 6116#L510-1 assume !(1 == ~e_e~0); 6117#L515-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6064#L520-1 assume !(1 == ~e_g~0); 6065#L525-1 assume !(1 == ~e_c~0); 6152#L530-1 assume !(1 == ~e_wl~0); 6196#L672-1 [2023-11-21 21:00:40,786 INFO L750 eck$LassoCheckResult]: Loop: 6196#L672-1 assume !false; 6030#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 6031#L377 assume !false; 6297#L295 assume !(0 == ~wl_st~0); 7264#L299 assume !(0 == ~c1_st~0); 7263#L302 assume !(0 == ~c2_st~0); 7262#L305 assume !(0 == ~wb_st~0); 7260#L308 assume !(0 == ~r_st~0); 7259#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 7257#L548 assume !(1 == ~c_req_up~0); 7256#L548-2 start_simulation_~kernel_st~0#1 := 3; 7255#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 7130#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 6080#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 6081#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 6969#L575-1 assume !(0 == ~e_wl~0); 6898#L580-1 assume 1 == ~wl_pc~0; 6964#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 6235#L593 assume !(1 == ~c1_pc~0); 6162#L603 assume !(1 == ~c2_pc~0); 6014#L612 assume !(1 == ~wb_pc~0); 6016#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 6970#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 6925#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6924#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 6922#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 6921#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 6899#L655-1 assume 0 == ~wl_st~0; 6196#L672-1 [2023-11-21 21:00:40,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:40,787 INFO L85 PathProgramCache]: Analyzing trace with hash 255545497, now seen corresponding path program 1 times [2023-11-21 21:00:40,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:40,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442449021] [2023-11-21 21:00:40,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:40,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:40,836 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-21 21:00:40,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:00:40,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442449021] [2023-11-21 21:00:40,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442449021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:00:40,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:00:40,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 21:00:40,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962204342] [2023-11-21 21:00:40,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:00:40,837 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 21:00:40,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:40,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1951233099, now seen corresponding path program 2 times [2023-11-21 21:00:40,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:40,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315269756] [2023-11-21 21:00:40,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:40,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:40,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:00:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:40,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:00:41,166 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 21:00:41,167 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 21:00:41,167 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 21:00:41,167 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 21:00:41,167 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-21 21:00:41,167 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:41,167 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 21:00:41,168 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 21:00:41,168 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration8_Loop [2023-11-21 21:00:41,168 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 21:00:41,168 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 21:00:41,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,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-21 21:00:41,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-21 21:00:41,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-21 21:00:41,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-21 21:00:41,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-21 21:00:41,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,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-21 21:00:41,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,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-21 21:00:41,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,490 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 21:00:41,490 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-21 21:00:41,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:41,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:41,500 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:41,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-21 21:00:41,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 21:00:41,502 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 21:00:41,533 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 21:00:41,534 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-21 21:00:41,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:41,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:41,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:41,553 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:41,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-21 21:00:41,577 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 21:00:41,577 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 21:00:41,590 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 21:00:41,590 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-21 21:00:41,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:41,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:41,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:41,605 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:41,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-21 21:00:41,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 21:00:41,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 21:00:41,624 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 21:00:41,624 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-21 21:00:41,641 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-11-21 21:00:41,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:41,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:41,643 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:41,646 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 21:00:41,646 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 21:00:41,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-21 21:00:41,661 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 21:00:41,661 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-21 21:00:41,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:41,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:41,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:41,681 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:41,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-21 21:00:41,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 21:00:41,690 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 21:00:41,709 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 21:00:41,709 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-21 21:00:41,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:41,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:41,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:41,728 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:41,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-21 21:00:41,729 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 21:00:41,730 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 21:00:41,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-11-21 21:00:41,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:41,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:41,754 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:41,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-21 21:00:41,762 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-21 21:00:41,762 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 21:00:41,797 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-21 21:00:41,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:41,816 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 21:00:41,816 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 21:00:41,817 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 21:00:41,817 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 21:00:41,817 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 21:00:41,817 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:41,817 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 21:00:41,817 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 21:00:41,817 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration8_Loop [2023-11-21 21:00:41,817 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 21:00:41,817 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 21:00:41,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-21 21:00:41,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-21 21:00:41,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-21 21:00:41,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,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-21 21:00:41,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,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-21 21:00:41,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-21 21:00:41,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,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-21 21:00:41,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,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-21 21:00:41,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,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-21 21:00:41,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,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-21 21:00:41,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-21 21:00:41,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:41,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:42,128 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 21:00:42,130 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 21:00:42,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:42,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:42,131 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:42,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 21:00:42,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-21 21:00:42,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:00:42,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 21:00:42,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:00:42,159 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-21 21:00:42,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:00:42,160 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-21 21:00:42,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 21:00:42,177 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:00:42,201 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:42,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:42,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:42,202 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:42,211 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-21 21:00:42,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:00:42,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 21:00:42,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:00:42,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:00:42,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:00:42,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-21 21:00:42,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 21:00:42,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 21:00:42,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:00:42,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:42,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:42,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:42,266 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:42,269 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-21 21:00:42,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-21 21:00:42,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:00:42,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 21:00:42,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:00:42,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:00:42,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:00:42,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 21:00:42,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 21:00:42,293 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:00:42,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:42,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:42,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:42,322 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:42,325 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-21 21:00:42,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:00:42,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 21:00:42,337 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:00:42,337 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:00:42,337 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:00:42,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 21:00:42,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 21:00:42,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-21 21:00:42,354 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:00:42,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:42,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:42,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:42,382 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:42,389 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-21 21:00:42,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-21 21:00:42,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:00:42,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 21:00:42,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:00:42,402 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-21 21:00:42,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:00:42,403 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-21 21:00:42,403 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 21:00:42,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:00:42,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:42,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:42,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:42,438 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:42,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-21 21:00:42,446 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-21 21:00:42,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:00:42,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 21:00:42,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:00:42,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:00:42,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:00:42,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 21:00:42,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 21:00:42,469 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 21:00:42,472 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-21 21:00:42,472 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-21 21:00:42,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:42,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:42,474 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:42,476 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 21:00:42,476 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-21 21:00:42,476 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 21:00:42,476 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2023-11-21 21:00:42,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-21 21:00:42,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:42,498 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-21 21:00:42,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:42,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 21:00:42,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:00:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:42,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 21:00:42,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:00:42,685 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-21 21:00:42,686 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-21 21:00:42,686 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1469 states and 2437 transitions. cyclomatic complexity: 973 Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:42,749 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1469 states and 2437 transitions. cyclomatic complexity: 973. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3132 states and 5186 transitions. Complement of second has 5 states. [2023-11-21 21:00:42,749 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-21 21:00:42,750 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-21 21:00:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-11-21 21:00:42,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 24 letters. Loop has 28 letters. [2023-11-21 21:00:42,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 21:00:42,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 52 letters. Loop has 28 letters. [2023-11-21 21:00:42,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 21:00:42,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 24 letters. Loop has 56 letters. [2023-11-21 21:00:42,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 21:00:42,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3132 states and 5186 transitions. [2023-11-21 21:00:42,785 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 2026 [2023-11-21 21:00:42,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3132 states to 3132 states and 5186 transitions. [2023-11-21 21:00:42,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2087 [2023-11-21 21:00:42,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2096 [2023-11-21 21:00:42,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3132 states and 5186 transitions. [2023-11-21 21:00:42,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 21:00:42,821 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3132 states and 5186 transitions. [2023-11-21 21:00:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3132 states and 5186 transitions. [2023-11-21 21:00:42,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3132 to 1927. [2023-11-21 21:00:42,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1927 states have (on average 1.6564608199273483) internal successors, (3192), 1926 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:42,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 3192 transitions. [2023-11-21 21:00:42,882 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1927 states and 3192 transitions. [2023-11-21 21:00:42,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:00:42,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 21:00:42,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 21:00:42,883 INFO L87 Difference]: Start difference. First operand 1927 states and 3192 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:00:43,029 INFO L93 Difference]: Finished difference Result 3375 states and 5492 transitions. [2023-11-21 21:00:43,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3375 states and 5492 transitions. [2023-11-21 21:00:43,069 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1952 [2023-11-21 21:00:43,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3375 states to 3375 states and 5492 transitions. [2023-11-21 21:00:43,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2068 [2023-11-21 21:00:43,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2068 [2023-11-21 21:00:43,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3375 states and 5492 transitions. [2023-11-21 21:00:43,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 21:00:43,106 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3375 states and 5492 transitions. [2023-11-21 21:00:43,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3375 states and 5492 transitions. [2023-11-21 21:00:43,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:43,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3375 to 3342. [2023-11-21 21:00:43,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3342 states, 3342 states have (on average 1.6334530221424297) internal successors, (5459), 3341 states have internal predecessors, (5459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:43,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3342 states to 3342 states and 5459 transitions. [2023-11-21 21:00:43,264 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3342 states and 5459 transitions. [2023-11-21 21:00:43,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 21:00:43,265 INFO L428 stractBuchiCegarLoop]: Abstraction has 3342 states and 5459 transitions. [2023-11-21 21:00:43,266 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-21 21:00:43,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3342 states and 5459 transitions. [2023-11-21 21:00:43,287 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1946 [2023-11-21 21:00:43,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:00:43,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:00:43,288 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-21 21:00:43,289 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-21 21:00:43,289 INFO L748 eck$LassoCheckResult]: Stem: 16202#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 16203#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 16235#L404 assume !(1 == ~c_req_up~0); 16284#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 16285#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 16256#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 16257#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 16230#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 16231#L435-1 assume !(0 == ~e_f~0); 16183#L440-1 assume !(0 == ~e_g~0); 16184#L445-1 assume !(0 == ~e_e~0); 16246#L450-1 assume 0 == ~e_c~0;~e_c~0 := 1; 16171#L455-1 assume !(0 == ~e_wl~0); 16172#L460-1 assume !(1 == ~wl_pc~0); 16358#$Ultimate##44 assume !(2 == ~wl_pc~0); 16266#L473 assume !(1 == ~c1_pc~0); 16371#L483 assume !(1 == ~c2_pc~0); 16152#L492 assume !(1 == ~wb_pc~0); 16263#L501 assume !(1 == ~e_c~0); 16264#L510-1 assume !(1 == ~e_e~0); 16422#L515-1 assume !(1 == ~e_f~0); 16423#L520-1 assume !(1 == ~e_g~0); 16418#L525-1 assume !(1 == ~e_c~0); 16419#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 16340#L672-1 assume !false; 16440#L542 [2023-11-21 21:00:43,289 INFO L750 eck$LassoCheckResult]: Loop: 16440#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 18351#L377 assume !false; 18352#L295 assume !(0 == ~wl_st~0); 18748#L299 assume !(0 == ~c1_st~0); 18747#L302 assume !(0 == ~c2_st~0); 18746#L305 assume !(0 == ~wb_st~0); 18094#L308 assume !(0 == ~r_st~0); 16347#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 16348#L548 assume !(1 == ~c_req_up~0); 18470#L548-2 start_simulation_~kernel_st~0#1 := 3; 18471#L560 assume !(0 == ~e_f~0); 18744#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 18737#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 18738#L570-1 assume !(0 == ~e_c~0); 18728#L575-1 assume !(0 == ~e_wl~0); 18726#L580-1 assume 1 == ~wl_pc~0; 18724#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 18725#L593 assume !(1 == ~c1_pc~0); 18860#L603 assume !(1 == ~c2_pc~0); 18857#L612 assume !(1 == ~wb_pc~0); 18854#L621 assume 1 == ~e_c~0;~r_st~0 := 0; 18852#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 18850#L635-1 assume !(1 == ~e_f~0); 18847#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 18845#L645-1 assume !(1 == ~e_c~0); 18844#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 17610#L655-1 assume 0 == ~wl_st~0; 18841#L672-1 assume !false; 16440#L542 [2023-11-21 21:00:43,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:43,290 INFO L85 PathProgramCache]: Analyzing trace with hash 344940224, now seen corresponding path program 1 times [2023-11-21 21:00:43,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:43,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551911610] [2023-11-21 21:00:43,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:43,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:43,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:00:43,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:00:43,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551911610] [2023-11-21 21:00:43,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551911610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:00:43,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:00:43,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 21:00:43,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473638953] [2023-11-21 21:00:43,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:00:43,336 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 21:00:43,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:43,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1890226441, now seen corresponding path program 1 times [2023-11-21 21:00:43,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:43,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367356274] [2023-11-21 21:00:43,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:43,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:43,356 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-21 21:00:43,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:00:43,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367356274] [2023-11-21 21:00:43,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367356274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:00:43,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:00:43,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:00:43,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722362378] [2023-11-21 21:00:43,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:00:43,358 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 21:00:43,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:00:43,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 21:00:43,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 21:00:43,359 INFO L87 Difference]: Start difference. First operand 3342 states and 5459 transitions. cyclomatic complexity: 2132 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:43,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:00:43,459 INFO L93 Difference]: Finished difference Result 3395 states and 5500 transitions. [2023-11-21 21:00:43,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3395 states and 5500 transitions. [2023-11-21 21:00:43,486 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1979 [2023-11-21 21:00:43,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3395 states to 3395 states and 5500 transitions. [2023-11-21 21:00:43,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2098 [2023-11-21 21:00:43,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2098 [2023-11-21 21:00:43,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3395 states and 5500 transitions. [2023-11-21 21:00:43,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 21:00:43,520 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3395 states and 5500 transitions. [2023-11-21 21:00:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3395 states and 5500 transitions. [2023-11-21 21:00:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3395 to 3141. [2023-11-21 21:00:43,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3141 states have (on average 1.6275071633237823) internal successors, (5112), 3140 states have internal predecessors, (5112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:43,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 5112 transitions. [2023-11-21 21:00:43,601 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3141 states and 5112 transitions. [2023-11-21 21:00:43,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 21:00:43,602 INFO L428 stractBuchiCegarLoop]: Abstraction has 3141 states and 5112 transitions. [2023-11-21 21:00:43,602 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-21 21:00:43,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3141 states and 5112 transitions. [2023-11-21 21:00:43,617 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1979 [2023-11-21 21:00:43,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:00:43,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:00:43,618 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-21 21:00:43,618 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-21 21:00:43,619 INFO L748 eck$LassoCheckResult]: Stem: 22950#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 22951#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 22980#L404 assume !(1 == ~c_req_up~0); 23044#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 22919#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 22920#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 23077#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 22975#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 22976#L435-1 assume !(0 == ~e_f~0); 22930#L440-1 assume !(0 == ~e_g~0); 22931#L445-1 assume !(0 == ~e_e~0); 22991#L450-1 assume !(0 == ~e_c~0); 22917#L455-1 assume !(0 == ~e_wl~0); 22918#L460-1 assume !(1 == ~wl_pc~0); 23086#$Ultimate##44 assume !(2 == ~wl_pc~0); 23010#L473 assume !(1 == ~c1_pc~0); 23157#L483 assume !(1 == ~c2_pc~0); 23156#L492 assume !(1 == ~wb_pc~0); 23150#L501 assume !(1 == ~e_c~0); 23151#L510-1 assume !(1 == ~e_e~0); 22921#L515-1 assume !(1 == ~e_f~0); 22922#L520-1 assume !(1 == ~e_g~0); 22985#L525-1 assume !(1 == ~e_c~0); 22986#L530-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 23074#L672-1 assume !false; 25327#L542 [2023-11-21 21:00:43,619 INFO L750 eck$LassoCheckResult]: Loop: 25327#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 25326#L377 assume !false; 25325#L295 assume !(0 == ~wl_st~0); 24890#L299 assume !(0 == ~c1_st~0); 24884#L302 assume !(0 == ~c2_st~0); 24885#L305 assume !(0 == ~wb_st~0); 24876#L308 assume !(0 == ~r_st~0); 24878#eval_returnLabel#1 havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 24546#L548 assume !(1 == ~c_req_up~0); 24547#L548-2 start_simulation_~kernel_st~0#1 := 3; 22927#L560 assume !(0 == ~e_f~0); 22928#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 23087#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 25820#L570-1 assume !(0 == ~e_c~0); 25415#L575-1 assume !(0 == ~e_wl~0); 25412#L580-1 assume 1 == ~wl_pc~0; 25411#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 23093#L593 assume !(1 == ~c1_pc~0); 25398#L603 assume !(1 == ~c2_pc~0); 25393#L612 assume !(1 == ~wb_pc~0); 25387#L621 assume !(1 == ~e_c~0); 25384#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 25381#L635-1 assume !(1 == ~e_f~0); 25378#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 25374#L645-1 assume !(1 == ~e_c~0); 25369#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 25360#L655-1 assume 0 == ~wl_st~0; 25358#L672-1 assume !false; 25327#L542 [2023-11-21 21:00:43,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:43,620 INFO L85 PathProgramCache]: Analyzing trace with hash -666177026, now seen corresponding path program 1 times [2023-11-21 21:00:43,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:43,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242183618] [2023-11-21 21:00:43,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:43,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:43,669 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-21 21:00:43,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:00:43,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242183618] [2023-11-21 21:00:43,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242183618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:00:43,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:00:43,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 21:00:43,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055926559] [2023-11-21 21:00:43,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:00:43,671 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 21:00:43,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:43,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1080879815, now seen corresponding path program 1 times [2023-11-21 21:00:43,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:43,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644837882] [2023-11-21 21:00:43,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:43,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:43,677 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:00:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:43,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:00:43,986 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 21:00:43,986 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 21:00:43,986 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 21:00:43,986 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 21:00:43,986 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-21 21:00:43,986 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:43,987 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 21:00:43,987 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 21:00:43,987 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration10_Loop [2023-11-21 21:00:43,987 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 21:00:43,987 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 21:00:43,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,373 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 21:00:44,373 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-21 21:00:44,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:44,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:44,378 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:44,380 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 21:00:44,381 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 21:00:44,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-21 21:00:44,418 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 21:00:44,418 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet4#1=0} Honda state: {ULTIMATE.start_eval_#t~nondet4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-21 21:00:44,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:44,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:44,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:44,439 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:44,442 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 21:00:44,442 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 21:00:44,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-21 21:00:44,477 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 21:00:44,478 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-21 21:00:44,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:44,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:44,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:44,499 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:44,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 21:00:44,502 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 21:00:44,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-21 21:00:44,515 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 21:00:44,516 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-21 21:00:44,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-11-21 21:00:44,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:44,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:44,541 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:44,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-21 21:00:44,543 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 21:00:44,543 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 21:00:44,563 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 21:00:44,563 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=-1} Honda state: {~r_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-21 21:00:44,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-11-21 21:00:44,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:44,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:44,578 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:44,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-21 21:00:44,580 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 21:00:44,580 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 21:00:44,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-11-21 21:00:44,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:44,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:44,606 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:44,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-21 21:00:44,614 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-21 21:00:44,614 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 21:00:44,645 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-21 21:00:44,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:44,670 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 21:00:44,670 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 21:00:44,670 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 21:00:44,670 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 21:00:44,670 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 21:00:44,670 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:44,670 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 21:00:44,670 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 21:00:44,670 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy2.cil.c_Iteration10_Loop [2023-11-21 21:00:44,671 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 21:00:44,671 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 21:00:44,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,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-21 21:00:44,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,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-21 21:00:44,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,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-21 21:00:44,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:00:44,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-21 21:00:45,034 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 21:00:45,035 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 21:00:45,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:45,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:45,039 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:45,042 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-21 21:00:45,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-21 21:00:45,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:00:45,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 21:00:45,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:00:45,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:00:45,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:00:45,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 21:00:45,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 21:00:45,081 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:00:45,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2023-11-21 21:00:45,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:45,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:45,101 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:45,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-11-21 21:00:45,103 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-21 21:00:45,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:00:45,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 21:00:45,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:00:45,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:00:45,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:00:45,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 21:00:45,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 21:00:45,114 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:00:45,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2023-11-21 21:00:45,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:45,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:45,132 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:45,135 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-21 21:00:45,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:00:45,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 21:00:45,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:00:45,148 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-11-21 21:00:45,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:00:45,149 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-11-21 21:00:45,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 21:00:45,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-11-21 21:00:45,161 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:00:45,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-11-21 21:00:45,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:45,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:45,179 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:45,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-11-21 21:00:45,180 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-21 21:00:45,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:00:45,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 21:00:45,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:00:45,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:00:45,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:00:45,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 21:00:45,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 21:00:45,201 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 21:00:45,203 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-21 21:00:45,204 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-21 21:00:45,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:00:45,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:00:45,206 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:00:45,208 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 21:00:45,208 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-21 21:00:45,208 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 21:00:45,208 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2023-11-21 21:00:45,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-11-21 21:00:45,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2023-11-21 21:00:45,228 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-21 21:00:45,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:45,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 21:00:45,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:00:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:45,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 21:00:45,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:00:45,431 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-21 21:00:45,432 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-21 21:00:45,433 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3141 states and 5112 transitions. cyclomatic complexity: 1984 Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:45,523 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3141 states and 5112 transitions. cyclomatic complexity: 1984. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6730 states and 10970 transitions. Complement of second has 5 states. [2023-11-21 21:00:45,523 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-21 21:00:45,524 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-21 21:00:45,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2023-11-21 21:00:45,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 25 letters. Loop has 28 letters. [2023-11-21 21:00:45,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 21:00:45,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 53 letters. Loop has 28 letters. [2023-11-21 21:00:45,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 21:00:45,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 25 letters. Loop has 56 letters. [2023-11-21 21:00:45,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 21:00:45,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6730 states and 10970 transitions. [2023-11-21 21:00:45,573 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 3115 [2023-11-21 21:00:45,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6730 states to 6730 states and 10970 transitions. [2023-11-21 21:00:45,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3227 [2023-11-21 21:00:45,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3262 [2023-11-21 21:00:45,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6730 states and 10970 transitions. [2023-11-21 21:00:45,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 21:00:45,640 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6730 states and 10970 transitions. [2023-11-21 21:00:45,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6730 states and 10970 transitions. [2023-11-21 21:00:45,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-11-21 21:00:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6730 to 6695. [2023-11-21 21:00:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6695 states, 6695 states have (on average 1.6298730395817775) internal successors, (10912), 6694 states have internal predecessors, (10912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6695 states to 6695 states and 10912 transitions. [2023-11-21 21:00:45,878 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6695 states and 10912 transitions. [2023-11-21 21:00:45,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:00:45,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 21:00:45,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 21:00:45,879 INFO L87 Difference]: Start difference. First operand 6695 states and 10912 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:45,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:00:45,996 INFO L93 Difference]: Finished difference Result 7180 states and 11526 transitions. [2023-11-21 21:00:45,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7180 states and 11526 transitions. [2023-11-21 21:00:46,038 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2859 [2023-11-21 21:00:46,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7180 states to 7180 states and 11526 transitions. [2023-11-21 21:00:46,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2935 [2023-11-21 21:00:46,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2935 [2023-11-21 21:00:46,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7180 states and 11526 transitions. [2023-11-21 21:00:46,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 21:00:46,086 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7180 states and 11526 transitions. [2023-11-21 21:00:46,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7180 states and 11526 transitions. [2023-11-21 21:00:46,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7180 to 7168. [2023-11-21 21:00:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7168 states, 7168 states have (on average 1.6063058035714286) internal successors, (11514), 7167 states have internal predecessors, (11514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7168 states to 7168 states and 11514 transitions. [2023-11-21 21:00:46,257 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7168 states and 11514 transitions. [2023-11-21 21:00:46,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 21:00:46,259 INFO L428 stractBuchiCegarLoop]: Abstraction has 7168 states and 11514 transitions. [2023-11-21 21:00:46,259 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-21 21:00:46,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7168 states and 11514 transitions. [2023-11-21 21:00:46,287 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2859 [2023-11-21 21:00:46,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:00:46,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:00:46,288 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-21 21:00:46,288 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:00:46,288 INFO L748 eck$LassoCheckResult]: Stem: 46881#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 46882#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 46917#L404 assume !(1 == ~c_req_up~0); 46965#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 46849#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 46850#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 47017#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 46909#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 46910#L435-1 assume !(0 == ~e_f~0); 46861#L440-1 assume !(0 == ~e_g~0); 46862#L445-1 assume !(0 == ~e_e~0); 46920#L450-1 assume !(0 == ~e_c~0); 46847#L455-1 assume !(0 == ~e_wl~0); 46848#L460-1 assume !(1 == ~wl_pc~0); 47002#$Ultimate##44 assume !(2 == ~wl_pc~0); 46947#L473 assume !(1 == ~c1_pc~0); 47042#L483 assume !(1 == ~c2_pc~0); 46827#L492 assume !(1 == ~wb_pc~0); 46942#L501 assume !(1 == ~e_c~0); 46943#L510-1 assume !(1 == ~e_e~0); 46851#L515-1 assume !(1 == ~e_f~0); 46852#L520-1 assume !(1 == ~e_g~0); 46921#L525-1 assume !(1 == ~e_c~0); 46922#L530-1 assume !(1 == ~e_wl~0); 47014#L672-1 assume !false; 49051#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 51668#L377 [2023-11-21 21:00:46,289 INFO L750 eck$LassoCheckResult]: Loop: 51668#L377 assume !false; 51666#L295 assume 0 == ~wl_st~0; 51663#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 51664#L321 assume !(0 != eval_~tmp~0#1); 51801#L317 assume !(0 == ~c1_st~0); 51794#L332 assume !(0 == ~c2_st~0); 51005#L347 assume !(0 == ~wb_st~0); 51002#L362 assume !(0 == ~r_st~0); 51668#L377 [2023-11-21 21:00:46,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:46,289 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2023-11-21 21:00:46,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:46,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169900739] [2023-11-21 21:00:46,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:46,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:46,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:00:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:46,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:00:46,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:46,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1279860915, now seen corresponding path program 1 times [2023-11-21 21:00:46,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:46,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51361404] [2023-11-21 21:00:46,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:46,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:46,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:00:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:46,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:00:46,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:46,326 INFO L85 PathProgramCache]: Analyzing trace with hash 360906411, now seen corresponding path program 1 times [2023-11-21 21:00:46,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:46,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223733402] [2023-11-21 21:00:46,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:46,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:46,373 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-21 21:00:46,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:00:46,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223733402] [2023-11-21 21:00:46,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223733402] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:00:46,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:00:46,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:00:46,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609097166] [2023-11-21 21:00:46,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:00:46,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:00:46,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:00:46,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:00:46,406 INFO L87 Difference]: Start difference. First operand 7168 states and 11514 transitions. cyclomatic complexity: 4382 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:46,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:00:46,567 INFO L93 Difference]: Finished difference Result 11016 states and 17576 transitions. [2023-11-21 21:00:46,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11016 states and 17576 transitions. [2023-11-21 21:00:46,626 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4438 [2023-11-21 21:00:46,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11016 states to 11016 states and 17576 transitions. [2023-11-21 21:00:46,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4518 [2023-11-21 21:00:46,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4518 [2023-11-21 21:00:46,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11016 states and 17576 transitions. [2023-11-21 21:00:46,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 21:00:46,682 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11016 states and 17576 transitions. [2023-11-21 21:00:46,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11016 states and 17576 transitions. [2023-11-21 21:00:46,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11016 to 11016. [2023-11-21 21:00:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11016 states, 11016 states have (on average 1.5954974582425563) internal successors, (17576), 11015 states have internal predecessors, (17576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:46,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11016 states to 11016 states and 17576 transitions. [2023-11-21 21:00:46,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11016 states and 17576 transitions. [2023-11-21 21:00:46,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:00:46,887 INFO L428 stractBuchiCegarLoop]: Abstraction has 11016 states and 17576 transitions. [2023-11-21 21:00:46,887 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-21 21:00:46,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11016 states and 17576 transitions. [2023-11-21 21:00:46,967 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 4438 [2023-11-21 21:00:46,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:00:46,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:00:46,968 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-21 21:00:46,969 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:00:46,969 INFO L748 eck$LassoCheckResult]: Stem: 65075#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 65076#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 65105#L404 assume !(1 == ~c_req_up~0); 65158#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 65044#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 65045#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 65213#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 65097#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 65098#L435-1 assume !(0 == ~e_f~0); 65054#L440-1 assume !(0 == ~e_g~0); 65055#L445-1 assume !(0 == ~e_e~0); 65108#L450-1 assume !(0 == ~e_c~0); 65042#L455-1 assume !(0 == ~e_wl~0); 65043#L460-1 assume !(1 == ~wl_pc~0); 65198#$Ultimate##44 assume !(2 == ~wl_pc~0); 65137#L473 assume !(1 == ~c1_pc~0); 65240#L483 assume !(1 == ~c2_pc~0); 65020#L492 assume !(1 == ~wb_pc~0); 65130#L501 assume !(1 == ~e_c~0); 65131#L510-1 assume !(1 == ~e_e~0); 65046#L515-1 assume !(1 == ~e_f~0); 65047#L520-1 assume !(1 == ~e_g~0); 65109#L525-1 assume !(1 == ~e_c~0); 65110#L530-1 assume !(1 == ~e_wl~0); 65210#L672-1 assume !false; 66474#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 70648#L377 [2023-11-21 21:00:46,969 INFO L750 eck$LassoCheckResult]: Loop: 70648#L377 assume !false; 72306#L295 assume 0 == ~wl_st~0; 72304#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 72300#L321 assume !(0 != eval_~tmp~0#1); 72301#L317 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 72321#L336 assume !(0 != eval_~tmp___0~0#1); 72316#L332 assume !(0 == ~c2_st~0); 72315#L347 assume !(0 == ~wb_st~0); 72311#L362 assume !(0 == ~r_st~0); 70648#L377 [2023-11-21 21:00:46,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:46,970 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2023-11-21 21:00:46,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:46,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288573771] [2023-11-21 21:00:46,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:46,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:46,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:00:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:46,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:00:46,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:47,000 INFO L85 PathProgramCache]: Analyzing trace with hash 969256162, now seen corresponding path program 1 times [2023-11-21 21:00:47,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:47,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088775810] [2023-11-21 21:00:47,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:47,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:47,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:00:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:47,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:00:47,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:47,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1748529686, now seen corresponding path program 1 times [2023-11-21 21:00:47,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:47,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595870552] [2023-11-21 21:00:47,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:47,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:47,046 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-21 21:00:47,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:00:47,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595870552] [2023-11-21 21:00:47,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595870552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:00:47,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:00:47,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:00:47,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307098800] [2023-11-21 21:00:47,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:00:47,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:00:47,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:00:47,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:00:47,093 INFO L87 Difference]: Start difference. First operand 11016 states and 17576 transitions. cyclomatic complexity: 6596 Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:47,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:00:47,203 INFO L93 Difference]: Finished difference Result 17164 states and 27055 transitions. [2023-11-21 21:00:47,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17164 states and 27055 transitions. [2023-11-21 21:00:47,291 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 6956 [2023-11-21 21:00:47,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17164 states to 17164 states and 27055 transitions. [2023-11-21 21:00:47,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7102 [2023-11-21 21:00:47,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7102 [2023-11-21 21:00:47,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17164 states and 27055 transitions. [2023-11-21 21:00:47,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 21:00:47,385 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17164 states and 27055 transitions. [2023-11-21 21:00:47,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17164 states and 27055 transitions. [2023-11-21 21:00:47,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17164 to 17164. [2023-11-21 21:00:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17164 states, 17164 states have (on average 1.5762642740619903) internal successors, (27055), 17163 states have internal predecessors, (27055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17164 states to 17164 states and 27055 transitions. [2023-11-21 21:00:47,863 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17164 states and 27055 transitions. [2023-11-21 21:00:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:00:47,949 INFO L428 stractBuchiCegarLoop]: Abstraction has 17164 states and 27055 transitions. [2023-11-21 21:00:47,949 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-21 21:00:47,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17164 states and 27055 transitions. [2023-11-21 21:00:48,009 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 6956 [2023-11-21 21:00:48,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:00:48,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:00:48,010 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-21 21:00:48,010 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:00:48,010 INFO L748 eck$LassoCheckResult]: Stem: 93260#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 93261#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 93291#L404 assume !(1 == ~c_req_up~0); 93361#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 93230#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 93231#L420-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 93470#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 95171#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 95170#L435-1 assume !(0 == ~e_f~0); 95169#L440-1 assume !(0 == ~e_g~0); 95168#L445-1 assume !(0 == ~e_e~0); 95167#L450-1 assume !(0 == ~e_c~0); 95166#L455-1 assume !(0 == ~e_wl~0); 95165#L460-1 assume !(1 == ~wl_pc~0); 95162#$Ultimate##44 assume !(2 == ~wl_pc~0); 95161#L473 assume !(1 == ~c1_pc~0); 95159#L483 assume !(1 == ~c2_pc~0); 93478#L492 assume !(1 == ~wb_pc~0); 93318#L501 assume !(1 == ~e_c~0); 93319#L510-1 assume !(1 == ~e_e~0); 93232#L515-1 assume !(1 == ~e_f~0); 93233#L520-1 assume !(1 == ~e_g~0); 93295#L525-1 assume !(1 == ~e_c~0); 93296#L530-1 assume !(1 == ~e_wl~0); 93398#L672-1 assume !false; 95172#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 104314#L377 [2023-11-21 21:00:48,010 INFO L750 eck$LassoCheckResult]: Loop: 104314#L377 assume !false; 107940#L295 assume 0 == ~wl_st~0; 107941#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 105989#L321 assume !(0 != eval_~tmp~0#1); 105990#L317 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 107010#L336 assume !(0 != eval_~tmp___0~0#1); 107388#L332 assume !(0 == ~c2_st~0); 107419#L347 assume !(0 == ~wb_st~0); 107414#L362 assume !(0 == ~r_st~0); 104314#L377 [2023-11-21 21:00:48,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:48,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2023-11-21 21:00:48,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:48,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199074871] [2023-11-21 21:00:48,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:48,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:48,050 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-21 21:00:48,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:00:48,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199074871] [2023-11-21 21:00:48,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199074871] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:00:48,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:00:48,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:00:48,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750072821] [2023-11-21 21:00:48,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:00:48,054 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 21:00:48,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:48,055 INFO L85 PathProgramCache]: Analyzing trace with hash 969256162, now seen corresponding path program 2 times [2023-11-21 21:00:48,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:48,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126671485] [2023-11-21 21:00:48,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:48,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:48,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:00:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:48,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:00:48,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:00:48,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:00:48,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:00:48,110 INFO L87 Difference]: Start difference. First operand 17164 states and 27055 transitions. cyclomatic complexity: 9927 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:00:48,181 INFO L93 Difference]: Finished difference Result 17112 states and 26968 transitions. [2023-11-21 21:00:48,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17112 states and 26968 transitions. [2023-11-21 21:00:48,259 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 6956 [2023-11-21 21:00:48,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17112 states to 17112 states and 26968 transitions. [2023-11-21 21:00:48,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7052 [2023-11-21 21:00:48,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7052 [2023-11-21 21:00:48,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17112 states and 26968 transitions. [2023-11-21 21:00:48,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 21:00:48,441 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17112 states and 26968 transitions. [2023-11-21 21:00:48,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states and 26968 transitions. [2023-11-21 21:00:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 17112. [2023-11-21 21:00:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17112 states, 17112 states have (on average 1.575970079476391) internal successors, (26968), 17111 states have internal predecessors, (26968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17112 states to 17112 states and 26968 transitions. [2023-11-21 21:00:48,744 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17112 states and 26968 transitions. [2023-11-21 21:00:48,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:00:48,745 INFO L428 stractBuchiCegarLoop]: Abstraction has 17112 states and 26968 transitions. [2023-11-21 21:00:48,746 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-21 21:00:48,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17112 states and 26968 transitions. [2023-11-21 21:00:48,868 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 6956 [2023-11-21 21:00:48,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:00:48,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:00:48,869 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-21 21:00:48,869 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:00:48,869 INFO L748 eck$LassoCheckResult]: Stem: 127544#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 127545#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 127576#L404 assume !(1 == ~c_req_up~0); 127626#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 127511#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 127512#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 127686#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 127571#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 127572#L435-1 assume !(0 == ~e_f~0); 127524#L440-1 assume !(0 == ~e_g~0); 127525#L445-1 assume !(0 == ~e_e~0); 127579#L450-1 assume !(0 == ~e_c~0); 127509#L455-1 assume !(0 == ~e_wl~0); 127510#L460-1 assume !(1 == ~wl_pc~0); 127671#$Ultimate##44 assume !(2 == ~wl_pc~0); 127607#L473 assume !(1 == ~c1_pc~0); 127713#L483 assume !(1 == ~c2_pc~0); 127487#L492 assume !(1 == ~wb_pc~0); 127602#L501 assume !(1 == ~e_c~0); 127603#L510-1 assume !(1 == ~e_e~0); 127513#L515-1 assume !(1 == ~e_f~0); 127514#L520-1 assume !(1 == ~e_g~0); 127580#L525-1 assume !(1 == ~e_c~0); 127581#L530-1 assume !(1 == ~e_wl~0); 127683#L672-1 assume !false; 129632#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 137103#L377 [2023-11-21 21:00:48,869 INFO L750 eck$LassoCheckResult]: Loop: 137103#L377 assume !false; 141877#L295 assume 0 == ~wl_st~0; 141378#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 141377#L321 assume !(0 != eval_~tmp~0#1); 141376#L317 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 141336#L336 assume !(0 != eval_~tmp___0~0#1); 141024#L332 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 141020#L351 assume !(0 != eval_~tmp___1~0#1); 140965#L347 assume !(0 == ~wb_st~0); 140960#L362 assume !(0 == ~r_st~0); 137103#L377 [2023-11-21 21:00:48,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:48,870 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2023-11-21 21:00:48,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:48,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572578232] [2023-11-21 21:00:48,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:48,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:48,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:00:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:48,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:00:48,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:48,897 INFO L85 PathProgramCache]: Analyzing trace with hash -19480801, now seen corresponding path program 1 times [2023-11-21 21:00:48,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:48,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329678690] [2023-11-21 21:00:48,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:48,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:48,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:00:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:48,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:00:48,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:48,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1628503831, now seen corresponding path program 1 times [2023-11-21 21:00:48,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:48,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520026924] [2023-11-21 21:00:48,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:48,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:00:48,973 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-21 21:00:48,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:00:48,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520026924] [2023-11-21 21:00:48,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520026924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:00:48,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:00:48,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:00:48,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733028303] [2023-11-21 21:00:48,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:00:49,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:00:49,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:00:49,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:00:49,023 INFO L87 Difference]: Start difference. First operand 17112 states and 26968 transitions. cyclomatic complexity: 9892 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:49,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:00:49,172 INFO L93 Difference]: Finished difference Result 29109 states and 45435 transitions. [2023-11-21 21:00:49,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29109 states and 45435 transitions. [2023-11-21 21:00:49,336 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 11874 [2023-11-21 21:00:49,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29109 states to 29109 states and 45435 transitions. [2023-11-21 21:00:49,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12004 [2023-11-21 21:00:49,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12004 [2023-11-21 21:00:49,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29109 states and 45435 transitions. [2023-11-21 21:00:49,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 21:00:49,629 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29109 states and 45435 transitions. [2023-11-21 21:00:49,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29109 states and 45435 transitions. [2023-11-21 21:00:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29109 to 29109. [2023-11-21 21:00:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29109 states, 29109 states have (on average 1.5608574667628567) internal successors, (45435), 29108 states have internal predecessors, (45435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:00:50,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29109 states to 29109 states and 45435 transitions. [2023-11-21 21:00:50,250 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29109 states and 45435 transitions. [2023-11-21 21:00:50,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:00:50,250 INFO L428 stractBuchiCegarLoop]: Abstraction has 29109 states and 45435 transitions. [2023-11-21 21:00:50,251 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-11-21 21:00:50,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29109 states and 45435 transitions. [2023-11-21 21:00:50,444 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 11874 [2023-11-21 21:00:50,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:00:50,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:00:50,446 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-21 21:00:50,446 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:00:50,446 INFO L748 eck$LassoCheckResult]: Stem: 173774#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 173775#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 173805#L404 assume !(1 == ~c_req_up~0); 173858#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 173741#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 173742#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 173919#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 173799#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 173800#L435-1 assume !(0 == ~e_f~0); 173754#L440-1 assume !(0 == ~e_g~0); 173755#L445-1 assume !(0 == ~e_e~0); 173808#L450-1 assume !(0 == ~e_c~0); 173739#L455-1 assume !(0 == ~e_wl~0); 173740#L460-1 assume !(1 == ~wl_pc~0); 173902#$Ultimate##44 assume !(2 == ~wl_pc~0); 173836#L473 assume !(1 == ~c1_pc~0); 173953#L483 assume !(1 == ~c2_pc~0); 173717#L492 assume !(1 == ~wb_pc~0); 173831#L501 assume !(1 == ~e_c~0); 173832#L510-1 assume !(1 == ~e_e~0); 173743#L515-1 assume !(1 == ~e_f~0); 173744#L520-1 assume !(1 == ~e_g~0); 173809#L525-1 assume !(1 == ~e_c~0); 173810#L530-1 assume !(1 == ~e_wl~0); 176228#L672-1 assume !false; 176229#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 188613#L377 [2023-11-21 21:00:50,446 INFO L750 eck$LassoCheckResult]: Loop: 188613#L377 assume !false; 197188#L295 assume 0 == ~wl_st~0; 197186#L308-1 assume 0 == ~wl_st~0;havoc eval_#t~nondet4#1;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 197184#L321 assume !(0 != eval_~tmp~0#1); 195819#L317 assume 0 == ~c1_st~0;havoc eval_#t~nondet5#1;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 195816#L336 assume !(0 != eval_~tmp___0~0#1); 195814#L332 assume 0 == ~c2_st~0;havoc eval_#t~nondet6#1;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 195765#L351 assume !(0 != eval_~tmp___1~0#1); 195811#L347 assume 0 == ~wb_st~0;havoc eval_#t~nondet7#1;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 196125#L366 assume !(0 != eval_~tmp___2~0#1); 196135#L362 assume !(0 == ~r_st~0); 188613#L377 [2023-11-21 21:00:50,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:50,447 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2023-11-21 21:00:50,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:50,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416974838] [2023-11-21 21:00:50,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:50,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:50,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:00:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:50,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:00:50,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:50,489 INFO L85 PathProgramCache]: Analyzing trace with hash -603940234, now seen corresponding path program 1 times [2023-11-21 21:00:50,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:50,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097289870] [2023-11-21 21:00:50,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:50,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:50,496 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:00:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:50,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:00:50,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:00:50,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1056024194, now seen corresponding path program 1 times [2023-11-21 21:00:50,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:00:50,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37044969] [2023-11-21 21:00:50,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:00:50,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:00:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:50,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:00:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:50,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:00:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:51,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:00:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:00:51,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.11 09:00:51 BoogieIcfgContainer [2023-11-21 21:00:51,933 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-21 21:00:51,934 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 21:00:51,934 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 21:00:51,934 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 21:00:51,935 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:00:36" (3/4) ... [2023-11-21 21:00:51,936 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-21 21:00:52,026 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/witness.graphml [2023-11-21 21:00:52,027 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 21:00:52,027 INFO L158 Benchmark]: Toolchain (without parser) took 16766.39ms. Allocated memory was 151.0MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 104.5MB in the beginning and 1.0GB in the end (delta: -897.3MB). Peak memory consumption was 378.6MB. Max. memory is 16.1GB. [2023-11-21 21:00:52,028 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 151.0MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 21:00:52,028 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.31ms. Allocated memory is still 151.0MB. Free memory was 104.3MB in the beginning and 89.4MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-21 21:00:52,028 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.16ms. Allocated memory is still 151.0MB. Free memory was 89.4MB in the beginning and 87.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 21:00:52,029 INFO L158 Benchmark]: Boogie Preprocessor took 89.35ms. Allocated memory is still 151.0MB. Free memory was 87.2MB in the beginning and 84.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 21:00:52,029 INFO L158 Benchmark]: RCFGBuilder took 708.14ms. Allocated memory is still 151.0MB. Free memory was 84.4MB in the beginning and 61.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-21 21:00:52,030 INFO L158 Benchmark]: BuchiAutomizer took 15358.29ms. Allocated memory was 151.0MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 60.9MB in the beginning and 1.0GB in the end (delta: -947.2MB). Peak memory consumption was 328.3MB. Max. memory is 16.1GB. [2023-11-21 21:00:52,030 INFO L158 Benchmark]: Witness Printer took 93.05ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-21 21:00:52,033 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.38ms. Allocated memory is still 151.0MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 458.31ms. Allocated memory is still 151.0MB. Free memory was 104.3MB in the beginning and 89.4MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.16ms. Allocated memory is still 151.0MB. Free memory was 89.4MB in the beginning and 87.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.35ms. Allocated memory is still 151.0MB. Free memory was 87.2MB in the beginning and 84.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 708.14ms. Allocated memory is still 151.0MB. Free memory was 84.4MB in the beginning and 61.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 15358.29ms. Allocated memory was 151.0MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 60.9MB in the beginning and 1.0GB in the end (delta: -947.2MB). Peak memory consumption was 328.3MB. Max. memory is 16.1GB. * Witness Printer took 93.05ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (14 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function ((-1 * e_c) + 1) and consists of 3 locations. One deterministic module has affine ranking function ((-1 * e_c) + 1) and consists of 3 locations. One deterministic module has affine ranking function ((-1 * e_e) + 1) and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 29109 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.1s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 8.0s. Construction of modules took 0.3s. Büchi inclusion checks took 5.4s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 11. Automata minimization 2.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 1885 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 1.4s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4258 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4255 mSDsluCounter, 7039 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2579 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 357 IncrementalHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 4460 mSDtfsCounter, 357 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT0 SILN1 SILU0 SILI5 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital80 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf96 smp100 dnf147 smp91 tf109 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 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: 294]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L689] int __retres1 ; [L693] e_wl = 2 [L694] e_c = e_wl [L695] e_g = e_c [L696] e_f = e_g [L697] e_e = e_f [L698] wl_pc = 0 [L699] c1_pc = 0 [L700] c2_pc = 0 [L701] wb_pc = 0 [L702] wb_i = 1 [L703] c2_i = wb_i [L704] c1_i = c2_i [L705] wl_i = c1_i [L706] r_i = 0 [L707] c_req_up = 0 [L708] d = 0 [L709] c = 0 [L710] CALL start_simulation() [L400] int kernel_st ; [L403] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L404] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L415] COND TRUE (int )wl_i == 1 [L416] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L420] COND TRUE (int )c1_i == 1 [L421] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L425] COND TRUE (int )c2_i == 1 [L426] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L430] COND TRUE (int )wb_i == 1 [L431] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L435] COND FALSE !((int )r_i == 1) [L438] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L440] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L445] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L450] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L455] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L460] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L465] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L473] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L483] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L492] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L501] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L510] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L515] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L520] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L525] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L530] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L535] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L541] COND TRUE 1 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L544] kernel_st = 1 [L545] CALL eval() [L286] int tmp ; [L287] int tmp___0 ; [L288] int tmp___1 ; [L289] int tmp___2 ; [L290] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L294] COND TRUE 1 [L296] COND TRUE (int )wl_st == 0 [L317] COND TRUE (int )wl_st == 0 [L319] tmp = __VERIFIER_nondet_int() [L321] COND FALSE !(\read(tmp)) [L332] COND TRUE (int )c1_st == 0 [L334] tmp___0 = __VERIFIER_nondet_int() [L336] COND FALSE !(\read(tmp___0)) [L347] COND TRUE (int )c2_st == 0 [L349] tmp___1 = __VERIFIER_nondet_int() [L351] COND FALSE !(\read(tmp___1)) [L362] COND TRUE (int )wb_st == 0 [L364] tmp___2 = __VERIFIER_nondet_int() [L366] COND FALSE !(\read(tmp___2)) [L377] COND FALSE !((int )r_st == 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 294]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L689] int __retres1 ; [L693] e_wl = 2 [L694] e_c = e_wl [L695] e_g = e_c [L696] e_f = e_g [L697] e_e = e_f [L698] wl_pc = 0 [L699] c1_pc = 0 [L700] c2_pc = 0 [L701] wb_pc = 0 [L702] wb_i = 1 [L703] c2_i = wb_i [L704] c1_i = c2_i [L705] wl_i = c1_i [L706] r_i = 0 [L707] c_req_up = 0 [L708] d = 0 [L709] c = 0 [L710] CALL start_simulation() [L400] int kernel_st ; [L403] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L404] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L415] COND TRUE (int )wl_i == 1 [L416] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L420] COND TRUE (int )c1_i == 1 [L421] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L425] COND TRUE (int )c2_i == 1 [L426] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L430] COND TRUE (int )wb_i == 1 [L431] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L435] COND FALSE !((int )r_i == 1) [L438] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L440] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L445] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L450] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L455] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L460] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L465] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L473] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L483] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L492] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L501] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L510] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L515] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L520] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L525] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L530] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L535] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L541] COND TRUE 1 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L544] kernel_st = 1 [L545] CALL eval() [L286] int tmp ; [L287] int tmp___0 ; [L288] int tmp___1 ; [L289] int tmp___2 ; [L290] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L294] COND TRUE 1 [L296] COND TRUE (int )wl_st == 0 [L317] COND TRUE (int )wl_st == 0 [L319] tmp = __VERIFIER_nondet_int() [L321] COND FALSE !(\read(tmp)) [L332] COND TRUE (int )c1_st == 0 [L334] tmp___0 = __VERIFIER_nondet_int() [L336] COND FALSE !(\read(tmp___0)) [L347] COND TRUE (int )c2_st == 0 [L349] tmp___1 = __VERIFIER_nondet_int() [L351] COND FALSE !(\read(tmp___1)) [L362] COND TRUE (int )wb_st == 0 [L364] tmp___2 = __VERIFIER_nondet_int() [L366] COND FALSE !(\read(tmp___2)) [L377] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-21 21:00:52,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3d01ecc-8b42-4c2a-9578-6ba128f1f10d/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with 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)