./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 527bcce2 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_5ac18bab-3cc4-4743-b6b5-0facc2622d11/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ac18bab-3cc4-4743-b6b5-0facc2622d11/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ac18bab-3cc4-4743-b6b5-0facc2622d11/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ac18bab-3cc4-4743-b6b5-0facc2622d11/bin/uautomizer-verify-bycVGegfSx/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ac18bab-3cc4-4743-b6b5-0facc2622d11/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ac18bab-3cc4-4743-b6b5-0facc2622d11/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:29:00,617 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:29:00,712 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ac18bab-3cc4-4743-b6b5-0facc2622d11/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-21 22:29:00,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:29:00,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:29:00,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:29:00,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:29:00,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:29:00,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:29:00,749 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:29:00,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:29:00,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:29:00,751 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:29:00,752 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-21 22:29:00,752 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-21 22:29:00,753 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-21 22:29:00,754 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-21 22:29:00,754 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-21 22:29:00,755 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-21 22:29:00,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:29:00,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-21 22:29:00,757 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:29:00,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:29:00,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:29:00,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:29:00,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-21 22:29:00,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-21 22:29:00,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-21 22:29:00,761 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:29:00,762 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:29:00,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:29:00,763 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-21 22:29:00,763 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:29:00,764 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:29:00,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:29:00,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:29:00,765 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:29:00,766 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-21 22:29:00,766 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_5ac18bab-3cc4-4743-b6b5-0facc2622d11/bin/uautomizer-verify-bycVGegfSx/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ac18bab-3cc4-4743-b6b5-0facc2622d11/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 [2023-11-21 22:29:01,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:29:01,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:29:01,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:29:01,098 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:29:01,100 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:29:01,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ac18bab-3cc4-4743-b6b5-0facc2622d11/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2023-11-21 22:29:04,338 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:29:04,604 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:29:04,604 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ac18bab-3cc4-4743-b6b5-0facc2622d11/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2023-11-21 22:29:04,615 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ac18bab-3cc4-4743-b6b5-0facc2622d11/bin/uautomizer-verify-bycVGegfSx/data/0377ee472/dc2f3d2437f145caa376010d2840ec29/FLAG4cba432e2 [2023-11-21 22:29:04,631 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ac18bab-3cc4-4743-b6b5-0facc2622d11/bin/uautomizer-verify-bycVGegfSx/data/0377ee472/dc2f3d2437f145caa376010d2840ec29 [2023-11-21 22:29:04,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:29:04,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:29:04,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:29:04,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:29:04,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:29:04,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:29:04" (1/1) ... [2023-11-21 22:29:04,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc2fb2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:29:04, skipping insertion in model container [2023-11-21 22:29:04,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:29:04" (1/1) ... [2023-11-21 22:29:04,706 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:29:04,965 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:29:04,986 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:29:05,036 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:29:05,061 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:29:05,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:29:05 WrapperNode [2023-11-21 22:29:05,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:29:05,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:29:05,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:29:05,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:29:05,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:29:05" (1/1) ... [2023-11-21 22:29:05,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:29:05" (1/1) ... [2023-11-21 22:29:05,135 INFO L138 Inliner]: procedures = 24, calls = 23, calls flagged for inlining = 18, calls inlined = 21, statements flattened = 259 [2023-11-21 22:29:05,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:29:05,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:29:05,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:29:05,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:29:05,149 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:29:05" (1/1) ... [2023-11-21 22:29:05,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:29:05" (1/1) ... [2023-11-21 22:29:05,161 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:29:05" (1/1) ... [2023-11-21 22:29:05,171 INFO L187 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-21 22:29:05,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:29:05" (1/1) ... [2023-11-21 22:29:05,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:29:05" (1/1) ... [2023-11-21 22:29:05,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:29:05" (1/1) ... [2023-11-21 22:29:05,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:29:05" (1/1) ... [2023-11-21 22:29:05,199 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:29:05" (1/1) ... [2023-11-21 22:29:05,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:29:05" (1/1) ... [2023-11-21 22:29:05,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:29:05,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:29:05,212 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:29:05,212 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:29:05,213 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:29:05" (1/1) ... [2023-11-21 22:29:05,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:29:05,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ac18bab-3cc4-4743-b6b5-0facc2622d11/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:29:05,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ac18bab-3cc4-4743-b6b5-0facc2622d11/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:29:05,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ac18bab-3cc4-4743-b6b5-0facc2622d11/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-21 22:29:05,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:29:05,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:29:05,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:29:05,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:29:05,376 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:29:05,379 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:29:05,708 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:29:05,719 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:29:05,719 INFO L308 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-21 22:29:05,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:29:05 BoogieIcfgContainer [2023-11-21 22:29:05,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:29:05,723 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-21 22:29:05,723 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-21 22:29:05,727 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-21 22:29:05,728 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:29:05,728 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 10:29:04" (1/3) ... [2023-11-21 22:29:05,732 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d387a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 10:29:05, skipping insertion in model container [2023-11-21 22:29:05,733 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:29:05,735 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:29:05" (2/3) ... [2023-11-21 22:29:05,737 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d387a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 10:29:05, skipping insertion in model container [2023-11-21 22:29:05,737 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:29:05,737 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:29:05" (3/3) ... [2023-11-21 22:29:05,738 INFO L332 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2023-11-21 22:29:05,814 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-21 22:29:05,814 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-21 22:29:05,815 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-21 22:29:05,815 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-21 22:29:05,815 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-21 22:29:05,815 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-21 22:29:05,815 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-21 22:29:05,816 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-21 22:29:05,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 81 states, 80 states have (on average 1.5125) internal successors, (121), 80 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:29:05,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2023-11-21 22:29:05,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:29:05,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:29:05,855 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:29:05,855 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:29:05,855 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-21 22:29:05,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 81 states, 80 states have (on average 1.5125) internal successors, (121), 80 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:29:05,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2023-11-21 22:29:05,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:29:05,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:29:05,863 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:29:05,863 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:29:05,872 INFO L748 eck$LassoCheckResult]: Stem: 31#$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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 43#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 68#init_model_returnLabel#1true assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 37#L206true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 3#L206-2true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 44#L211-1true assume { :end_inline_init_threads } true; 66#L323-2true [2023-11-21 22:29:05,873 INFO L750 eck$LassoCheckResult]: Loop: 66#L323-2true assume !false; 12#L324true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 48#L272true assume false; 15#eval_returnLabel#1true havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 59#L224-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 77#L236-1true exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 28#exists_runnable_thread_returnLabel#2true stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 13#L302true assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 14#L309true stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 74#stop_simulation_returnLabel#1true start_simulation_#t~ret11#1 := stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 55#L330true assume !(0 != start_simulation_~tmp~3#1); 66#L323-2true [2023-11-21 22:29:05,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:29:05,879 INFO L85 PathProgramCache]: Analyzing trace with hash 889479019, now seen corresponding path program 1 times [2023-11-21 22:29:05,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:29:05,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730235200] [2023-11-21 22:29:05,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:29:05,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:29:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:29:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:29:06,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:29:06,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730235200] [2023-11-21 22:29:06,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730235200] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:29:06,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:29:06,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:29:06,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267618049] [2023-11-21 22:29:06,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:29:06,096 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:29:06,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:29:06,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1504754769, now seen corresponding path program 1 times [2023-11-21 22:29:06,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:29:06,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171142491] [2023-11-21 22:29:06,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:29:06,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:29:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:29:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:29:06,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:29:06,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171142491] [2023-11-21 22:29:06,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171142491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:29:06,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:29:06,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:29:06,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416801865] [2023-11-21 22:29:06,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:29:06,116 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:29:06,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:29:06,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:29:06,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:29:06,153 INFO L87 Difference]: Start difference. First operand has 81 states, 80 states have (on average 1.5125) internal successors, (121), 80 states have internal predecessors, (121), 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 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:29:06,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:29:06,178 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2023-11-21 22:29:06,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 106 transitions. [2023-11-21 22:29:06,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2023-11-21 22:29:06,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 100 transitions. [2023-11-21 22:29:06,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2023-11-21 22:29:06,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2023-11-21 22:29:06,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 100 transitions. [2023-11-21 22:29:06,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:29:06,195 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 100 transitions. [2023-11-21 22:29:06,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 100 transitions. [2023-11-21 22:29:06,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-11-21 22:29:06,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.408450704225352) internal successors, (100), 70 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:29:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2023-11-21 22:29:06,241 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 100 transitions. [2023-11-21 22:29:06,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:29:06,247 INFO L428 stractBuchiCegarLoop]: Abstraction has 71 states and 100 transitions. [2023-11-21 22:29:06,247 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-21 22:29:06,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 100 transitions. [2023-11-21 22:29:06,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2023-11-21 22:29:06,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:29:06,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:29:06,251 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:29:06,251 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:29:06,251 INFO L748 eck$LassoCheckResult]: Stem: 211#$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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 212#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 222#init_model_returnLabel#1 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 217#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 171#L206-2 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 172#L211-1 assume { :end_inline_init_threads } true; 223#L323-2 [2023-11-21 22:29:06,252 INFO L750 eck$LassoCheckResult]: Loop: 223#L323-2 assume !false; 188#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 174#L272 assume !false; 227#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 179#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 180#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 182#exists_runnable_thread_returnLabel#1 eval_#t~ret7#1 := exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 183#L252 assume !(0 != eval_~tmp___1~0#1); 192#eval_returnLabel#1 havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 193#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 232#L236-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 208#exists_runnable_thread_returnLabel#2 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 189#L302 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 190#L309 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 191#stop_simulation_returnLabel#1 start_simulation_#t~ret11#1 := stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 229#L330 assume !(0 != start_simulation_~tmp~3#1); 223#L323-2 [2023-11-21 22:29:06,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:29:06,252 INFO L85 PathProgramCache]: Analyzing trace with hash 889477097, now seen corresponding path program 1 times [2023-11-21 22:29:06,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:29:06,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082172590] [2023-11-21 22:29:06,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:29:06,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:29:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:29:06,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:29:06,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:29:06,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082172590] [2023-11-21 22:29:06,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082172590] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:29:06,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:29:06,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:29:06,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866593218] [2023-11-21 22:29:06,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:29:06,304 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:29:06,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:29:06,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1251467551, now seen corresponding path program 1 times [2023-11-21 22:29:06,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:29:06,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531570580] [2023-11-21 22:29:06,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:29:06,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:29:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:29:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:29:06,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:29:06,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531570580] [2023-11-21 22:29:06,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531570580] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:29:06,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:29:06,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:29:06,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972645725] [2023-11-21 22:29:06,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:29:06,408 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:29:06,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:29:06,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:29:06,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:29:06,410 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. cyclomatic complexity: 30 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:29:06,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:29:06,425 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2023-11-21 22:29:06,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 99 transitions. [2023-11-21 22:29:06,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2023-11-21 22:29:06,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 99 transitions. [2023-11-21 22:29:06,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2023-11-21 22:29:06,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2023-11-21 22:29:06,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 99 transitions. [2023-11-21 22:29:06,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:29:06,432 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 99 transitions. [2023-11-21 22:29:06,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 99 transitions. [2023-11-21 22:29:06,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-11-21 22:29:06,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 70 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:29:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2023-11-21 22:29:06,441 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 99 transitions. [2023-11-21 22:29:06,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:29:06,443 INFO L428 stractBuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2023-11-21 22:29:06,443 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-21 22:29:06,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 99 transitions. [2023-11-21 22:29:06,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2023-11-21 22:29:06,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:29:06,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:29:06,446 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:29:06,446 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:29:06,447 INFO L748 eck$LassoCheckResult]: Stem: 363#$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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 373#init_model_returnLabel#1 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 370#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 322#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 323#L211-1 assume { :end_inline_init_threads } true; 374#L323-2 [2023-11-21 22:29:06,447 INFO L750 eck$LassoCheckResult]: Loop: 374#L323-2 assume !false; 341#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 325#L272 assume !false; 378#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 330#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 331#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 333#exists_runnable_thread_returnLabel#1 eval_#t~ret7#1 := exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 334#L252 assume !(0 != eval_~tmp___1~0#1); 343#eval_returnLabel#1 havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 344#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 383#L236-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 357#exists_runnable_thread_returnLabel#2 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 339#L302 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 340#L309 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 342#stop_simulation_returnLabel#1 start_simulation_#t~ret11#1 := stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 381#L330 assume !(0 != start_simulation_~tmp~3#1); 374#L323-2 [2023-11-21 22:29:06,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:29:06,448 INFO L85 PathProgramCache]: Analyzing trace with hash 889477035, now seen corresponding path program 1 times [2023-11-21 22:29:06,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:29:06,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034468393] [2023-11-21 22:29:06,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:29:06,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:29:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:29:06,462 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:29:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:29:06,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:29:06,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:29:06,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1251467551, now seen corresponding path program 2 times [2023-11-21 22:29:06,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:29:06,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452461192] [2023-11-21 22:29:06,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:29:06,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:29:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:29:06,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-21 22:29:06,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:29:06,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452461192] [2023-11-21 22:29:06,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452461192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:29:06,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:29:06,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:29:06,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145715104] [2023-11-21 22:29:06,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:29:06,560 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:29:06,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:29:06,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:29:06,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:29:06,562 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. cyclomatic complexity: 29 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:29:06,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:29:06,721 INFO L93 Difference]: Finished difference Result 139 states and 192 transitions. [2023-11-21 22:29:06,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 192 transitions. [2023-11-21 22:29:06,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 133 [2023-11-21 22:29:06,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 139 states and 192 transitions. [2023-11-21 22:29:06,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2023-11-21 22:29:06,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2023-11-21 22:29:06,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 192 transitions. [2023-11-21 22:29:06,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:29:06,741 INFO L218 hiAutomatonCegarLoop]: Abstraction has 139 states and 192 transitions. [2023-11-21 22:29:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 192 transitions. [2023-11-21 22:29:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 74. [2023-11-21 22:29:06,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 73 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:29:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2023-11-21 22:29:06,753 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 102 transitions. [2023-11-21 22:29:06,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 22:29:06,759 INFO L428 stractBuchiCegarLoop]: Abstraction has 74 states and 102 transitions. [2023-11-21 22:29:06,760 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-21 22:29:06,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 102 transitions. [2023-11-21 22:29:06,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2023-11-21 22:29:06,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:29:06,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:29:06,762 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:29:06,762 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:29:06,763 INFO L748 eck$LassoCheckResult]: Stem: 590#$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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 591#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 601#init_model_returnLabel#1 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 596#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 549#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 550#L211-1 assume { :end_inline_init_threads } true; 602#L323-2 [2023-11-21 22:29:06,763 INFO L750 eck$LassoCheckResult]: Loop: 602#L323-2 assume !false; 566#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 552#L272 assume !false; 606#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 557#L224 assume !(0 == ~p_dw_st~0); 559#L228 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2#1 := 0; 572#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 616#exists_runnable_thread_returnLabel#1 eval_#t~ret7#1 := exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 618#L252 assume !(0 != eval_~tmp___1~0#1); 570#eval_returnLabel#1 havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 571#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 611#L236-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 585#exists_runnable_thread_returnLabel#2 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 567#L302 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 568#L309 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 569#stop_simulation_returnLabel#1 start_simulation_#t~ret11#1 := stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 609#L330 assume !(0 != start_simulation_~tmp~3#1); 602#L323-2 [2023-11-21 22:29:06,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:29:06,764 INFO L85 PathProgramCache]: Analyzing trace with hash 889477035, now seen corresponding path program 2 times [2023-11-21 22:29:06,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:29:06,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97187191] [2023-11-21 22:29:06,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:29:06,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:29:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:29:06,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:29:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:29:06,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:29:06,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:29:06,809 INFO L85 PathProgramCache]: Analyzing trace with hash 960183933, now seen corresponding path program 1 times [2023-11-21 22:29:06,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:29:06,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806202005] [2023-11-21 22:29:06,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:29:06,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:29:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:29:06,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:29:06,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:29:06,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806202005] [2023-11-21 22:29:06,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806202005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:29:06,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:29:06,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:29:06,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119739915] [2023-11-21 22:29:06,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:29:06,868 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:29:06,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:29:06,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:29:06,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:29:06,870 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. cyclomatic complexity: 29 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:29:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:29:06,932 INFO L93 Difference]: Finished difference Result 125 states and 170 transitions. [2023-11-21 22:29:06,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 170 transitions. [2023-11-21 22:29:06,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 117 [2023-11-21 22:29:06,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 170 transitions. [2023-11-21 22:29:06,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2023-11-21 22:29:06,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2023-11-21 22:29:06,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 170 transitions. [2023-11-21 22:29:06,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:29:06,945 INFO L218 hiAutomatonCegarLoop]: Abstraction has 125 states and 170 transitions. [2023-11-21 22:29:06,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 170 transitions. [2023-11-21 22:29:06,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2023-11-21 22:29:06,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 107 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:29:06,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2023-11-21 22:29:06,964 INFO L240 hiAutomatonCegarLoop]: Abstraction has 108 states and 146 transitions. [2023-11-21 22:29:06,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:29:06,970 INFO L428 stractBuchiCegarLoop]: Abstraction has 108 states and 146 transitions. [2023-11-21 22:29:06,970 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-21 22:29:06,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 146 transitions. [2023-11-21 22:29:06,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2023-11-21 22:29:06,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:29:06,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:29:06,973 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:29:06,973 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:29:06,975 INFO L748 eck$LassoCheckResult]: Stem: 796#$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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 797#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 808#init_model_returnLabel#1 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 803#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 750#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 751#L211-1 assume { :end_inline_init_threads } true; 809#L323-2 assume !false; 839#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 835#L272 [2023-11-21 22:29:06,976 INFO L750 eck$LassoCheckResult]: Loop: 835#L272 assume !false; 834#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 833#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 832#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 831#exists_runnable_thread_returnLabel#1 eval_#t~ret7#1 := exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 819#L252 assume 0 != eval_~tmp___1~0#1; 820#L252-1 assume 0 == ~p_dw_st~0;havoc eval_#t~nondet8#1;eval_~tmp~1#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; 827#L261 assume !(0 != eval_~tmp~1#1); 828#L257 assume !(0 == ~c_dr_st~0); 835#L272 [2023-11-21 22:29:06,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:29:06,976 INFO L85 PathProgramCache]: Analyzing trace with hash 88939597, now seen corresponding path program 1 times [2023-11-21 22:29:06,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:29:06,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541636507] [2023-11-21 22:29:06,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:29:06,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:29:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:29:06,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:29:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:29:07,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:29:07,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:29:07,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1880932392, now seen corresponding path program 1 times [2023-11-21 22:29:07,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:29:07,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136697598] [2023-11-21 22:29:07,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:29:07,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:29:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:29:07,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:29:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:29:07,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:29:07,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:29:07,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1617118884, now seen corresponding path program 1 times [2023-11-21 22:29:07,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:29:07,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655187568] [2023-11-21 22:29:07,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:29:07,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:29:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:29:07,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-21 22:29:07,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:29:07,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655187568] [2023-11-21 22:29:07,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655187568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:29:07,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:29:07,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:29:07,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994268459] [2023-11-21 22:29:07,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:29:07,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:29:07,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:29:07,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:29:07,208 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. cyclomatic complexity: 39 Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:29:07,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:29:07,262 INFO L93 Difference]: Finished difference Result 189 states and 254 transitions. [2023-11-21 22:29:07,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 254 transitions. [2023-11-21 22:29:07,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 181 [2023-11-21 22:29:07,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 189 states and 254 transitions. [2023-11-21 22:29:07,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 189 [2023-11-21 22:29:07,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2023-11-21 22:29:07,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 254 transitions. [2023-11-21 22:29:07,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:29:07,276 INFO L218 hiAutomatonCegarLoop]: Abstraction has 189 states and 254 transitions. [2023-11-21 22:29:07,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 254 transitions. [2023-11-21 22:29:07,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 151. [2023-11-21 22:29:07,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 150 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:29:07,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 202 transitions. [2023-11-21 22:29:07,301 INFO L240 hiAutomatonCegarLoop]: Abstraction has 151 states and 202 transitions. [2023-11-21 22:29:07,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:29:07,307 INFO L428 stractBuchiCegarLoop]: Abstraction has 151 states and 202 transitions. [2023-11-21 22:29:07,307 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-21 22:29:07,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 202 transitions. [2023-11-21 22:29:07,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2023-11-21 22:29:07,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:29:07,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:29:07,310 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:29:07,310 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:29:07,310 INFO L748 eck$LassoCheckResult]: Stem: 1102#$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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1103#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1113#init_model_returnLabel#1 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 1109#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1059#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1060#L211-1 assume { :end_inline_init_threads } true; 1114#L323-2 assume !false; 1075#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 1062#L272 [2023-11-21 22:29:07,311 INFO L750 eck$LassoCheckResult]: Loop: 1062#L272 assume !false; 1121#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 1154#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 1155#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 1171#exists_runnable_thread_returnLabel#1 eval_#t~ret7#1 := exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 1170#L252 assume 0 != eval_~tmp___1~0#1; 1148#L252-1 assume 0 == ~p_dw_st~0;havoc eval_#t~nondet8#1;eval_~tmp~1#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; 1137#L261 assume !(0 != eval_~tmp~1#1); 1139#L257 assume 0 == ~c_dr_st~0;havoc eval_#t~nondet9#1;eval_~tmp___0~1#1 := eval_#t~nondet9#1;havoc eval_#t~nondet9#1; 1061#L276 assume !(0 != eval_~tmp___0~1#1); 1062#L272 [2023-11-21 22:29:07,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:29:07,311 INFO L85 PathProgramCache]: Analyzing trace with hash 88939597, now seen corresponding path program 2 times [2023-11-21 22:29:07,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:29:07,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715280065] [2023-11-21 22:29:07,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:29:07,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:29:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:29:07,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:29:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:29:07,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:29:07,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:29:07,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1820641230, now seen corresponding path program 1 times [2023-11-21 22:29:07,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:29:07,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946391155] [2023-11-21 22:29:07,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:29:07,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:29:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:29:07,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:29:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:29:07,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:29:07,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:29:07,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1408918910, now seen corresponding path program 1 times [2023-11-21 22:29:07,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:29:07,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118463911] [2023-11-21 22:29:07,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:29:07,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:29:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:29:07,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:29:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:29:07,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:29:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:29:08,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:29:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:29:08,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.11 10:29:08 BoogieIcfgContainer [2023-11-21 22:29:08,115 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-21 22:29:08,116 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:29:08,116 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:29:08,117 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:29:08,117 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:29:05" (3/4) ... [2023-11-21 22:29:08,120 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-21 22:29:08,202 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ac18bab-3cc4-4743-b6b5-0facc2622d11/bin/uautomizer-verify-bycVGegfSx/witness.graphml [2023-11-21 22:29:08,203 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:29:08,204 INFO L158 Benchmark]: Toolchain (without parser) took 3568.43ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 125.5MB in the beginning and 148.8MB in the end (delta: -23.3MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2023-11-21 22:29:08,204 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 113.2MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:29:08,205 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.59ms. Allocated memory is still 155.2MB. Free memory was 125.0MB in the beginning and 112.9MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-21 22:29:08,205 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.52ms. Allocated memory is still 155.2MB. Free memory was 112.9MB in the beginning and 110.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:29:08,206 INFO L158 Benchmark]: Boogie Preprocessor took 72.31ms. Allocated memory is still 155.2MB. Free memory was 110.8MB in the beginning and 108.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:29:08,206 INFO L158 Benchmark]: RCFGBuilder took 511.28ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 92.8MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-21 22:29:08,207 INFO L158 Benchmark]: BuchiAutomizer took 2392.54ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 92.8MB in the beginning and 150.9MB in the end (delta: -58.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:29:08,208 INFO L158 Benchmark]: Witness Printer took 87.09ms. Allocated memory is still 186.6MB. Free memory was 150.9MB in the beginning and 148.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:29:08,210 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.28ms. Allocated memory is still 113.2MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.59ms. Allocated memory is still 155.2MB. Free memory was 125.0MB in the beginning and 112.9MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.52ms. Allocated memory is still 155.2MB. Free memory was 112.9MB in the beginning and 110.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.31ms. Allocated memory is still 155.2MB. Free memory was 110.8MB in the beginning and 108.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 511.28ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 92.8MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 2392.54ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 92.8MB in the beginning and 150.9MB in the end (delta: -58.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 87.09ms. Allocated memory is still 186.6MB. Free memory was 150.9MB in the beginning and 148.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 151 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 120 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s 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, 505 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 505 mSDsluCounter, 970 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 431 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 539 mSDtfsCounter, 60 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI2 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: 247]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L24] int q_buf_0 ; [L25] int q_free ; [L26] int q_read_ev ; [L27] int q_write_ev ; [L28] int p_num_write ; [L29] int p_last_write ; [L30] int p_dw_st ; [L31] int p_dw_pc ; [L32] int p_dw_i ; [L33] int c_num_read ; [L34] int c_last_read ; [L35] int c_dr_st ; [L36] int c_dr_pc ; [L37] int c_dr_i ; [L144] static int a_t ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0] [L360] int __retres1 ; [L364] CALL init_model() [L346] q_free = 1 [L347] q_write_ev = 2 [L348] q_read_ev = q_write_ev [L349] p_num_write = 0 [L350] p_dw_pc = 0 [L351] p_dw_i = 1 [L352] c_num_read = 0 [L353] c_dr_pc = 0 [L354] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L364] RET init_model() [L365] CALL start_simulation() [L314] int kernel_st ; [L315] int tmp ; [L319] kernel_st = 0 [L320] CALL init_threads() [L206] COND TRUE (int )p_dw_i == 1 [L207] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L211] COND TRUE (int )c_dr_i == 1 [L212] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L320] RET init_threads() [L323] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L326] kernel_st = 1 [L327] CALL eval() [L241] int tmp ; [L242] int tmp___0 ; [L243] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] Loop: [L247] COND TRUE 1 [L250] CALL, EXPR exists_runnable_thread() [L221] int __retres1 ; [L224] COND TRUE (int )p_dw_st == 0 [L225] __retres1 = 1 [L237] return (__retres1); [L250] RET, EXPR exists_runnable_thread() [L250] tmp___1 = exists_runnable_thread() [L252] COND TRUE \read(tmp___1) [L257] COND TRUE (int )p_dw_st == 0 [L259] tmp = __VERIFIER_nondet_int() [L261] COND FALSE !(\read(tmp)) [L272] COND TRUE (int )c_dr_st == 0 [L274] tmp___0 = __VERIFIER_nondet_int() [L276] COND FALSE !(\read(tmp___0)) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 247]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L24] int q_buf_0 ; [L25] int q_free ; [L26] int q_read_ev ; [L27] int q_write_ev ; [L28] int p_num_write ; [L29] int p_last_write ; [L30] int p_dw_st ; [L31] int p_dw_pc ; [L32] int p_dw_i ; [L33] int c_num_read ; [L34] int c_last_read ; [L35] int c_dr_st ; [L36] int c_dr_pc ; [L37] int c_dr_i ; [L144] static int a_t ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0] [L360] int __retres1 ; [L364] CALL init_model() [L346] q_free = 1 [L347] q_write_ev = 2 [L348] q_read_ev = q_write_ev [L349] p_num_write = 0 [L350] p_dw_pc = 0 [L351] p_dw_i = 1 [L352] c_num_read = 0 [L353] c_dr_pc = 0 [L354] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L364] RET init_model() [L365] CALL start_simulation() [L314] int kernel_st ; [L315] int tmp ; [L319] kernel_st = 0 [L320] CALL init_threads() [L206] COND TRUE (int )p_dw_i == 1 [L207] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L211] COND TRUE (int )c_dr_i == 1 [L212] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L320] RET init_threads() [L323] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] [L326] kernel_st = 1 [L327] CALL eval() [L241] int tmp ; [L242] int tmp___0 ; [L243] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=1, q_read_ev=2, q_write_ev=2] Loop: [L247] COND TRUE 1 [L250] CALL, EXPR exists_runnable_thread() [L221] int __retres1 ; [L224] COND TRUE (int )p_dw_st == 0 [L225] __retres1 = 1 [L237] return (__retres1); [L250] RET, EXPR exists_runnable_thread() [L250] tmp___1 = exists_runnable_thread() [L252] COND TRUE \read(tmp___1) [L257] COND TRUE (int )p_dw_st == 0 [L259] tmp = __VERIFIER_nondet_int() [L261] COND FALSE !(\read(tmp)) [L272] COND TRUE (int )c_dr_st == 0 [L274] tmp___0 = __VERIFIER_nondet_int() [L276] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-21 22:29:08,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ac18bab-3cc4-4743-b6b5-0facc2622d11/bin/uautomizer-verify-bycVGegfSx/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)