./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/toy.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 18:47:16,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:47:16,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:47:16,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:47:16,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:47:16,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:47:16,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:47:16,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:47:16,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:47:16,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:47:16,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:47:16,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:47:16,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:47:16,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:47:16,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:47:16,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:47:16,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:47:16,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:47:16,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:47:16,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:47:16,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:47:16,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:47:16,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:47:16,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:47:16,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:47:16,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:47:16,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:47:16,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:47:16,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:47:16,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:47:16,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:47:16,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:47:16,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:47:16,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:47:16,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:47:16,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:47:16,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:47:16,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:47:16,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:47:16,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:47:16,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:47:16,848 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-12-13 18:47:16,868 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:47:16,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:47:16,869 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:47:16,869 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:47:16,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:47:16,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:47:16,870 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:47:16,870 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 18:47:16,877 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 18:47:16,877 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 18:47:16,877 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 18:47:16,877 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 18:47:16,878 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 18:47:16,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:47:16,878 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:47:16,878 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 18:47:16,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:47:16,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:47:16,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:47:16,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 18:47:16,879 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 18:47:16,879 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 18:47:16,879 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:47:16,880 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 18:47:16,880 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 18:47:16,880 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:47:16,880 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 18:47:16,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:47:16,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:47:16,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:47:16,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:47:16,882 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 18:47:16,882 INFO L138 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_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/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_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b [2022-12-13 18:47:17,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:47:17,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:47:17,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:47:17,075 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:47:17,076 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:47:17,077 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/systemc/toy.cil.c [2022-12-13 18:47:19,660 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:47:19,843 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:47:19,843 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/sv-benchmarks/c/systemc/toy.cil.c [2022-12-13 18:47:19,850 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/data/03a9fdee5/5d1aa2d4c5e84fca82755b4ad4e4b0cc/FLAGf8dd74946 [2022-12-13 18:47:19,860 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/data/03a9fdee5/5d1aa2d4c5e84fca82755b4ad4e4b0cc [2022-12-13 18:47:19,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:47:19,863 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:47:19,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:47:19,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:47:19,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:47:19,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:47:19" (1/1) ... [2022-12-13 18:47:19,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f362fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:47:19, skipping insertion in model container [2022-12-13 18:47:19,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:47:19" (1/1) ... [2022-12-13 18:47:19,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:47:19,897 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:47:19,992 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/sv-benchmarks/c/systemc/toy.cil.c[697,710] [2022-12-13 18:47:20,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:47:20,039 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:47:20,047 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/sv-benchmarks/c/systemc/toy.cil.c[697,710] [2022-12-13 18:47:20,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:47:20,082 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:47:20,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:47:20 WrapperNode [2022-12-13 18:47:20,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:47:20,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:47:20,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:47:20,083 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:47:20,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:47:20" (1/1) ... [2022-12-13 18:47:20,094 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:47:20" (1/1) ... [2022-12-13 18:47:20,111 INFO L138 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 357 [2022-12-13 18:47:20,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:47:20,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:47:20,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:47:20,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:47:20,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:47:20" (1/1) ... [2022-12-13 18:47:20,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:47:20" (1/1) ... [2022-12-13 18:47:20,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:47:20" (1/1) ... [2022-12-13 18:47:20,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:47:20" (1/1) ... [2022-12-13 18:47:20,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:47:20" (1/1) ... [2022-12-13 18:47:20,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:47:20" (1/1) ... [2022-12-13 18:47:20,129 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:47:20" (1/1) ... [2022-12-13 18:47:20,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:47:20" (1/1) ... [2022-12-13 18:47:20,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:47:20,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:47:20,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:47:20,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:47:20,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:47:20" (1/1) ... [2022-12-13 18:47:20,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:20,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:20,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:20,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 18:47:20,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:47:20,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 18:47:20,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:47:20,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:47:20,254 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:47:20,256 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:47:20,566 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:47:20,574 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:47:20,574 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 18:47:20,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:47:20 BoogieIcfgContainer [2022-12-13 18:47:20,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:47:20,578 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 18:47:20,578 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 18:47:20,582 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 18:47:20,583 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 18:47:20,583 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 06:47:19" (1/3) ... [2022-12-13 18:47:20,584 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62a5a2e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 06:47:20, skipping insertion in model container [2022-12-13 18:47:20,584 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 18:47:20,584 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:47:20" (2/3) ... [2022-12-13 18:47:20,584 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62a5a2e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 06:47:20, skipping insertion in model container [2022-12-13 18:47:20,584 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 18:47:20,585 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:47:20" (3/3) ... [2022-12-13 18:47:20,586 INFO L332 chiAutomizerObserver]: Analyzing ICFG toy.cil.c [2022-12-13 18:47:20,636 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 18:47:20,636 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 18:47:20,637 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 18:47:20,637 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 18:47:20,637 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 18:47:20,637 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 18:47:20,637 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 18:47:20,637 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 18:47:20,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.8307692307692307) internal successors, (238), 130 states have internal predecessors, (238), 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) [2022-12-13 18:47:20,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2022-12-13 18:47:20,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:47:20,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:47:20,664 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] [2022-12-13 18:47:20,664 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] [2022-12-13 18:47:20,664 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 18:47:20,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.8307692307692307) internal successors, (238), 130 states have internal predecessors, (238), 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) [2022-12-13 18:47:20,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2022-12-13 18:47:20,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:47:20,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:47:20,672 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] [2022-12-13 18:47:20,672 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] [2022-12-13 18:47:20,679 INFO L748 eck$LassoCheckResult]: Stem: 24#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 39#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 105#L408true assume !(1 == ~c_req_up~0); 84#L408-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 126#L419-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 125#L424-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 59#L429-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 120#L434-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 43#L439-1true assume !(0 == ~e_f~0); 5#L444-1true assume !(0 == ~e_g~0); 97#L449-1true assume !(0 == ~e_e~0); 52#L454-1true assume !(0 == ~e_c~0); 110#L459-1true assume !(0 == ~e_wl~0); 25#L464-1true assume !(1 == ~wl_pc~0); 99#$Ultimate##44true assume !(2 == ~wl_pc~0); 23#L477true assume !(1 == ~c1_pc~0); 18#L487true assume !(1 == ~c2_pc~0); 86#L496true assume !(1 == ~wb_pc~0); 29#L505true assume !(1 == ~e_c~0); 36#L514-1true assume !(1 == ~e_e~0); 132#L519-1true assume !(1 == ~e_f~0); 40#L524-1true assume !(1 == ~e_g~0); 130#L529-1true assume !(1 == ~e_c~0); 2#L534-1true assume !(1 == ~e_wl~0); 4#L676-1true [2022-12-13 18:47:20,680 INFO L750 eck$LassoCheckResult]: Loop: 4#L676-1true assume !false; 35#L546true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 69#L381true assume !true; 89#eval_returnLabel#1true assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 42#L552true assume !(1 == ~c_req_up~0); 58#L552-2true start_simulation_~kernel_st~0#1 := 3; 14#L564true assume 0 == ~e_f~0;~e_f~0 := 1; 17#L564-2true assume !(0 == ~e_g~0); 6#L569-1true assume 0 == ~e_e~0;~e_e~0 := 1; 129#L574-1true assume 0 == ~e_c~0;~e_c~0 := 1; 10#L579-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 93#L584-1true assume 1 == ~wl_pc~0; 46#L590true assume 1 == ~e_wl~0;~wl_st~0 := 0; 112#L597true assume !(1 == ~c1_pc~0); 27#L607true assume !(1 == ~c2_pc~0); 102#L616true assume !(1 == ~wb_pc~0); 122#L625true assume 1 == ~e_c~0;~r_st~0 := 0; 57#L634-1true assume 1 == ~e_e~0;~e_e~0 := 2; 51#L639-1true assume !(1 == ~e_f~0); 116#L644-1true assume 1 == ~e_g~0;~e_g~0 := 2; 76#L649-1true assume 1 == ~e_c~0;~e_c~0 := 2; 41#L654-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 21#L659-1true assume 0 == ~wl_st~0; 4#L676-1true [2022-12-13 18:47:20,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:20,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2022-12-13 18:47:20,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:20,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899742575] [2022-12-13 18:47:20,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:20,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:20,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:20,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899742575] [2022-12-13 18:47:20,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899742575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:20,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:20,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:47:20,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530683802] [2022-12-13 18:47:20,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:20,915 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 18:47:20,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:20,915 INFO L85 PathProgramCache]: Analyzing trace with hash 672584946, now seen corresponding path program 1 times [2022-12-13 18:47:20,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:20,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721574014] [2022-12-13 18:47:20,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:20,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:20,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:20,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721574014] [2022-12-13 18:47:20,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721574014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:20,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:20,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:47:20,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735519413] [2022-12-13 18:47:20,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:20,935 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 18:47:20,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:47:20,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 18:47:20,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 18:47:20,968 INFO L87 Difference]: Start difference. First operand has 131 states, 130 states have (on average 1.8307692307692307) internal successors, (238), 130 states have internal predecessors, (238), 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) [2022-12-13 18:47:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:47:20,986 INFO L93 Difference]: Finished difference Result 130 states and 224 transitions. [2022-12-13 18:47:20,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 224 transitions. [2022-12-13 18:47:20,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2022-12-13 18:47:20,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 125 states and 219 transitions. [2022-12-13 18:47:20,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2022-12-13 18:47:20,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2022-12-13 18:47:20,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 219 transitions. [2022-12-13 18:47:20,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:47:20,998 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 219 transitions. [2022-12-13 18:47:21,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 219 transitions. [2022-12-13 18:47:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-12-13 18:47:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.752) internal successors, (219), 124 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:47:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 219 transitions. [2022-12-13 18:47:21,025 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 219 transitions. [2022-12-13 18:47:21,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 18:47:21,028 INFO L428 stractBuchiCegarLoop]: Abstraction has 125 states and 219 transitions. [2022-12-13 18:47:21,029 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 18:47:21,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 219 transitions. [2022-12-13 18:47:21,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2022-12-13 18:47:21,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:47:21,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:47:21,032 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] [2022-12-13 18:47:21,032 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] [2022-12-13 18:47:21,032 INFO L748 eck$LassoCheckResult]: Stem: 313#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 314#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; 343#L408 assume !(1 == ~c_req_up~0); 306#L408-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 383#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 394#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 368#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 369#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 350#L439-1 assume !(0 == ~e_f~0); 273#L444-1 assume !(0 == ~e_g~0); 274#L449-1 assume !(0 == ~e_e~0); 363#L454-1 assume !(0 == ~e_c~0); 364#L459-1 assume !(0 == ~e_wl~0); 315#L464-1 assume !(1 == ~wl_pc~0); 316#$Ultimate##44 assume !(2 == ~wl_pc~0); 311#L477 assume !(1 == ~c1_pc~0); 299#L487 assume !(1 == ~c2_pc~0); 301#L496 assume !(1 == ~wb_pc~0); 327#L505 assume !(1 == ~e_c~0); 328#L514-1 assume !(1 == ~e_e~0); 339#L519-1 assume !(1 == ~e_f~0); 345#L524-1 assume !(1 == ~e_g~0); 346#L529-1 assume !(1 == ~e_c~0); 270#L534-1 assume !(1 == ~e_wl~0); 271#L676-1 [2022-12-13 18:47:21,032 INFO L750 eck$LassoCheckResult]: Loop: 271#L676-1 assume !false; 272#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 298#L381 assume !false; 340#L299 assume !(0 == ~wl_st~0); 341#L303 assume !(0 == ~c1_st~0); 393#L306 assume !(0 == ~c2_st~0); 386#L309 assume !(0 == ~wb_st~0); 387#L312 assume !(0 == ~r_st~0); 388#eval_returnLabel#1 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 347#L552 assume !(1 == ~c_req_up~0); 348#L552-2 start_simulation_~kernel_st~0#1 := 3; 294#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 295#L564-2 assume !(0 == ~e_g~0); 275#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 276#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 285#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 286#L584-1 assume 1 == ~wl_pc~0; 354#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 355#L597 assume !(1 == ~c1_pc~0); 321#L607 assume !(1 == ~c2_pc~0); 322#L616 assume !(1 == ~wb_pc~0); 375#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 367#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 361#L639-1 assume !(1 == ~e_f~0); 362#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 376#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 344#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 307#L659-1 assume 0 == ~wl_st~0; 271#L676-1 [2022-12-13 18:47:21,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:21,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2022-12-13 18:47:21,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:21,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105441125] [2022-12-13 18:47:21,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:21,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:21,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:21,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105441125] [2022-12-13 18:47:21,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105441125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:21,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:21,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:47:21,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113999505] [2022-12-13 18:47:21,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:21,106 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 18:47:21,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:21,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1073460531, now seen corresponding path program 1 times [2022-12-13 18:47:21,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:21,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214666362] [2022-12-13 18:47:21,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:21,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:21,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:21,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:21,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214666362] [2022-12-13 18:47:21,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214666362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:21,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:21,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:47:21,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546223896] [2022-12-13 18:47:21,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:21,142 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 18:47:21,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:47:21,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:47:21,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:47:21,143 INFO L87 Difference]: Start difference. First operand 125 states and 219 transitions. cyclomatic complexity: 95 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:47:21,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:47:21,165 INFO L93 Difference]: Finished difference Result 125 states and 218 transitions. [2022-12-13 18:47:21,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 218 transitions. [2022-12-13 18:47:21,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2022-12-13 18:47:21,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 218 transitions. [2022-12-13 18:47:21,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2022-12-13 18:47:21,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2022-12-13 18:47:21,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 218 transitions. [2022-12-13 18:47:21,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:47:21,170 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 218 transitions. [2022-12-13 18:47:21,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 218 transitions. [2022-12-13 18:47:21,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-12-13 18:47:21,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.744) internal successors, (218), 124 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:47:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 218 transitions. [2022-12-13 18:47:21,178 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 218 transitions. [2022-12-13 18:47:21,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:47:21,179 INFO L428 stractBuchiCegarLoop]: Abstraction has 125 states and 218 transitions. [2022-12-13 18:47:21,179 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 18:47:21,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 218 transitions. [2022-12-13 18:47:21,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2022-12-13 18:47:21,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:47:21,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:47:21,182 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] [2022-12-13 18:47:21,182 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] [2022-12-13 18:47:21,183 INFO L748 eck$LassoCheckResult]: Stem: 570#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 571#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; 600#L408 assume !(1 == ~c_req_up~0); 563#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 640#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 651#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 625#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 626#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 607#L439-1 assume !(0 == ~e_f~0); 530#L444-1 assume !(0 == ~e_g~0); 531#L449-1 assume !(0 == ~e_e~0); 620#L454-1 assume !(0 == ~e_c~0); 621#L459-1 assume !(0 == ~e_wl~0); 572#L464-1 assume !(1 == ~wl_pc~0); 573#$Ultimate##44 assume !(2 == ~wl_pc~0); 568#L477 assume !(1 == ~c1_pc~0); 556#L487 assume !(1 == ~c2_pc~0); 558#L496 assume !(1 == ~wb_pc~0); 584#L505 assume !(1 == ~e_c~0); 585#L514-1 assume !(1 == ~e_e~0); 596#L519-1 assume !(1 == ~e_f~0); 602#L524-1 assume !(1 == ~e_g~0); 603#L529-1 assume !(1 == ~e_c~0); 527#L534-1 assume !(1 == ~e_wl~0); 528#L676-1 [2022-12-13 18:47:21,183 INFO L750 eck$LassoCheckResult]: Loop: 528#L676-1 assume !false; 529#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 555#L381 assume !false; 597#L299 assume !(0 == ~wl_st~0); 598#L303 assume !(0 == ~c1_st~0); 650#L306 assume !(0 == ~c2_st~0); 643#L309 assume !(0 == ~wb_st~0); 644#L312 assume !(0 == ~r_st~0); 645#eval_returnLabel#1 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 604#L552 assume !(1 == ~c_req_up~0); 605#L552-2 start_simulation_~kernel_st~0#1 := 3; 551#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 552#L564-2 assume !(0 == ~e_g~0); 532#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 533#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 542#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 543#L584-1 assume 1 == ~wl_pc~0; 611#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 612#L597 assume !(1 == ~c1_pc~0); 578#L607 assume !(1 == ~c2_pc~0); 579#L616 assume !(1 == ~wb_pc~0); 632#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 624#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 618#L639-1 assume !(1 == ~e_f~0); 619#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 634#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 601#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 564#L659-1 assume 0 == ~wl_st~0; 528#L676-1 [2022-12-13 18:47:21,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:21,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2022-12-13 18:47:21,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:21,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498195230] [2022-12-13 18:47:21,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:21,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:21,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:21,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498195230] [2022-12-13 18:47:21,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498195230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:21,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:21,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:47:21,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680554323] [2022-12-13 18:47:21,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:21,236 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 18:47:21,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:21,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1073460531, now seen corresponding path program 2 times [2022-12-13 18:47:21,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:21,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325035836] [2022-12-13 18:47:21,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:21,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:21,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:21,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325035836] [2022-12-13 18:47:21,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325035836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:21,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:21,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:47:21,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709506676] [2022-12-13 18:47:21,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:21,267 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 18:47:21,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:47:21,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:47:21,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:47:21,268 INFO L87 Difference]: Start difference. First operand 125 states and 218 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) [2022-12-13 18:47:21,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:47:21,280 INFO L93 Difference]: Finished difference Result 125 states and 217 transitions. [2022-12-13 18:47:21,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 217 transitions. [2022-12-13 18:47:21,282 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2022-12-13 18:47:21,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 217 transitions. [2022-12-13 18:47:21,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2022-12-13 18:47:21,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2022-12-13 18:47:21,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 217 transitions. [2022-12-13 18:47:21,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:47:21,284 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 217 transitions. [2022-12-13 18:47:21,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 217 transitions. [2022-12-13 18:47:21,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-12-13 18:47:21,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.736) internal successors, (217), 124 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) [2022-12-13 18:47:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 217 transitions. [2022-12-13 18:47:21,290 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 217 transitions. [2022-12-13 18:47:21,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:47:21,291 INFO L428 stractBuchiCegarLoop]: Abstraction has 125 states and 217 transitions. [2022-12-13 18:47:21,291 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 18:47:21,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 217 transitions. [2022-12-13 18:47:21,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2022-12-13 18:47:21,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:47:21,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:47:21,293 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] [2022-12-13 18:47:21,293 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] [2022-12-13 18:47:21,293 INFO L748 eck$LassoCheckResult]: Stem: 827#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 828#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; 857#L408 assume !(1 == ~c_req_up~0); 820#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 897#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 908#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 882#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 883#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 864#L439-1 assume !(0 == ~e_f~0); 787#L444-1 assume !(0 == ~e_g~0); 788#L449-1 assume !(0 == ~e_e~0); 877#L454-1 assume !(0 == ~e_c~0); 878#L459-1 assume !(0 == ~e_wl~0); 829#L464-1 assume !(1 == ~wl_pc~0); 830#$Ultimate##44 assume !(2 == ~wl_pc~0); 825#L477 assume !(1 == ~c1_pc~0); 813#L487 assume !(1 == ~c2_pc~0); 815#L496 assume !(1 == ~wb_pc~0); 841#L505 assume !(1 == ~e_c~0); 842#L514-1 assume !(1 == ~e_e~0); 853#L519-1 assume !(1 == ~e_f~0); 859#L524-1 assume !(1 == ~e_g~0); 860#L529-1 assume !(1 == ~e_c~0); 784#L534-1 assume !(1 == ~e_wl~0); 785#L676-1 [2022-12-13 18:47:21,293 INFO L750 eck$LassoCheckResult]: Loop: 785#L676-1 assume !false; 786#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 812#L381 assume !false; 854#L299 assume !(0 == ~wl_st~0); 855#L303 assume !(0 == ~c1_st~0); 907#L306 assume !(0 == ~c2_st~0); 900#L309 assume !(0 == ~wb_st~0); 901#L312 assume !(0 == ~r_st~0); 902#eval_returnLabel#1 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 861#L552 assume !(1 == ~c_req_up~0); 862#L552-2 start_simulation_~kernel_st~0#1 := 3; 808#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 809#L564-2 assume !(0 == ~e_g~0); 789#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 790#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 799#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 800#L584-1 assume 1 == ~wl_pc~0; 868#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 869#L597 assume !(1 == ~c1_pc~0); 835#L607 assume !(1 == ~c2_pc~0); 836#L616 assume !(1 == ~wb_pc~0); 889#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 881#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 875#L639-1 assume !(1 == ~e_f~0); 876#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 891#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 858#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 821#L659-1 assume 0 == ~wl_st~0; 785#L676-1 [2022-12-13 18:47:21,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:21,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2022-12-13 18:47:21,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:21,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140658496] [2022-12-13 18:47:21,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:21,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:21,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:21,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140658496] [2022-12-13 18:47:21,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140658496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:21,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:21,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:47:21,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836830677] [2022-12-13 18:47:21,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:21,321 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 18:47:21,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:21,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1073460531, now seen corresponding path program 3 times [2022-12-13 18:47:21,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:21,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676109023] [2022-12-13 18:47:21,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:21,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:21,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:21,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676109023] [2022-12-13 18:47:21,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676109023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:21,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:21,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:47:21,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138559099] [2022-12-13 18:47:21,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:21,341 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 18:47:21,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:47:21,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:47:21,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:47:21,342 INFO L87 Difference]: Start difference. First operand 125 states and 217 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) [2022-12-13 18:47:21,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:47:21,350 INFO L93 Difference]: Finished difference Result 125 states and 216 transitions. [2022-12-13 18:47:21,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 216 transitions. [2022-12-13 18:47:21,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2022-12-13 18:47:21,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 216 transitions. [2022-12-13 18:47:21,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2022-12-13 18:47:21,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2022-12-13 18:47:21,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 216 transitions. [2022-12-13 18:47:21,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:47:21,352 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 216 transitions. [2022-12-13 18:47:21,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 216 transitions. [2022-12-13 18:47:21,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-12-13 18:47:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.728) internal successors, (216), 124 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) [2022-12-13 18:47:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 216 transitions. [2022-12-13 18:47:21,355 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 216 transitions. [2022-12-13 18:47:21,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:47:21,356 INFO L428 stractBuchiCegarLoop]: Abstraction has 125 states and 216 transitions. [2022-12-13 18:47:21,356 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-12-13 18:47:21,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 216 transitions. [2022-12-13 18:47:21,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2022-12-13 18:47:21,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:47:21,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:47:21,357 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] [2022-12-13 18:47:21,357 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] [2022-12-13 18:47:21,357 INFO L748 eck$LassoCheckResult]: Stem: 1084#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1085#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; 1114#L408 assume !(1 == ~c_req_up~0); 1077#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1154#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1165#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1139#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1140#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1121#L439-1 assume !(0 == ~e_f~0); 1044#L444-1 assume !(0 == ~e_g~0); 1045#L449-1 assume !(0 == ~e_e~0); 1134#L454-1 assume !(0 == ~e_c~0); 1135#L459-1 assume !(0 == ~e_wl~0); 1086#L464-1 assume !(1 == ~wl_pc~0); 1087#$Ultimate##44 assume !(2 == ~wl_pc~0); 1082#L477 assume !(1 == ~c1_pc~0); 1070#L487 assume !(1 == ~c2_pc~0); 1072#L496 assume !(1 == ~wb_pc~0); 1098#L505 assume !(1 == ~e_c~0); 1099#L514-1 assume !(1 == ~e_e~0); 1110#L519-1 assume !(1 == ~e_f~0); 1116#L524-1 assume !(1 == ~e_g~0); 1117#L529-1 assume !(1 == ~e_c~0); 1041#L534-1 assume !(1 == ~e_wl~0); 1042#L676-1 [2022-12-13 18:47:21,357 INFO L750 eck$LassoCheckResult]: Loop: 1042#L676-1 assume !false; 1043#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1069#L381 assume !false; 1111#L299 assume !(0 == ~wl_st~0); 1112#L303 assume !(0 == ~c1_st~0); 1164#L306 assume !(0 == ~c2_st~0); 1157#L309 assume !(0 == ~wb_st~0); 1158#L312 assume !(0 == ~r_st~0); 1159#eval_returnLabel#1 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1118#L552 assume !(1 == ~c_req_up~0); 1119#L552-2 start_simulation_~kernel_st~0#1 := 3; 1065#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 1066#L564-2 assume !(0 == ~e_g~0); 1046#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1047#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1056#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1057#L584-1 assume 1 == ~wl_pc~0; 1125#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1126#L597 assume !(1 == ~c1_pc~0); 1092#L607 assume !(1 == ~c2_pc~0); 1093#L616 assume !(1 == ~wb_pc~0); 1146#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 1138#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1132#L639-1 assume !(1 == ~e_f~0); 1133#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1148#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1115#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1078#L659-1 assume 0 == ~wl_st~0; 1042#L676-1 [2022-12-13 18:47:21,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:21,358 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2022-12-13 18:47:21,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:21,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039447] [2022-12-13 18:47:21,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:21,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:21,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:47:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:21,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:47:21,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:21,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1073460531, now seen corresponding path program 4 times [2022-12-13 18:47:21,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:21,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064247707] [2022-12-13 18:47:21,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:21,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:21,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:21,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064247707] [2022-12-13 18:47:21,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064247707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:21,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:21,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:47:21,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657694426] [2022-12-13 18:47:21,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:21,402 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 18:47:21,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:47:21,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:47:21,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:47:21,402 INFO L87 Difference]: Start difference. First operand 125 states and 216 transitions. cyclomatic complexity: 92 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:47:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:47:21,442 INFO L93 Difference]: Finished difference Result 159 states and 276 transitions. [2022-12-13 18:47:21,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 276 transitions. [2022-12-13 18:47:21,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 111 [2022-12-13 18:47:21,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 276 transitions. [2022-12-13 18:47:21,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2022-12-13 18:47:21,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2022-12-13 18:47:21,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 276 transitions. [2022-12-13 18:47:21,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:47:21,448 INFO L218 hiAutomatonCegarLoop]: Abstraction has 159 states and 276 transitions. [2022-12-13 18:47:21,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 276 transitions. [2022-12-13 18:47:21,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2022-12-13 18:47:21,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 159 states have (on average 1.7358490566037736) internal successors, (276), 158 states have internal predecessors, (276), 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) [2022-12-13 18:47:21,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 276 transitions. [2022-12-13 18:47:21,452 INFO L240 hiAutomatonCegarLoop]: Abstraction has 159 states and 276 transitions. [2022-12-13 18:47:21,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:47:21,452 INFO L428 stractBuchiCegarLoop]: Abstraction has 159 states and 276 transitions. [2022-12-13 18:47:21,452 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-12-13 18:47:21,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 276 transitions. [2022-12-13 18:47:21,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 111 [2022-12-13 18:47:21,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:47:21,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:47:21,454 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] [2022-12-13 18:47:21,454 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] [2022-12-13 18:47:21,454 INFO L748 eck$LassoCheckResult]: Stem: 1375#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1376#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; 1405#L408 assume !(1 == ~c_req_up~0); 1368#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1449#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1462#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1431#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1432#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1412#L439-1 assume 0 == ~e_f~0;~e_f~0 := 1; 1334#L444-1 assume !(0 == ~e_g~0); 1335#L449-1 assume !(0 == ~e_e~0); 1426#L454-1 assume !(0 == ~e_c~0); 1427#L459-1 assume !(0 == ~e_wl~0); 1377#L464-1 assume !(1 == ~wl_pc~0); 1378#$Ultimate##44 assume !(2 == ~wl_pc~0); 1373#L477 assume !(1 == ~c1_pc~0); 1361#L487 assume !(1 == ~c2_pc~0); 1363#L496 assume !(1 == ~wb_pc~0); 1389#L505 assume !(1 == ~e_c~0); 1390#L514-1 assume !(1 == ~e_e~0); 1401#L519-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1407#L524-1 assume !(1 == ~e_g~0); 1408#L529-1 assume !(1 == ~e_c~0); 1331#L534-1 assume !(1 == ~e_wl~0); 1332#L676-1 [2022-12-13 18:47:21,454 INFO L750 eck$LassoCheckResult]: Loop: 1332#L676-1 assume !false; 1333#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1360#L381 assume !false; 1402#L299 assume !(0 == ~wl_st~0); 1403#L303 assume !(0 == ~c1_st~0); 1461#L306 assume !(0 == ~c2_st~0); 1452#L309 assume !(0 == ~wb_st~0); 1453#L312 assume !(0 == ~r_st~0); 1454#eval_returnLabel#1 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1409#L552 assume !(1 == ~c_req_up~0); 1410#L552-2 start_simulation_~kernel_st~0#1 := 3; 1355#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 1356#L564-2 assume !(0 == ~e_g~0); 1489#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1488#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1487#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1486#L584-1 assume 1 == ~wl_pc~0; 1484#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1482#L597 assume !(1 == ~c1_pc~0); 1442#L607 assume !(1 == ~c2_pc~0); 1437#L616 assume !(1 == ~wb_pc~0); 1480#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 1430#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1424#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1425#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1443#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1406#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1369#L659-1 assume 0 == ~wl_st~0; 1332#L676-1 [2022-12-13 18:47:21,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:21,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1276613851, now seen corresponding path program 1 times [2022-12-13 18:47:21,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:21,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610494368] [2022-12-13 18:47:21,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:21,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:21,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:21,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610494368] [2022-12-13 18:47:21,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610494368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:21,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:21,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:47:21,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562514677] [2022-12-13 18:47:21,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:21,487 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 18:47:21,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:21,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1071613489, now seen corresponding path program 1 times [2022-12-13 18:47:21,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:21,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429853629] [2022-12-13 18:47:21,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:21,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:21,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:47:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:21,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:47:21,765 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 18:47:21,766 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 18:47:21,766 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 18:47:21,766 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 18:47:21,766 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-12-13 18:47:21,766 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:21,766 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 18:47:21,766 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 18:47:21,767 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2022-12-13 18:47:21,767 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 18:47:21,767 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 18:47:21,783 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,793 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,795 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,799 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,801 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,803 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,805 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,809 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,812 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,813 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,815 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,817 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,818 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,820 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,823 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,826 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,827 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,831 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,834 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,838 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,840 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,842 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,846 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,848 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,849 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:21,853 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,010 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 18:47:22,010 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-12-13 18:47:22,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:22,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:22,013 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:22,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-12-13 18:47:22,015 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-12-13 18:47:22,015 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-12-13 18:47:22,031 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-12-13 18:47:22,032 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: [] [2022-12-13 18:47:22,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-12-13 18:47:22,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:22,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:22,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:22,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-12-13 18:47:22,039 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-12-13 18:47:22,039 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-12-13 18:47:22,058 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-12-13 18:47:22,058 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-12-13 18:47:22,061 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-12-13 18:47:22,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:22,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:22,062 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:22,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-12-13 18:47:22,065 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-12-13 18:47:22,065 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-12-13 18:47:22,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-12-13 18:47:22,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:22,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:22,081 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:22,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-12-13 18:47:22,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-12-13 18:47:22,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-12-13 18:47:22,100 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-12-13 18:47:22,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-12-13 18:47:22,104 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 18:47:22,104 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 18:47:22,104 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 18:47:22,104 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 18:47:22,104 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 18:47:22,104 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:22,104 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 18:47:22,104 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 18:47:22,104 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration6_Loop [2022-12-13 18:47:22,104 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 18:47:22,104 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 18:47:22,107 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,110 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,114 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,116 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,118 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,120 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,124 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,127 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,129 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,131 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,133 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,135 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,137 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,141 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,143 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,146 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,148 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,152 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,154 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,158 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,160 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,162 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,166 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,168 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,170 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,174 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,319 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 18:47:22,323 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 18:47:22,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:22,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:22,325 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:22,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-12-13 18:47:22,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 18:47:22,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 18:47:22,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 18:47:22,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 18:47:22,339 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-12-13 18:47:22,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 18:47:22,341 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-12-13 18:47:22,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 18:47:22,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 18:47:22,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-12-13 18:47:22,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:22,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:22,348 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:22,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-12-13 18:47:22,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 18:47:22,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 18:47:22,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 18:47:22,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 18:47:22,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 18:47:22,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 18:47:22,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 18:47:22,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 18:47:22,364 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 18:47:22,368 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-12-13 18:47:22,368 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-12-13 18:47:22,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:22,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:22,396 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:22,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-12-13 18:47:22,398 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 18:47:22,398 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-12-13 18:47:22,398 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 18:47:22,399 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2022-12-13 18:47:22,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-12-13 18:47:22,404 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-12-13 18:47:22,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:22,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:47:22,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:47:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:22,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 18:47:22,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:47:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:22,560 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 [2022-12-13 18:47:22,562 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 159 states and 276 transitions. cyclomatic complexity: 118 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) [2022-12-13 18:47:22,633 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 159 states and 276 transitions. cyclomatic complexity: 118. 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 500 states and 860 transitions. Complement of second has 5 states. [2022-12-13 18:47:22,634 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 [2022-12-13 18:47:22,635 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) [2022-12-13 18:47:22,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2022-12-13 18:47:22,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 28 letters. [2022-12-13 18:47:22,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 18:47:22,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 52 letters. Loop has 28 letters. [2022-12-13 18:47:22,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 18:47:22,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 376 transitions. Stem has 24 letters. Loop has 56 letters. [2022-12-13 18:47:22,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 18:47:22,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 500 states and 860 transitions. [2022-12-13 18:47:22,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-12-13 18:47:22,649 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 333 [2022-12-13 18:47:22,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 500 states to 500 states and 860 transitions. [2022-12-13 18:47:22,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 382 [2022-12-13 18:47:22,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2022-12-13 18:47:22,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 500 states and 860 transitions. [2022-12-13 18:47:22,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 18:47:22,655 INFO L218 hiAutomatonCegarLoop]: Abstraction has 500 states and 860 transitions. [2022-12-13 18:47:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states and 860 transitions. [2022-12-13 18:47:22,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 385. [2022-12-13 18:47:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 385 states have (on average 1.7246753246753246) internal successors, (664), 384 states have internal predecessors, (664), 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) [2022-12-13 18:47:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 664 transitions. [2022-12-13 18:47:22,665 INFO L240 hiAutomatonCegarLoop]: Abstraction has 385 states and 664 transitions. [2022-12-13 18:47:22,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:47:22,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:47:22,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:47:22,666 INFO L87 Difference]: Start difference. First operand 385 states and 664 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:47:22,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:47:22,687 INFO L93 Difference]: Finished difference Result 316 states and 521 transitions. [2022-12-13 18:47:22,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 521 transitions. [2022-12-13 18:47:22,690 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2022-12-13 18:47:22,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 521 transitions. [2022-12-13 18:47:22,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 220 [2022-12-13 18:47:22,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 220 [2022-12-13 18:47:22,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 521 transitions. [2022-12-13 18:47:22,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 18:47:22,693 INFO L218 hiAutomatonCegarLoop]: Abstraction has 316 states and 521 transitions. [2022-12-13 18:47:22,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 521 transitions. [2022-12-13 18:47:22,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2022-12-13 18:47:22,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.6487341772151898) internal successors, (521), 315 states have internal predecessors, (521), 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) [2022-12-13 18:47:22,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 521 transitions. [2022-12-13 18:47:22,701 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 521 transitions. [2022-12-13 18:47:22,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:47:22,702 INFO L428 stractBuchiCegarLoop]: Abstraction has 316 states and 521 transitions. [2022-12-13 18:47:22,702 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-12-13 18:47:22,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 316 states and 521 transitions. [2022-12-13 18:47:22,704 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 188 [2022-12-13 18:47:22,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:47:22,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:47:22,705 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] [2022-12-13 18:47:22,705 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] [2022-12-13 18:47:22,705 INFO L748 eck$LassoCheckResult]: Stem: 2946#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 2947#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; 2999#L408 assume !(1 == ~c_req_up~0); 2935#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 3077#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 3096#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 3047#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 3048#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 3010#L439-1 assume !(0 == ~e_f~0); 2874#L444-1 assume !(0 == ~e_g~0); 2875#L449-1 assume !(0 == ~e_e~0); 3035#L454-1 assume !(0 == ~e_c~0); 3036#L459-1 assume !(0 == ~e_wl~0); 2948#L464-1 assume !(1 == ~wl_pc~0); 2949#$Ultimate##44 assume !(2 == ~wl_pc~0); 2944#L477 assume !(1 == ~c1_pc~0); 2925#L487 assume !(1 == ~c2_pc~0); 2927#L496 assume !(1 == ~wb_pc~0); 2969#L505 assume !(1 == ~e_c~0); 2970#L514-1 assume !(1 == ~e_e~0); 2992#L519-1 assume !(1 == ~e_f~0); 3000#L524-1 assume !(1 == ~e_g~0); 3001#L529-1 assume !(1 == ~e_c~0); 2867#L534-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2868#L676-1 [2022-12-13 18:47:22,705 INFO L750 eck$LassoCheckResult]: Loop: 2868#L676-1 assume !false; 3114#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 3111#L381 assume !false; 3110#L299 assume !(0 == ~wl_st~0); 3109#L303 assume !(0 == ~c1_st~0); 3108#L306 assume !(0 == ~c2_st~0); 3107#L309 assume !(0 == ~wb_st~0); 3105#L312 assume !(0 == ~r_st~0); 3085#eval_returnLabel#1 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 3004#L552 assume !(1 == ~c_req_up~0); 3005#L552-2 start_simulation_~kernel_st~0#1 := 3; 2914#L564 assume !(0 == ~e_f~0); 2915#L564-2 assume !(0 == ~e_g~0); 3101#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 3099#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 3100#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 3162#L584-1 assume 1 == ~wl_pc~0; 3160#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 3158#L597 assume !(1 == ~c1_pc~0); 3156#L607 assume !(1 == ~c2_pc~0); 3154#L616 assume !(1 == ~wb_pc~0); 3151#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 3149#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 3148#L639-1 assume !(1 == ~e_f~0); 3147#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 3146#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 3126#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 3124#L659-1 assume 0 == ~wl_st~0; 2868#L676-1 [2022-12-13 18:47:22,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:22,706 INFO L85 PathProgramCache]: Analyzing trace with hash 255605077, now seen corresponding path program 1 times [2022-12-13 18:47:22,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:22,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034525512] [2022-12-13 18:47:22,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:22,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:22,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:22,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:22,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034525512] [2022-12-13 18:47:22,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034525512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:22,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:22,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:47:22,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533772729] [2022-12-13 18:47:22,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:22,751 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 18:47:22,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:22,752 INFO L85 PathProgramCache]: Analyzing trace with hash -514887371, now seen corresponding path program 1 times [2022-12-13 18:47:22,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:22,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604331491] [2022-12-13 18:47:22,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:22,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:22,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:47:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:22,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:47:22,945 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 18:47:22,945 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 18:47:22,945 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 18:47:22,945 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 18:47:22,945 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-12-13 18:47:22,946 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:22,946 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 18:47:22,946 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 18:47:22,946 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration7_Loop [2022-12-13 18:47:22,946 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 18:47:22,946 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 18:47:22,948 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,950 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,952 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,954 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,956 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,957 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,961 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,962 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,964 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,966 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,969 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,973 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,975 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,977 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,980 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,982 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,984 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,987 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,989 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,992 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,994 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,996 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,997 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:22,999 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,001 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,002 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,138 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 18:47:23,138 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-12-13 18:47:23,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:23,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:23,139 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:23,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-12-13 18:47:23,142 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-12-13 18:47:23,142 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-12-13 18:47:23,160 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-12-13 18:47:23,160 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=-1} Honda state: {~c2_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-12-13 18:47:23,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-12-13 18:47:23,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:23,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:23,164 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:23,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-12-13 18:47:23,166 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-12-13 18:47:23,166 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-12-13 18:47:23,178 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-12-13 18:47:23,178 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: [] [2022-12-13 18:47:23,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-12-13 18:47:23,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:23,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:23,182 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:23,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-12-13 18:47:23,184 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-12-13 18:47:23,184 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-12-13 18:47:23,195 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-12-13 18:47:23,195 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: [] [2022-12-13 18:47:23,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-12-13 18:47:23,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:23,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:23,200 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:23,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-12-13 18:47:23,202 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-12-13 18:47:23,202 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-12-13 18:47:23,219 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-12-13 18:47:23,219 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=4} Honda state: {~c1_st~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-12-13 18:47:23,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-12-13 18:47:23,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:23,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:23,223 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:23,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-12-13 18:47:23,225 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-12-13 18:47:23,225 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-12-13 18:47:23,237 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-12-13 18:47:23,237 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~0#1=0} Honda state: {ULTIMATE.start_eval_~tmp___0~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-12-13 18:47:23,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-12-13 18:47:23,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:23,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:23,240 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:23,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-12-13 18:47:23,242 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-12-13 18:47:23,242 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-12-13 18:47:23,256 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-12-13 18:47:23,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:23,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:23,257 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:23,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-12-13 18:47:23,259 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-12-13 18:47:23,259 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-12-13 18:47:23,272 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-12-13 18:47:23,276 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-12-13 18:47:23,276 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 18:47:23,276 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 18:47:23,276 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 18:47:23,276 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 18:47:23,276 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 18:47:23,276 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:23,277 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 18:47:23,277 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 18:47:23,277 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration7_Loop [2022-12-13 18:47:23,277 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 18:47:23,277 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 18:47:23,279 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,281 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,283 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,284 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,286 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,287 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,291 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,292 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,294 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,296 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,297 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,301 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,304 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,306 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,310 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,311 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,315 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,317 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,320 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,322 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,324 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,325 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,326 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,327 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,328 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,330 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:23,430 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 18:47:23,430 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 18:47:23,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:23,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:23,431 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:23,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-12-13 18:47:23,433 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 [2022-12-13 18:47:23,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 18:47:23,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 18:47:23,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 18:47:23,444 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-12-13 18:47:23,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 18:47:23,445 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-12-13 18:47:23,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 18:47:23,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 18:47:23,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-12-13 18:47:23,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:23,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:23,450 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:23,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-12-13 18:47:23,452 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 [2022-12-13 18:47:23,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 18:47:23,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 18:47:23,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 18:47:23,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 18:47:23,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 18:47:23,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 18:47:23,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 18:47:23,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 18:47:23,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-12-13 18:47:23,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:23,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:23,468 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:23,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-12-13 18:47:23,470 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 [2022-12-13 18:47:23,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 18:47:23,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 18:47:23,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 18:47:23,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 18:47:23,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 18:47:23,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 18:47:23,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 18:47:23,482 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 18:47:23,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-12-13 18:47:23,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:23,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:23,486 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:23,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-12-13 18:47:23,487 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 [2022-12-13 18:47:23,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 18:47:23,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 18:47:23,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 18:47:23,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 18:47:23,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 18:47:23,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 18:47:23,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 18:47:23,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 18:47:23,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-12-13 18:47:23,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:23,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:23,504 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:23,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-12-13 18:47:23,506 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 [2022-12-13 18:47:23,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 18:47:23,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 18:47:23,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 18:47:23,516 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-12-13 18:47:23,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 18:47:23,517 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-12-13 18:47:23,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 18:47:23,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 18:47:23,522 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-12-13 18:47:23,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:23,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:23,523 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:23,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-12-13 18:47:23,525 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 [2022-12-13 18:47:23,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 18:47:23,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 18:47:23,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 18:47:23,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 18:47:23,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 18:47:23,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 18:47:23,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 18:47:23,538 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 18:47:23,540 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-12-13 18:47:23,540 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-12-13 18:47:23,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:23,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:23,546 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:23,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-12-13 18:47:23,548 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 18:47:23,548 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-12-13 18:47:23,548 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 18:47:23,548 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2022-12-13 18:47:23,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-12-13 18:47:23,553 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-12-13 18:47:23,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:23,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:47:23,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:47:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:23,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 18:47:23,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:47:23,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:23,662 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 [2022-12-13 18:47:23,662 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 316 states and 521 transitions. cyclomatic complexity: 208 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) [2022-12-13 18:47:23,690 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 316 states and 521 transitions. cyclomatic complexity: 208. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 604 states and 995 transitions. Complement of second has 5 states. [2022-12-13 18:47:23,691 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 [2022-12-13 18:47:23,691 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) [2022-12-13 18:47:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2022-12-13 18:47:23,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 364 transitions. Stem has 24 letters. Loop has 28 letters. [2022-12-13 18:47:23,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 18:47:23,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 364 transitions. Stem has 52 letters. Loop has 28 letters. [2022-12-13 18:47:23,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 18:47:23,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 364 transitions. Stem has 24 letters. Loop has 56 letters. [2022-12-13 18:47:23,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 18:47:23,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 604 states and 995 transitions. [2022-12-13 18:47:23,696 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 376 [2022-12-13 18:47:23,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 604 states to 604 states and 995 transitions. [2022-12-13 18:47:23,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2022-12-13 18:47:23,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 412 [2022-12-13 18:47:23,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 604 states and 995 transitions. [2022-12-13 18:47:23,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 18:47:23,698 INFO L218 hiAutomatonCegarLoop]: Abstraction has 604 states and 995 transitions. [2022-12-13 18:47:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states and 995 transitions. [2022-12-13 18:47:23,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 316. [2022-12-13 18:47:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 316 states have (on average 1.6487341772151898) internal successors, (521), 315 states have internal predecessors, (521), 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) [2022-12-13 18:47:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 521 transitions. [2022-12-13 18:47:23,704 INFO L240 hiAutomatonCegarLoop]: Abstraction has 316 states and 521 transitions. [2022-12-13 18:47:23,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:47:23,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:47:23,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:47:23,704 INFO L87 Difference]: Start difference. First operand 316 states and 521 transitions. Second operand has 4 states, 3 states have (on average 8.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) [2022-12-13 18:47:23,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:47:23,777 INFO L93 Difference]: Finished difference Result 597 states and 967 transitions. [2022-12-13 18:47:23,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 597 states and 967 transitions. [2022-12-13 18:47:23,781 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 313 [2022-12-13 18:47:23,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 597 states to 597 states and 967 transitions. [2022-12-13 18:47:23,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 390 [2022-12-13 18:47:23,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 390 [2022-12-13 18:47:23,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 597 states and 967 transitions. [2022-12-13 18:47:23,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 18:47:23,785 INFO L218 hiAutomatonCegarLoop]: Abstraction has 597 states and 967 transitions. [2022-12-13 18:47:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states and 967 transitions. [2022-12-13 18:47:23,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 595. [2022-12-13 18:47:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 595 states have (on average 1.6218487394957983) internal successors, (965), 594 states have internal predecessors, (965), 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) [2022-12-13 18:47:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 965 transitions. [2022-12-13 18:47:23,799 INFO L240 hiAutomatonCegarLoop]: Abstraction has 595 states and 965 transitions. [2022-12-13 18:47:23,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:47:23,800 INFO L428 stractBuchiCegarLoop]: Abstraction has 595 states and 965 transitions. [2022-12-13 18:47:23,800 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-12-13 18:47:23,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 595 states and 965 transitions. [2022-12-13 18:47:23,803 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 313 [2022-12-13 18:47:23,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:47:23,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:47:23,804 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] [2022-12-13 18:47:23,804 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] [2022-12-13 18:47:23,804 INFO L748 eck$LassoCheckResult]: Stem: 4961#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 4962#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; 5016#L408 assume !(1 == ~c_req_up~0); 5104#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 5105#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 5145#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 5146#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 5137#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 5138#L439-1 assume !(0 == ~e_f~0); 4886#L444-1 assume !(0 == ~e_g~0); 4887#L449-1 assume !(0 == ~e_e~0); 5051#L454-1 assume 0 == ~e_c~0;~e_c~0 := 1; 5052#L459-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 5130#L464-1 assume !(1 == ~wl_pc~0); 5185#$Ultimate##44 assume !(2 == ~wl_pc~0); 5183#L477 assume !(1 == ~c1_pc~0); 5181#L487 assume !(1 == ~c2_pc~0); 5179#L496 assume !(1 == ~wb_pc~0); 5177#L505 assume !(1 == ~e_c~0); 5176#L514-1 assume !(1 == ~e_e~0); 5175#L519-1 assume !(1 == ~e_f~0); 5174#L524-1 assume !(1 == ~e_g~0); 5173#L529-1 assume !(1 == ~e_c~0); 5172#L534-1 assume !(1 == ~e_wl~0); 4881#L676-1 assume !false; 4883#L546 [2022-12-13 18:47:23,805 INFO L750 eck$LassoCheckResult]: Loop: 4883#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 4934#L381 assume !false; 5009#L299 assume !(0 == ~wl_st~0); 5011#L303 assume !(0 == ~c1_st~0); 5142#L306 assume !(0 == ~c2_st~0); 5149#L309 assume !(0 == ~wb_st~0); 5150#L312 assume !(0 == ~r_st~0); 5115#eval_returnLabel#1 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 5116#L552 assume !(1 == ~c_req_up~0); 5412#L552-2 start_simulation_~kernel_st~0#1 := 3; 5411#L564 assume !(0 == ~e_f~0); 5410#L564-2 assume !(0 == ~e_g~0); 5409#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 5408#L574-1 assume !(0 == ~e_c~0); 5407#L579-1 assume !(0 == ~e_wl~0); 5399#L584-1 assume !(1 == ~wl_pc~0); 5056#$Ultimate##254 assume !(2 == ~wl_pc~0); 5058#L597 assume !(1 == ~c1_pc~0); 5403#L607 assume !(1 == ~c2_pc~0); 5126#L616 assume !(1 == ~wb_pc~0); 5081#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 5400#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 5474#L639-1 assume !(1 == ~e_f~0); 5473#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 5472#L649-1 assume !(1 == ~e_c~0); 5471#L654-1 assume !(1 == ~e_wl~0); 5384#L659-1 assume 0 == ~wl_st~0; 4882#L676-1 assume !false; 4883#L546 [2022-12-13 18:47:23,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:23,805 INFO L85 PathProgramCache]: Analyzing trace with hash 931746300, now seen corresponding path program 1 times [2022-12-13 18:47:23,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:23,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902445632] [2022-12-13 18:47:23,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:23,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:23,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:23,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902445632] [2022-12-13 18:47:23,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902445632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:23,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:23,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:47:23,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872870146] [2022-12-13 18:47:23,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:23,832 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 18:47:23,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:23,832 INFO L85 PathProgramCache]: Analyzing trace with hash -54743004, now seen corresponding path program 1 times [2022-12-13 18:47:23,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:23,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729067129] [2022-12-13 18:47:23,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:23,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:23,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:23,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729067129] [2022-12-13 18:47:23,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729067129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:23,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:23,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:47:23,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868789068] [2022-12-13 18:47:23,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:23,843 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 18:47:23,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:47:23,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:47:23,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:47:23,844 INFO L87 Difference]: Start difference. First operand 595 states and 965 transitions. cyclomatic complexity: 375 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) [2022-12-13 18:47:23,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:47:23,904 INFO L93 Difference]: Finished difference Result 1015 states and 1639 transitions. [2022-12-13 18:47:23,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1015 states and 1639 transitions. [2022-12-13 18:47:23,911 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 498 [2022-12-13 18:47:23,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1015 states to 1015 states and 1639 transitions. [2022-12-13 18:47:23,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 618 [2022-12-13 18:47:23,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 618 [2022-12-13 18:47:23,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1015 states and 1639 transitions. [2022-12-13 18:47:23,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 18:47:23,917 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1015 states and 1639 transitions. [2022-12-13 18:47:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states and 1639 transitions. [2022-12-13 18:47:23,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 600. [2022-12-13 18:47:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 600 states have (on average 1.61) internal successors, (966), 599 states have internal predecessors, (966), 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) [2022-12-13 18:47:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 966 transitions. [2022-12-13 18:47:23,926 INFO L240 hiAutomatonCegarLoop]: Abstraction has 600 states and 966 transitions. [2022-12-13 18:47:23,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:47:23,927 INFO L428 stractBuchiCegarLoop]: Abstraction has 600 states and 966 transitions. [2022-12-13 18:47:23,927 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-12-13 18:47:23,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 600 states and 966 transitions. [2022-12-13 18:47:23,928 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 319 [2022-12-13 18:47:23,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:47:23,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:47:23,929 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] [2022-12-13 18:47:23,929 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] [2022-12-13 18:47:23,929 INFO L748 eck$LassoCheckResult]: Stem: 6580#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 6581#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; 6633#L408 assume !(1 == ~c_req_up~0); 6568#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6773#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6774#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6685#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 6686#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 6763#L439-1 assume !(0 == ~e_f~0); 6506#L444-1 assume !(0 == ~e_g~0); 6507#L449-1 assume !(0 == ~e_e~0); 6669#L454-1 assume !(0 == ~e_c~0); 6670#L459-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 6582#L464-1 assume !(1 == ~wl_pc~0); 6583#$Ultimate##44 assume !(2 == ~wl_pc~0); 6890#L477 assume !(1 == ~c1_pc~0); 6888#L487 assume !(1 == ~c2_pc~0); 6886#L496 assume !(1 == ~wb_pc~0); 6884#L505 assume !(1 == ~e_c~0); 6883#L514-1 assume !(1 == ~e_e~0); 6881#L519-1 assume !(1 == ~e_f~0); 6841#L524-1 assume !(1 == ~e_g~0); 6840#L529-1 assume !(1 == ~e_c~0); 6815#L534-1 assume !(1 == ~e_wl~0); 6813#L676-1 assume !false; 6814#L546 [2022-12-13 18:47:23,929 INFO L750 eck$LassoCheckResult]: Loop: 6814#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 7038#L381 assume !false; 7037#L299 assume !(0 == ~wl_st~0); 7036#L303 assume !(0 == ~c1_st~0); 7035#L306 assume !(0 == ~c2_st~0); 7034#L309 assume !(0 == ~wb_st~0); 7033#L312 assume !(0 == ~r_st~0); 7032#eval_returnLabel#1 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 6639#L552 assume !(1 == ~c_req_up~0); 6640#L552-2 start_simulation_~kernel_st~0#1 := 3; 7029#L564 assume !(0 == ~e_f~0); 7028#L564-2 assume !(0 == ~e_g~0); 7027#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 7026#L574-1 assume !(0 == ~e_c~0); 7025#L579-1 assume !(0 == ~e_wl~0); 7024#L584-1 assume !(1 == ~wl_pc~0); 7002#$Ultimate##254 assume !(2 == ~wl_pc~0); 7021#L597 assume !(1 == ~c1_pc~0); 7019#L607 assume !(1 == ~c2_pc~0); 7017#L616 assume !(1 == ~wb_pc~0); 7015#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 6678#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 6665#L639-1 assume !(1 == ~e_f~0); 6666#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 6703#L649-1 assume !(1 == ~e_c~0); 6634#L654-1 assume !(1 == ~e_wl~0); 6635#L659-1 assume 0 == ~wl_st~0; 7046#L676-1 assume !false; 6814#L546 [2022-12-13 18:47:23,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:23,930 INFO L85 PathProgramCache]: Analyzing trace with hash -79370950, now seen corresponding path program 1 times [2022-12-13 18:47:23,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:23,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341305598] [2022-12-13 18:47:23,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:23,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:23,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:23,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341305598] [2022-12-13 18:47:23,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341305598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:23,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:23,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:47:23,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577754403] [2022-12-13 18:47:23,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:23,958 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 18:47:23,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:23,958 INFO L85 PathProgramCache]: Analyzing trace with hash -54743004, now seen corresponding path program 2 times [2022-12-13 18:47:23,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:23,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768466370] [2022-12-13 18:47:23,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:23,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:23,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:23,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768466370] [2022-12-13 18:47:23,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768466370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:23,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:23,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:47:23,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911995949] [2022-12-13 18:47:23,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:23,970 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 18:47:23,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:47:23,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:47:23,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:47:23,970 INFO L87 Difference]: Start difference. First operand 600 states and 966 transitions. cyclomatic complexity: 371 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) [2022-12-13 18:47:24,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:47:24,016 INFO L93 Difference]: Finished difference Result 1248 states and 1981 transitions. [2022-12-13 18:47:24,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1248 states and 1981 transitions. [2022-12-13 18:47:24,023 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 710 [2022-12-13 18:47:24,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1248 states to 1248 states and 1981 transitions. [2022-12-13 18:47:24,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 796 [2022-12-13 18:47:24,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 796 [2022-12-13 18:47:24,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1248 states and 1981 transitions. [2022-12-13 18:47:24,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 18:47:24,031 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1248 states and 1981 transitions. [2022-12-13 18:47:24,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states and 1981 transitions. [2022-12-13 18:47:24,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 800. [2022-12-13 18:47:24,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 800 states have (on average 1.58875) internal successors, (1271), 799 states have internal predecessors, (1271), 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) [2022-12-13 18:47:24,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1271 transitions. [2022-12-13 18:47:24,047 INFO L240 hiAutomatonCegarLoop]: Abstraction has 800 states and 1271 transitions. [2022-12-13 18:47:24,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:47:24,048 INFO L428 stractBuchiCegarLoop]: Abstraction has 800 states and 1271 transitions. [2022-12-13 18:47:24,048 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-12-13 18:47:24,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 800 states and 1271 transitions. [2022-12-13 18:47:24,050 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 465 [2022-12-13 18:47:24,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:47:24,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:47:24,051 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] [2022-12-13 18:47:24,051 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] [2022-12-13 18:47:24,051 INFO L748 eck$LassoCheckResult]: Stem: 8437#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 8438#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; 8491#L408 assume !(1 == ~c_req_up~0); 8587#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 8588#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 8643#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 8644#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 8634#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 8635#L439-1 assume !(0 == ~e_f~0); 8364#L444-1 assume !(0 == ~e_g~0); 8365#L449-1 assume !(0 == ~e_e~0); 8528#L454-1 assume !(0 == ~e_c~0); 8529#L459-1 assume !(0 == ~e_wl~0); 8439#L464-1 assume !(1 == ~wl_pc~0); 8440#$Ultimate##44 assume !(2 == ~wl_pc~0); 8435#L477 assume !(1 == ~c1_pc~0); 8422#L487 assume !(1 == ~c2_pc~0); 8424#L496 assume !(1 == ~wb_pc~0); 8655#L505 assume !(1 == ~e_c~0); 8654#L514-1 assume !(1 == ~e_e~0); 8653#L519-1 assume !(1 == ~e_f~0); 8495#L524-1 assume !(1 == ~e_g~0); 8496#L529-1 assume !(1 == ~e_c~0); 8358#L534-1 assume !(1 == ~e_wl~0); 8359#L676-1 assume !false; 8816#L546 [2022-12-13 18:47:24,051 INFO L750 eck$LassoCheckResult]: Loop: 8816#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 9105#L381 assume !false; 9104#L299 assume !(0 == ~wl_st~0); 9103#L303 assume !(0 == ~c1_st~0); 9102#L306 assume !(0 == ~c2_st~0); 8594#L309 assume !(0 == ~wb_st~0); 8595#L312 assume !(0 == ~r_st~0); 9101#eval_returnLabel#1 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 8497#L552 assume !(1 == ~c_req_up~0); 8498#L552-2 start_simulation_~kernel_st~0#1 := 3; 8403#L564 assume !(0 == ~e_f~0); 8404#L564-2 assume !(0 == ~e_g~0); 8366#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 8367#L574-1 assume !(0 == ~e_c~0); 8386#L579-1 assume !(0 == ~e_wl~0); 8387#L584-1 assume !(1 == ~wl_pc~0); 9097#$Ultimate##254 assume !(2 == ~wl_pc~0); 9095#L597 assume !(1 == ~c1_pc~0); 8448#L607 assume !(1 == ~c2_pc~0); 8449#L616 assume !(1 == ~wb_pc~0); 8636#L625 assume !(1 == ~e_c~0); 8637#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 9121#L639-1 assume !(1 == ~e_f~0); 9120#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 8559#L649-1 assume !(1 == ~e_c~0); 8560#L654-1 assume !(1 == ~e_wl~0); 9117#L659-1 assume 0 == ~wl_st~0; 9111#L676-1 assume !false; 8816#L546 [2022-12-13 18:47:24,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:24,051 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2022-12-13 18:47:24,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:24,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948737291] [2022-12-13 18:47:24,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:24,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:24,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:47:24,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-12-13 18:47:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:24,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:47:24,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:24,071 INFO L85 PathProgramCache]: Analyzing trace with hash -864089630, now seen corresponding path program 1 times [2022-12-13 18:47:24,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:24,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857564541] [2022-12-13 18:47:24,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:24,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:24,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857564541] [2022-12-13 18:47:24,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857564541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:24,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:24,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:47:24,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676165287] [2022-12-13 18:47:24,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:24,083 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 18:47:24,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:47:24,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:47:24,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:47:24,083 INFO L87 Difference]: Start difference. First operand 800 states and 1271 transitions. cyclomatic complexity: 476 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) [2022-12-13 18:47:24,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:47:24,107 INFO L93 Difference]: Finished difference Result 1241 states and 1961 transitions. [2022-12-13 18:47:24,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1241 states and 1961 transitions. [2022-12-13 18:47:24,116 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 739 [2022-12-13 18:47:24,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1241 states to 1241 states and 1961 transitions. [2022-12-13 18:47:24,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 799 [2022-12-13 18:47:24,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 799 [2022-12-13 18:47:24,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1241 states and 1961 transitions. [2022-12-13 18:47:24,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 18:47:24,120 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1241 states and 1961 transitions. [2022-12-13 18:47:24,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states and 1961 transitions. [2022-12-13 18:47:24,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1241. [2022-12-13 18:47:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 1241 states have (on average 1.5801772763900082) internal successors, (1961), 1240 states have internal predecessors, (1961), 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) [2022-12-13 18:47:24,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1961 transitions. [2022-12-13 18:47:24,136 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1241 states and 1961 transitions. [2022-12-13 18:47:24,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:47:24,137 INFO L428 stractBuchiCegarLoop]: Abstraction has 1241 states and 1961 transitions. [2022-12-13 18:47:24,137 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-12-13 18:47:24,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1241 states and 1961 transitions. [2022-12-13 18:47:24,140 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 739 [2022-12-13 18:47:24,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:47:24,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:47:24,140 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] [2022-12-13 18:47:24,140 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:47:24,141 INFO L748 eck$LassoCheckResult]: Stem: 10482#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 10483#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; 10534#L408 assume !(1 == ~c_req_up~0); 10632#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 10633#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 10706#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 10705#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 10675#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 10676#L439-1 assume !(0 == ~e_f~0); 10411#L444-1 assume !(0 == ~e_g~0); 10412#L449-1 assume !(0 == ~e_e~0); 10570#L454-1 assume !(0 == ~e_c~0); 10571#L459-1 assume !(0 == ~e_wl~0); 10484#L464-1 assume !(1 == ~wl_pc~0); 10485#$Ultimate##44 assume !(2 == ~wl_pc~0); 10480#L477 assume !(1 == ~c1_pc~0); 10467#L487 assume !(1 == ~c2_pc~0); 10469#L496 assume !(1 == ~wb_pc~0); 10503#L505 assume !(1 == ~e_c~0); 10504#L514-1 assume !(1 == ~e_e~0); 10530#L519-1 assume !(1 == ~e_f~0); 10535#L524-1 assume !(1 == ~e_g~0); 10536#L529-1 assume !(1 == ~e_c~0); 10405#L534-1 assume !(1 == ~e_wl~0); 10406#L676-1 assume !false; 10834#L546 [2022-12-13 18:47:24,141 INFO L750 eck$LassoCheckResult]: Loop: 10834#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 11203#L381 assume !false; 11202#L299 assume !(0 == ~wl_st~0); 10527#L303 assume !(0 == ~c1_st~0); 10679#L306 assume !(0 == ~c2_st~0); 10640#L309 assume !(0 == ~wb_st~0); 10642#L312 assume !(0 == ~r_st~0); 10645#eval_returnLabel#1 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 10539#L552 assume !(1 == ~c_req_up~0); 10540#L552-2 start_simulation_~kernel_st~0#1 := 3; 10449#L564 assume !(0 == ~e_f~0); 10450#L564-2 assume !(0 == ~e_g~0); 10413#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 10414#L574-1 assume !(0 == ~e_c~0); 10433#L579-1 assume !(0 == ~e_wl~0); 10434#L584-1 assume !(1 == ~wl_pc~0); 10554#$Ultimate##254 assume 2 == ~wl_pc~0; 10574#L598 assume 1 == ~e_e~0;~wl_st~0 := 0; 10670#L597 assume !(1 == ~c1_pc~0); 11504#L607 assume !(1 == ~c2_pc~0); 11500#L616 assume !(1 == ~wb_pc~0); 11496#L625 assume !(1 == ~e_c~0); 11493#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 11492#L639-1 assume !(1 == ~e_f~0); 11491#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 11490#L649-1 assume !(1 == ~e_c~0); 11235#L654-1 assume !(1 == ~e_wl~0); 11219#L659-1 assume 0 == ~wl_st~0; 11214#L676-1 assume !false; 10834#L546 [2022-12-13 18:47:24,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:24,141 INFO L85 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 2 times [2022-12-13 18:47:24,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:24,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444471273] [2022-12-13 18:47:24,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:24,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:24,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:47:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:24,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:47:24,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:24,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1766031718, now seen corresponding path program 1 times [2022-12-13 18:47:24,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:24,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231504518] [2022-12-13 18:47:24,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:24,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:24,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:47:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:24,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:47:24,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:24,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1128637889, now seen corresponding path program 1 times [2022-12-13 18:47:24,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:24,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420216523] [2022-12-13 18:47:24,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:24,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:24,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:24,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:24,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420216523] [2022-12-13 18:47:24,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420216523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:24,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:24,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:47:24,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475734194] [2022-12-13 18:47:24,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:24,315 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 18:47:24,315 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 18:47:24,315 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 18:47:24,316 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 18:47:24,316 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-12-13 18:47:24,316 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:24,316 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 18:47:24,316 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 18:47:24,316 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration11_Loop [2022-12-13 18:47:24,316 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 18:47:24,316 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 18:47:24,318 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,320 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,322 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,324 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,327 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,329 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,331 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,335 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,337 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,341 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,343 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,344 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,345 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,347 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,348 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,352 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,354 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,355 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,357 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,359 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,362 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,364 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,366 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,367 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,371 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,373 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,536 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 18:47:24,536 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-12-13 18:47:24,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:24,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:24,537 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:24,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-12-13 18:47:24,539 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-12-13 18:47:24,539 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-12-13 18:47:24,557 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-12-13 18:47:24,558 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=-1} Honda state: {~r_st~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-12-13 18:47:24,560 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-12-13 18:47:24,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:24,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:24,561 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:24,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-12-13 18:47:24,563 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-12-13 18:47:24,563 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-12-13 18:47:24,575 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-12-13 18:47:24,575 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: [] [2022-12-13 18:47:24,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-12-13 18:47:24,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:24,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:24,579 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:24,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-12-13 18:47:24,581 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-12-13 18:47:24,581 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-12-13 18:47:24,592 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-12-13 18:47:24,592 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: [] [2022-12-13 18:47:24,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-12-13 18:47:24,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:24,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:24,596 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:24,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-12-13 18:47:24,598 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-12-13 18:47:24,598 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-12-13 18:47:24,612 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-12-13 18:47:24,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:24,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:24,613 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:24,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-12-13 18:47:24,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-12-13 18:47:24,615 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-12-13 18:47:24,627 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-12-13 18:47:24,630 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-12-13 18:47:24,630 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 18:47:24,630 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 18:47:24,630 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 18:47:24,630 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 18:47:24,630 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 18:47:24,631 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:24,631 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 18:47:24,631 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 18:47:24,631 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy.cil.c_Iteration11_Loop [2022-12-13 18:47:24,631 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 18:47:24,631 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 18:47:24,632 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,635 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,636 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,637 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,640 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,641 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,643 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,646 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,648 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,650 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,652 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,653 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,653 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,654 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,657 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,658 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,659 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,660 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,661 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,663 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,665 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,666 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,668 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,669 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,672 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,673 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 18:47:24,802 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 18:47:24,802 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 18:47:24,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:24,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:24,803 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:24,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-12-13 18:47:24,805 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 [2022-12-13 18:47:24,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 18:47:24,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 18:47:24,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 18:47:24,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 18:47:24,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 18:47:24,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 18:47:24,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 18:47:24,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 18:47:24,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-12-13 18:47:24,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:24,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:24,821 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:24,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-12-13 18:47:24,823 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 [2022-12-13 18:47:24,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 18:47:24,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 18:47:24,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 18:47:24,833 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-12-13 18:47:24,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 18:47:24,834 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-12-13 18:47:24,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 18:47:24,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 18:47:24,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-12-13 18:47:24,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:24,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:24,839 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:24,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-12-13 18:47:24,841 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 [2022-12-13 18:47:24,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 18:47:24,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 18:47:24,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 18:47:24,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 18:47:24,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 18:47:24,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 18:47:24,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 18:47:24,852 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 18:47:24,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-12-13 18:47:24,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:24,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:24,856 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:24,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-12-13 18:47:24,859 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 [2022-12-13 18:47:24,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 18:47:24,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 18:47:24,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 18:47:24,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 18:47:24,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 18:47:24,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 18:47:24,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 18:47:24,872 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 18:47:24,874 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-12-13 18:47:24,874 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-12-13 18:47:24,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 18:47:24,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:47:24,875 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 18:47:24,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-12-13 18:47:24,877 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 18:47:24,877 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-12-13 18:47:24,877 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 18:47:24,877 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2022-12-13 18:47:24,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-12-13 18:47:24,880 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-12-13 18:47:24,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:24,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:47:24,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:47:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:24,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 18:47:24,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:47:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:24,965 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 [2022-12-13 18:47:24,965 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1241 states and 1961 transitions. cyclomatic complexity: 725 Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:47:24,996 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1241 states and 1961 transitions. cyclomatic complexity: 725. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3166 states and 4998 transitions. Complement of second has 5 states. [2022-12-13 18:47:24,997 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 [2022-12-13 18:47:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:47:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2022-12-13 18:47:24,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 197 transitions. Stem has 25 letters. Loop has 29 letters. [2022-12-13 18:47:24,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 18:47:24,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 197 transitions. Stem has 54 letters. Loop has 29 letters. [2022-12-13 18:47:24,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 18:47:24,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 197 transitions. Stem has 25 letters. Loop has 58 letters. [2022-12-13 18:47:24,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 18:47:24,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3166 states and 4998 transitions. [2022-12-13 18:47:25,009 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1320 [2022-12-13 18:47:25,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3166 states to 3166 states and 4998 transitions. [2022-12-13 18:47:25,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1384 [2022-12-13 18:47:25,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1401 [2022-12-13 18:47:25,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3166 states and 4998 transitions. [2022-12-13 18:47:25,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 18:47:25,019 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3166 states and 4998 transitions. [2022-12-13 18:47:25,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states and 4998 transitions. [2022-12-13 18:47:25,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 3149. [2022-12-13 18:47:25,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 3149 states have (on average 1.577961257542077) internal successors, (4969), 3148 states have internal predecessors, (4969), 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) [2022-12-13 18:47:25,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4969 transitions. [2022-12-13 18:47:25,058 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3149 states and 4969 transitions. [2022-12-13 18:47:25,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:47:25,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:47:25,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:47:25,058 INFO L87 Difference]: Start difference. First operand 3149 states and 4969 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:47:25,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:47:25,089 INFO L93 Difference]: Finished difference Result 3149 states and 4917 transitions. [2022-12-13 18:47:25,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3149 states and 4917 transitions. [2022-12-13 18:47:25,104 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1320 [2022-12-13 18:47:25,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3149 states to 3149 states and 4917 transitions. [2022-12-13 18:47:25,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1384 [2022-12-13 18:47:25,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1384 [2022-12-13 18:47:25,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3149 states and 4917 transitions. [2022-12-13 18:47:25,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 18:47:25,121 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3149 states and 4917 transitions. [2022-12-13 18:47:25,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3149 states and 4917 transitions. [2022-12-13 18:47:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3149 to 3149. [2022-12-13 18:47:25,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 3149 states have (on average 1.5614480787551603) internal successors, (4917), 3148 states have internal predecessors, (4917), 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) [2022-12-13 18:47:25,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4917 transitions. [2022-12-13 18:47:25,177 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3149 states and 4917 transitions. [2022-12-13 18:47:25,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:47:25,178 INFO L428 stractBuchiCegarLoop]: Abstraction has 3149 states and 4917 transitions. [2022-12-13 18:47:25,178 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-12-13 18:47:25,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3149 states and 4917 transitions. [2022-12-13 18:47:25,197 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1320 [2022-12-13 18:47:25,198 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-12-13 18:47:25,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:47:25,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:47:25,198 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] [2022-12-13 18:47:25,198 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:47:25,199 INFO L748 eck$LassoCheckResult]: Stem: 21369#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 21370#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; 21424#L408 assume !(1 == ~c_req_up~0); 21520#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 21521#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 21562#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 21473#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 21474#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 21435#L439-1 assume !(0 == ~e_f~0); 21436#L444-1 assume !(0 == ~e_g~0); 21537#L449-1 assume !(0 == ~e_e~0); 21459#L454-1 assume !(0 == ~e_c~0); 21460#L459-1 assume !(0 == ~e_wl~0); 21546#L464-1 assume !(1 == ~wl_pc~0); 21538#$Ultimate##44 assume !(2 == ~wl_pc~0); 21539#L477 assume !(1 == ~c1_pc~0); 21575#L487 assume !(1 == ~c2_pc~0); 21522#L496 assume !(1 == ~wb_pc~0); 21390#L505 assume !(1 == ~e_c~0); 21391#L514-1 assume !(1 == ~e_e~0); 21417#L519-1 assume !(1 == ~e_f~0); 21425#L524-1 assume !(1 == ~e_g~0); 21426#L529-1 assume !(1 == ~e_c~0); 21294#L534-1 assume !(1 == ~e_wl~0); 21295#L676-1 assume !false; 22687#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 24062#L381 [2022-12-13 18:47:25,199 INFO L750 eck$LassoCheckResult]: Loop: 24062#L381 assume !false; 24061#L299 assume 0 == ~wl_st~0; 24060#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 24058#L325 assume !(0 != eval_~tmp~0#1); 24059#L321 assume !(0 == ~c1_st~0); 24424#L336 assume !(0 == ~c2_st~0); 24074#L351 assume !(0 == ~wb_st~0); 24063#L366 assume !(0 == ~r_st~0); 24062#L381 [2022-12-13 18:47:25,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:25,199 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2022-12-13 18:47:25,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:25,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262260372] [2022-12-13 18:47:25,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:25,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:25,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:47:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:25,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:47:25,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:25,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1282723830, now seen corresponding path program 1 times [2022-12-13 18:47:25,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:25,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599406839] [2022-12-13 18:47:25,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:25,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:25,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:47:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:25,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:47:25,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:25,215 INFO L85 PathProgramCache]: Analyzing trace with hash 363769326, now seen corresponding path program 1 times [2022-12-13 18:47:25,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:25,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140366770] [2022-12-13 18:47:25,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:25,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:25,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:25,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140366770] [2022-12-13 18:47:25,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140366770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:25,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:25,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:47:25,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381501976] [2022-12-13 18:47:25,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:25,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:47:25,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:47:25,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:47:25,260 INFO L87 Difference]: Start difference. First operand 3149 states and 4917 transitions. cyclomatic complexity: 1783 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) [2022-12-13 18:47:25,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:47:25,296 INFO L93 Difference]: Finished difference Result 4634 states and 7109 transitions. [2022-12-13 18:47:25,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4634 states and 7109 transitions. [2022-12-13 18:47:25,307 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1978 [2022-12-13 18:47:25,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4634 states to 4634 states and 7109 transitions. [2022-12-13 18:47:25,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2042 [2022-12-13 18:47:25,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2042 [2022-12-13 18:47:25,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4634 states and 7109 transitions. [2022-12-13 18:47:25,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 18:47:25,323 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4634 states and 7109 transitions. [2022-12-13 18:47:25,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4634 states and 7109 transitions. [2022-12-13 18:47:25,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4634 to 4616. [2022-12-13 18:47:25,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4616 states, 4616 states have (on average 1.5361785095320624) internal successors, (7091), 4615 states have internal predecessors, (7091), 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) [2022-12-13 18:47:25,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4616 states to 4616 states and 7091 transitions. [2022-12-13 18:47:25,371 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4616 states and 7091 transitions. [2022-12-13 18:47:25,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:47:25,372 INFO L428 stractBuchiCegarLoop]: Abstraction has 4616 states and 7091 transitions. [2022-12-13 18:47:25,372 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-12-13 18:47:25,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4616 states and 7091 transitions. [2022-12-13 18:47:25,381 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1970 [2022-12-13 18:47:25,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:47:25,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:47:25,381 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] [2022-12-13 18:47:25,381 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:47:25,381 INFO L748 eck$LassoCheckResult]: Stem: 29161#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 29162#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; 29216#L408 assume !(1 == ~c_req_up~0); 29320#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 29321#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 29369#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 29370#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 29363#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 29364#L439-1 assume !(0 == ~e_f~0); 29091#L444-1 assume !(0 == ~e_g~0); 29092#L449-1 assume !(0 == ~e_e~0); 29252#L454-1 assume !(0 == ~e_c~0); 29253#L459-1 assume !(0 == ~e_wl~0); 29163#L464-1 assume !(1 == ~wl_pc~0); 29164#$Ultimate##44 assume !(2 == ~wl_pc~0); 29159#L477 assume !(1 == ~c1_pc~0); 29146#L487 assume !(1 == ~c2_pc~0); 29148#L496 assume !(1 == ~wb_pc~0); 29389#L505 assume !(1 == ~e_c~0); 29388#L514-1 assume !(1 == ~e_e~0); 29387#L519-1 assume !(1 == ~e_f~0); 29220#L524-1 assume !(1 == ~e_g~0); 29221#L529-1 assume !(1 == ~e_c~0); 29085#L534-1 assume !(1 == ~e_wl~0); 29086#L676-1 assume !false; 30097#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 32746#L381 [2022-12-13 18:47:25,381 INFO L750 eck$LassoCheckResult]: Loop: 32746#L381 assume !false; 32786#L299 assume 0 == ~wl_st~0; 32770#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 32769#L325 assume !(0 != eval_~tmp~0#1); 32768#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 32634#L340 assume !(0 != eval_~tmp___0~0#1); 32767#L336 assume !(0 == ~c2_st~0); 32794#L351 assume !(0 == ~wb_st~0); 32787#L366 assume !(0 == ~r_st~0); 32746#L381 [2022-12-13 18:47:25,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:25,382 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2022-12-13 18:47:25,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:25,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429308786] [2022-12-13 18:47:25,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:25,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:25,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:47:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:25,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:47:25,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:25,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1058006530, now seen corresponding path program 1 times [2022-12-13 18:47:25,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:25,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618916110] [2022-12-13 18:47:25,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:25,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:25,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:47:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:25,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:47:25,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:25,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1659779318, now seen corresponding path program 1 times [2022-12-13 18:47:25,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:25,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420569583] [2022-12-13 18:47:25,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:25,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:25,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:25,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:25,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420569583] [2022-12-13 18:47:25,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420569583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:25,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:25,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:47:25,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288005969] [2022-12-13 18:47:25,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:25,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:47:25,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:47:25,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:47:25,449 INFO L87 Difference]: Start difference. First operand 4616 states and 7091 transitions. cyclomatic complexity: 2490 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) [2022-12-13 18:47:25,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:47:25,511 INFO L93 Difference]: Finished difference Result 7194 states and 10846 transitions. [2022-12-13 18:47:25,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7194 states and 10846 transitions. [2022-12-13 18:47:25,526 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 3096 [2022-12-13 18:47:25,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7194 states to 7194 states and 10846 transitions. [2022-12-13 18:47:25,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3210 [2022-12-13 18:47:25,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3210 [2022-12-13 18:47:25,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7194 states and 10846 transitions. [2022-12-13 18:47:25,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 18:47:25,547 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7194 states and 10846 transitions. [2022-12-13 18:47:25,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7194 states and 10846 transitions. [2022-12-13 18:47:25,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7194 to 7158. [2022-12-13 18:47:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7158 states, 7158 states have (on average 1.5101983794355964) internal successors, (10810), 7157 states have internal predecessors, (10810), 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) [2022-12-13 18:47:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7158 states to 7158 states and 10810 transitions. [2022-12-13 18:47:25,625 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7158 states and 10810 transitions. [2022-12-13 18:47:25,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:47:25,626 INFO L428 stractBuchiCegarLoop]: Abstraction has 7158 states and 10810 transitions. [2022-12-13 18:47:25,626 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-12-13 18:47:25,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7158 states and 10810 transitions. [2022-12-13 18:47:25,641 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 3080 [2022-12-13 18:47:25,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:47:25,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:47:25,641 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] [2022-12-13 18:47:25,641 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:47:25,641 INFO L748 eck$LassoCheckResult]: Stem: 40980#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 40981#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; 41039#L408 assume !(1 == ~c_req_up~0); 41148#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 41149#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 41201#L424-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 41202#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 41226#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 41222#L439-1 assume !(0 == ~e_f~0); 41223#L444-1 assume !(0 == ~e_g~0); 41218#L449-1 assume !(0 == ~e_e~0); 41219#L454-1 assume !(0 == ~e_c~0); 41186#L459-1 assume !(0 == ~e_wl~0); 41187#L464-1 assume !(1 == ~wl_pc~0); 41176#$Ultimate##44 assume !(2 == ~wl_pc~0); 41177#L477 assume !(1 == ~c1_pc~0); 41243#L487 assume !(1 == ~c2_pc~0); 41242#L496 assume !(1 == ~wb_pc~0); 41236#L505 assume !(1 == ~e_c~0); 41237#L514-1 assume !(1 == ~e_e~0); 41232#L519-1 assume !(1 == ~e_f~0); 41233#L524-1 assume !(1 == ~e_g~0); 41213#L529-1 assume !(1 == ~e_c~0); 40903#L534-1 assume !(1 == ~e_wl~0); 40904#L676-1 assume !false; 42072#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 44192#L381 [2022-12-13 18:47:25,642 INFO L750 eck$LassoCheckResult]: Loop: 44192#L381 assume !false; 47505#L299 assume 0 == ~wl_st~0; 47504#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 47502#L325 assume !(0 != eval_~tmp~0#1); 47503#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 47322#L340 assume !(0 != eval_~tmp___0~0#1); 47514#L336 assume !(0 == ~c2_st~0); 47512#L351 assume !(0 == ~wb_st~0); 47506#L366 assume !(0 == ~r_st~0); 44192#L381 [2022-12-13 18:47:25,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:25,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2022-12-13 18:47:25,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:25,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825432863] [2022-12-13 18:47:25,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:25,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:25,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:25,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825432863] [2022-12-13 18:47:25,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825432863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:25,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:25,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:47:25,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150069099] [2022-12-13 18:47:25,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:25,660 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 18:47:25,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:25,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1058006530, now seen corresponding path program 2 times [2022-12-13 18:47:25,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:25,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114071533] [2022-12-13 18:47:25,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:25,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:25,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:47:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:25,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:47:25,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:47:25,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:47:25,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:47:25,703 INFO L87 Difference]: Start difference. First operand 7158 states and 10810 transitions. cyclomatic complexity: 3667 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) [2022-12-13 18:47:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:47:25,737 INFO L93 Difference]: Finished difference Result 7106 states and 10723 transitions. [2022-12-13 18:47:25,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7106 states and 10723 transitions. [2022-12-13 18:47:25,769 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 3080 [2022-12-13 18:47:25,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7106 states to 7106 states and 10723 transitions. [2022-12-13 18:47:25,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3144 [2022-12-13 18:47:25,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3144 [2022-12-13 18:47:25,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7106 states and 10723 transitions. [2022-12-13 18:47:25,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 18:47:25,804 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7106 states and 10723 transitions. [2022-12-13 18:47:25,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7106 states and 10723 transitions. [2022-12-13 18:47:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7106 to 7106. [2022-12-13 18:47:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7106 states, 7106 states have (on average 1.5090064734027582) internal successors, (10723), 7105 states have internal predecessors, (10723), 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) [2022-12-13 18:47:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7106 states to 7106 states and 10723 transitions. [2022-12-13 18:47:25,884 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7106 states and 10723 transitions. [2022-12-13 18:47:25,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:47:25,884 INFO L428 stractBuchiCegarLoop]: Abstraction has 7106 states and 10723 transitions. [2022-12-13 18:47:25,884 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-12-13 18:47:25,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7106 states and 10723 transitions. [2022-12-13 18:47:25,898 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 3080 [2022-12-13 18:47:25,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:47:25,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:47:25,898 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] [2022-12-13 18:47:25,898 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:47:25,899 INFO L748 eck$LassoCheckResult]: Stem: 55251#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 55252#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; 55307#L408 assume !(1 == ~c_req_up~0); 55416#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 55417#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 55463#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 55464#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 55458#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 55459#L439-1 assume !(0 == ~e_f~0); 55179#L444-1 assume !(0 == ~e_g~0); 55180#L449-1 assume !(0 == ~e_e~0); 55345#L454-1 assume !(0 == ~e_c~0); 55346#L459-1 assume !(0 == ~e_wl~0); 55253#L464-1 assume !(1 == ~wl_pc~0); 55254#$Ultimate##44 assume !(2 == ~wl_pc~0); 55249#L477 assume !(1 == ~c1_pc~0); 55235#L487 assume !(1 == ~c2_pc~0); 55237#L496 assume !(1 == ~wb_pc~0); 55480#L505 assume !(1 == ~e_c~0); 55479#L514-1 assume !(1 == ~e_e~0); 55478#L519-1 assume !(1 == ~e_f~0); 55311#L524-1 assume !(1 == ~e_g~0); 55312#L529-1 assume !(1 == ~e_c~0); 55475#L534-1 assume !(1 == ~e_wl~0); 58782#L676-1 assume !false; 58783#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 60668#L381 [2022-12-13 18:47:25,899 INFO L750 eck$LassoCheckResult]: Loop: 60668#L381 assume !false; 60667#L299 assume 0 == ~wl_st~0; 60666#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 60662#L325 assume !(0 != eval_~tmp~0#1); 60660#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 60624#L340 assume !(0 != eval_~tmp___0~0#1); 60657#L336 assume 0 == ~c2_st~0;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 60635#L355 assume !(0 != eval_~tmp___1~0#1); 60656#L351 assume !(0 == ~wb_st~0); 60669#L366 assume !(0 == ~r_st~0); 60668#L381 [2022-12-13 18:47:25,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:25,899 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2022-12-13 18:47:25,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:25,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313101957] [2022-12-13 18:47:25,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:25,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:25,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:47:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:25,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:47:25,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:25,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1563186686, now seen corresponding path program 1 times [2022-12-13 18:47:25,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:25,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221711553] [2022-12-13 18:47:25,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:25,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:25,910 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:47:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:25,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:47:25,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:25,912 INFO L85 PathProgramCache]: Analyzing trace with hash 84797946, now seen corresponding path program 1 times [2022-12-13 18:47:25,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:25,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145348951] [2022-12-13 18:47:25,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:25,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:47:25,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:47:25,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:47:25,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145348951] [2022-12-13 18:47:25,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145348951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:47:25,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:47:25,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:47:25,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169818974] [2022-12-13 18:47:25,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:47:25,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:47:25,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:47:25,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:47:25,971 INFO L87 Difference]: Start difference. First operand 7106 states and 10723 transitions. cyclomatic complexity: 3632 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) [2022-12-13 18:47:26,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:47:26,034 INFO L93 Difference]: Finished difference Result 12263 states and 18336 transitions. [2022-12-13 18:47:26,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12263 states and 18336 transitions. [2022-12-13 18:47:26,079 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 5356 [2022-12-13 18:47:26,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12263 states to 12263 states and 18336 transitions. [2022-12-13 18:47:26,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5422 [2022-12-13 18:47:26,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5422 [2022-12-13 18:47:26,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12263 states and 18336 transitions. [2022-12-13 18:47:26,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 18:47:26,109 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12263 states and 18336 transitions. [2022-12-13 18:47:26,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12263 states and 18336 transitions. [2022-12-13 18:47:26,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12263 to 12263. [2022-12-13 18:47:26,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12263 states, 12263 states have (on average 1.4952295523118324) internal successors, (18336), 12262 states have internal predecessors, (18336), 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) [2022-12-13 18:47:26,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12263 states to 12263 states and 18336 transitions. [2022-12-13 18:47:26,250 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12263 states and 18336 transitions. [2022-12-13 18:47:26,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:47:26,251 INFO L428 stractBuchiCegarLoop]: Abstraction has 12263 states and 18336 transitions. [2022-12-13 18:47:26,251 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-12-13 18:47:26,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12263 states and 18336 transitions. [2022-12-13 18:47:26,269 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 5356 [2022-12-13 18:47:26,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 18:47:26,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 18:47:26,270 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] [2022-12-13 18:47:26,270 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:47:26,270 INFO L748 eck$LassoCheckResult]: Stem: 74623#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 74624#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; 74681#L408 assume !(1 == ~c_req_up~0); 74797#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 74798#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 74852#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 74853#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 74843#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 74844#L439-1 assume !(0 == ~e_f~0); 74556#L444-1 assume !(0 == ~e_g~0); 74557#L449-1 assume !(0 == ~e_e~0); 74721#L454-1 assume !(0 == ~e_c~0); 74722#L459-1 assume !(0 == ~e_wl~0); 74625#L464-1 assume !(1 == ~wl_pc~0); 74626#$Ultimate##44 assume !(2 == ~wl_pc~0); 74621#L477 assume !(1 == ~c1_pc~0); 74610#L487 assume !(1 == ~c2_pc~0); 74612#L496 assume !(1 == ~wb_pc~0); 74869#L505 assume !(1 == ~e_c~0); 74868#L514-1 assume !(1 == ~e_e~0); 74867#L519-1 assume !(1 == ~e_f~0); 74685#L524-1 assume !(1 == ~e_g~0); 74686#L529-1 assume !(1 == ~e_c~0); 74864#L534-1 assume !(1 == ~e_wl~0); 80799#L676-1 assume !false; 80800#L546 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 82989#L381 [2022-12-13 18:47:26,270 INFO L750 eck$LassoCheckResult]: Loop: 82989#L381 assume !false; 82988#L299 assume 0 == ~wl_st~0; 82987#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0#1 := eval_#t~nondet4#1;havoc eval_#t~nondet4#1; 82986#L325 assume !(0 != eval_~tmp~0#1); 82984#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 82957#L340 assume !(0 != eval_~tmp___0~0#1); 74792#L336 assume 0 == ~c2_st~0;eval_~tmp___1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 74652#L355 assume !(0 != eval_~tmp___1~0#1); 74654#L351 assume 0 == ~wb_st~0;eval_~tmp___2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 82995#L370 assume !(0 != eval_~tmp___2~0#1); 82991#L366 assume !(0 == ~r_st~0); 82989#L381 [2022-12-13 18:47:26,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:26,270 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2022-12-13 18:47:26,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:26,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705804743] [2022-12-13 18:47:26,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:26,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:26,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:47:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:26,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:47:26,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:26,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1214182410, now seen corresponding path program 1 times [2022-12-13 18:47:26,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:26,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979853466] [2022-12-13 18:47:26,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:26,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:26,281 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:47:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:26,283 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:47:26,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:47:26,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1666266370, now seen corresponding path program 1 times [2022-12-13 18:47:26,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:47:26,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815150182] [2022-12-13 18:47:26,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:47:26,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:47:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:26,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:47:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:26,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:47:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:26,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:47:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:47:27,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.12 06:47:27 BoogieIcfgContainer [2022-12-13 18:47:27,067 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-12-13 18:47:27,067 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 18:47:27,067 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 18:47:27,068 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 18:47:27,068 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:47:20" (3/4) ... [2022-12-13 18:47:27,070 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-12-13 18:47:27,114 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 18:47:27,114 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 18:47:27,115 INFO L158 Benchmark]: Toolchain (without parser) took 7251.47ms. Allocated memory was 153.1MB in the beginning and 285.2MB in the end (delta: 132.1MB). Free memory was 120.1MB in the beginning and 151.5MB in the end (delta: -31.4MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. [2022-12-13 18:47:27,115 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 153.1MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:47:27,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.49ms. Allocated memory is still 153.1MB. Free memory was 120.1MB in the beginning and 105.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 18:47:27,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.85ms. Allocated memory is still 153.1MB. Free memory was 105.4MB in the beginning and 103.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:47:27,116 INFO L158 Benchmark]: Boogie Preprocessor took 21.21ms. Allocated memory is still 153.1MB. Free memory was 103.1MB in the beginning and 101.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:47:27,116 INFO L158 Benchmark]: RCFGBuilder took 444.05ms. Allocated memory is still 153.1MB. Free memory was 100.5MB in the beginning and 78.6MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-13 18:47:27,117 INFO L158 Benchmark]: BuchiAutomizer took 6488.99ms. Allocated memory was 153.1MB in the beginning and 285.2MB in the end (delta: 132.1MB). Free memory was 78.1MB in the beginning and 156.8MB in the end (delta: -78.7MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2022-12-13 18:47:27,117 INFO L158 Benchmark]: Witness Printer took 47.01ms. Allocated memory is still 285.2MB. Free memory was 156.8MB in the beginning and 151.5MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 18:47:27,118 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 153.1MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.49ms. Allocated memory is still 153.1MB. Free memory was 120.1MB in the beginning and 105.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.85ms. Allocated memory is still 153.1MB. Free memory was 105.4MB in the beginning and 103.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.21ms. Allocated memory is still 153.1MB. Free memory was 103.1MB in the beginning and 101.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 444.05ms. Allocated memory is still 153.1MB. Free memory was 100.5MB in the beginning and 78.6MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 6488.99ms. Allocated memory was 153.1MB in the beginning and 285.2MB in the end (delta: 132.1MB). Free memory was 78.1MB in the beginning and 156.8MB in the end (delta: -78.7MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. * Witness Printer took 47.01ms. Allocated memory is still 285.2MB. Free memory was 156.8MB in the beginning and 151.5MB in the end (delta: 5.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 18 terminating modules (15 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_e + 1 and consists of 3 locations. 15 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 12263 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 16 iterations. TraceHistogramMax:1. Analysis of lassos took 4.2s. Construction of modules took 0.2s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 13. Automata minimization 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 1339 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.3s 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, 3829 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3826 mSDsluCounter, 7050 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2605 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 305 IncrementalHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 4445 mSDtfsCounter, 305 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc3 concLT1 SILN1 SILU0 SILI6 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq182 hnf98 smp100 dnf190 smp75 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 298]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c=0, c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L714] CALL start_simulation() [L404] int kernel_st ; [L407] kernel_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L408] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L419] COND TRUE (int )wl_i == 1 [L420] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L424] COND TRUE (int )c1_i == 1 [L425] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L429] COND TRUE (int )c2_i == 1 [L430] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L434] COND TRUE (int )wb_i == 1 [L435] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L439] COND FALSE !((int )r_i == 1) [L442] r_st = 2 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L444] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L449] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L454] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L459] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L464] COND FALSE !((int )e_wl == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L469] COND FALSE !((int )wl_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L477] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L487] COND FALSE !((int )c1_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L496] COND FALSE !((int )c2_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L505] COND FALSE !((int )wb_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L514] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L519] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L524] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L529] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L534] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L539] COND FALSE !((int )e_wl == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L545] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L548] kernel_st = 1 [L549] CALL eval() [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L298] COND TRUE 1 [L300] COND TRUE (int )wl_st == 0 [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND FALSE !(\read(tmp)) [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND FALSE !(\read(tmp___0)) [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND FALSE !(\read(tmp___1)) [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND FALSE !(\read(tmp___2)) [L381] COND FALSE !((int )r_st == 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 298]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; VAL [c=0, c1_i=0, c1_pc=0, c1_st=0, c2_i=0, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=0, e_e=0, e_f=0, e_g=0, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=0, wb_pc=0, wb_st=0, wl_i=0, wl_pc=0, wl_st=0] [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L714] CALL start_simulation() [L404] int kernel_st ; [L407] kernel_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L408] COND FALSE !((int )c_req_up == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L419] COND TRUE (int )wl_i == 1 [L420] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L424] COND TRUE (int )c1_i == 1 [L425] c1_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L429] COND TRUE (int )c2_i == 1 [L430] c2_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L434] COND TRUE (int )wb_i == 1 [L435] wb_st = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L439] COND FALSE !((int )r_i == 1) [L442] r_st = 2 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L444] COND FALSE !((int )e_f == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L449] COND FALSE !((int )e_g == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L454] COND FALSE !((int )e_e == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L459] COND FALSE !((int )e_c == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L464] COND FALSE !((int )e_wl == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L469] COND FALSE !((int )wl_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L477] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L487] COND FALSE !((int )c1_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L496] COND FALSE !((int )c2_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L505] COND FALSE !((int )wb_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L514] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L519] COND FALSE !((int )e_e == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L524] COND FALSE !((int )e_f == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L529] COND FALSE !((int )e_g == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L534] COND FALSE !((int )e_c == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L539] COND FALSE !((int )e_wl == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L545] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, kernel_st=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L548] kernel_st = 1 [L549] CALL eval() [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] Loop: [L298] COND TRUE 1 [L300] COND TRUE (int )wl_st == 0 [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND FALSE !(\read(tmp)) [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND FALSE !(\read(tmp___0)) [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND FALSE !(\read(tmp___1)) [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND FALSE !(\read(tmp___2)) [L381] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-12-13 18:47:27,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fddbe93b-8213-4174-8e5b-dadcfa52d2aa/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)