./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc 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_02e49522-7a1a-4432-b22b-32d3ffec49b0/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02e49522-7a1a-4432-b22b-32d3ffec49b0/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02e49522-7a1a-4432-b22b-32d3ffec49b0/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02e49522-7a1a-4432-b22b-32d3ffec49b0/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_8.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02e49522-7a1a-4432-b22b-32d3ffec49b0/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02e49522-7a1a-4432-b22b-32d3ffec49b0/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:54:14,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:54:14,948 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02e49522-7a1a-4432-b22b-32d3ffec49b0/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-26 11:54:14,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:54:14,957 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:54:14,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:54:14,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:54:14,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:54:14,997 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:54:15,002 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:54:15,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:54:15,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:54:15,005 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:54:15,007 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-26 11:54:15,008 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-26 11:54:15,008 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-26 11:54:15,009 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-26 11:54:15,011 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-26 11:54:15,011 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-26 11:54:15,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:54:15,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-26 11:54:15,013 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:54:15,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:54:15,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:54:15,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:54:15,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-26 11:54:15,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-26 11:54:15,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-26 11:54:15,016 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:54:15,017 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:54:15,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:54:15,019 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-26 11:54:15,019 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:54:15,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:54:15,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:54:15,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:54:15,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:54:15,021 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-26 11:54:15,021 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02e49522-7a1a-4432-b22b-32d3ffec49b0/bin/uautomizer-verify-VRDe98Ueme/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_02e49522-7a1a-4432-b22b-32d3ffec49b0/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 [2023-11-26 11:54:15,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:54:15,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:54:15,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:54:15,398 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:54:15,400 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:54:15,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02e49522-7a1a-4432-b22b-32d3ffec49b0/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/locks/test_locks_8.c [2023-11-26 11:54:18,592 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:54:18,782 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:54:18,782 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02e49522-7a1a-4432-b22b-32d3ffec49b0/sv-benchmarks/c/locks/test_locks_8.c [2023-11-26 11:54:18,791 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02e49522-7a1a-4432-b22b-32d3ffec49b0/bin/uautomizer-verify-VRDe98Ueme/data/9ab8da561/79ef7a3b0b94439294d9409beb2c2528/FLAG5c0d8e48d [2023-11-26 11:54:18,807 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02e49522-7a1a-4432-b22b-32d3ffec49b0/bin/uautomizer-verify-VRDe98Ueme/data/9ab8da561/79ef7a3b0b94439294d9409beb2c2528 [2023-11-26 11:54:18,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:54:18,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:54:18,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:54:18,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:54:18,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:54:18,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:54:18" (1/1) ... [2023-11-26 11:54:18,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474198dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:18, skipping insertion in model container [2023-11-26 11:54:18,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:54:18" (1/1) ... [2023-11-26 11:54:18,861 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:54:19,028 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:54:19,039 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:54:19,063 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:54:19,078 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:54:19,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:19 WrapperNode [2023-11-26 11:54:19,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:54:19,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:54:19,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:54:19,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:54:19,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:19" (1/1) ... [2023-11-26 11:54:19,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:19" (1/1) ... [2023-11-26 11:54:19,117 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 116 [2023-11-26 11:54:19,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:54:19,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:54:19,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:54:19,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:54:19,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:19" (1/1) ... [2023-11-26 11:54:19,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:19" (1/1) ... [2023-11-26 11:54:19,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:19" (1/1) ... [2023-11-26 11:54:19,146 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-26 11:54:19,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:19" (1/1) ... [2023-11-26 11:54:19,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:19" (1/1) ... [2023-11-26 11:54:19,151 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:19" (1/1) ... [2023-11-26 11:54:19,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:19" (1/1) ... [2023-11-26 11:54:19,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:19" (1/1) ... [2023-11-26 11:54:19,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:19" (1/1) ... [2023-11-26 11:54:19,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:54:19,163 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:54:19,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:54:19,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:54:19,169 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:19" (1/1) ... [2023-11-26 11:54:19,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:54:19,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02e49522-7a1a-4432-b22b-32d3ffec49b0/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:54:19,219 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02e49522-7a1a-4432-b22b-32d3ffec49b0/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:54:19,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02e49522-7a1a-4432-b22b-32d3ffec49b0/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-26 11:54:19,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:54:19,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:54:19,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:54:19,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:54:19,359 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:54:19,361 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:54:19,620 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:54:19,630 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:54:19,631 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:54:19,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:54:19 BoogieIcfgContainer [2023-11-26 11:54:19,633 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:54:19,634 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-26 11:54:19,634 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-26 11:54:19,638 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-26 11:54:19,639 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 11:54:19,640 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.11 11:54:18" (1/3) ... [2023-11-26 11:54:19,641 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67d56ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 11:54:19, skipping insertion in model container [2023-11-26 11:54:19,641 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 11:54:19,641 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:54:19" (2/3) ... [2023-11-26 11:54:19,642 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@67d56ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 11:54:19, skipping insertion in model container [2023-11-26 11:54:19,642 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 11:54:19,642 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:54:19" (3/3) ... [2023-11-26 11:54:19,644 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_8.c [2023-11-26 11:54:19,708 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-26 11:54:19,708 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-26 11:54:19,709 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-26 11:54:19,709 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-26 11:54:19,709 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-26 11:54:19,709 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-26 11:54:19,709 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-26 11:54:19,710 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-26 11:54:19,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:19,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2023-11-26 11:54:19,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:54:19,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:54:19,739 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 11:54:19,739 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:19,739 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-26 11:54:19,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:19,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2023-11-26 11:54:19,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:54:19,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:54:19,744 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 11:54:19,744 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:19,751 INFO L748 eck$LassoCheckResult]: Stem: 32#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 19#L127-1true [2023-11-26 11:54:19,752 INFO L750 eck$LassoCheckResult]: Loop: 19#L127-1true assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 27#L37true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 6#L58true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 13#L58-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 15#L62-1true assume !(0 != main_~p3~0#1); 28#L66-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 30#L70-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 33#L74-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 24#L78-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 10#L82-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 8#L86-1true assume !(0 != main_~p1~0#1); 5#L92-1true assume !(0 != main_~p2~0#1); 16#L97-1true assume !(0 != main_~p3~0#1); 21#L102-1true assume !(0 != main_~p4~0#1); 18#L107-1true assume !(0 != main_~p5~0#1); 34#L112-1true assume !(0 != main_~p6~0#1); 31#L117-1true assume !(0 != main_~p7~0#1); 11#L122-1true assume !(0 != main_~p8~0#1); 19#L127-1true [2023-11-26 11:54:19,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:19,758 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-26 11:54:19,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:19,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935670790] [2023-11-26 11:54:19,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:19,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:19,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:54:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:19,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:54:19,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:19,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1098697512, now seen corresponding path program 1 times [2023-11-26 11:54:19,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:19,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303885970] [2023-11-26 11:54:19,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:19,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:54:20,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:20,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303885970] [2023-11-26 11:54:20,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303885970] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:20,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:20,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:54:20,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131201798] [2023-11-26 11:54:20,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:20,119 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:54:20,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:20,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:20,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:20,167 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 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 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:20,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:54:20,239 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2023-11-26 11:54:20,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 105 transitions. [2023-11-26 11:54:20,243 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2023-11-26 11:54:20,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 53 states and 83 transitions. [2023-11-26 11:54:20,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2023-11-26 11:54:20,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2023-11-26 11:54:20,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 83 transitions. [2023-11-26 11:54:20,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:20,258 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 83 transitions. [2023-11-26 11:54:20,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 83 transitions. [2023-11-26 11:54:20,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-26 11:54:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 52 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2023-11-26 11:54:20,302 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 83 transitions. [2023-11-26 11:54:20,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:20,312 INFO L428 stractBuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2023-11-26 11:54:20,313 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-26 11:54:20,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2023-11-26 11:54:20,318 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2023-11-26 11:54:20,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:54:20,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:54:20,320 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 11:54:20,321 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:20,322 INFO L748 eck$LassoCheckResult]: Stem: 136#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 111#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 112#L127-1 [2023-11-26 11:54:20,322 INFO L750 eck$LassoCheckResult]: Loop: 112#L127-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 139#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 137#L58 assume !(0 != main_~p1~0#1); 138#L58-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 156#L62-1 assume !(0 != main_~p3~0#1); 155#L66-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 154#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 153#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 152#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 151#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 150#L86-1 assume !(0 != main_~p1~0#1); 108#L92-1 assume !(0 != main_~p2~0#1); 107#L97-1 assume !(0 != main_~p3~0#1); 122#L102-1 assume !(0 != main_~p4~0#1); 127#L107-1 assume !(0 != main_~p5~0#1); 142#L112-1 assume !(0 != main_~p6~0#1); 135#L117-1 assume !(0 != main_~p7~0#1); 129#L122-1 assume !(0 != main_~p8~0#1); 112#L127-1 [2023-11-26 11:54:20,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:20,325 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-11-26 11:54:20,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:20,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024652991] [2023-11-26 11:54:20,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:20,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:20,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:54:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:20,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:54:20,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:20,355 INFO L85 PathProgramCache]: Analyzing trace with hash 77629158, now seen corresponding path program 1 times [2023-11-26 11:54:20,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:20,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739733235] [2023-11-26 11:54:20,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:20,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:54:20,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:20,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739733235] [2023-11-26 11:54:20,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739733235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:20,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:20,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:54:20,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114936275] [2023-11-26 11:54:20,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:20,414 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:54:20,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:20,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:20,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:20,415 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:20,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:54:20,433 INFO L93 Difference]: Finished difference Result 102 states and 158 transitions. [2023-11-26 11:54:20,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 158 transitions. [2023-11-26 11:54:20,437 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2023-11-26 11:54:20,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 158 transitions. [2023-11-26 11:54:20,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2023-11-26 11:54:20,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2023-11-26 11:54:20,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 158 transitions. [2023-11-26 11:54:20,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:20,440 INFO L218 hiAutomatonCegarLoop]: Abstraction has 102 states and 158 transitions. [2023-11-26 11:54:20,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 158 transitions. [2023-11-26 11:54:20,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-26 11:54:20,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.5490196078431373) internal successors, (158), 101 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 158 transitions. [2023-11-26 11:54:20,451 INFO L240 hiAutomatonCegarLoop]: Abstraction has 102 states and 158 transitions. [2023-11-26 11:54:20,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:20,452 INFO L428 stractBuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2023-11-26 11:54:20,453 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-26 11:54:20,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 158 transitions. [2023-11-26 11:54:20,455 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2023-11-26 11:54:20,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:54:20,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:54:20,456 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 11:54:20,456 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:20,456 INFO L748 eck$LassoCheckResult]: Stem: 299#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 272#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 273#L127-1 [2023-11-26 11:54:20,457 INFO L750 eck$LassoCheckResult]: Loop: 273#L127-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 321#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 319#L58 assume !(0 != main_~p1~0#1); 316#L58-2 assume !(0 != main_~p2~0#1); 314#L62-1 assume !(0 != main_~p3~0#1); 312#L66-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 310#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 308#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 306#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 304#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 303#L86-1 assume !(0 != main_~p1~0#1); 300#L92-1 assume !(0 != main_~p2~0#1); 301#L97-1 assume !(0 != main_~p3~0#1); 343#L102-1 assume !(0 != main_~p4~0#1); 337#L107-1 assume !(0 != main_~p5~0#1); 332#L112-1 assume !(0 != main_~p6~0#1); 329#L117-1 assume !(0 != main_~p7~0#1); 325#L122-1 assume !(0 != main_~p8~0#1); 273#L127-1 [2023-11-26 11:54:20,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:20,457 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-11-26 11:54:20,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:20,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236132534] [2023-11-26 11:54:20,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:20,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:20,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:54:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:20,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:54:20,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:20,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1202234520, now seen corresponding path program 1 times [2023-11-26 11:54:20,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:20,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646524403] [2023-11-26 11:54:20,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:20,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:20,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:54:20,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:20,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646524403] [2023-11-26 11:54:20,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646524403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:20,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:20,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:54:20,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928090069] [2023-11-26 11:54:20,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:20,562 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:54:20,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:20,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:20,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:20,563 INFO L87 Difference]: Start difference. First operand 102 states and 158 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:54:20,590 INFO L93 Difference]: Finished difference Result 198 states and 302 transitions. [2023-11-26 11:54:20,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 302 transitions. [2023-11-26 11:54:20,594 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2023-11-26 11:54:20,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 198 states and 302 transitions. [2023-11-26 11:54:20,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2023-11-26 11:54:20,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2023-11-26 11:54:20,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 302 transitions. [2023-11-26 11:54:20,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:20,600 INFO L218 hiAutomatonCegarLoop]: Abstraction has 198 states and 302 transitions. [2023-11-26 11:54:20,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 302 transitions. [2023-11-26 11:54:20,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2023-11-26 11:54:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 198 states have (on average 1.5252525252525253) internal successors, (302), 197 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 302 transitions. [2023-11-26 11:54:20,643 INFO L240 hiAutomatonCegarLoop]: Abstraction has 198 states and 302 transitions. [2023-11-26 11:54:20,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:20,645 INFO L428 stractBuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2023-11-26 11:54:20,645 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-26 11:54:20,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 302 transitions. [2023-11-26 11:54:20,648 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2023-11-26 11:54:20,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:54:20,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:54:20,648 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 11:54:20,649 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:20,649 INFO L748 eck$LassoCheckResult]: Stem: 605#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 578#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 579#L127-1 [2023-11-26 11:54:20,649 INFO L750 eck$LassoCheckResult]: Loop: 579#L127-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 667#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 665#L58 assume !(0 != main_~p1~0#1); 666#L58-2 assume !(0 != main_~p2~0#1); 718#L62-1 assume !(0 != main_~p3~0#1); 706#L66-1 assume !(0 != main_~p4~0#1); 707#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 716#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 705#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 702#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 692#L86-1 assume !(0 != main_~p1~0#1); 687#L92-1 assume !(0 != main_~p2~0#1); 685#L97-1 assume !(0 != main_~p3~0#1); 680#L102-1 assume !(0 != main_~p4~0#1); 677#L107-1 assume !(0 != main_~p5~0#1); 673#L112-1 assume !(0 != main_~p6~0#1); 671#L117-1 assume !(0 != main_~p7~0#1); 669#L122-1 assume !(0 != main_~p8~0#1); 579#L127-1 [2023-11-26 11:54:20,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:20,650 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2023-11-26 11:54:20,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:20,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876008734] [2023-11-26 11:54:20,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:20,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:20,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:54:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:20,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:54:20,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:20,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1789040534, now seen corresponding path program 1 times [2023-11-26 11:54:20,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:20,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135401127] [2023-11-26 11:54:20,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:20,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:54:20,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:20,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135401127] [2023-11-26 11:54:20,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135401127] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:20,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:20,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:54:20,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025587772] [2023-11-26 11:54:20,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:20,705 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:54:20,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:20,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:20,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:20,706 INFO L87 Difference]: Start difference. First operand 198 states and 302 transitions. cyclomatic complexity: 112 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:20,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:54:20,733 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2023-11-26 11:54:20,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 578 transitions. [2023-11-26 11:54:20,738 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2023-11-26 11:54:20,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 386 states and 578 transitions. [2023-11-26 11:54:20,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2023-11-26 11:54:20,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2023-11-26 11:54:20,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 578 transitions. [2023-11-26 11:54:20,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:20,746 INFO L218 hiAutomatonCegarLoop]: Abstraction has 386 states and 578 transitions. [2023-11-26 11:54:20,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 578 transitions. [2023-11-26 11:54:20,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2023-11-26 11:54:20,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 386 states have (on average 1.4974093264248705) internal successors, (578), 385 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:20,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 578 transitions. [2023-11-26 11:54:20,790 INFO L240 hiAutomatonCegarLoop]: Abstraction has 386 states and 578 transitions. [2023-11-26 11:54:20,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:20,795 INFO L428 stractBuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2023-11-26 11:54:20,795 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-26 11:54:20,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 578 transitions. [2023-11-26 11:54:20,798 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2023-11-26 11:54:20,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:54:20,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:54:20,802 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 11:54:20,803 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:20,803 INFO L748 eck$LassoCheckResult]: Stem: 1198#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 1169#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 1170#L127-1 [2023-11-26 11:54:20,803 INFO L750 eck$LassoCheckResult]: Loop: 1170#L127-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 1274#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 1259#L58 assume !(0 != main_~p1~0#1); 1261#L58-2 assume !(0 != main_~p2~0#1); 1239#L62-1 assume !(0 != main_~p3~0#1); 1240#L66-1 assume !(0 != main_~p4~0#1); 1351#L70-1 assume !(0 != main_~p5~0#1); 1343#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1344#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1335#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1336#L86-1 assume !(0 != main_~p1~0#1); 1369#L92-1 assume !(0 != main_~p2~0#1); 1367#L97-1 assume !(0 != main_~p3~0#1); 1365#L102-1 assume !(0 != main_~p4~0#1); 1363#L107-1 assume !(0 != main_~p5~0#1); 1360#L112-1 assume !(0 != main_~p6~0#1); 1358#L117-1 assume !(0 != main_~p7~0#1); 1355#L122-1 assume !(0 != main_~p8~0#1); 1170#L127-1 [2023-11-26 11:54:20,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:20,804 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2023-11-26 11:54:20,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:20,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898683488] [2023-11-26 11:54:20,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:20,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:20,810 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:54:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:20,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:54:20,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:20,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1530875096, now seen corresponding path program 1 times [2023-11-26 11:54:20,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:20,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435901902] [2023-11-26 11:54:20,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:20,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:54:20,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:20,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435901902] [2023-11-26 11:54:20,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435901902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:20,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:20,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:54:20,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947986507] [2023-11-26 11:54:20,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:20,887 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:54:20,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:20,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:20,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:20,888 INFO L87 Difference]: Start difference. First operand 386 states and 578 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:20,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:54:20,904 INFO L93 Difference]: Finished difference Result 754 states and 1106 transitions. [2023-11-26 11:54:20,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 1106 transitions. [2023-11-26 11:54:20,915 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2023-11-26 11:54:20,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 754 states and 1106 transitions. [2023-11-26 11:54:20,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 754 [2023-11-26 11:54:20,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 754 [2023-11-26 11:54:20,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 754 states and 1106 transitions. [2023-11-26 11:54:20,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:20,925 INFO L218 hiAutomatonCegarLoop]: Abstraction has 754 states and 1106 transitions. [2023-11-26 11:54:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states and 1106 transitions. [2023-11-26 11:54:20,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2023-11-26 11:54:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 754 states have (on average 1.46684350132626) internal successors, (1106), 753 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1106 transitions. [2023-11-26 11:54:20,949 INFO L240 hiAutomatonCegarLoop]: Abstraction has 754 states and 1106 transitions. [2023-11-26 11:54:20,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:20,952 INFO L428 stractBuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2023-11-26 11:54:20,952 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-26 11:54:20,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 754 states and 1106 transitions. [2023-11-26 11:54:20,959 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2023-11-26 11:54:20,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:54:20,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:54:20,961 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 11:54:20,961 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:20,961 INFO L748 eck$LassoCheckResult]: Stem: 2345#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 2315#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 2316#L127-1 [2023-11-26 11:54:20,961 INFO L750 eck$LassoCheckResult]: Loop: 2316#L127-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 2408#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 2404#L58 assume !(0 != main_~p1~0#1); 2402#L58-2 assume !(0 != main_~p2~0#1); 2400#L62-1 assume !(0 != main_~p3~0#1); 2396#L66-1 assume !(0 != main_~p4~0#1); 2392#L70-1 assume !(0 != main_~p5~0#1); 2388#L74-1 assume !(0 != main_~p6~0#1); 2386#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2384#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2380#L86-1 assume !(0 != main_~p1~0#1); 2378#L92-1 assume !(0 != main_~p2~0#1); 2370#L97-1 assume !(0 != main_~p3~0#1); 2371#L102-1 assume !(0 != main_~p4~0#1); 2423#L107-1 assume !(0 != main_~p5~0#1); 2419#L112-1 assume !(0 != main_~p6~0#1); 2416#L117-1 assume !(0 != main_~p7~0#1); 2412#L122-1 assume !(0 != main_~p8~0#1); 2316#L127-1 [2023-11-26 11:54:20,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:20,962 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2023-11-26 11:54:20,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:20,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121944369] [2023-11-26 11:54:20,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:20,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:20,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:54:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:20,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:54:20,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:20,987 INFO L85 PathProgramCache]: Analyzing trace with hash -829810518, now seen corresponding path program 1 times [2023-11-26 11:54:20,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:20,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233422904] [2023-11-26 11:54:20,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:20,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:54:21,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:21,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233422904] [2023-11-26 11:54:21,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233422904] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:21,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:21,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:54:21,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725613210] [2023-11-26 11:54:21,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:21,024 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:54:21,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:21,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:21,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:21,025 INFO L87 Difference]: Start difference. First operand 754 states and 1106 transitions. cyclomatic complexity: 384 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:21,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:54:21,045 INFO L93 Difference]: Finished difference Result 1474 states and 2114 transitions. [2023-11-26 11:54:21,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1474 states and 2114 transitions. [2023-11-26 11:54:21,081 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2023-11-26 11:54:21,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1474 states to 1474 states and 2114 transitions. [2023-11-26 11:54:21,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1474 [2023-11-26 11:54:21,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1474 [2023-11-26 11:54:21,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1474 states and 2114 transitions. [2023-11-26 11:54:21,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:21,099 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2023-11-26 11:54:21,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states and 2114 transitions. [2023-11-26 11:54:21,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2023-11-26 11:54:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1474 states have (on average 1.4341926729986432) internal successors, (2114), 1473 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2114 transitions. [2023-11-26 11:54:21,138 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2023-11-26 11:54:21,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:21,139 INFO L428 stractBuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2023-11-26 11:54:21,140 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-26 11:54:21,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1474 states and 2114 transitions. [2023-11-26 11:54:21,150 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2023-11-26 11:54:21,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:54:21,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:54:21,151 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 11:54:21,151 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:21,151 INFO L748 eck$LassoCheckResult]: Stem: 4577#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 4547#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 4548#L127-1 [2023-11-26 11:54:21,152 INFO L750 eck$LassoCheckResult]: Loop: 4548#L127-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 4854#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 4851#L58 assume !(0 != main_~p1~0#1); 4852#L58-2 assume !(0 != main_~p2~0#1); 4823#L62-1 assume !(0 != main_~p3~0#1); 4824#L66-1 assume !(0 != main_~p4~0#1); 4897#L70-1 assume !(0 != main_~p5~0#1); 4895#L74-1 assume !(0 != main_~p6~0#1); 4891#L78-1 assume !(0 != main_~p7~0#1); 4885#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4882#L86-1 assume !(0 != main_~p1~0#1); 4878#L92-1 assume !(0 != main_~p2~0#1); 4876#L97-1 assume !(0 != main_~p3~0#1); 4870#L102-1 assume !(0 != main_~p4~0#1); 4869#L107-1 assume !(0 != main_~p5~0#1); 4866#L112-1 assume !(0 != main_~p6~0#1); 4862#L117-1 assume !(0 != main_~p7~0#1); 4859#L122-1 assume !(0 != main_~p8~0#1); 4548#L127-1 [2023-11-26 11:54:21,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:21,152 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2023-11-26 11:54:21,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:21,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542662269] [2023-11-26 11:54:21,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:21,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:21,162 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:54:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:21,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:54:21,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:21,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1222837528, now seen corresponding path program 1 times [2023-11-26 11:54:21,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:21,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510526036] [2023-11-26 11:54:21,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:21,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:54:21,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:54:21,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:54:21,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510526036] [2023-11-26 11:54:21,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510526036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:54:21,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:54:21,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:54:21,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248330534] [2023-11-26 11:54:21,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:54:21,205 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:54:21,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:54:21,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:54:21,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:54:21,206 INFO L87 Difference]: Start difference. First operand 1474 states and 2114 transitions. cyclomatic complexity: 704 Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:54:21,235 INFO L93 Difference]: Finished difference Result 2882 states and 4034 transitions. [2023-11-26 11:54:21,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2882 states and 4034 transitions. [2023-11-26 11:54:21,261 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2023-11-26 11:54:21,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2882 states to 2882 states and 4034 transitions. [2023-11-26 11:54:21,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2882 [2023-11-26 11:54:21,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2882 [2023-11-26 11:54:21,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2882 states and 4034 transitions. [2023-11-26 11:54:21,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:54:21,321 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2023-11-26 11:54:21,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states and 4034 transitions. [2023-11-26 11:54:21,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2023-11-26 11:54:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2882 states, 2882 states have (on average 1.3997224149895906) internal successors, (4034), 2881 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:54:21,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 4034 transitions. [2023-11-26 11:54:21,403 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2023-11-26 11:54:21,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:54:21,404 INFO L428 stractBuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2023-11-26 11:54:21,404 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-26 11:54:21,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2882 states and 4034 transitions. [2023-11-26 11:54:21,426 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2023-11-26 11:54:21,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:54:21,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:54:21,427 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 11:54:21,427 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:54:21,427 INFO L748 eck$LassoCheckResult]: Stem: 8945#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 8909#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 8910#L127-1 [2023-11-26 11:54:21,427 INFO L750 eck$LassoCheckResult]: Loop: 8910#L127-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 9083#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 9080#L58 assume !(0 != main_~p1~0#1); 9077#L58-2 assume !(0 != main_~p2~0#1); 9071#L62-1 assume !(0 != main_~p3~0#1); 9072#L66-1 assume !(0 != main_~p4~0#1); 9134#L70-1 assume !(0 != main_~p5~0#1); 9128#L74-1 assume !(0 != main_~p6~0#1); 9122#L78-1 assume !(0 != main_~p7~0#1); 9115#L82-1 assume !(0 != main_~p8~0#1); 9108#L86-1 assume !(0 != main_~p1~0#1); 9107#L92-1 assume !(0 != main_~p2~0#1); 9104#L97-1 assume !(0 != main_~p3~0#1); 9101#L102-1 assume !(0 != main_~p4~0#1); 9099#L107-1 assume !(0 != main_~p5~0#1); 9095#L112-1 assume !(0 != main_~p6~0#1); 9091#L117-1 assume !(0 != main_~p7~0#1); 9087#L122-1 assume !(0 != main_~p8~0#1); 8910#L127-1 [2023-11-26 11:54:21,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:21,428 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2023-11-26 11:54:21,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:21,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872532658] [2023-11-26 11:54:21,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:21,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:21,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:54:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:21,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:54:21,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:21,441 INFO L85 PathProgramCache]: Analyzing trace with hash -542779158, now seen corresponding path program 1 times [2023-11-26 11:54:21,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:21,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366517969] [2023-11-26 11:54:21,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:21,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:21,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:54:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:21,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:54:21,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:54:21,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1175900116, now seen corresponding path program 1 times [2023-11-26 11:54:21,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:54:21,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674183054] [2023-11-26 11:54:21,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:54:21,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:54:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:21,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:54:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:21,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:54:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:21,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:54:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:54:21,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.11 11:54:21 BoogieIcfgContainer [2023-11-26 11:54:21,896 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-26 11:54:21,896 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:54:21,897 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:54:21,897 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:54:21,897 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:54:19" (3/4) ... [2023-11-26 11:54:21,899 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-26 11:54:21,950 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02e49522-7a1a-4432-b22b-32d3ffec49b0/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 11:54:21,953 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:54:21,954 INFO L158 Benchmark]: Toolchain (without parser) took 3142.22ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 94.1MB in the beginning and 63.6MB in the end (delta: 30.5MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. [2023-11-26 11:54:21,954 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 96.5MB. Free memory was 69.8MB in the beginning and 69.8MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:54:21,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.62ms. Allocated memory is still 134.2MB. Free memory was 93.7MB in the beginning and 82.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-26 11:54:21,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.90ms. Allocated memory is still 134.2MB. Free memory was 82.9MB in the beginning and 81.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:54:21,955 INFO L158 Benchmark]: Boogie Preprocessor took 43.07ms. Allocated memory is still 134.2MB. Free memory was 81.2MB in the beginning and 79.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:54:21,956 INFO L158 Benchmark]: RCFGBuilder took 470.05ms. Allocated memory is still 134.2MB. Free memory was 79.4MB in the beginning and 103.0MB in the end (delta: -23.6MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2023-11-26 11:54:21,956 INFO L158 Benchmark]: BuchiAutomizer took 2261.95ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 103.0MB in the beginning and 66.7MB in the end (delta: 36.3MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2023-11-26 11:54:21,957 INFO L158 Benchmark]: Witness Printer took 56.58ms. Allocated memory is still 163.6MB. Free memory was 66.7MB in the beginning and 63.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:54:21,959 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 96.5MB. Free memory was 69.8MB in the beginning and 69.8MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.62ms. Allocated memory is still 134.2MB. Free memory was 93.7MB in the beginning and 82.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.90ms. Allocated memory is still 134.2MB. Free memory was 82.9MB in the beginning and 81.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.07ms. Allocated memory is still 134.2MB. Free memory was 81.2MB in the beginning and 79.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 470.05ms. Allocated memory is still 134.2MB. Free memory was 79.4MB in the beginning and 103.0MB in the end (delta: -23.6MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 2261.95ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 103.0MB in the beginning and 66.7MB in the end (delta: 36.3MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. * Witness Printer took 56.58ms. Allocated memory is still 163.6MB. Free memory was 66.7MB in the beginning and 63.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 2882 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 234 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 234 mSDsluCounter, 734 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 276 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 458 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI7 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 35]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 35]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-26 11:54:21,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02e49522-7a1a-4432-b22b-32d3ffec49b0/bin/uautomizer-verify-VRDe98Ueme/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)