./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32153782-c51c-45a1-9641-ff3108a1a1b3/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32153782-c51c-45a1-9641-ff3108a1a1b3/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32153782-c51c-45a1-9641-ff3108a1a1b3/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32153782-c51c-45a1-9641-ff3108a1a1b3/bin/uautomizer-j4sWxH34Be/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32153782-c51c-45a1-9641-ff3108a1a1b3/bin/uautomizer-j4sWxH34Be/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32153782-c51c-45a1-9641-ff3108a1a1b3/bin/uautomizer-j4sWxH34Be --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf5caed0975bcd13784481e6ed5c6e2683f42c4424e4d0ddd251aa22a6d5bd38 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 19:36:30,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:36:30,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:36:30,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:36:30,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:36:30,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:36:30,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:36:30,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:36:30,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:36:30,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:36:30,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:36:30,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:36:30,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:36:30,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:36:30,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:36:30,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:36:30,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:36:30,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:36:30,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:36:30,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:36:30,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:36:30,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:36:30,877 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:36:30,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:36:30,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:36:30,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:36:30,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:36:30,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:36:30,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:36:30,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:36:30,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:36:30,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:36:30,886 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:36:30,887 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:36:30,888 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:36:30,889 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:36:30,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:36:30,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:36:30,890 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:36:30,891 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:36:30,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:36:30,892 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32153782-c51c-45a1-9641-ff3108a1a1b3/bin/uautomizer-j4sWxH34Be/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-21 19:36:30,937 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:36:30,937 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:36:30,938 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:36:30,938 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:36:30,939 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:36:30,939 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:36:30,939 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:36:30,939 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-21 19:36:30,940 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-21 19:36:30,940 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-21 19:36:30,940 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-21 19:36:30,940 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-21 19:36:30,940 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-21 19:36:30,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:36:30,941 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 19:36:30,941 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-21 19:36:30,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:36:30,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 19:36:30,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:36:30,942 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-21 19:36:30,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-21 19:36:30,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-21 19:36:30,948 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 19:36:30,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 19:36:30,949 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-21 19:36:30,949 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:36:30,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-21 19:36:30,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:36:30,951 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:36:30,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:36:30,952 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 19:36:30,952 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:36:30,954 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-21 19:36:30,954 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32153782-c51c-45a1-9641-ff3108a1a1b3/bin/uautomizer-j4sWxH34Be/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_32153782-c51c-45a1-9641-ff3108a1a1b3/bin/uautomizer-j4sWxH34Be Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf5caed0975bcd13784481e6ed5c6e2683f42c4424e4d0ddd251aa22a6d5bd38 [2021-10-21 19:36:31,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:36:31,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:36:31,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:36:31,258 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:36:31,260 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:36:31,261 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32153782-c51c-45a1-9641-ff3108a1a1b3/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2021-10-21 19:36:31,360 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32153782-c51c-45a1-9641-ff3108a1a1b3/bin/uautomizer-j4sWxH34Be/data/433a13cf9/b59ce2cf2ef545e9b22d530411755e31/FLAGa372e55d8 [2021-10-21 19:36:31,910 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:36:31,911 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32153782-c51c-45a1-9641-ff3108a1a1b3/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2021-10-21 19:36:31,929 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32153782-c51c-45a1-9641-ff3108a1a1b3/bin/uautomizer-j4sWxH34Be/data/433a13cf9/b59ce2cf2ef545e9b22d530411755e31/FLAGa372e55d8 [2021-10-21 19:36:32,259 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32153782-c51c-45a1-9641-ff3108a1a1b3/bin/uautomizer-j4sWxH34Be/data/433a13cf9/b59ce2cf2ef545e9b22d530411755e31 [2021-10-21 19:36:32,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:36:32,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 19:36:32,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:36:32,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:36:32,270 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:36:32,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:36:32" (1/1) ... [2021-10-21 19:36:32,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ee9c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:36:32, skipping insertion in model container [2021-10-21 19:36:32,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:36:32" (1/1) ... [2021-10-21 19:36:32,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:36:32,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:36:32,520 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32153782-c51c-45a1-9641-ff3108a1a1b3/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[335,348] [2021-10-21 19:36:32,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:36:32,623 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 19:36:32,639 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32153782-c51c-45a1-9641-ff3108a1a1b3/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[335,348] [2021-10-21 19:36:32,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:36:32,714 INFO L208 MainTranslator]: Completed translation [2021-10-21 19:36:32,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:36:32 WrapperNode [2021-10-21 19:36:32,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:36:32,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 19:36:32,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 19:36:32,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 19:36:32,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:36:32" (1/1) ... [2021-10-21 19:36:32,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:36:32" (1/1) ... [2021-10-21 19:36:32,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 19:36:32,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 19:36:32,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 19:36:32,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 19:36:32,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:36:32" (1/1) ... [2021-10-21 19:36:32,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:36:32" (1/1) ... [2021-10-21 19:36:32,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:36:32" (1/1) ... [2021-10-21 19:36:32,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:36:32" (1/1) ... [2021-10-21 19:36:32,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:36:32" (1/1) ... [2021-10-21 19:36:32,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:36:32" (1/1) ... [2021-10-21 19:36:32,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:36:32" (1/1) ... [2021-10-21 19:36:32,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 19:36:32,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 19:36:32,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 19:36:32,871 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 19:36:32,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:36:32" (1/1) ... [2021-10-21 19:36:32,879 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:36:32,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32153782-c51c-45a1-9641-ff3108a1a1b3/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:36:32,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32153782-c51c-45a1-9641-ff3108a1a1b3/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:36:32,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32153782-c51c-45a1-9641-ff3108a1a1b3/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-21 19:36:32,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 19:36:32,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 19:36:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 19:36:32,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 19:36:33,493 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0; [2021-10-21 19:36:33,493 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume !(1 == ~q_free~0); [2021-10-21 19:36:33,502 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 19:36:33,514 INFO L299 CfgBuilder]: Removed 70 assume(true) statements. [2021-10-21 19:36:33,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:36:33 BoogieIcfgContainer [2021-10-21 19:36:33,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 19:36:33,519 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-21 19:36:33,520 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-21 19:36:33,523 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-21 19:36:33,523 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 19:36:33,523 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.10 07:36:32" (1/3) ... [2021-10-21 19:36:33,524 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57a1ec27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.10 07:36:33, skipping insertion in model container [2021-10-21 19:36:33,524 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 19:36:33,525 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:36:32" (2/3) ... [2021-10-21 19:36:33,525 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57a1ec27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.10 07:36:33, skipping insertion in model container [2021-10-21 19:36:33,525 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 19:36:33,525 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:36:33" (3/3) ... [2021-10-21 19:36:33,526 INFO L389 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2021-10-21 19:36:33,569 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-21 19:36:33,569 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-21 19:36:33,570 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-21 19:36:33,570 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-21 19:36:33,570 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-21 19:36:33,570 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-21 19:36:33,570 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-21 19:36:33,570 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-21 19:36:33,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 129 states, 128 states have (on average 1.6171875) internal successors, (207), 128 states have internal predecessors, (207), 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) [2021-10-21 19:36:33,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-10-21 19:36:33,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:36:33,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:36:33,625 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:33,626 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:33,626 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-21 19:36:33,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 129 states, 128 states have (on average 1.6171875) internal successors, (207), 128 states have internal predecessors, (207), 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) [2021-10-21 19:36:33,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-10-21 19:36:33,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:36:33,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:36:33,637 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:33,637 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:33,642 INFO L791 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0; 40#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; 46#L543true havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 76#L250true assume !(1 == ~q_req_up~0); 86#L250-1true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 116#L265-1true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 15#L270-1true assume !(0 == ~q_read_ev~0); 93#L303-1true assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 31#L308-1true havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 39#L58true assume 1 == ~p_dw_pc~0; 103#L59true assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 52#L79true is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 10#L80true activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 104#L379true assume !(0 != activate_threads_~tmp~1); 100#L379-2true havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 55#L87true assume 1 == ~c_dr_pc~0; 84#L88true assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 29#L108true is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 109#L109true activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 48#L387true assume !(0 != activate_threads_~tmp___0~1); 95#L387-2true assume !(1 == ~q_read_ev~0); 74#L321-1true assume !(1 == ~q_write_ev~0); 72#L483-1true [2021-10-21 19:36:33,643 INFO L793 eck$LassoCheckResult]: Loop: 72#L483-1true assume !false; 121#L484true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 75#L427true assume !true; 59#L443true start_simulation_~kernel_st~0 := 2; 106#L250-2true assume !(1 == ~q_req_up~0); 119#L250-3true start_simulation_~kernel_st~0 := 3; 83#L303-2true assume !(0 == ~q_read_ev~0); 73#L303-4true assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 122#L308-3true havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 43#L58-3true assume 1 == ~p_dw_pc~0; 13#L59-1true assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 110#L79-1true is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 113#L80-1true activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 64#L379-3true assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 4#L379-5true havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 30#L87-3true assume 1 == ~c_dr_pc~0; 115#L88-1true assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 70#L108-1true is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 120#L109-1true activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 111#L387-3true assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 36#L387-5true assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 67#L321-3true assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 91#L326-3true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 65#L283-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 97#L295-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 63#L296-1true start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 41#L502true assume !(0 == start_simulation_~tmp~4); 112#L502-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 18#L283-2true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 35#L295-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 38#L296-2true stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 23#L457true assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 108#L464true stop_simulation_#res := stop_simulation_~__retres2~0; 130#L465true start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 42#L515true assume !(0 != start_simulation_~tmp___0~3); 72#L483-1true [2021-10-21 19:36:33,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:33,649 INFO L82 PathProgramCache]: Analyzing trace with hash -598217252, now seen corresponding path program 1 times [2021-10-21 19:36:33,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:33,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163481897] [2021-10-21 19:36:33,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:33,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:33,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:33,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163481897] [2021-10-21 19:36:33,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163481897] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:33,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:33,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:33,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723739388] [2021-10-21 19:36:33,833 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:36:33,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:33,834 INFO L82 PathProgramCache]: Analyzing trace with hash -556986804, now seen corresponding path program 1 times [2021-10-21 19:36:33,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:33,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347265149] [2021-10-21 19:36:33,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:33,835 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:33,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:33,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:33,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347265149] [2021-10-21 19:36:33,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347265149] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:33,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:33,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 19:36:33,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624753700] [2021-10-21 19:36:33,869 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 19:36:33,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:33,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:33,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:33,887 INFO L87 Difference]: Start difference. First operand has 129 states, 128 states have (on average 1.6171875) internal successors, (207), 128 states have internal predecessors, (207), 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 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) [2021-10-21 19:36:33,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:33,913 INFO L93 Difference]: Finished difference Result 129 states and 196 transitions. [2021-10-21 19:36:33,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:33,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 196 transitions. [2021-10-21 19:36:33,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-10-21 19:36:33,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 123 states and 190 transitions. [2021-10-21 19:36:33,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2021-10-21 19:36:33,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2021-10-21 19:36:33,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 190 transitions. [2021-10-21 19:36:33,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:36:33,929 INFO L681 BuchiCegarLoop]: Abstraction has 123 states and 190 transitions. [2021-10-21 19:36:33,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 190 transitions. [2021-10-21 19:36:33,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-10-21 19:36:33,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.5447154471544715) internal successors, (190), 122 states have internal predecessors, (190), 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) [2021-10-21 19:36:33,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 190 transitions. [2021-10-21 19:36:33,962 INFO L704 BuchiCegarLoop]: Abstraction has 123 states and 190 transitions. [2021-10-21 19:36:33,962 INFO L587 BuchiCegarLoop]: Abstraction has 123 states and 190 transitions. [2021-10-21 19:36:33,962 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-21 19:36:33,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 190 transitions. [2021-10-21 19:36:33,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-10-21 19:36:33,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:36:33,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:36:33,967 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:33,967 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:33,967 INFO L791 eck$LassoCheckResult]: Stem: 389#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0; 336#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; 337#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 345#L250 assume !(1 == ~q_req_up~0); 351#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 379#L265-1 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 293#L270-1 assume !(0 == ~q_read_ev~0); 294#L303-1 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 325#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 326#L58 assume 1 == ~p_dw_pc~0; 335#L59 assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 304#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 281#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 282#L379 assume !(0 != activate_threads_~tmp~1); 382#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 353#L87 assume 1 == ~c_dr_pc~0; 354#L88 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 321#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 322#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 346#L387 assume !(0 != activate_threads_~tmp___0~1); 347#L387-2 assume !(1 == ~q_read_ev~0); 372#L321-1 assume !(1 == ~q_write_ev~0); 342#L483-1 [2021-10-21 19:36:33,968 INFO L793 eck$LassoCheckResult]: Loop: 342#L483-1 assume !false; 369#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 328#L427 assume !false; 349#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 350#L283 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 272#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 273#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 290#L407 assume !(0 != eval_~tmp___1~0); 292#L443 start_simulation_~kernel_st~0 := 2; 356#L250-2 assume !(1 == ~q_req_up~0); 385#L250-3 start_simulation_~kernel_st~0 := 3; 378#L303-2 assume !(0 == ~q_read_ev~0); 370#L303-4 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 371#L308-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 343#L58-3 assume 1 == ~p_dw_pc~0; 287#L59-1 assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 288#L79-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 387#L80-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 359#L379-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 267#L379-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 268#L87-3 assume 1 == ~c_dr_pc~0; 324#L88-1 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 306#L108-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 368#L109-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 388#L387-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 332#L387-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 333#L321-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 364#L326-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 360#L283-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 362#L295-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 358#L296-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 338#L502 assume !(0 == start_simulation_~tmp~4); 339#L502-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 301#L283-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 302#L295-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 331#L296-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 314#L457 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 315#L464 stop_simulation_#res := stop_simulation_~__retres2~0; 386#L465 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 341#L515 assume !(0 != start_simulation_~tmp___0~3); 342#L483-1 [2021-10-21 19:36:33,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:33,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1395927454, now seen corresponding path program 1 times [2021-10-21 19:36:33,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:33,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697109394] [2021-10-21 19:36:33,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:33,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:34,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:34,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:34,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697109394] [2021-10-21 19:36:34,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697109394] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:34,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:34,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:34,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481579307] [2021-10-21 19:36:34,013 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:36:34,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:34,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1442702753, now seen corresponding path program 1 times [2021-10-21 19:36:34,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:34,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311388246] [2021-10-21 19:36:34,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:34,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:34,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:34,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311388246] [2021-10-21 19:36:34,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311388246] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:34,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:34,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:36:34,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789426221] [2021-10-21 19:36:34,069 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 19:36:34,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:34,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:34,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:34,071 INFO L87 Difference]: Start difference. First operand 123 states and 190 transitions. cyclomatic complexity: 68 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) [2021-10-21 19:36:34,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:34,085 INFO L93 Difference]: Finished difference Result 123 states and 189 transitions. [2021-10-21 19:36:34,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:34,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 189 transitions. [2021-10-21 19:36:34,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-10-21 19:36:34,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 123 states and 189 transitions. [2021-10-21 19:36:34,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2021-10-21 19:36:34,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2021-10-21 19:36:34,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 189 transitions. [2021-10-21 19:36:34,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:36:34,092 INFO L681 BuchiCegarLoop]: Abstraction has 123 states and 189 transitions. [2021-10-21 19:36:34,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 189 transitions. [2021-10-21 19:36:34,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-10-21 19:36:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.5365853658536586) internal successors, (189), 122 states have internal predecessors, (189), 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) [2021-10-21 19:36:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 189 transitions. [2021-10-21 19:36:34,100 INFO L704 BuchiCegarLoop]: Abstraction has 123 states and 189 transitions. [2021-10-21 19:36:34,100 INFO L587 BuchiCegarLoop]: Abstraction has 123 states and 189 transitions. [2021-10-21 19:36:34,100 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-21 19:36:34,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 189 transitions. [2021-10-21 19:36:34,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-10-21 19:36:34,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:36:34,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:36:34,103 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:34,103 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:34,104 INFO L791 eck$LassoCheckResult]: Stem: 644#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0; 591#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; 592#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 600#L250 assume !(1 == ~q_req_up~0); 606#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 634#L265-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 548#L270-1 assume !(0 == ~q_read_ev~0); 549#L303-1 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 580#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 581#L58 assume 1 == ~p_dw_pc~0; 590#L59 assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 559#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 536#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 537#L379 assume !(0 != activate_threads_~tmp~1); 637#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 608#L87 assume 1 == ~c_dr_pc~0; 609#L88 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 576#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 577#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 601#L387 assume !(0 != activate_threads_~tmp___0~1); 602#L387-2 assume !(1 == ~q_read_ev~0); 627#L321-1 assume !(1 == ~q_write_ev~0); 597#L483-1 [2021-10-21 19:36:34,104 INFO L793 eck$LassoCheckResult]: Loop: 597#L483-1 assume !false; 624#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 583#L427 assume !false; 604#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 605#L283 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 527#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 528#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 545#L407 assume !(0 != eval_~tmp___1~0); 547#L443 start_simulation_~kernel_st~0 := 2; 611#L250-2 assume !(1 == ~q_req_up~0); 640#L250-3 start_simulation_~kernel_st~0 := 3; 633#L303-2 assume !(0 == ~q_read_ev~0); 625#L303-4 assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; 626#L308-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 598#L58-3 assume 1 == ~p_dw_pc~0; 542#L59-1 assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 543#L79-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 642#L80-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 614#L379-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 522#L379-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 523#L87-3 assume 1 == ~c_dr_pc~0; 579#L88-1 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 561#L108-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 623#L109-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 643#L387-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 587#L387-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 588#L321-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 619#L326-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 615#L283-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 617#L295-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 613#L296-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 593#L502 assume !(0 == start_simulation_~tmp~4); 594#L502-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 556#L283-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 557#L295-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 586#L296-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 569#L457 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 570#L464 stop_simulation_#res := stop_simulation_~__retres2~0; 641#L465 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 596#L515 assume !(0 != start_simulation_~tmp___0~3); 597#L483-1 [2021-10-21 19:36:34,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:34,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1310691940, now seen corresponding path program 1 times [2021-10-21 19:36:34,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:34,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519166048] [2021-10-21 19:36:34,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:34,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:34,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:34,173 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519166048] [2021-10-21 19:36:34,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519166048] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:34,173 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:34,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:36:34,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933430560] [2021-10-21 19:36:34,174 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:36:34,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:34,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1442702753, now seen corresponding path program 2 times [2021-10-21 19:36:34,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:34,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752422303] [2021-10-21 19:36:34,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:34,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:34,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:34,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752422303] [2021-10-21 19:36:34,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752422303] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:34,253 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:34,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:36:34,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442840788] [2021-10-21 19:36:34,254 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 19:36:34,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:34,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:36:34,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:36:34,255 INFO L87 Difference]: Start difference. First operand 123 states and 189 transitions. cyclomatic complexity: 67 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2021-10-21 19:36:34,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:34,370 INFO L93 Difference]: Finished difference Result 251 states and 380 transitions. [2021-10-21 19:36:34,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:36:34,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 251 states and 380 transitions. [2021-10-21 19:36:34,374 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 189 [2021-10-21 19:36:34,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 251 states to 251 states and 380 transitions. [2021-10-21 19:36:34,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 251 [2021-10-21 19:36:34,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 251 [2021-10-21 19:36:34,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 251 states and 380 transitions. [2021-10-21 19:36:34,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:36:34,380 INFO L681 BuchiCegarLoop]: Abstraction has 251 states and 380 transitions. [2021-10-21 19:36:34,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states and 380 transitions. [2021-10-21 19:36:34,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2021-10-21 19:36:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 251 states have (on average 1.5139442231075697) internal successors, (380), 250 states have internal predecessors, (380), 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) [2021-10-21 19:36:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 380 transitions. [2021-10-21 19:36:34,408 INFO L704 BuchiCegarLoop]: Abstraction has 251 states and 380 transitions. [2021-10-21 19:36:34,408 INFO L587 BuchiCegarLoop]: Abstraction has 251 states and 380 transitions. [2021-10-21 19:36:34,409 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-21 19:36:34,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 251 states and 380 transitions. [2021-10-21 19:36:34,412 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 189 [2021-10-21 19:36:34,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:36:34,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:36:34,416 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:34,418 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:34,419 INFO L791 eck$LassoCheckResult]: Stem: 1060#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0; 979#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; 980#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 991#L250 assume !(1 == ~q_req_up~0); 1029#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1153#L265-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1152#L270-1 assume !(0 == ~q_read_ev~0); 1151#L303-1 assume !(0 == ~q_write_ev~0); 1150#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1149#L58 assume 1 == ~p_dw_pc~0; 1147#L59 assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 1144#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1143#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 1142#L379 assume !(0 != activate_threads_~tmp~1); 1141#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 1140#L87 assume 1 == ~c_dr_pc~0; 1138#L88 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 962#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 963#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 992#L387 assume !(0 != activate_threads_~tmp___0~1); 993#L387-2 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 1041#L321-1 assume !(1 == ~q_write_ev~0); 1022#L483-1 [2021-10-21 19:36:34,420 INFO L793 eck$LassoCheckResult]: Loop: 1022#L483-1 assume !false; 1023#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 1027#L427 assume !false; 1028#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1038#L283 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 913#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 914#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 1074#L407 assume !(0 != eval_~tmp___1~0); 1006#L443 start_simulation_~kernel_st~0 := 2; 1007#L250-2 assume !(1 == ~q_req_up~0); 1061#L250-3 start_simulation_~kernel_st~0 := 3; 1062#L303-2 assume !(0 == ~q_read_ev~0); 1072#L303-4 assume !(0 == ~q_write_ev~0); 1068#L308-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 1135#L58-3 assume 1 == ~p_dw_pc~0; 928#L59-1 assume 1 == ~fast_clk_edge~0;is_do_write_p_triggered_~__retres1~0 := 1; 929#L79-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 1056#L80-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 1011#L379-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 908#L379-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 909#L87-3 assume 1 == ~c_dr_pc~0; 965#L88-1 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 947#L108-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 1020#L109-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 1057#L387-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 974#L387-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 975#L321-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 1016#L326-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1012#L283-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1014#L295-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1116#L296-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 981#L502 assume !(0 == start_simulation_~tmp~4); 982#L502-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 942#L283-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 943#L295-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 973#L296-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 1088#L457 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 1052#L464 stop_simulation_#res := stop_simulation_~__retres2~0; 1053#L465 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 1065#L515 assume !(0 != start_simulation_~tmp___0~3); 1022#L483-1 [2021-10-21 19:36:34,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:34,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1704411616, now seen corresponding path program 1 times [2021-10-21 19:36:34,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:34,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825860705] [2021-10-21 19:36:34,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:34,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:34,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:34,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:34,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825860705] [2021-10-21 19:36:34,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825860705] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:34,473 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:34,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:36:34,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309074445] [2021-10-21 19:36:34,474 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:36:34,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:34,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1952175843, now seen corresponding path program 1 times [2021-10-21 19:36:34,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:34,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406871557] [2021-10-21 19:36:34,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:34,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:34,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:34,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406871557] [2021-10-21 19:36:34,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406871557] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:34,540 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:34,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:36:34,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845522683] [2021-10-21 19:36:34,541 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 19:36:34,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:34,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:36:34,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:36:34,548 INFO L87 Difference]: Start difference. First operand 251 states and 380 transitions. cyclomatic complexity: 131 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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) [2021-10-21 19:36:34,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:34,706 INFO L93 Difference]: Finished difference Result 883 states and 1295 transitions. [2021-10-21 19:36:34,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:36:34,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 883 states and 1295 transitions. [2021-10-21 19:36:34,717 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 850 [2021-10-21 19:36:34,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 883 states to 883 states and 1295 transitions. [2021-10-21 19:36:34,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 883 [2021-10-21 19:36:34,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 883 [2021-10-21 19:36:34,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 883 states and 1295 transitions. [2021-10-21 19:36:34,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:36:34,760 INFO L681 BuchiCegarLoop]: Abstraction has 883 states and 1295 transitions. [2021-10-21 19:36:34,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states and 1295 transitions. [2021-10-21 19:36:34,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 857. [2021-10-21 19:36:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 857 states have (on average 1.4807467911318553) internal successors, (1269), 856 states have internal predecessors, (1269), 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) [2021-10-21 19:36:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1269 transitions. [2021-10-21 19:36:34,817 INFO L704 BuchiCegarLoop]: Abstraction has 857 states and 1269 transitions. [2021-10-21 19:36:34,818 INFO L587 BuchiCegarLoop]: Abstraction has 857 states and 1269 transitions. [2021-10-21 19:36:34,818 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-21 19:36:34,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 857 states and 1269 transitions. [2021-10-21 19:36:34,825 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 828 [2021-10-21 19:36:34,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:36:34,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:36:34,826 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:34,826 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:34,827 INFO L791 eck$LassoCheckResult]: Stem: 2197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0; 2121#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; 2122#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 2132#L250 assume !(1 == ~q_req_up~0); 2162#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 2171#L265-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 2080#L270-1 assume !(0 == ~q_read_ev~0); 2081#L303-1 assume !(0 == ~q_write_ev~0); 2111#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2112#L58 assume !(1 == ~p_dw_pc~0); 2082#L58-2 assume !(2 == ~p_dw_pc~0); 2083#L68-1 is_do_write_p_triggered_~__retres1~0 := 0; 2138#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2068#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 2069#L379 assume !(0 != activate_threads_~tmp~1); 2184#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2139#L87 assume 1 == ~c_dr_pc~0; 2140#L88 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 2107#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2108#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 2133#L387 assume !(0 != activate_threads_~tmp___0~1); 2134#L387-2 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 2161#L321-1 assume !(1 == ~q_write_ev~0); 2127#L483-1 [2021-10-21 19:36:34,834 INFO L793 eck$LassoCheckResult]: Loop: 2127#L483-1 assume !false; 2158#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 2114#L427 assume !false; 2136#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2137#L283 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2062#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2063#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 2077#L407 assume !(0 != eval_~tmp___1~0); 2079#L443 start_simulation_~kernel_st~0 := 2; 2861#L250-2 assume !(1 == ~q_req_up~0); 2859#L250-3 start_simulation_~kernel_st~0 := 3; 2857#L303-2 assume !(0 == ~q_read_ev~0); 2855#L303-4 assume !(0 == ~q_write_ev~0); 2853#L308-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 2851#L58-3 assume !(1 == ~p_dw_pc~0); 2849#L58-5 assume !(2 == ~p_dw_pc~0); 2847#L68-3 is_do_write_p_triggered_~__retres1~0 := 0; 2845#L79-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 2843#L80-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 2842#L379-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 2841#L379-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 2840#L87-3 assume 1 == ~c_dr_pc~0; 2836#L88-1 assume 1 == ~slow_clk_edge~0;is_do_read_c_triggered_~__retres1~1 := 1; 2835#L108-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 2834#L109-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 2833#L387-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 2118#L387-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 2119#L321-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 2153#L326-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2149#L283-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2151#L295-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2147#L296-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 2123#L502 assume !(0 == start_simulation_~tmp~4); 2124#L502-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2087#L283-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 2088#L295-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2117#L296-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 2097#L457 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 2098#L464 stop_simulation_#res := stop_simulation_~__retres2~0; 2192#L465 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 2126#L515 assume !(0 != start_simulation_~tmp___0~3); 2127#L483-1 [2021-10-21 19:36:34,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:34,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1443448551, now seen corresponding path program 1 times [2021-10-21 19:36:34,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:34,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842051334] [2021-10-21 19:36:34,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:34,836 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:34,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:34,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:34,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842051334] [2021-10-21 19:36:34,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842051334] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:34,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:34,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:36:34,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042492609] [2021-10-21 19:36:34,914 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:36:34,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:34,915 INFO L82 PathProgramCache]: Analyzing trace with hash 611599060, now seen corresponding path program 1 times [2021-10-21 19:36:34,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:34,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483158071] [2021-10-21 19:36:34,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:34,916 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:34,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:34,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:34,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483158071] [2021-10-21 19:36:34,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483158071] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:34,981 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:34,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:36:34,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338240600] [2021-10-21 19:36:34,982 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 19:36:34,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:34,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:36:34,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:36:34,983 INFO L87 Difference]: Start difference. First operand 857 states and 1269 transitions. cyclomatic complexity: 416 Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:35,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:35,123 INFO L93 Difference]: Finished difference Result 2083 states and 2999 transitions. [2021-10-21 19:36:35,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:36:35,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2083 states and 2999 transitions. [2021-10-21 19:36:35,142 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 2044 [2021-10-21 19:36:35,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2083 states to 2083 states and 2999 transitions. [2021-10-21 19:36:35,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2083 [2021-10-21 19:36:35,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2083 [2021-10-21 19:36:35,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2083 states and 2999 transitions. [2021-10-21 19:36:35,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:36:35,167 INFO L681 BuchiCegarLoop]: Abstraction has 2083 states and 2999 transitions. [2021-10-21 19:36:35,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states and 2999 transitions. [2021-10-21 19:36:35,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 2017. [2021-10-21 19:36:35,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 2017 states have (on average 1.4442240951908776) internal successors, (2913), 2016 states have internal predecessors, (2913), 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) [2021-10-21 19:36:35,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2913 transitions. [2021-10-21 19:36:35,212 INFO L704 BuchiCegarLoop]: Abstraction has 2017 states and 2913 transitions. [2021-10-21 19:36:35,212 INFO L587 BuchiCegarLoop]: Abstraction has 2017 states and 2913 transitions. [2021-10-21 19:36:35,212 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-21 19:36:35,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2017 states and 2913 transitions. [2021-10-21 19:36:35,226 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1980 [2021-10-21 19:36:35,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:36:35,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:36:35,227 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:35,227 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:35,227 INFO L791 eck$LassoCheckResult]: Stem: 5157#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0; 5081#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; 5082#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 5087#L250 assume !(1 == ~q_req_up~0); 5120#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 5128#L265-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 5034#L270-1 assume !(0 == ~q_read_ev~0); 5035#L303-1 assume !(0 == ~q_write_ev~0); 5068#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 5069#L58 assume !(1 == ~p_dw_pc~0); 5036#L58-2 assume !(2 == ~p_dw_pc~0); 5037#L68-1 is_do_write_p_triggered_~__retres1~0 := 0; 5094#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 5022#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 5023#L379 assume !(0 != activate_threads_~tmp~1); 5142#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 5095#L87 assume !(1 == ~c_dr_pc~0); 5014#L87-2 assume !(2 == ~c_dr_pc~0); 5015#L97-1 is_do_read_c_triggered_~__retres1~1 := 0; 5064#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 5065#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 5088#L387 assume !(0 != activate_threads_~tmp___0~1); 5089#L387-2 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 5118#L321-1 assume !(1 == ~q_write_ev~0); 5119#L483-1 [2021-10-21 19:36:35,227 INFO L793 eck$LassoCheckResult]: Loop: 5119#L483-1 assume !false; 6694#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 6693#L427 assume !false; 6692#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6691#L283 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 6689#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6688#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 6686#L407 assume !(0 != eval_~tmp___1~0); 6685#L443 start_simulation_~kernel_st~0 := 2; 6684#L250-2 assume !(1 == ~q_req_up~0); 6683#L250-3 start_simulation_~kernel_st~0 := 3; 6682#L303-2 assume !(0 == ~q_read_ev~0); 6681#L303-4 assume !(0 == ~q_write_ev~0); 6680#L308-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 6679#L58-3 assume !(1 == ~p_dw_pc~0); 6678#L58-5 assume !(2 == ~p_dw_pc~0); 6677#L68-3 is_do_write_p_triggered_~__retres1~0 := 0; 6676#L79-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 6675#L80-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 6674#L379-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 6673#L379-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 6670#L87-3 assume !(1 == ~c_dr_pc~0); 5102#L87-5 assume !(2 == ~c_dr_pc~0); 5103#L97-3 is_do_read_c_triggered_~__retres1~1 := 0; 6727#L108-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 6725#L109-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 6723#L387-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 6721#L387-5 assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; 6586#L321-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 6579#L326-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6717#L283-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 6714#L295-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6712#L296-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 6709#L502 assume !(0 == start_simulation_~tmp~4); 6707#L502-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6706#L283-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 6704#L295-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6703#L296-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 6702#L457 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 6701#L464 stop_simulation_#res := stop_simulation_~__retres2~0; 6700#L465 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 6699#L515 assume !(0 != start_simulation_~tmp___0~3); 5119#L483-1 [2021-10-21 19:36:35,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:35,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1480396684, now seen corresponding path program 1 times [2021-10-21 19:36:35,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:35,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469609136] [2021-10-21 19:36:35,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:35,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:35,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:35,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469609136] [2021-10-21 19:36:35,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469609136] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:35,259 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:35,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:35,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790623639] [2021-10-21 19:36:35,259 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:36:35,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:35,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1634640237, now seen corresponding path program 1 times [2021-10-21 19:36:35,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:35,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315576242] [2021-10-21 19:36:35,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:35,260 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:35,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:35,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315576242] [2021-10-21 19:36:35,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315576242] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:35,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:35,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:36:35,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659844660] [2021-10-21 19:36:35,293 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 19:36:35,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:35,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:35,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:35,294 INFO L87 Difference]: Start difference. First operand 2017 states and 2913 transitions. cyclomatic complexity: 904 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:35,354 INFO L93 Difference]: Finished difference Result 2666 states and 3813 transitions. [2021-10-21 19:36:35,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:35,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2666 states and 3813 transitions. [2021-10-21 19:36:35,381 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 2630 [2021-10-21 19:36:35,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2666 states to 2666 states and 3813 transitions. [2021-10-21 19:36:35,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2666 [2021-10-21 19:36:35,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2666 [2021-10-21 19:36:35,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2666 states and 3813 transitions. [2021-10-21 19:36:35,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:36:35,414 INFO L681 BuchiCegarLoop]: Abstraction has 2666 states and 3813 transitions. [2021-10-21 19:36:35,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states and 3813 transitions. [2021-10-21 19:36:35,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 1680. [2021-10-21 19:36:35,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1680 states have (on average 1.4386904761904762) internal successors, (2417), 1679 states have internal predecessors, (2417), 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) [2021-10-21 19:36:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2417 transitions. [2021-10-21 19:36:35,459 INFO L704 BuchiCegarLoop]: Abstraction has 1680 states and 2417 transitions. [2021-10-21 19:36:35,459 INFO L587 BuchiCegarLoop]: Abstraction has 1680 states and 2417 transitions. [2021-10-21 19:36:35,460 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-21 19:36:35,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1680 states and 2417 transitions. [2021-10-21 19:36:35,471 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1650 [2021-10-21 19:36:35,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:36:35,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:36:35,472 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:35,472 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:35,472 INFO L791 eck$LassoCheckResult]: Stem: 9850#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0; 9774#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; 9775#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 9779#L250 assume !(1 == ~q_req_up~0); 9814#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 9825#L265-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 9726#L270-1 assume !(0 == ~q_read_ev~0); 9727#L303-1 assume !(0 == ~q_write_ev~0); 9761#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 9762#L58 assume !(1 == ~p_dw_pc~0); 9728#L58-2 assume !(2 == ~p_dw_pc~0); 9729#L68-1 is_do_write_p_triggered_~__retres1~0 := 0; 9786#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 9714#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 9715#L379 assume !(0 != activate_threads_~tmp~1); 9837#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 9787#L87 assume !(1 == ~c_dr_pc~0); 9706#L87-2 assume !(2 == ~c_dr_pc~0); 9707#L97-1 is_do_read_c_triggered_~__retres1~1 := 0; 9757#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 9758#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 9780#L387 assume !(0 != activate_threads_~tmp___0~1); 9781#L387-2 assume !(1 == ~q_read_ev~0); 9812#L321-1 assume !(1 == ~q_write_ev~0); 9813#L483-1 [2021-10-21 19:36:35,472 INFO L793 eck$LassoCheckResult]: Loop: 9813#L483-1 assume !false; 9935#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 9934#L427 assume !false; 9933#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 9932#L283 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 9930#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 9929#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 9927#L407 assume !(0 != eval_~tmp___1~0); 9928#L443 start_simulation_~kernel_st~0 := 2; 9988#L250-2 assume !(1 == ~q_req_up~0); 9987#L250-3 start_simulation_~kernel_st~0 := 3; 9986#L303-2 assume !(0 == ~q_read_ev~0); 9985#L303-4 assume !(0 == ~q_write_ev~0); 9984#L308-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 9983#L58-3 assume !(1 == ~p_dw_pc~0); 9982#L58-5 assume !(2 == ~p_dw_pc~0); 9981#L68-3 is_do_write_p_triggered_~__retres1~0 := 0; 9980#L79-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 9979#L80-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 9977#L379-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 9975#L379-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 9973#L87-3 assume !(1 == ~c_dr_pc~0); 9971#L87-5 assume !(2 == ~c_dr_pc~0); 9969#L97-3 is_do_read_c_triggered_~__retres1~1 := 0; 9967#L108-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 9965#L109-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 9963#L387-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 9961#L387-5 assume !(1 == ~q_read_ev~0); 9959#L321-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 9957#L326-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 9955#L283-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 9952#L295-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 9950#L296-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 9947#L502 assume !(0 == start_simulation_~tmp~4); 9945#L502-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 9944#L283-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 9942#L295-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 9941#L296-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 9940#L457 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 9939#L464 stop_simulation_#res := stop_simulation_~__retres2~0; 9938#L465 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 9937#L515 assume !(0 != start_simulation_~tmp___0~3); 9813#L483-1 [2021-10-21 19:36:35,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:35,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1480396746, now seen corresponding path program 1 times [2021-10-21 19:36:35,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:35,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452783472] [2021-10-21 19:36:35,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:35,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:35,484 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:36:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:35,521 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:36:35,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:35,522 INFO L82 PathProgramCache]: Analyzing trace with hash 354776559, now seen corresponding path program 1 times [2021-10-21 19:36:35,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:35,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739293743] [2021-10-21 19:36:35,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:35,523 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:35,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:35,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:35,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739293743] [2021-10-21 19:36:35,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739293743] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:35,557 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:35,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:36:35,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421461376] [2021-10-21 19:36:35,557 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 19:36:35,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:35,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:36:35,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:36:35,558 INFO L87 Difference]: Start difference. First operand 1680 states and 2417 transitions. cyclomatic complexity: 741 Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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) [2021-10-21 19:36:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:35,650 INFO L93 Difference]: Finished difference Result 2816 states and 3974 transitions. [2021-10-21 19:36:35,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:36:35,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2816 states and 3974 transitions. [2021-10-21 19:36:35,675 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2780 [2021-10-21 19:36:35,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2816 states to 2816 states and 3974 transitions. [2021-10-21 19:36:35,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2816 [2021-10-21 19:36:35,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2816 [2021-10-21 19:36:35,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2816 states and 3974 transitions. [2021-10-21 19:36:35,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:36:35,706 INFO L681 BuchiCegarLoop]: Abstraction has 2816 states and 3974 transitions. [2021-10-21 19:36:35,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states and 3974 transitions. [2021-10-21 19:36:35,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 1743. [2021-10-21 19:36:35,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1743 states have (on average 1.4228341939185312) internal successors, (2480), 1742 states have internal predecessors, (2480), 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) [2021-10-21 19:36:35,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2480 transitions. [2021-10-21 19:36:35,755 INFO L704 BuchiCegarLoop]: Abstraction has 1743 states and 2480 transitions. [2021-10-21 19:36:35,756 INFO L587 BuchiCegarLoop]: Abstraction has 1743 states and 2480 transitions. [2021-10-21 19:36:35,756 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-21 19:36:35,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1743 states and 2480 transitions. [2021-10-21 19:36:35,766 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1713 [2021-10-21 19:36:35,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:36:35,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:36:35,767 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:35,767 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:35,767 INFO L791 eck$LassoCheckResult]: Stem: 14365#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0; 14283#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; 14284#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 14288#L250 assume !(1 == ~q_req_up~0); 14335#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 14342#L265-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 14237#L270-1 assume !(0 == ~q_read_ev~0); 14238#L303-1 assume !(0 == ~q_write_ev~0); 14271#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 14272#L58 assume !(1 == ~p_dw_pc~0); 14239#L58-2 assume !(2 == ~p_dw_pc~0); 14240#L68-1 is_do_write_p_triggered_~__retres1~0 := 0; 14297#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 14226#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 14227#L379 assume !(0 != activate_threads_~tmp~1); 14351#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 14300#L87 assume !(1 == ~c_dr_pc~0); 14218#L87-2 assume !(2 == ~c_dr_pc~0); 14219#L97-1 is_do_read_c_triggered_~__retres1~1 := 0; 14267#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 14268#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 14289#L387 assume !(0 != activate_threads_~tmp___0~1); 14290#L387-2 assume !(1 == ~q_read_ev~0); 14332#L321-1 assume !(1 == ~q_write_ev~0); 14333#L483-1 [2021-10-21 19:36:35,768 INFO L793 eck$LassoCheckResult]: Loop: 14333#L483-1 assume !false; 15885#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 14303#L427 assume !false; 15766#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 15762#L283 assume !(0 == ~p_dw_st~0); 15760#L287 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 15761#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 14291#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 14292#L407 assume !(0 != eval_~tmp___1~0); 15750#L443 start_simulation_~kernel_st~0 := 2; 15751#L250-2 assume !(1 == ~q_req_up~0); 15743#L250-3 start_simulation_~kernel_st~0 := 3; 15744#L303-2 assume !(0 == ~q_read_ev~0); 15739#L303-4 assume !(0 == ~q_write_ev~0); 15740#L308-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 15733#L58-3 assume !(1 == ~p_dw_pc~0); 15734#L58-5 assume !(2 == ~p_dw_pc~0); 15773#L68-3 is_do_write_p_triggered_~__retres1~0 := 0; 15769#L79-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 15770#L80-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 15763#L379-3 assume 0 != activate_threads_~tmp~1;~p_dw_st~0 := 0; 15764#L379-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 14265#L87-3 assume !(1 == ~c_dr_pc~0); 14266#L87-5 assume !(2 == ~c_dr_pc~0); 15919#L97-3 is_do_read_c_triggered_~__retres1~1 := 0; 15918#L108-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 15917#L109-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 15916#L387-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 15915#L387-5 assume !(1 == ~q_read_ev~0); 15914#L321-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 15913#L326-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 15912#L283-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 15908#L295-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 15905#L296-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 15901#L502 assume !(0 == start_simulation_~tmp~4); 15899#L502-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 15898#L283-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 15896#L295-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 15895#L296-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 15893#L457 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 15891#L464 stop_simulation_#res := stop_simulation_~__retres2~0; 15890#L465 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 15888#L515 assume !(0 != start_simulation_~tmp___0~3); 14333#L483-1 [2021-10-21 19:36:35,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:35,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1480396746, now seen corresponding path program 2 times [2021-10-21 19:36:35,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:35,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041530594] [2021-10-21 19:36:35,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:35,769 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:35,777 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:36:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:35,793 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:36:35,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:35,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1644874558, now seen corresponding path program 1 times [2021-10-21 19:36:35,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:35,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479220933] [2021-10-21 19:36:35,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:35,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:35,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:35,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:35,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479220933] [2021-10-21 19:36:35,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479220933] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:35,849 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:35,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:36:35,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865774843] [2021-10-21 19:36:35,850 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 19:36:35,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:35,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:36:35,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:36:35,851 INFO L87 Difference]: Start difference. First operand 1743 states and 2480 transitions. cyclomatic complexity: 741 Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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) [2021-10-21 19:36:35,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:35,932 INFO L93 Difference]: Finished difference Result 4091 states and 5801 transitions. [2021-10-21 19:36:35,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:36:35,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4091 states and 5801 transitions. [2021-10-21 19:36:35,964 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4057 [2021-10-21 19:36:35,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4091 states to 4091 states and 5801 transitions. [2021-10-21 19:36:35,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4091 [2021-10-21 19:36:36,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4091 [2021-10-21 19:36:36,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4091 states and 5801 transitions. [2021-10-21 19:36:36,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:36:36,008 INFO L681 BuchiCegarLoop]: Abstraction has 4091 states and 5801 transitions. [2021-10-21 19:36:36,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4091 states and 5801 transitions. [2021-10-21 19:36:36,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4091 to 1821. [2021-10-21 19:36:36,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1821 states have (on average 1.3953871499176276) internal successors, (2541), 1820 states have internal predecessors, (2541), 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) [2021-10-21 19:36:36,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2541 transitions. [2021-10-21 19:36:36,094 INFO L704 BuchiCegarLoop]: Abstraction has 1821 states and 2541 transitions. [2021-10-21 19:36:36,095 INFO L587 BuchiCegarLoop]: Abstraction has 1821 states and 2541 transitions. [2021-10-21 19:36:36,095 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-21 19:36:36,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1821 states and 2541 transitions. [2021-10-21 19:36:36,102 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1791 [2021-10-21 19:36:36,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:36:36,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:36:36,103 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:36,103 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:36,103 INFO L791 eck$LassoCheckResult]: Stem: 20207#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0; 20130#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; 20131#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 20136#L250 assume !(1 == ~q_req_up~0); 20176#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 20187#L265-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 20084#L270-1 assume !(0 == ~q_read_ev~0); 20085#L303-1 assume !(0 == ~q_write_ev~0); 20117#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 20118#L58 assume !(1 == ~p_dw_pc~0); 20086#L58-2 assume !(2 == ~p_dw_pc~0); 20087#L68-1 is_do_write_p_triggered_~__retres1~0 := 0; 20143#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 20073#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 20074#L379 assume !(0 != activate_threads_~tmp~1); 20195#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 20146#L87 assume !(1 == ~c_dr_pc~0); 20065#L87-2 assume !(2 == ~c_dr_pc~0); 20066#L97-1 is_do_read_c_triggered_~__retres1~1 := 0; 20113#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 20114#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 20137#L387 assume !(0 != activate_threads_~tmp___0~1); 20138#L387-2 assume !(1 == ~q_read_ev~0); 20173#L321-1 assume !(1 == ~q_write_ev~0); 20174#L483-1 [2021-10-21 19:36:36,104 INFO L793 eck$LassoCheckResult]: Loop: 20174#L483-1 assume !false; 20282#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 20267#L427 assume !false; 20281#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 20280#L283 assume !(0 == ~p_dw_st~0); 20279#L287 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 20278#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 20276#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 20273#L407 assume !(0 != eval_~tmp___1~0); 20274#L443 start_simulation_~kernel_st~0 := 2; 20334#L250-2 assume !(1 == ~q_req_up~0); 20333#L250-3 start_simulation_~kernel_st~0 := 3; 20332#L303-2 assume !(0 == ~q_read_ev~0); 20331#L303-4 assume !(0 == ~q_write_ev~0); 20330#L308-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 20329#L58-3 assume !(1 == ~p_dw_pc~0); 20328#L58-5 assume !(2 == ~p_dw_pc~0); 20327#L68-3 is_do_write_p_triggered_~__retres1~0 := 0; 20326#L79-1 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 20325#L80-1 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 20323#L379-3 assume !(0 != activate_threads_~tmp~1); 20321#L379-5 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 20319#L87-3 assume !(1 == ~c_dr_pc~0); 20317#L87-5 assume !(2 == ~c_dr_pc~0); 20315#L97-3 is_do_read_c_triggered_~__retres1~1 := 0; 20313#L108-1 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 20311#L109-1 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 20309#L387-3 assume 0 != activate_threads_~tmp___0~1;~c_dr_st~0 := 0; 20307#L387-5 assume !(1 == ~q_read_ev~0); 20305#L321-3 assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; 20303#L326-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 20301#L283-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 20298#L295-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 20296#L296-1 start_simulation_#t~ret16 := exists_runnable_thread_#res;start_simulation_~tmp~4 := start_simulation_#t~ret16;havoc start_simulation_#t~ret16; 20293#L502 assume !(0 == start_simulation_~tmp~4); 20291#L502-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret15, stop_simulation_~tmp~3, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~3;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 20290#L283-2 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 20288#L295-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 20287#L296-2 stop_simulation_#t~ret15 := exists_runnable_thread_#res;stop_simulation_~tmp~3 := stop_simulation_#t~ret15;havoc stop_simulation_#t~ret15; 20286#L457 assume 0 != stop_simulation_~tmp~3;stop_simulation_~__retres2~0 := 0; 20285#L464 stop_simulation_#res := stop_simulation_~__retres2~0; 20284#L465 start_simulation_#t~ret17 := stop_simulation_#res;start_simulation_~tmp___0~3 := start_simulation_#t~ret17;havoc start_simulation_#t~ret17; 20283#L515 assume !(0 != start_simulation_~tmp___0~3); 20174#L483-1 [2021-10-21 19:36:36,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:36,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1480396746, now seen corresponding path program 3 times [2021-10-21 19:36:36,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:36,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697237277] [2021-10-21 19:36:36,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:36,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:36,113 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:36:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:36,127 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:36:36,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:36,127 INFO L82 PathProgramCache]: Analyzing trace with hash -160563776, now seen corresponding path program 1 times [2021-10-21 19:36:36,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:36,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169121624] [2021-10-21 19:36:36,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:36,128 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:36,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:36,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:36,148 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169121624] [2021-10-21 19:36:36,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169121624] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:36,149 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:36,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:36:36,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892689334] [2021-10-21 19:36:36,149 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-10-21 19:36:36,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:36,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:36,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:36,150 INFO L87 Difference]: Start difference. First operand 1821 states and 2541 transitions. cyclomatic complexity: 724 Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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) [2021-10-21 19:36:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:36,186 INFO L93 Difference]: Finished difference Result 2830 states and 3865 transitions. [2021-10-21 19:36:36,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:36,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2830 states and 3865 transitions. [2021-10-21 19:36:36,203 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 2795 [2021-10-21 19:36:36,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2830 states to 2830 states and 3865 transitions. [2021-10-21 19:36:36,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2830 [2021-10-21 19:36:36,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2830 [2021-10-21 19:36:36,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2830 states and 3865 transitions. [2021-10-21 19:36:36,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:36:36,232 INFO L681 BuchiCegarLoop]: Abstraction has 2830 states and 3865 transitions. [2021-10-21 19:36:36,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states and 3865 transitions. [2021-10-21 19:36:36,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 2830. [2021-10-21 19:36:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2830 states, 2830 states have (on average 1.3657243816254416) internal successors, (3865), 2829 states have internal predecessors, (3865), 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) [2021-10-21 19:36:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 3865 transitions. [2021-10-21 19:36:36,292 INFO L704 BuchiCegarLoop]: Abstraction has 2830 states and 3865 transitions. [2021-10-21 19:36:36,292 INFO L587 BuchiCegarLoop]: Abstraction has 2830 states and 3865 transitions. [2021-10-21 19:36:36,292 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-10-21 19:36:36,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2830 states and 3865 transitions. [2021-10-21 19:36:36,303 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 2795 [2021-10-21 19:36:36,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:36:36,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:36:36,304 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:36,304 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:36,305 INFO L791 eck$LassoCheckResult]: Stem: 24871#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0; 24784#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; 24785#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 24793#L250 assume !(1 == ~q_req_up~0); 24834#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 24845#L265-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 24741#L270-1 assume !(0 == ~q_read_ev~0); 24742#L303-1 assume !(0 == ~q_write_ev~0); 24772#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 24773#L58 assume !(1 == ~p_dw_pc~0); 24743#L58-2 assume !(2 == ~p_dw_pc~0); 24744#L68-1 is_do_write_p_triggered_~__retres1~0 := 0; 24801#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 24730#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 24731#L379 assume !(0 != activate_threads_~tmp~1); 24855#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 24804#L87 assume !(1 == ~c_dr_pc~0); 24722#L87-2 assume !(2 == ~c_dr_pc~0); 24723#L97-1 is_do_read_c_triggered_~__retres1~1 := 0; 24769#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 24770#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 24794#L387 assume !(0 != activate_threads_~tmp___0~1); 24795#L387-2 assume !(1 == ~q_read_ev~0); 24831#L321-1 assume !(1 == ~q_write_ev~0); 24832#L483-1 assume !false; 26477#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 26463#L427 [2021-10-21 19:36:36,305 INFO L793 eck$LassoCheckResult]: Loop: 26463#L427 assume !false; 26474#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 26472#L283 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 26471#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 26470#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 26469#L407 assume 0 != eval_~tmp___1~0; 26467#L407-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet13;havoc eval_#t~nondet13; 26465#L416 assume !(0 != eval_~tmp~2); 26464#L412 assume !(0 == ~c_dr_st~0); 26463#L427 [2021-10-21 19:36:36,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:36,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1027102476, now seen corresponding path program 1 times [2021-10-21 19:36:36,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:36,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129043757] [2021-10-21 19:36:36,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:36,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:36,319 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:36:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:36,353 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:36:36,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:36,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1127629253, now seen corresponding path program 1 times [2021-10-21 19:36:36,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:36,354 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285579892] [2021-10-21 19:36:36,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:36,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:36,358 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:36:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:36,362 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:36:36,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:36,363 INFO L82 PathProgramCache]: Analyzing trace with hash -644372710, now seen corresponding path program 1 times [2021-10-21 19:36:36,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:36,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911056180] [2021-10-21 19:36:36,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:36,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:36:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:36:36,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:36:36,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911056180] [2021-10-21 19:36:36,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911056180] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:36:36,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:36:36,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 19:36:36,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125437168] [2021-10-21 19:36:36,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:36:36,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:36:36,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:36:36,468 INFO L87 Difference]: Start difference. First operand 2830 states and 3865 transitions. cyclomatic complexity: 1042 Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:36:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:36:36,551 INFO L93 Difference]: Finished difference Result 4193 states and 5700 transitions. [2021-10-21 19:36:36,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:36:36,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4193 states and 5700 transitions. [2021-10-21 19:36:36,574 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 4159 [2021-10-21 19:36:36,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4193 states to 4193 states and 5700 transitions. [2021-10-21 19:36:36,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4193 [2021-10-21 19:36:36,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4193 [2021-10-21 19:36:36,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4193 states and 5700 transitions. [2021-10-21 19:36:36,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:36:36,612 INFO L681 BuchiCegarLoop]: Abstraction has 4193 states and 5700 transitions. [2021-10-21 19:36:36,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4193 states and 5700 transitions. [2021-10-21 19:36:36,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4193 to 3691. [2021-10-21 19:36:36,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3691 states, 3691 states have (on average 1.3665673259279327) internal successors, (5044), 3690 states have internal predecessors, (5044), 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) [2021-10-21 19:36:36,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 5044 transitions. [2021-10-21 19:36:36,714 INFO L704 BuchiCegarLoop]: Abstraction has 3691 states and 5044 transitions. [2021-10-21 19:36:36,715 INFO L587 BuchiCegarLoop]: Abstraction has 3691 states and 5044 transitions. [2021-10-21 19:36:36,715 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-10-21 19:36:36,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3691 states and 5044 transitions. [2021-10-21 19:36:36,729 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 3657 [2021-10-21 19:36:36,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:36:36,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:36:36,730 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:36,730 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:36:36,730 INFO L791 eck$LassoCheckResult]: Stem: 31910#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(17);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~fast_clk_edge~0 := 0;~slow_clk_edge~0 := 0;~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_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;~t~0 := 0; 31815#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~fast_clk_edge~0 := 2;~slow_clk_edge~0 := 2;~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; 31816#L543 havoc start_simulation_#t~ret16, start_simulation_#t~ret17, start_simulation_~kernel_st~0, start_simulation_~tmp~4, start_simulation_~tmp___0~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~4;havoc start_simulation_~tmp___0~3;start_simulation_~kernel_st~0 := 0; 31826#L250 assume !(1 == ~q_req_up~0); 31864#L250-1 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 31876#L265-1 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 31772#L270-1 assume !(0 == ~q_read_ev~0); 31773#L303-1 assume !(0 == ~q_write_ev~0); 31803#L308-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, activate_threads_~tmp~1, activate_threads_~tmp___0~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc is_do_write_p_triggered_#res;havoc is_do_write_p_triggered_~__retres1~0;havoc is_do_write_p_triggered_~__retres1~0; 31804#L58 assume !(1 == ~p_dw_pc~0); 31774#L58-2 assume !(2 == ~p_dw_pc~0); 31775#L68-1 is_do_write_p_triggered_~__retres1~0 := 0; 31832#L79 is_do_write_p_triggered_#res := is_do_write_p_triggered_~__retres1~0; 31761#L80 activate_threads_#t~ret10 := is_do_write_p_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 31762#L379 assume !(0 != activate_threads_~tmp~1); 31890#L379-2 havoc is_do_read_c_triggered_#res;havoc is_do_read_c_triggered_~__retres1~1;havoc is_do_read_c_triggered_~__retres1~1; 31834#L87 assume !(1 == ~c_dr_pc~0); 31753#L87-2 assume !(2 == ~c_dr_pc~0); 31754#L97-1 is_do_read_c_triggered_~__retres1~1 := 0; 31800#L108 is_do_read_c_triggered_#res := is_do_read_c_triggered_~__retres1~1; 31801#L109 activate_threads_#t~ret11 := is_do_read_c_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 31827#L387 assume !(0 != activate_threads_~tmp___0~1); 31828#L387-2 assume !(1 == ~q_read_ev~0); 31861#L321-1 assume !(1 == ~q_write_ev~0); 31862#L483-1 assume !false; 34351#L484 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret12, eval_#t~nondet13, eval_#t~nondet14, eval_~tmp~2, eval_~tmp___0~2, eval_~tmp___1~0;havoc eval_~tmp~2;havoc eval_~tmp___0~2;havoc eval_~tmp___1~0; 34329#L427 [2021-10-21 19:36:36,734 INFO L793 eck$LassoCheckResult]: Loop: 34329#L427 assume !false; 34349#L403 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 34346#L283 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 34344#L295 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 34342#L296 eval_#t~ret12 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret12;havoc eval_#t~ret12; 34340#L407 assume 0 != eval_~tmp___1~0; 34337#L407-1 assume 0 == ~p_dw_st~0;eval_~tmp~2 := eval_#t~nondet13;havoc eval_#t~nondet13; 34333#L416 assume !(0 != eval_~tmp~2); 34331#L412 assume 0 == ~c_dr_st~0;eval_~tmp___0~2 := eval_#t~nondet14;havoc eval_#t~nondet14; 34328#L431 assume !(0 != eval_~tmp___0~2); 34329#L427 [2021-10-21 19:36:36,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:36,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1027102476, now seen corresponding path program 2 times [2021-10-21 19:36:36,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:36,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654682143] [2021-10-21 19:36:36,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:36,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:36,746 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:36:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:36,769 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:36:36,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:36,769 INFO L82 PathProgramCache]: Analyzing trace with hash 596766931, now seen corresponding path program 1 times [2021-10-21 19:36:36,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:36,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580421082] [2021-10-21 19:36:36,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:36,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:36,773 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:36:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:36,779 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:36:36,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:36:36,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1499280926, now seen corresponding path program 1 times [2021-10-21 19:36:36,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:36:36,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238703054] [2021-10-21 19:36:36,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:36:36,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:36:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:36,789 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:36:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:36:36,809 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:36:38,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.10 07:36:38 BoogieIcfgContainer [2021-10-21 19:36:38,116 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-21 19:36:38,117 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 19:36:38,117 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 19:36:38,117 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 19:36:38,117 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:36:33" (3/4) ... [2021-10-21 19:36:38,120 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-10-21 19:36:38,176 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32153782-c51c-45a1-9641-ff3108a1a1b3/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 19:36:38,176 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 19:36:38,178 INFO L168 Benchmark]: Toolchain (without parser) took 5913.39 ms. Allocated memory was 142.6 MB in the beginning and 180.4 MB in the end (delta: 37.7 MB). Free memory was 110.5 MB in the beginning and 109.7 MB in the end (delta: 792.3 kB). Peak memory consumption was 37.4 MB. Max. memory is 16.1 GB. [2021-10-21 19:36:38,178 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 86.0 MB. Free memory is still 44.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:36:38,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 454.30 ms. Allocated memory is still 142.6 MB. Free memory was 110.5 MB in the beginning and 116.6 MB in the end (delta: -6.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-21 19:36:38,179 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.92 ms. Allocated memory is still 142.6 MB. Free memory was 116.6 MB in the beginning and 114.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-21 19:36:38,179 INFO L168 Benchmark]: Boogie Preprocessor took 69.73 ms. Allocated memory is still 142.6 MB. Free memory was 114.0 MB in the beginning and 111.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:36:38,180 INFO L168 Benchmark]: RCFGBuilder took 647.65 ms. Allocated memory is still 142.6 MB. Free memory was 111.9 MB in the beginning and 93.5 MB in the end (delta: 18.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-21 19:36:38,180 INFO L168 Benchmark]: BuchiAutomizer took 4597.29 ms. Allocated memory was 142.6 MB in the beginning and 180.4 MB in the end (delta: 37.7 MB). Free memory was 93.0 MB in the beginning and 112.8 MB in the end (delta: -19.7 MB). Peak memory consumption was 88.7 MB. Max. memory is 16.1 GB. [2021-10-21 19:36:38,181 INFO L168 Benchmark]: Witness Printer took 59.55 ms. Allocated memory is still 180.4 MB. Free memory was 112.8 MB in the beginning and 109.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:36:38,183 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 86.0 MB. Free memory is still 44.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 454.30 ms. Allocated memory is still 142.6 MB. Free memory was 110.5 MB in the beginning and 116.6 MB in the end (delta: -6.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 78.92 ms. Allocated memory is still 142.6 MB. Free memory was 116.6 MB in the beginning and 114.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 69.73 ms. Allocated memory is still 142.6 MB. Free memory was 114.0 MB in the beginning and 111.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 647.65 ms. Allocated memory is still 142.6 MB. Free memory was 111.9 MB in the beginning and 93.5 MB in the end (delta: 18.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 4597.29 ms. Allocated memory was 142.6 MB in the beginning and 180.4 MB in the end (delta: 37.7 MB). Free memory was 93.0 MB in the beginning and 112.8 MB in the end (delta: -19.7 MB). Peak memory consumption was 88.7 MB. Max. memory is 16.1 GB. * Witness Printer took 59.55 ms. Allocated memory is still 180.4 MB. Free memory was 112.8 MB in the beginning and 109.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 3691 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.3s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 501.9ms AutomataMinimizationTime, 10 MinimizatonAttempts, 4923 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 3691 states and ocurred in iteration 10. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1850 SDtfs, 3311 SDslu, 2684 SDs, 0 SdLazy, 340 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 370.8ms Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 concLT0 SILN0 SILU0 SILI6 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 402]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=18562} State at position 1 is {a_t=0, NULL=0, NULL=18562, c_num_read=0, tmp=0, kernel_st=1, q_read_ev=2, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d35f14e=0, p_dw_pc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30069701=0, NULL=0, NULL=0, q_free=1, fast_clk_edge=2, __retres1=0, tmp___0=0, q_ev=0, slow_clk_edge=2, tmp___0=0, NULL=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@473a0c0f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3427829b=0, tmp=0, __retres1=0, p_last_write=0, c_dr_i=1, c_dr_pc=0, NULL=18565, \result=0, \result=0, c_dr_st=0, p_dw_i=1, tmp___1=1, q_req_up=0, q_write_ev=2, __retres1=1, NULL=18563, t=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@514446a6=0, NULL=0, NULL=18564, p_dw_st=0, \result=0, c_last_read=0, q_buf_0=0, p_num_write=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@35e2555d=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8457a90=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 402]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L16] int fast_clk_edge ; [L17] int slow_clk_edge ; [L18] int q_buf_0 ; [L19] int q_free ; [L20] int q_read_ev ; [L21] int q_write_ev ; [L22] int q_req_up ; [L23] int q_ev ; [L44] int p_num_write ; [L45] int p_last_write ; [L46] int p_dw_st ; [L47] int p_dw_pc ; [L48] int p_dw_i ; [L49] int c_num_read ; [L50] int c_last_read ; [L51] int c_dr_st ; [L52] int c_dr_pc ; [L53] int c_dr_i ; [L186] static int a_t ; [L336] static int t = 0; [L547] int __retres1 ; [L531] fast_clk_edge = 2 [L532] slow_clk_edge = 2 [L533] q_free = 1 [L534] q_write_ev = 2 [L535] q_read_ev = q_write_ev [L536] p_num_write = 0 [L537] p_dw_pc = 0 [L538] p_dw_i = 1 [L539] c_num_read = 0 [L540] c_dr_pc = 0 [L541] c_dr_i = 1 [L469] int kernel_st ; [L470] int tmp ; [L471] int tmp___0 ; [L475] kernel_st = 0 [L250] COND FALSE !((int )q_req_up == 1) [L265] COND TRUE (int )p_dw_i == 1 [L266] p_dw_st = 0 [L270] COND TRUE (int )c_dr_i == 1 [L271] c_dr_st = 0 [L303] COND FALSE !((int )q_read_ev == 0) [L308] COND FALSE !((int )q_write_ev == 0) [L372] int tmp ; [L373] int tmp___0 ; [L55] int __retres1 ; [L58] COND FALSE !((int )p_dw_pc == 1) [L68] COND FALSE !((int )p_dw_pc == 2) [L78] __retres1 = 0 [L80] return (__retres1); [L377] tmp = is_do_write_p_triggered() [L379] COND FALSE !(\read(tmp)) [L84] int __retres1 ; [L87] COND FALSE !((int )c_dr_pc == 1) [L97] COND FALSE !((int )c_dr_pc == 2) [L107] __retres1 = 0 [L109] return (__retres1); [L385] tmp___0 = is_do_read_c_triggered() [L387] COND FALSE !(\read(tmp___0)) [L321] COND FALSE !((int )q_read_ev == 1) [L326] COND FALSE !((int )q_write_ev == 1) [L483] COND TRUE 1 [L486] kernel_st = 1 [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; Loop: [L402] COND TRUE 1 [L280] int __retres1 ; [L283] COND TRUE (int )p_dw_st == 0 [L284] __retres1 = 1 [L296] return (__retres1); [L405] tmp___1 = exists_runnable_thread() [L407] COND TRUE \read(tmp___1) [L412] COND TRUE (int )p_dw_st == 0 [L414] tmp = __VERIFIER_nondet_int() [L416] COND FALSE !(\read(tmp)) [L427] COND TRUE (int )c_dr_st == 0 [L429] tmp___0 = __VERIFIER_nondet_int() [L431] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-10-21 19:36:38,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_32153782-c51c-45a1-9641-ff3108a1a1b3/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...