./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f9db8f562e00e8e2c77bd4109a87025a2d9cfdc1d504bc43872dc3be0602b46a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:00:39,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:00:39,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:00:39,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:00:39,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:00:39,313 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:00:39,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:00:39,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:00:39,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:00:39,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:00:39,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:00:39,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:00:39,327 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:00:39,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:00:39,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:00:39,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:00:39,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:00:39,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:00:39,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:00:39,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:00:39,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:00:39,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:00:39,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:00:39,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:00:39,347 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:00:39,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:00:39,347 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:00:39,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:00:39,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:00:39,349 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:00:39,349 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:00:39,349 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:00:39,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:00:39,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:00:39,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:00:39,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:00:39,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:00:39,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:00:39,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:00:39,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:00:39,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:00:39,355 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 20:00:39,379 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:00:39,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:00:39,380 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:00:39,380 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:00:39,381 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:00:39,381 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:00:39,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:00:39,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:00:39,382 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:00:39,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:00:39,383 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:00:39,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:00:39,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:00:39,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:00:39,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:00:39,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:00:39,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:00:39,385 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:00:39,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:00:39,385 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:00:39,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:00:39,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:00:39,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:00:39,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:00:39,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:00:39,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:00:39,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:00:39,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:00:39,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:00:39,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:00:39,387 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:00:39,387 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:00:39,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:00:39,388 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(G ! call(reach_error())) ) 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 -> f9db8f562e00e8e2c77bd4109a87025a2d9cfdc1d504bc43872dc3be0602b46a [2022-02-20 20:00:39,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:00:39,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:00:39,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:00:39,626 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:00:39,627 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:00:39,628 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c [2022-02-20 20:00:39,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62d4493ce/87857de07e0343d3855c063be46fe5f3/FLAG97b7c404e [2022-02-20 20:00:40,045 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:00:40,045 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c [2022-02-20 20:00:40,067 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62d4493ce/87857de07e0343d3855c063be46fe5f3/FLAG97b7c404e [2022-02-20 20:00:40,076 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62d4493ce/87857de07e0343d3855c063be46fe5f3 [2022-02-20 20:00:40,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:00:40,078 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:00:40,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:00:40,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:00:40,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:00:40,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:00:40" (1/1) ... [2022-02-20 20:00:40,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8fe6a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:40, skipping insertion in model container [2022-02-20 20:00:40,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:00:40" (1/1) ... [2022-02-20 20:00:40,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:00:40,143 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:00:40,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c[911,924] [2022-02-20 20:00:40,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c[8416,8429] [2022-02-20 20:00:40,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:00:40,490 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:00:40,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c[911,924] [2022-02-20 20:00:40,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.10.cil-2.c[8416,8429] [2022-02-20 20:00:40,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:00:40,592 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:00:40,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:40 WrapperNode [2022-02-20 20:00:40,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:00:40,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:00:40,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:00:40,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:00:40,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:40" (1/1) ... [2022-02-20 20:00:40,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:40" (1/1) ... [2022-02-20 20:00:40,658 INFO L137 Inliner]: procedures = 75, calls = 91, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 962 [2022-02-20 20:00:40,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:00:40,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:00:40,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:00:40,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:00:40,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:40" (1/1) ... [2022-02-20 20:00:40,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:40" (1/1) ... [2022-02-20 20:00:40,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:40" (1/1) ... [2022-02-20 20:00:40,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:40" (1/1) ... [2022-02-20 20:00:40,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:40" (1/1) ... [2022-02-20 20:00:40,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:40" (1/1) ... [2022-02-20 20:00:40,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:40" (1/1) ... [2022-02-20 20:00:40,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:00:40,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:00:40,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:00:40,740 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:00:40,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:40" (1/1) ... [2022-02-20 20:00:40,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:00:40,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:00:40,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 20:00:40,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 20:00:40,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:00:40,861 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 20:00:40,861 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 20:00:40,861 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 20:00:40,861 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 20:00:40,862 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 20:00:40,862 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 20:00:40,863 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 20:00:40,863 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 20:00:40,863 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 20:00:40,863 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 20:00:40,863 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 20:00:40,863 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 20:00:40,863 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 20:00:40,863 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 20:00:40,864 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 20:00:40,864 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 20:00:40,864 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 20:00:40,864 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 20:00:40,864 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 20:00:40,864 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 20:00:40,864 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 20:00:40,865 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 20:00:40,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:00:40,865 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 20:00:40,865 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 20:00:40,865 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 20:00:40,866 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 20:00:40,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:00:40,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:00:40,866 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 20:00:40,866 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 20:00:41,010 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:00:41,015 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:00:41,548 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-02-20 20:00:41,548 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-02-20 20:00:41,591 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:00:41,600 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:00:41,600 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-02-20 20:00:41,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:00:41 BoogieIcfgContainer [2022-02-20 20:00:41,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:00:41,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:00:41,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:00:41,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:00:41,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:00:40" (1/3) ... [2022-02-20 20:00:41,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250bf562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:00:41, skipping insertion in model container [2022-02-20 20:00:41,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:00:40" (2/3) ... [2022-02-20 20:00:41,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250bf562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:00:41, skipping insertion in model container [2022-02-20 20:00:41,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:00:41" (3/3) ... [2022-02-20 20:00:41,607 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.10.cil-2.c [2022-02-20 20:00:41,610 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:00:41,611 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 20:00:41,640 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:00:41,645 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 20:00:41,645 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:00:41,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 449 states, 392 states have (on average 1.6301020408163265) internal successors, (639), 398 states have internal predecessors, (639), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-02-20 20:00:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:41,675 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:41,676 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:41,676 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:41,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:41,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1246254058, now seen corresponding path program 1 times [2022-02-20 20:00:41,686 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:41,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483316316] [2022-02-20 20:00:41,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:41,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {492#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {493#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:41,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {493#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {493#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:41,933 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {493#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {454#(= ~q_read_ev~0 2)} #1721#return; {454#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:41,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {494#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {495#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:41,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {495#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {495#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:41,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {495#(= |old(~q_read_ev~0)| 0)} assume true; {495#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:41,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {495#(= |old(~q_read_ev~0)| 0)} {454#(= ~q_read_ev~0 2)} #1723#return; {453#false} is VALID [2022-02-20 20:00:41,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:41,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {452#true} havoc ~__retres1~0; {452#true} is VALID [2022-02-20 20:00:42,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#true} assume 1 == ~p_dw_pc~0; {452#true} is VALID [2022-02-20 20:00:42,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {452#true} is VALID [2022-02-20 20:00:42,008 INFO L290 TraceCheckUtils]: 3: Hoare triple {452#true} #res := ~__retres1~0; {452#true} is VALID [2022-02-20 20:00:42,008 INFO L290 TraceCheckUtils]: 4: Hoare triple {452#true} assume true; {452#true} is VALID [2022-02-20 20:00:42,009 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {452#true} {452#true} #1717#return; {452#true} is VALID [2022-02-20 20:00:42,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {452#true} havoc ~__retres1~1; {452#true} is VALID [2022-02-20 20:00:42,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#true} assume 1 == ~c_dr_pc~0; {452#true} is VALID [2022-02-20 20:00:42,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {452#true} is VALID [2022-02-20 20:00:42,018 INFO L290 TraceCheckUtils]: 3: Hoare triple {452#true} #res := ~__retres1~1; {452#true} is VALID [2022-02-20 20:00:42,019 INFO L290 TraceCheckUtils]: 4: Hoare triple {452#true} assume true; {452#true} is VALID [2022-02-20 20:00:42,019 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {452#true} {452#true} #1719#return; {452#true} is VALID [2022-02-20 20:00:42,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {496#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {452#true} is VALID [2022-02-20 20:00:42,020 INFO L272 TraceCheckUtils]: 1: Hoare triple {452#true} call #t~ret8 := is_do_write_p_triggered(); {452#true} is VALID [2022-02-20 20:00:42,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} havoc ~__retres1~0; {452#true} is VALID [2022-02-20 20:00:42,020 INFO L290 TraceCheckUtils]: 3: Hoare triple {452#true} assume 1 == ~p_dw_pc~0; {452#true} is VALID [2022-02-20 20:00:42,021 INFO L290 TraceCheckUtils]: 4: Hoare triple {452#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {452#true} is VALID [2022-02-20 20:00:42,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {452#true} #res := ~__retres1~0; {452#true} is VALID [2022-02-20 20:00:42,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {452#true} assume true; {452#true} is VALID [2022-02-20 20:00:42,022 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {452#true} {452#true} #1717#return; {452#true} is VALID [2022-02-20 20:00:42,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {452#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {452#true} is VALID [2022-02-20 20:00:42,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {452#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {452#true} is VALID [2022-02-20 20:00:42,023 INFO L272 TraceCheckUtils]: 10: Hoare triple {452#true} call #t~ret9 := is_do_read_c_triggered(); {452#true} is VALID [2022-02-20 20:00:42,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {452#true} havoc ~__retres1~1; {452#true} is VALID [2022-02-20 20:00:42,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {452#true} assume 1 == ~c_dr_pc~0; {452#true} is VALID [2022-02-20 20:00:42,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {452#true} is VALID [2022-02-20 20:00:42,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {452#true} #res := ~__retres1~1; {452#true} is VALID [2022-02-20 20:00:42,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {452#true} assume true; {452#true} is VALID [2022-02-20 20:00:42,024 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {452#true} {452#true} #1719#return; {452#true} is VALID [2022-02-20 20:00:42,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {452#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {452#true} is VALID [2022-02-20 20:00:42,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {452#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {452#true} is VALID [2022-02-20 20:00:42,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {452#true} assume true; {452#true} is VALID [2022-02-20 20:00:42,026 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {452#true} {453#false} #1725#return; {453#false} is VALID [2022-02-20 20:00:42,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {494#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {452#true} is VALID [2022-02-20 20:00:42,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {452#true} is VALID [2022-02-20 20:00:42,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} assume true; {452#true} is VALID [2022-02-20 20:00:42,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {452#true} {453#false} #1727#return; {453#false} is VALID [2022-02-20 20:00:42,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:42,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {452#true} havoc ~__retres1~2; {452#true} is VALID [2022-02-20 20:00:42,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {452#true} is VALID [2022-02-20 20:00:42,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} #res := ~__retres1~2; {452#true} is VALID [2022-02-20 20:00:42,047 INFO L290 TraceCheckUtils]: 3: Hoare triple {452#true} assume true; {452#true} is VALID [2022-02-20 20:00:42,049 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {452#true} {453#false} #1729#return; {453#false} is VALID [2022-02-20 20:00:42,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {452#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {452#true} is VALID [2022-02-20 20:00:42,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {452#true} is VALID [2022-02-20 20:00:42,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {454#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:42,052 INFO L290 TraceCheckUtils]: 3: Hoare triple {454#(= ~q_read_ev~0 2)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {454#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:42,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {454#(= ~q_read_ev~0 2)} call update_channels1(); {492#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:42,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {492#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {493#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:42,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {493#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {493#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:00:42,055 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {493#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {454#(= ~q_read_ev~0 2)} #1721#return; {454#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:42,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {454#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {454#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:42,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {454#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {454#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:42,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {454#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {454#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:42,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {454#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {454#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:00:42,058 INFO L272 TraceCheckUtils]: 12: Hoare triple {454#(= ~q_read_ev~0 2)} call fire_delta_events1(); {494#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:42,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {494#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 0 == ~q_read_ev~0;~q_read_ev~0 := 1; {495#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:42,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {495#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {495#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:42,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {495#(= |old(~q_read_ev~0)| 0)} assume true; {495#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 20:00:42,059 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {495#(= |old(~q_read_ev~0)| 0)} {454#(= ~q_read_ev~0 2)} #1723#return; {453#false} is VALID [2022-02-20 20:00:42,060 INFO L272 TraceCheckUtils]: 17: Hoare triple {453#false} call activate_threads1(); {496#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:42,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {496#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {452#true} is VALID [2022-02-20 20:00:42,060 INFO L272 TraceCheckUtils]: 19: Hoare triple {452#true} call #t~ret8 := is_do_write_p_triggered(); {452#true} is VALID [2022-02-20 20:00:42,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {452#true} havoc ~__retres1~0; {452#true} is VALID [2022-02-20 20:00:42,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {452#true} assume 1 == ~p_dw_pc~0; {452#true} is VALID [2022-02-20 20:00:42,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {452#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {452#true} is VALID [2022-02-20 20:00:42,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {452#true} #res := ~__retres1~0; {452#true} is VALID [2022-02-20 20:00:42,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {452#true} assume true; {452#true} is VALID [2022-02-20 20:00:42,061 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {452#true} {452#true} #1717#return; {452#true} is VALID [2022-02-20 20:00:42,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {452#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {452#true} is VALID [2022-02-20 20:00:42,061 INFO L290 TraceCheckUtils]: 27: Hoare triple {452#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {452#true} is VALID [2022-02-20 20:00:42,062 INFO L272 TraceCheckUtils]: 28: Hoare triple {452#true} call #t~ret9 := is_do_read_c_triggered(); {452#true} is VALID [2022-02-20 20:00:42,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {452#true} havoc ~__retres1~1; {452#true} is VALID [2022-02-20 20:00:42,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {452#true} assume 1 == ~c_dr_pc~0; {452#true} is VALID [2022-02-20 20:00:42,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {452#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {452#true} is VALID [2022-02-20 20:00:42,063 INFO L290 TraceCheckUtils]: 32: Hoare triple {452#true} #res := ~__retres1~1; {452#true} is VALID [2022-02-20 20:00:42,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {452#true} assume true; {452#true} is VALID [2022-02-20 20:00:42,063 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {452#true} {452#true} #1719#return; {452#true} is VALID [2022-02-20 20:00:42,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {452#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {452#true} is VALID [2022-02-20 20:00:42,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {452#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {452#true} is VALID [2022-02-20 20:00:42,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {452#true} assume true; {452#true} is VALID [2022-02-20 20:00:42,064 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {452#true} {453#false} #1725#return; {453#false} is VALID [2022-02-20 20:00:42,064 INFO L272 TraceCheckUtils]: 39: Hoare triple {453#false} call reset_delta_events1(); {494#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:42,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {494#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {452#true} is VALID [2022-02-20 20:00:42,064 INFO L290 TraceCheckUtils]: 41: Hoare triple {452#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {452#true} is VALID [2022-02-20 20:00:42,065 INFO L290 TraceCheckUtils]: 42: Hoare triple {452#true} assume true; {452#true} is VALID [2022-02-20 20:00:42,065 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {452#true} {453#false} #1727#return; {453#false} is VALID [2022-02-20 20:00:42,065 INFO L290 TraceCheckUtils]: 44: Hoare triple {453#false} assume !false; {453#false} is VALID [2022-02-20 20:00:42,065 INFO L290 TraceCheckUtils]: 45: Hoare triple {453#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {453#false} is VALID [2022-02-20 20:00:42,065 INFO L290 TraceCheckUtils]: 46: Hoare triple {453#false} assume !false; {453#false} is VALID [2022-02-20 20:00:42,066 INFO L272 TraceCheckUtils]: 47: Hoare triple {453#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {452#true} is VALID [2022-02-20 20:00:42,066 INFO L290 TraceCheckUtils]: 48: Hoare triple {452#true} havoc ~__retres1~2; {452#true} is VALID [2022-02-20 20:00:42,066 INFO L290 TraceCheckUtils]: 49: Hoare triple {452#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {452#true} is VALID [2022-02-20 20:00:42,066 INFO L290 TraceCheckUtils]: 50: Hoare triple {452#true} #res := ~__retres1~2; {452#true} is VALID [2022-02-20 20:00:42,066 INFO L290 TraceCheckUtils]: 51: Hoare triple {452#true} assume true; {452#true} is VALID [2022-02-20 20:00:42,068 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {452#true} {453#false} #1729#return; {453#false} is VALID [2022-02-20 20:00:42,068 INFO L290 TraceCheckUtils]: 53: Hoare triple {453#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {453#false} is VALID [2022-02-20 20:00:42,068 INFO L290 TraceCheckUtils]: 54: Hoare triple {453#false} assume 0 != eval1_~tmp___1~0#1; {453#false} is VALID [2022-02-20 20:00:42,069 INFO L290 TraceCheckUtils]: 55: Hoare triple {453#false} assume !(0 == ~p_dw_st~0); {453#false} is VALID [2022-02-20 20:00:42,069 INFO L290 TraceCheckUtils]: 56: Hoare triple {453#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {453#false} is VALID [2022-02-20 20:00:42,072 INFO L290 TraceCheckUtils]: 57: Hoare triple {453#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {453#false} is VALID [2022-02-20 20:00:42,073 INFO L290 TraceCheckUtils]: 58: Hoare triple {453#false} assume !(0 == ~c_dr_pc~0); {453#false} is VALID [2022-02-20 20:00:42,073 INFO L290 TraceCheckUtils]: 59: Hoare triple {453#false} assume 2 == ~c_dr_pc~0; {453#false} is VALID [2022-02-20 20:00:42,074 INFO L290 TraceCheckUtils]: 60: Hoare triple {453#false} do_read_c_~a~0#1 := ~a_t~0; {453#false} is VALID [2022-02-20 20:00:42,074 INFO L290 TraceCheckUtils]: 61: Hoare triple {453#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {453#false} is VALID [2022-02-20 20:00:42,075 INFO L290 TraceCheckUtils]: 62: Hoare triple {453#false} assume !(~p_last_write~0 == ~c_last_read~0); {453#false} is VALID [2022-02-20 20:00:42,075 INFO L272 TraceCheckUtils]: 63: Hoare triple {453#false} call error1(); {453#false} is VALID [2022-02-20 20:00:42,075 INFO L290 TraceCheckUtils]: 64: Hoare triple {453#false} assume !false; {453#false} is VALID [2022-02-20 20:00:42,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:42,077 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:42,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483316316] [2022-02-20 20:00:42,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483316316] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:42,078 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:42,078 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:42,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131398914] [2022-02-20 20:00:42,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:42,084 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:42,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:42,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:42,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:42,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:42,145 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:42,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:42,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:42,171 INFO L87 Difference]: Start difference. First operand has 449 states, 392 states have (on average 1.6301020408163265) internal successors, (639), 398 states have internal predecessors, (639), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:45,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:45,189 INFO L93 Difference]: Finished difference Result 1023 states and 1629 transitions. [2022-02-20 20:00:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 20:00:45,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:45,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:45,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1629 transitions. [2022-02-20 20:00:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1629 transitions. [2022-02-20 20:00:45,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1629 transitions. [2022-02-20 20:00:46,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1629 edges. 1629 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:46,518 INFO L225 Difference]: With dead ends: 1023 [2022-02-20 20:00:46,518 INFO L226 Difference]: Without dead ends: 590 [2022-02-20 20:00:46,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:00:46,538 INFO L933 BasicCegarLoop]: 688 mSDtfsCounter, 1142 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:46,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1149 Valid, 1964 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 20:00:46,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-02-20 20:00:46,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 551. [2022-02-20 20:00:46,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:46,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 590 states. Second operand has 551 states, 474 states have (on average 1.518987341772152) internal successors, (720), 480 states have internal predecessors, (720), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (56), 52 states have call predecessors, (56), 51 states have call successors, (56) [2022-02-20 20:00:46,641 INFO L74 IsIncluded]: Start isIncluded. First operand 590 states. Second operand has 551 states, 474 states have (on average 1.518987341772152) internal successors, (720), 480 states have internal predecessors, (720), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (56), 52 states have call predecessors, (56), 51 states have call successors, (56) [2022-02-20 20:00:46,643 INFO L87 Difference]: Start difference. First operand 590 states. Second operand has 551 states, 474 states have (on average 1.518987341772152) internal successors, (720), 480 states have internal predecessors, (720), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (56), 52 states have call predecessors, (56), 51 states have call successors, (56) [2022-02-20 20:00:46,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:46,675 INFO L93 Difference]: Finished difference Result 590 states and 885 transitions. [2022-02-20 20:00:46,675 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 885 transitions. [2022-02-20 20:00:46,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:46,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:46,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 551 states, 474 states have (on average 1.518987341772152) internal successors, (720), 480 states have internal predecessors, (720), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (56), 52 states have call predecessors, (56), 51 states have call successors, (56) Second operand 590 states. [2022-02-20 20:00:46,682 INFO L87 Difference]: Start difference. First operand has 551 states, 474 states have (on average 1.518987341772152) internal successors, (720), 480 states have internal predecessors, (720), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (56), 52 states have call predecessors, (56), 51 states have call successors, (56) Second operand 590 states. [2022-02-20 20:00:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:46,708 INFO L93 Difference]: Finished difference Result 590 states and 885 transitions. [2022-02-20 20:00:46,708 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 885 transitions. [2022-02-20 20:00:46,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:46,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:46,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:46,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:46,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 474 states have (on average 1.518987341772152) internal successors, (720), 480 states have internal predecessors, (720), 53 states have call successors, (53), 21 states have call predecessors, (53), 22 states have return successors, (56), 52 states have call predecessors, (56), 51 states have call successors, (56) [2022-02-20 20:00:46,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 829 transitions. [2022-02-20 20:00:46,740 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 829 transitions. Word has length 65 [2022-02-20 20:00:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:46,741 INFO L470 AbstractCegarLoop]: Abstraction has 551 states and 829 transitions. [2022-02-20 20:00:46,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 829 transitions. [2022-02-20 20:00:46,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:46,743 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:46,744 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:46,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:00:46,744 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:46,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:46,745 INFO L85 PathProgramCache]: Analyzing trace with hash 432634582, now seen corresponding path program 1 times [2022-02-20 20:00:46,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:46,746 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29234479] [2022-02-20 20:00:46,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:46,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:46,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:46,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {3831#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {3832#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:46,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {3832#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3832#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:46,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3832#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3793#(= ~q_write_ev~0 ~q_read_ev~0)} #1721#return; {3793#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:46,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:46,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {3832#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {3833#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:46,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {3833#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {3834#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:46,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {3834#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3834#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:46,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3834#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3793#(= ~q_write_ev~0 ~q_read_ev~0)} #1723#return; {3792#false} is VALID [2022-02-20 20:00:46,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:46,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:46,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {3791#true} havoc ~__retres1~0; {3791#true} is VALID [2022-02-20 20:00:46,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {3791#true} assume 1 == ~p_dw_pc~0; {3791#true} is VALID [2022-02-20 20:00:46,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {3791#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3791#true} is VALID [2022-02-20 20:00:46,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {3791#true} #res := ~__retres1~0; {3791#true} is VALID [2022-02-20 20:00:46,876 INFO L290 TraceCheckUtils]: 4: Hoare triple {3791#true} assume true; {3791#true} is VALID [2022-02-20 20:00:46,876 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3791#true} {3791#true} #1717#return; {3791#true} is VALID [2022-02-20 20:00:46,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:46,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {3791#true} havoc ~__retres1~1; {3791#true} is VALID [2022-02-20 20:00:46,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {3791#true} assume 1 == ~c_dr_pc~0; {3791#true} is VALID [2022-02-20 20:00:46,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {3791#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3791#true} is VALID [2022-02-20 20:00:46,880 INFO L290 TraceCheckUtils]: 3: Hoare triple {3791#true} #res := ~__retres1~1; {3791#true} is VALID [2022-02-20 20:00:46,880 INFO L290 TraceCheckUtils]: 4: Hoare triple {3791#true} assume true; {3791#true} is VALID [2022-02-20 20:00:46,880 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3791#true} {3791#true} #1719#return; {3791#true} is VALID [2022-02-20 20:00:46,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {3835#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {3791#true} is VALID [2022-02-20 20:00:46,881 INFO L272 TraceCheckUtils]: 1: Hoare triple {3791#true} call #t~ret8 := is_do_write_p_triggered(); {3791#true} is VALID [2022-02-20 20:00:46,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {3791#true} havoc ~__retres1~0; {3791#true} is VALID [2022-02-20 20:00:46,881 INFO L290 TraceCheckUtils]: 3: Hoare triple {3791#true} assume 1 == ~p_dw_pc~0; {3791#true} is VALID [2022-02-20 20:00:46,881 INFO L290 TraceCheckUtils]: 4: Hoare triple {3791#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3791#true} is VALID [2022-02-20 20:00:46,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {3791#true} #res := ~__retres1~0; {3791#true} is VALID [2022-02-20 20:00:46,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {3791#true} assume true; {3791#true} is VALID [2022-02-20 20:00:46,882 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3791#true} {3791#true} #1717#return; {3791#true} is VALID [2022-02-20 20:00:46,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {3791#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3791#true} is VALID [2022-02-20 20:00:46,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {3791#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3791#true} is VALID [2022-02-20 20:00:46,882 INFO L272 TraceCheckUtils]: 10: Hoare triple {3791#true} call #t~ret9 := is_do_read_c_triggered(); {3791#true} is VALID [2022-02-20 20:00:46,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {3791#true} havoc ~__retres1~1; {3791#true} is VALID [2022-02-20 20:00:46,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {3791#true} assume 1 == ~c_dr_pc~0; {3791#true} is VALID [2022-02-20 20:00:46,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {3791#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3791#true} is VALID [2022-02-20 20:00:46,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {3791#true} #res := ~__retres1~1; {3791#true} is VALID [2022-02-20 20:00:46,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {3791#true} assume true; {3791#true} is VALID [2022-02-20 20:00:46,883 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3791#true} {3791#true} #1719#return; {3791#true} is VALID [2022-02-20 20:00:46,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {3791#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3791#true} is VALID [2022-02-20 20:00:46,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {3791#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3791#true} is VALID [2022-02-20 20:00:46,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {3791#true} assume true; {3791#true} is VALID [2022-02-20 20:00:46,884 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3791#true} {3792#false} #1725#return; {3792#false} is VALID [2022-02-20 20:00:46,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:46,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {3832#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {3791#true} is VALID [2022-02-20 20:00:46,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {3791#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3791#true} is VALID [2022-02-20 20:00:46,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {3791#true} assume true; {3791#true} is VALID [2022-02-20 20:00:46,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3791#true} {3792#false} #1727#return; {3792#false} is VALID [2022-02-20 20:00:46,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:46,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {3791#true} havoc ~__retres1~2; {3791#true} is VALID [2022-02-20 20:00:46,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {3791#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3791#true} is VALID [2022-02-20 20:00:46,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {3791#true} #res := ~__retres1~2; {3791#true} is VALID [2022-02-20 20:00:46,892 INFO L290 TraceCheckUtils]: 3: Hoare triple {3791#true} assume true; {3791#true} is VALID [2022-02-20 20:00:46,892 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3791#true} {3792#false} #1729#return; {3792#false} is VALID [2022-02-20 20:00:46,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {3791#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {3791#true} is VALID [2022-02-20 20:00:46,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {3791#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {3791#true} is VALID [2022-02-20 20:00:46,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {3791#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {3793#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:46,894 INFO L290 TraceCheckUtils]: 3: Hoare triple {3793#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {3793#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:46,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {3793#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {3831#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:46,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {3831#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {3832#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:46,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {3832#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3832#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:46,896 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3832#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3793#(= ~q_write_ev~0 ~q_read_ev~0)} #1721#return; {3793#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:46,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {3793#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {3793#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:46,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {3793#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3793#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:46,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {3793#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3793#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:46,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {3793#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {3793#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:00:46,897 INFO L272 TraceCheckUtils]: 12: Hoare triple {3793#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {3832#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:46,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {3832#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {3833#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:46,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {3833#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {3834#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:46,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {3834#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3834#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:00:46,899 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3834#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3793#(= ~q_write_ev~0 ~q_read_ev~0)} #1723#return; {3792#false} is VALID [2022-02-20 20:00:46,899 INFO L272 TraceCheckUtils]: 17: Hoare triple {3792#false} call activate_threads1(); {3835#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:46,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {3835#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {3791#true} is VALID [2022-02-20 20:00:46,900 INFO L272 TraceCheckUtils]: 19: Hoare triple {3791#true} call #t~ret8 := is_do_write_p_triggered(); {3791#true} is VALID [2022-02-20 20:00:46,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {3791#true} havoc ~__retres1~0; {3791#true} is VALID [2022-02-20 20:00:46,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {3791#true} assume 1 == ~p_dw_pc~0; {3791#true} is VALID [2022-02-20 20:00:46,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {3791#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {3791#true} is VALID [2022-02-20 20:00:46,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {3791#true} #res := ~__retres1~0; {3791#true} is VALID [2022-02-20 20:00:46,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {3791#true} assume true; {3791#true} is VALID [2022-02-20 20:00:46,901 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3791#true} {3791#true} #1717#return; {3791#true} is VALID [2022-02-20 20:00:46,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {3791#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3791#true} is VALID [2022-02-20 20:00:46,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {3791#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3791#true} is VALID [2022-02-20 20:00:46,901 INFO L272 TraceCheckUtils]: 28: Hoare triple {3791#true} call #t~ret9 := is_do_read_c_triggered(); {3791#true} is VALID [2022-02-20 20:00:46,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {3791#true} havoc ~__retres1~1; {3791#true} is VALID [2022-02-20 20:00:46,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {3791#true} assume 1 == ~c_dr_pc~0; {3791#true} is VALID [2022-02-20 20:00:46,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {3791#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {3791#true} is VALID [2022-02-20 20:00:46,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {3791#true} #res := ~__retres1~1; {3791#true} is VALID [2022-02-20 20:00:46,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {3791#true} assume true; {3791#true} is VALID [2022-02-20 20:00:46,902 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3791#true} {3791#true} #1719#return; {3791#true} is VALID [2022-02-20 20:00:46,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {3791#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3791#true} is VALID [2022-02-20 20:00:46,902 INFO L290 TraceCheckUtils]: 36: Hoare triple {3791#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3791#true} is VALID [2022-02-20 20:00:46,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {3791#true} assume true; {3791#true} is VALID [2022-02-20 20:00:46,903 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3791#true} {3792#false} #1725#return; {3792#false} is VALID [2022-02-20 20:00:46,903 INFO L272 TraceCheckUtils]: 39: Hoare triple {3792#false} call reset_delta_events1(); {3832#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:46,903 INFO L290 TraceCheckUtils]: 40: Hoare triple {3832#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {3791#true} is VALID [2022-02-20 20:00:46,903 INFO L290 TraceCheckUtils]: 41: Hoare triple {3791#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3791#true} is VALID [2022-02-20 20:00:46,903 INFO L290 TraceCheckUtils]: 42: Hoare triple {3791#true} assume true; {3791#true} is VALID [2022-02-20 20:00:46,904 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3791#true} {3792#false} #1727#return; {3792#false} is VALID [2022-02-20 20:00:46,904 INFO L290 TraceCheckUtils]: 44: Hoare triple {3792#false} assume !false; {3792#false} is VALID [2022-02-20 20:00:46,904 INFO L290 TraceCheckUtils]: 45: Hoare triple {3792#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {3792#false} is VALID [2022-02-20 20:00:46,904 INFO L290 TraceCheckUtils]: 46: Hoare triple {3792#false} assume !false; {3792#false} is VALID [2022-02-20 20:00:46,904 INFO L272 TraceCheckUtils]: 47: Hoare triple {3792#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3791#true} is VALID [2022-02-20 20:00:46,904 INFO L290 TraceCheckUtils]: 48: Hoare triple {3791#true} havoc ~__retres1~2; {3791#true} is VALID [2022-02-20 20:00:46,905 INFO L290 TraceCheckUtils]: 49: Hoare triple {3791#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3791#true} is VALID [2022-02-20 20:00:46,905 INFO L290 TraceCheckUtils]: 50: Hoare triple {3791#true} #res := ~__retres1~2; {3791#true} is VALID [2022-02-20 20:00:46,905 INFO L290 TraceCheckUtils]: 51: Hoare triple {3791#true} assume true; {3791#true} is VALID [2022-02-20 20:00:46,905 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3791#true} {3792#false} #1729#return; {3792#false} is VALID [2022-02-20 20:00:46,905 INFO L290 TraceCheckUtils]: 53: Hoare triple {3792#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {3792#false} is VALID [2022-02-20 20:00:46,906 INFO L290 TraceCheckUtils]: 54: Hoare triple {3792#false} assume 0 != eval1_~tmp___1~0#1; {3792#false} is VALID [2022-02-20 20:00:46,906 INFO L290 TraceCheckUtils]: 55: Hoare triple {3792#false} assume !(0 == ~p_dw_st~0); {3792#false} is VALID [2022-02-20 20:00:46,906 INFO L290 TraceCheckUtils]: 56: Hoare triple {3792#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {3792#false} is VALID [2022-02-20 20:00:46,906 INFO L290 TraceCheckUtils]: 57: Hoare triple {3792#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {3792#false} is VALID [2022-02-20 20:00:46,906 INFO L290 TraceCheckUtils]: 58: Hoare triple {3792#false} assume !(0 == ~c_dr_pc~0); {3792#false} is VALID [2022-02-20 20:00:46,907 INFO L290 TraceCheckUtils]: 59: Hoare triple {3792#false} assume 2 == ~c_dr_pc~0; {3792#false} is VALID [2022-02-20 20:00:46,907 INFO L290 TraceCheckUtils]: 60: Hoare triple {3792#false} do_read_c_~a~0#1 := ~a_t~0; {3792#false} is VALID [2022-02-20 20:00:46,907 INFO L290 TraceCheckUtils]: 61: Hoare triple {3792#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {3792#false} is VALID [2022-02-20 20:00:46,907 INFO L290 TraceCheckUtils]: 62: Hoare triple {3792#false} assume !(~p_last_write~0 == ~c_last_read~0); {3792#false} is VALID [2022-02-20 20:00:46,907 INFO L272 TraceCheckUtils]: 63: Hoare triple {3792#false} call error1(); {3792#false} is VALID [2022-02-20 20:00:46,907 INFO L290 TraceCheckUtils]: 64: Hoare triple {3792#false} assume !false; {3792#false} is VALID [2022-02-20 20:00:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:46,908 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:46,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29234479] [2022-02-20 20:00:46,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29234479] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:46,908 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:46,909 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:00:46,909 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777666967] [2022-02-20 20:00:46,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:46,910 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:46,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:46,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:46,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:46,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:00:46,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:46,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:00:46,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:00:46,955 INFO L87 Difference]: Start difference. First operand 551 states and 829 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:50,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:50,580 INFO L93 Difference]: Finished difference Result 948 states and 1395 transitions. [2022-02-20 20:00:50,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 20:00:50,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 20:00:50,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:50,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1071 transitions. [2022-02-20 20:00:50,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:50,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1071 transitions. [2022-02-20 20:00:50,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1071 transitions. [2022-02-20 20:00:51,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1071 edges. 1071 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:51,245 INFO L225 Difference]: With dead ends: 948 [2022-02-20 20:00:51,251 INFO L226 Difference]: Without dead ends: 739 [2022-02-20 20:00:51,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 20:00:51,258 INFO L933 BasicCegarLoop]: 750 mSDtfsCounter, 1632 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1663 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:51,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1663 Valid, 2266 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 20:00:51,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-02-20 20:00:51,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 663. [2022-02-20 20:00:51,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:51,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 739 states. Second operand has 663 states, 564 states have (on average 1.5) internal successors, (846), 572 states have internal predecessors, (846), 66 states have call successors, (66), 28 states have call predecessors, (66), 31 states have return successors, (77), 66 states have call predecessors, (77), 64 states have call successors, (77) [2022-02-20 20:00:51,321 INFO L74 IsIncluded]: Start isIncluded. First operand 739 states. Second operand has 663 states, 564 states have (on average 1.5) internal successors, (846), 572 states have internal predecessors, (846), 66 states have call successors, (66), 28 states have call predecessors, (66), 31 states have return successors, (77), 66 states have call predecessors, (77), 64 states have call successors, (77) [2022-02-20 20:00:51,322 INFO L87 Difference]: Start difference. First operand 739 states. Second operand has 663 states, 564 states have (on average 1.5) internal successors, (846), 572 states have internal predecessors, (846), 66 states have call successors, (66), 28 states have call predecessors, (66), 31 states have return successors, (77), 66 states have call predecessors, (77), 64 states have call successors, (77) [2022-02-20 20:00:51,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:51,395 INFO L93 Difference]: Finished difference Result 739 states and 1103 transitions. [2022-02-20 20:00:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1103 transitions. [2022-02-20 20:00:51,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:51,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:51,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 663 states, 564 states have (on average 1.5) internal successors, (846), 572 states have internal predecessors, (846), 66 states have call successors, (66), 28 states have call predecessors, (66), 31 states have return successors, (77), 66 states have call predecessors, (77), 64 states have call successors, (77) Second operand 739 states. [2022-02-20 20:00:51,401 INFO L87 Difference]: Start difference. First operand has 663 states, 564 states have (on average 1.5) internal successors, (846), 572 states have internal predecessors, (846), 66 states have call successors, (66), 28 states have call predecessors, (66), 31 states have return successors, (77), 66 states have call predecessors, (77), 64 states have call successors, (77) Second operand 739 states. [2022-02-20 20:00:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:51,462 INFO L93 Difference]: Finished difference Result 739 states and 1103 transitions. [2022-02-20 20:00:51,462 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1103 transitions. [2022-02-20 20:00:51,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:51,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:51,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:51,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 564 states have (on average 1.5) internal successors, (846), 572 states have internal predecessors, (846), 66 states have call successors, (66), 28 states have call predecessors, (66), 31 states have return successors, (77), 66 states have call predecessors, (77), 64 states have call successors, (77) [2022-02-20 20:00:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 989 transitions. [2022-02-20 20:00:51,510 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 989 transitions. Word has length 65 [2022-02-20 20:00:51,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:51,510 INFO L470 AbstractCegarLoop]: Abstraction has 663 states and 989 transitions. [2022-02-20 20:00:51,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:00:51,510 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 989 transitions. [2022-02-20 20:00:51,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 20:00:51,511 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:51,511 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:51,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:00:51,512 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:51,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:51,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1595951528, now seen corresponding path program 1 times [2022-02-20 20:00:51,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:51,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193054159] [2022-02-20 20:00:51,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:51,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:51,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:51,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {7536#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {7537#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:51,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {7537#(not (= |old(~q_req_up~0)| 1))} assume true; {7537#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:51,568 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7537#(not (= |old(~q_req_up~0)| 1))} {7497#(= ~q_req_up~0 ~p_dw_pc~0)} #1721#return; {7501#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:51,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:51,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {7538#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {7494#true} is VALID [2022-02-20 20:00:51,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {7494#true} assume !(0 == ~q_write_ev~0); {7494#true} is VALID [2022-02-20 20:00:51,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {7494#true} assume true; {7494#true} is VALID [2022-02-20 20:00:51,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7494#true} {7501#(not (= ~p_dw_pc~0 1))} #1723#return; {7501#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:51,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:51,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:51,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {7494#true} havoc ~__retres1~0; {7494#true} is VALID [2022-02-20 20:00:51,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {7494#true} assume 1 == ~p_dw_pc~0; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,605 INFO L290 TraceCheckUtils]: 3: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,606 INFO L290 TraceCheckUtils]: 4: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,606 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} {7494#true} #1717#return; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:00:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:51,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {7494#true} havoc ~__retres1~1; {7494#true} is VALID [2022-02-20 20:00:51,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {7494#true} assume 1 == ~c_dr_pc~0; {7494#true} is VALID [2022-02-20 20:00:51,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {7494#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {7494#true} is VALID [2022-02-20 20:00:51,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {7494#true} #res := ~__retres1~1; {7494#true} is VALID [2022-02-20 20:00:51,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {7494#true} assume true; {7494#true} is VALID [2022-02-20 20:00:51,610 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7494#true} {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} #1719#return; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {7539#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {7494#true} is VALID [2022-02-20 20:00:51,611 INFO L272 TraceCheckUtils]: 1: Hoare triple {7494#true} call #t~ret8 := is_do_write_p_triggered(); {7494#true} is VALID [2022-02-20 20:00:51,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {7494#true} havoc ~__retres1~0; {7494#true} is VALID [2022-02-20 20:00:51,611 INFO L290 TraceCheckUtils]: 3: Hoare triple {7494#true} assume 1 == ~p_dw_pc~0; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,611 INFO L290 TraceCheckUtils]: 4: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,613 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} {7494#true} #1717#return; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,614 INFO L272 TraceCheckUtils]: 10: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {7494#true} is VALID [2022-02-20 20:00:51,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {7494#true} havoc ~__retres1~1; {7494#true} is VALID [2022-02-20 20:00:51,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {7494#true} assume 1 == ~c_dr_pc~0; {7494#true} is VALID [2022-02-20 20:00:51,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {7494#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {7494#true} is VALID [2022-02-20 20:00:51,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {7494#true} #res := ~__retres1~1; {7494#true} is VALID [2022-02-20 20:00:51,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {7494#true} assume true; {7494#true} is VALID [2022-02-20 20:00:51,615 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7494#true} {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} #1719#return; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,616 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} {7501#(not (= ~p_dw_pc~0 1))} #1725#return; {7495#false} is VALID [2022-02-20 20:00:51,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 20:00:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:51,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {7538#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {7494#true} is VALID [2022-02-20 20:00:51,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {7494#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7494#true} is VALID [2022-02-20 20:00:51,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {7494#true} assume true; {7494#true} is VALID [2022-02-20 20:00:51,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7494#true} {7495#false} #1727#return; {7495#false} is VALID [2022-02-20 20:00:51,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 20:00:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:51,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {7494#true} havoc ~__retres1~2; {7494#true} is VALID [2022-02-20 20:00:51,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {7494#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7494#true} is VALID [2022-02-20 20:00:51,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {7494#true} #res := ~__retres1~2; {7494#true} is VALID [2022-02-20 20:00:51,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {7494#true} assume true; {7494#true} is VALID [2022-02-20 20:00:51,623 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7494#true} {7495#false} #1729#return; {7495#false} is VALID [2022-02-20 20:00:51,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {7494#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {7496#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:51,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {7496#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {7496#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:00:51,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {7496#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {7497#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:51,625 INFO L290 TraceCheckUtils]: 3: Hoare triple {7497#(= ~q_req_up~0 ~p_dw_pc~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {7497#(= ~q_req_up~0 ~p_dw_pc~0)} is VALID [2022-02-20 20:00:51,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {7497#(= ~q_req_up~0 ~p_dw_pc~0)} call update_channels1(); {7536#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:51,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {7536#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {7537#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:51,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {7537#(not (= |old(~q_req_up~0)| 1))} assume true; {7537#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:00:51,626 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7537#(not (= |old(~q_req_up~0)| 1))} {7497#(= ~q_req_up~0 ~p_dw_pc~0)} #1721#return; {7501#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:51,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {7501#(not (= ~p_dw_pc~0 1))} assume { :begin_inline_init_threads1 } true; {7501#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:51,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {7501#(not (= ~p_dw_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7501#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:51,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {7501#(not (= ~p_dw_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7501#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:51,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {7501#(not (= ~p_dw_pc~0 1))} assume { :end_inline_init_threads1 } true; {7501#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:51,628 INFO L272 TraceCheckUtils]: 12: Hoare triple {7501#(not (= ~p_dw_pc~0 1))} call fire_delta_events1(); {7538#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:51,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {7538#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {7494#true} is VALID [2022-02-20 20:00:51,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {7494#true} assume !(0 == ~q_write_ev~0); {7494#true} is VALID [2022-02-20 20:00:51,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {7494#true} assume true; {7494#true} is VALID [2022-02-20 20:00:51,629 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7494#true} {7501#(not (= ~p_dw_pc~0 1))} #1723#return; {7501#(not (= ~p_dw_pc~0 1))} is VALID [2022-02-20 20:00:51,629 INFO L272 TraceCheckUtils]: 17: Hoare triple {7501#(not (= ~p_dw_pc~0 1))} call activate_threads1(); {7539#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:51,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {7539#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {7494#true} is VALID [2022-02-20 20:00:51,629 INFO L272 TraceCheckUtils]: 19: Hoare triple {7494#true} call #t~ret8 := is_do_write_p_triggered(); {7494#true} is VALID [2022-02-20 20:00:51,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {7494#true} havoc ~__retres1~0; {7494#true} is VALID [2022-02-20 20:00:51,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {7494#true} assume 1 == ~p_dw_pc~0; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} #res := ~__retres1~0; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,631 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} {7494#true} #1717#return; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,632 INFO L272 TraceCheckUtils]: 28: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} call #t~ret9 := is_do_read_c_triggered(); {7494#true} is VALID [2022-02-20 20:00:51,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {7494#true} havoc ~__retres1~1; {7494#true} is VALID [2022-02-20 20:00:51,633 INFO L290 TraceCheckUtils]: 30: Hoare triple {7494#true} assume 1 == ~c_dr_pc~0; {7494#true} is VALID [2022-02-20 20:00:51,633 INFO L290 TraceCheckUtils]: 31: Hoare triple {7494#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {7494#true} is VALID [2022-02-20 20:00:51,633 INFO L290 TraceCheckUtils]: 32: Hoare triple {7494#true} #res := ~__retres1~1; {7494#true} is VALID [2022-02-20 20:00:51,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {7494#true} assume true; {7494#true} is VALID [2022-02-20 20:00:51,633 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7494#true} {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} #1719#return; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,634 INFO L290 TraceCheckUtils]: 35: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,634 INFO L290 TraceCheckUtils]: 36: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} assume true; {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} is VALID [2022-02-20 20:00:51,635 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7546#(= (+ (- 1) ~p_dw_pc~0) 0)} {7501#(not (= ~p_dw_pc~0 1))} #1725#return; {7495#false} is VALID [2022-02-20 20:00:51,635 INFO L272 TraceCheckUtils]: 39: Hoare triple {7495#false} call reset_delta_events1(); {7538#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:51,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {7538#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {7494#true} is VALID [2022-02-20 20:00:51,635 INFO L290 TraceCheckUtils]: 41: Hoare triple {7494#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7494#true} is VALID [2022-02-20 20:00:51,635 INFO L290 TraceCheckUtils]: 42: Hoare triple {7494#true} assume true; {7494#true} is VALID [2022-02-20 20:00:51,636 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7494#true} {7495#false} #1727#return; {7495#false} is VALID [2022-02-20 20:00:51,636 INFO L290 TraceCheckUtils]: 44: Hoare triple {7495#false} assume !false; {7495#false} is VALID [2022-02-20 20:00:51,636 INFO L290 TraceCheckUtils]: 45: Hoare triple {7495#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {7495#false} is VALID [2022-02-20 20:00:51,636 INFO L290 TraceCheckUtils]: 46: Hoare triple {7495#false} assume !false; {7495#false} is VALID [2022-02-20 20:00:51,636 INFO L272 TraceCheckUtils]: 47: Hoare triple {7495#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7494#true} is VALID [2022-02-20 20:00:51,636 INFO L290 TraceCheckUtils]: 48: Hoare triple {7494#true} havoc ~__retres1~2; {7494#true} is VALID [2022-02-20 20:00:51,636 INFO L290 TraceCheckUtils]: 49: Hoare triple {7494#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7494#true} is VALID [2022-02-20 20:00:51,637 INFO L290 TraceCheckUtils]: 50: Hoare triple {7494#true} #res := ~__retres1~2; {7494#true} is VALID [2022-02-20 20:00:51,637 INFO L290 TraceCheckUtils]: 51: Hoare triple {7494#true} assume true; {7494#true} is VALID [2022-02-20 20:00:51,637 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7494#true} {7495#false} #1729#return; {7495#false} is VALID [2022-02-20 20:00:51,637 INFO L290 TraceCheckUtils]: 53: Hoare triple {7495#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {7495#false} is VALID [2022-02-20 20:00:51,637 INFO L290 TraceCheckUtils]: 54: Hoare triple {7495#false} assume 0 != eval1_~tmp___1~0#1; {7495#false} is VALID [2022-02-20 20:00:51,637 INFO L290 TraceCheckUtils]: 55: Hoare triple {7495#false} assume !(0 == ~p_dw_st~0); {7495#false} is VALID [2022-02-20 20:00:51,637 INFO L290 TraceCheckUtils]: 56: Hoare triple {7495#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {7495#false} is VALID [2022-02-20 20:00:51,638 INFO L290 TraceCheckUtils]: 57: Hoare triple {7495#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {7495#false} is VALID [2022-02-20 20:00:51,638 INFO L290 TraceCheckUtils]: 58: Hoare triple {7495#false} assume !(0 == ~c_dr_pc~0); {7495#false} is VALID [2022-02-20 20:00:51,638 INFO L290 TraceCheckUtils]: 59: Hoare triple {7495#false} assume 2 == ~c_dr_pc~0; {7495#false} is VALID [2022-02-20 20:00:51,638 INFO L290 TraceCheckUtils]: 60: Hoare triple {7495#false} do_read_c_~a~0#1 := ~a_t~0; {7495#false} is VALID [2022-02-20 20:00:51,638 INFO L290 TraceCheckUtils]: 61: Hoare triple {7495#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {7495#false} is VALID [2022-02-20 20:00:51,638 INFO L290 TraceCheckUtils]: 62: Hoare triple {7495#false} assume !(~p_last_write~0 == ~c_last_read~0); {7495#false} is VALID [2022-02-20 20:00:51,638 INFO L272 TraceCheckUtils]: 63: Hoare triple {7495#false} call error1(); {7495#false} is VALID [2022-02-20 20:00:51,638 INFO L290 TraceCheckUtils]: 64: Hoare triple {7495#false} assume !false; {7495#false} is VALID [2022-02-20 20:00:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:51,639 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:51,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193054159] [2022-02-20 20:00:51,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193054159] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:51,639 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:51,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:00:51,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447753189] [2022-02-20 20:00:51,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:51,640 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 20:00:51,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:51,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:51,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:51,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:00:51,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:51,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:00:51,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:00:51,678 INFO L87 Difference]: Start difference. First operand 663 states and 989 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:57,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:57,232 INFO L93 Difference]: Finished difference Result 2209 states and 3187 transitions. [2022-02-20 20:00:57,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:00:57,233 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-02-20 20:00:57,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:00:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1476 transitions. [2022-02-20 20:00:57,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:57,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1476 transitions. [2022-02-20 20:00:57,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1476 transitions. [2022-02-20 20:00:58,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1476 edges. 1476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:58,580 INFO L225 Difference]: With dead ends: 2209 [2022-02-20 20:00:58,580 INFO L226 Difference]: Without dead ends: 1876 [2022-02-20 20:00:58,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:00:58,588 INFO L933 BasicCegarLoop]: 806 mSDtfsCounter, 3489 mSDsluCounter, 2169 mSDsCounter, 0 mSdLazyCounter, 1880 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3507 SdHoareTripleChecker+Valid, 2975 SdHoareTripleChecker+Invalid, 2531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 1880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 20:00:58,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3507 Valid, 2975 Invalid, 2531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 1880 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 20:00:58,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2022-02-20 20:00:58,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1716. [2022-02-20 20:00:58,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:00:58,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1876 states. Second operand has 1716 states, 1412 states have (on average 1.4093484419263456) internal successors, (1990), 1435 states have internal predecessors, (1990), 176 states have call successors, (176), 111 states have call predecessors, (176), 126 states have return successors, (210), 172 states have call predecessors, (210), 174 states have call successors, (210) [2022-02-20 20:00:58,652 INFO L74 IsIncluded]: Start isIncluded. First operand 1876 states. Second operand has 1716 states, 1412 states have (on average 1.4093484419263456) internal successors, (1990), 1435 states have internal predecessors, (1990), 176 states have call successors, (176), 111 states have call predecessors, (176), 126 states have return successors, (210), 172 states have call predecessors, (210), 174 states have call successors, (210) [2022-02-20 20:00:58,655 INFO L87 Difference]: Start difference. First operand 1876 states. Second operand has 1716 states, 1412 states have (on average 1.4093484419263456) internal successors, (1990), 1435 states have internal predecessors, (1990), 176 states have call successors, (176), 111 states have call predecessors, (176), 126 states have return successors, (210), 172 states have call predecessors, (210), 174 states have call successors, (210) [2022-02-20 20:00:58,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:58,784 INFO L93 Difference]: Finished difference Result 1876 states and 2588 transitions. [2022-02-20 20:00:58,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2588 transitions. [2022-02-20 20:00:58,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:58,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:58,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 1716 states, 1412 states have (on average 1.4093484419263456) internal successors, (1990), 1435 states have internal predecessors, (1990), 176 states have call successors, (176), 111 states have call predecessors, (176), 126 states have return successors, (210), 172 states have call predecessors, (210), 174 states have call successors, (210) Second operand 1876 states. [2022-02-20 20:00:58,795 INFO L87 Difference]: Start difference. First operand has 1716 states, 1412 states have (on average 1.4093484419263456) internal successors, (1990), 1435 states have internal predecessors, (1990), 176 states have call successors, (176), 111 states have call predecessors, (176), 126 states have return successors, (210), 172 states have call predecessors, (210), 174 states have call successors, (210) Second operand 1876 states. [2022-02-20 20:00:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:00:58,916 INFO L93 Difference]: Finished difference Result 1876 states and 2588 transitions. [2022-02-20 20:00:58,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2588 transitions. [2022-02-20 20:00:58,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:00:58,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:00:58,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:00:58,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:00:58,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1412 states have (on average 1.4093484419263456) internal successors, (1990), 1435 states have internal predecessors, (1990), 176 states have call successors, (176), 111 states have call predecessors, (176), 126 states have return successors, (210), 172 states have call predecessors, (210), 174 states have call successors, (210) [2022-02-20 20:00:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2376 transitions. [2022-02-20 20:00:59,073 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2376 transitions. Word has length 65 [2022-02-20 20:00:59,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:00:59,073 INFO L470 AbstractCegarLoop]: Abstraction has 1716 states and 2376 transitions. [2022-02-20 20:00:59,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-02-20 20:00:59,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2376 transitions. [2022-02-20 20:00:59,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:00:59,076 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:00:59,076 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:00:59,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:00:59,076 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:00:59,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:00:59,077 INFO L85 PathProgramCache]: Analyzing trace with hash -31119566, now seen corresponding path program 1 times [2022-02-20 20:00:59,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:00:59,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957287230] [2022-02-20 20:00:59,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:00:59,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:00:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:00:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {16680#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {16640#true} is VALID [2022-02-20 20:00:59,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {16640#true} assume true; {16640#true} is VALID [2022-02-20 20:00:59,130 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16640#true} {16640#true} #1721#return; {16640#true} is VALID [2022-02-20 20:00:59,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:00:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {16681#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {16640#true} is VALID [2022-02-20 20:00:59,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {16640#true} assume !(0 == ~q_write_ev~0); {16640#true} is VALID [2022-02-20 20:00:59,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {16640#true} assume true; {16640#true} is VALID [2022-02-20 20:00:59,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16640#true} {16640#true} #1723#return; {16640#true} is VALID [2022-02-20 20:00:59,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:00:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:00:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {16640#true} havoc ~__retres1~0; {16640#true} is VALID [2022-02-20 20:00:59,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {16640#true} assume !(1 == ~p_dw_pc~0); {16640#true} is VALID [2022-02-20 20:00:59,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {16640#true} assume !(2 == ~p_dw_pc~0); {16640#true} is VALID [2022-02-20 20:00:59,232 INFO L290 TraceCheckUtils]: 3: Hoare triple {16640#true} ~__retres1~0 := 0; {16698#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:59,233 INFO L290 TraceCheckUtils]: 4: Hoare triple {16698#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {16699#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:59,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {16699#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {16699#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:59,234 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {16699#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {16640#true} #1717#return; {16690#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:59,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:00:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {16640#true} havoc ~__retres1~1; {16640#true} is VALID [2022-02-20 20:00:59,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {16640#true} assume 1 == ~c_dr_pc~0; {16640#true} is VALID [2022-02-20 20:00:59,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {16640#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {16640#true} is VALID [2022-02-20 20:00:59,240 INFO L290 TraceCheckUtils]: 3: Hoare triple {16640#true} #res := ~__retres1~1; {16640#true} is VALID [2022-02-20 20:00:59,240 INFO L290 TraceCheckUtils]: 4: Hoare triple {16640#true} assume true; {16640#true} is VALID [2022-02-20 20:00:59,240 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {16640#true} {16641#false} #1719#return; {16641#false} is VALID [2022-02-20 20:00:59,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {16682#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {16640#true} is VALID [2022-02-20 20:00:59,240 INFO L272 TraceCheckUtils]: 1: Hoare triple {16640#true} call #t~ret8 := is_do_write_p_triggered(); {16640#true} is VALID [2022-02-20 20:00:59,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {16640#true} havoc ~__retres1~0; {16640#true} is VALID [2022-02-20 20:00:59,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {16640#true} assume !(1 == ~p_dw_pc~0); {16640#true} is VALID [2022-02-20 20:00:59,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {16640#true} assume !(2 == ~p_dw_pc~0); {16640#true} is VALID [2022-02-20 20:00:59,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {16640#true} ~__retres1~0 := 0; {16698#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:59,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {16698#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {16699#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:59,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {16699#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {16699#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:59,244 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16699#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {16640#true} #1717#return; {16690#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:59,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {16690#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {16691#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:00:59,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {16691#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {16641#false} is VALID [2022-02-20 20:00:59,249 INFO L272 TraceCheckUtils]: 11: Hoare triple {16641#false} call #t~ret9 := is_do_read_c_triggered(); {16640#true} is VALID [2022-02-20 20:00:59,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {16640#true} havoc ~__retres1~1; {16640#true} is VALID [2022-02-20 20:00:59,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {16640#true} assume 1 == ~c_dr_pc~0; {16640#true} is VALID [2022-02-20 20:00:59,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {16640#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {16640#true} is VALID [2022-02-20 20:00:59,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {16640#true} #res := ~__retres1~1; {16640#true} is VALID [2022-02-20 20:00:59,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {16640#true} assume true; {16640#true} is VALID [2022-02-20 20:00:59,251 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16640#true} {16641#false} #1719#return; {16641#false} is VALID [2022-02-20 20:00:59,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {16641#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {16641#false} is VALID [2022-02-20 20:00:59,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {16641#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {16641#false} is VALID [2022-02-20 20:00:59,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {16641#false} assume true; {16641#false} is VALID [2022-02-20 20:00:59,253 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16641#false} {16640#true} #1725#return; {16641#false} is VALID [2022-02-20 20:00:59,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:00:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {16681#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {16640#true} is VALID [2022-02-20 20:00:59,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {16640#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {16640#true} is VALID [2022-02-20 20:00:59,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {16640#true} assume true; {16640#true} is VALID [2022-02-20 20:00:59,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16640#true} {16641#false} #1727#return; {16641#false} is VALID [2022-02-20 20:00:59,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:00:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:00:59,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {16640#true} havoc ~__retres1~2; {16640#true} is VALID [2022-02-20 20:00:59,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {16640#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {16640#true} is VALID [2022-02-20 20:00:59,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {16640#true} #res := ~__retres1~2; {16640#true} is VALID [2022-02-20 20:00:59,265 INFO L290 TraceCheckUtils]: 3: Hoare triple {16640#true} assume true; {16640#true} is VALID [2022-02-20 20:00:59,265 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16640#true} {16641#false} #1729#return; {16641#false} is VALID [2022-02-20 20:00:59,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {16640#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {16640#true} is VALID [2022-02-20 20:00:59,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {16640#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {16640#true} is VALID [2022-02-20 20:00:59,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {16640#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {16640#true} is VALID [2022-02-20 20:00:59,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {16640#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {16640#true} is VALID [2022-02-20 20:00:59,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {16640#true} call update_channels1(); {16680#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:00:59,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {16680#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {16640#true} is VALID [2022-02-20 20:00:59,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {16640#true} assume true; {16640#true} is VALID [2022-02-20 20:00:59,267 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16640#true} {16640#true} #1721#return; {16640#true} is VALID [2022-02-20 20:00:59,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {16640#true} assume { :begin_inline_init_threads1 } true; {16640#true} is VALID [2022-02-20 20:00:59,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {16640#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {16640#true} is VALID [2022-02-20 20:00:59,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {16640#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {16640#true} is VALID [2022-02-20 20:00:59,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {16640#true} assume { :end_inline_init_threads1 } true; {16640#true} is VALID [2022-02-20 20:00:59,269 INFO L272 TraceCheckUtils]: 12: Hoare triple {16640#true} call fire_delta_events1(); {16681#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:59,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {16681#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {16640#true} is VALID [2022-02-20 20:00:59,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {16640#true} assume !(0 == ~q_write_ev~0); {16640#true} is VALID [2022-02-20 20:00:59,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {16640#true} assume true; {16640#true} is VALID [2022-02-20 20:00:59,269 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16640#true} {16640#true} #1723#return; {16640#true} is VALID [2022-02-20 20:00:59,270 INFO L272 TraceCheckUtils]: 17: Hoare triple {16640#true} call activate_threads1(); {16682#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:00:59,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {16682#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {16640#true} is VALID [2022-02-20 20:00:59,270 INFO L272 TraceCheckUtils]: 19: Hoare triple {16640#true} call #t~ret8 := is_do_write_p_triggered(); {16640#true} is VALID [2022-02-20 20:00:59,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {16640#true} havoc ~__retres1~0; {16640#true} is VALID [2022-02-20 20:00:59,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {16640#true} assume !(1 == ~p_dw_pc~0); {16640#true} is VALID [2022-02-20 20:00:59,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {16640#true} assume !(2 == ~p_dw_pc~0); {16640#true} is VALID [2022-02-20 20:00:59,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {16640#true} ~__retres1~0 := 0; {16698#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 20:00:59,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {16698#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {16699#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:59,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {16699#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {16699#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 20:00:59,272 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16699#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {16640#true} #1717#return; {16690#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 20:00:59,272 INFO L290 TraceCheckUtils]: 27: Hoare triple {16690#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {16691#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 20:00:59,273 INFO L290 TraceCheckUtils]: 28: Hoare triple {16691#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {16641#false} is VALID [2022-02-20 20:00:59,273 INFO L272 TraceCheckUtils]: 29: Hoare triple {16641#false} call #t~ret9 := is_do_read_c_triggered(); {16640#true} is VALID [2022-02-20 20:00:59,273 INFO L290 TraceCheckUtils]: 30: Hoare triple {16640#true} havoc ~__retres1~1; {16640#true} is VALID [2022-02-20 20:00:59,273 INFO L290 TraceCheckUtils]: 31: Hoare triple {16640#true} assume 1 == ~c_dr_pc~0; {16640#true} is VALID [2022-02-20 20:00:59,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {16640#true} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {16640#true} is VALID [2022-02-20 20:00:59,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {16640#true} #res := ~__retres1~1; {16640#true} is VALID [2022-02-20 20:00:59,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {16640#true} assume true; {16640#true} is VALID [2022-02-20 20:00:59,274 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16640#true} {16641#false} #1719#return; {16641#false} is VALID [2022-02-20 20:00:59,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {16641#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {16641#false} is VALID [2022-02-20 20:00:59,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {16641#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {16641#false} is VALID [2022-02-20 20:00:59,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {16641#false} assume true; {16641#false} is VALID [2022-02-20 20:00:59,274 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16641#false} {16640#true} #1725#return; {16641#false} is VALID [2022-02-20 20:00:59,274 INFO L272 TraceCheckUtils]: 40: Hoare triple {16641#false} call reset_delta_events1(); {16681#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:00:59,275 INFO L290 TraceCheckUtils]: 41: Hoare triple {16681#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {16640#true} is VALID [2022-02-20 20:00:59,275 INFO L290 TraceCheckUtils]: 42: Hoare triple {16640#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {16640#true} is VALID [2022-02-20 20:00:59,275 INFO L290 TraceCheckUtils]: 43: Hoare triple {16640#true} assume true; {16640#true} is VALID [2022-02-20 20:00:59,275 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {16640#true} {16641#false} #1727#return; {16641#false} is VALID [2022-02-20 20:00:59,275 INFO L290 TraceCheckUtils]: 45: Hoare triple {16641#false} assume !false; {16641#false} is VALID [2022-02-20 20:00:59,275 INFO L290 TraceCheckUtils]: 46: Hoare triple {16641#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {16641#false} is VALID [2022-02-20 20:00:59,275 INFO L290 TraceCheckUtils]: 47: Hoare triple {16641#false} assume !false; {16641#false} is VALID [2022-02-20 20:00:59,275 INFO L272 TraceCheckUtils]: 48: Hoare triple {16641#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {16640#true} is VALID [2022-02-20 20:00:59,276 INFO L290 TraceCheckUtils]: 49: Hoare triple {16640#true} havoc ~__retres1~2; {16640#true} is VALID [2022-02-20 20:00:59,276 INFO L290 TraceCheckUtils]: 50: Hoare triple {16640#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {16640#true} is VALID [2022-02-20 20:00:59,276 INFO L290 TraceCheckUtils]: 51: Hoare triple {16640#true} #res := ~__retres1~2; {16640#true} is VALID [2022-02-20 20:00:59,276 INFO L290 TraceCheckUtils]: 52: Hoare triple {16640#true} assume true; {16640#true} is VALID [2022-02-20 20:00:59,276 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16640#true} {16641#false} #1729#return; {16641#false} is VALID [2022-02-20 20:00:59,276 INFO L290 TraceCheckUtils]: 54: Hoare triple {16641#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {16641#false} is VALID [2022-02-20 20:00:59,276 INFO L290 TraceCheckUtils]: 55: Hoare triple {16641#false} assume 0 != eval1_~tmp___1~0#1; {16641#false} is VALID [2022-02-20 20:00:59,276 INFO L290 TraceCheckUtils]: 56: Hoare triple {16641#false} assume !(0 == ~p_dw_st~0); {16641#false} is VALID [2022-02-20 20:00:59,277 INFO L290 TraceCheckUtils]: 57: Hoare triple {16641#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {16641#false} is VALID [2022-02-20 20:00:59,277 INFO L290 TraceCheckUtils]: 58: Hoare triple {16641#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {16641#false} is VALID [2022-02-20 20:00:59,277 INFO L290 TraceCheckUtils]: 59: Hoare triple {16641#false} assume !(0 == ~c_dr_pc~0); {16641#false} is VALID [2022-02-20 20:00:59,277 INFO L290 TraceCheckUtils]: 60: Hoare triple {16641#false} assume 2 == ~c_dr_pc~0; {16641#false} is VALID [2022-02-20 20:00:59,277 INFO L290 TraceCheckUtils]: 61: Hoare triple {16641#false} do_read_c_~a~0#1 := ~a_t~0; {16641#false} is VALID [2022-02-20 20:00:59,277 INFO L290 TraceCheckUtils]: 62: Hoare triple {16641#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {16641#false} is VALID [2022-02-20 20:00:59,277 INFO L290 TraceCheckUtils]: 63: Hoare triple {16641#false} assume !(~p_last_write~0 == ~c_last_read~0); {16641#false} is VALID [2022-02-20 20:00:59,277 INFO L272 TraceCheckUtils]: 64: Hoare triple {16641#false} call error1(); {16641#false} is VALID [2022-02-20 20:00:59,278 INFO L290 TraceCheckUtils]: 65: Hoare triple {16641#false} assume !false; {16641#false} is VALID [2022-02-20 20:00:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:00:59,279 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:00:59,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957287230] [2022-02-20 20:00:59,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957287230] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:00:59,280 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:00:59,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:00:59,280 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323512367] [2022-02-20 20:00:59,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:00:59,281 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 20:00:59,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:00:59,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:00:59,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:00:59,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:00:59,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:00:59,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:00:59,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:00:59,330 INFO L87 Difference]: Start difference. First operand 1716 states and 2376 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:03,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:03,671 INFO L93 Difference]: Finished difference Result 3244 states and 4455 transitions. [2022-02-20 20:01:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:01:03,671 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 20:01:03,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 852 transitions. [2022-02-20 20:01:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 852 transitions. [2022-02-20 20:01:03,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 852 transitions. [2022-02-20 20:01:04,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 852 edges. 852 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:04,421 INFO L225 Difference]: With dead ends: 3244 [2022-02-20 20:01:04,421 INFO L226 Difference]: Without dead ends: 1864 [2022-02-20 20:01:04,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 20:01:04,424 INFO L933 BasicCegarLoop]: 659 mSDtfsCounter, 586 mSDsluCounter, 2270 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:04,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [587 Valid, 2929 Invalid, 1664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 20:01:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2022-02-20 20:01:04,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1756. [2022-02-20 20:01:04,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:04,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1864 states. Second operand has 1756 states, 1444 states have (on average 1.3961218836565097) internal successors, (2016), 1467 states have internal predecessors, (2016), 176 states have call successors, (176), 111 states have call predecessors, (176), 134 states have return successors, (218), 180 states have call predecessors, (218), 174 states have call successors, (218) [2022-02-20 20:01:04,504 INFO L74 IsIncluded]: Start isIncluded. First operand 1864 states. Second operand has 1756 states, 1444 states have (on average 1.3961218836565097) internal successors, (2016), 1467 states have internal predecessors, (2016), 176 states have call successors, (176), 111 states have call predecessors, (176), 134 states have return successors, (218), 180 states have call predecessors, (218), 174 states have call successors, (218) [2022-02-20 20:01:04,507 INFO L87 Difference]: Start difference. First operand 1864 states. Second operand has 1756 states, 1444 states have (on average 1.3961218836565097) internal successors, (2016), 1467 states have internal predecessors, (2016), 176 states have call successors, (176), 111 states have call predecessors, (176), 134 states have return successors, (218), 180 states have call predecessors, (218), 174 states have call successors, (218) [2022-02-20 20:01:04,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:04,644 INFO L93 Difference]: Finished difference Result 1864 states and 2564 transitions. [2022-02-20 20:01:04,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2564 transitions. [2022-02-20 20:01:04,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:04,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:04,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 1756 states, 1444 states have (on average 1.3961218836565097) internal successors, (2016), 1467 states have internal predecessors, (2016), 176 states have call successors, (176), 111 states have call predecessors, (176), 134 states have return successors, (218), 180 states have call predecessors, (218), 174 states have call successors, (218) Second operand 1864 states. [2022-02-20 20:01:04,652 INFO L87 Difference]: Start difference. First operand has 1756 states, 1444 states have (on average 1.3961218836565097) internal successors, (2016), 1467 states have internal predecessors, (2016), 176 states have call successors, (176), 111 states have call predecessors, (176), 134 states have return successors, (218), 180 states have call predecessors, (218), 174 states have call successors, (218) Second operand 1864 states. [2022-02-20 20:01:04,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:04,771 INFO L93 Difference]: Finished difference Result 1864 states and 2564 transitions. [2022-02-20 20:01:04,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2564 transitions. [2022-02-20 20:01:04,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:04,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:04,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:04,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1444 states have (on average 1.3961218836565097) internal successors, (2016), 1467 states have internal predecessors, (2016), 176 states have call successors, (176), 111 states have call predecessors, (176), 134 states have return successors, (218), 180 states have call predecessors, (218), 174 states have call successors, (218) [2022-02-20 20:01:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2410 transitions. [2022-02-20 20:01:04,920 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2410 transitions. Word has length 66 [2022-02-20 20:01:04,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:04,921 INFO L470 AbstractCegarLoop]: Abstraction has 1756 states and 2410 transitions. [2022-02-20 20:01:04,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:04,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2410 transitions. [2022-02-20 20:01:04,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 20:01:04,922 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:04,922 INFO L514 BasicCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:04,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:01:04,923 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:04,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:04,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1060478864, now seen corresponding path program 1 times [2022-02-20 20:01:04,923 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:04,923 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244284328] [2022-02-20 20:01:04,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:04,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {27180#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {27181#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:05,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {27181#(not (= |old(~q_req_up~0)| 1))} assume true; {27181#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:05,012 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27181#(not (= |old(~q_req_up~0)| 1))} {27140#(= ~c_dr_pc~0 ~q_req_up~0)} #1721#return; {27144#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:05,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {27182#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {27137#true} is VALID [2022-02-20 20:01:05,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {27137#true} assume !(0 == ~q_write_ev~0); {27137#true} is VALID [2022-02-20 20:01:05,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {27137#true} assume true; {27137#true} is VALID [2022-02-20 20:01:05,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27137#true} {27144#(not (= ~c_dr_pc~0 1))} #1723#return; {27144#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:05,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {27137#true} havoc ~__retres1~0; {27137#true} is VALID [2022-02-20 20:01:05,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {27137#true} assume !(1 == ~p_dw_pc~0); {27137#true} is VALID [2022-02-20 20:01:05,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {27137#true} assume !(2 == ~p_dw_pc~0); {27137#true} is VALID [2022-02-20 20:01:05,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {27137#true} ~__retres1~0 := 0; {27137#true} is VALID [2022-02-20 20:01:05,068 INFO L290 TraceCheckUtils]: 4: Hoare triple {27137#true} #res := ~__retres1~0; {27137#true} is VALID [2022-02-20 20:01:05,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {27137#true} assume true; {27137#true} is VALID [2022-02-20 20:01:05,069 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {27137#true} {27137#true} #1717#return; {27137#true} is VALID [2022-02-20 20:01:05,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {27137#true} havoc ~__retres1~1; {27137#true} is VALID [2022-02-20 20:01:05,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {27137#true} assume 1 == ~c_dr_pc~0; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,074 INFO L290 TraceCheckUtils]: 3: Hoare triple {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,075 INFO L290 TraceCheckUtils]: 4: Hoare triple {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,075 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} {27137#true} #1719#return; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {27183#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {27137#true} is VALID [2022-02-20 20:01:05,075 INFO L272 TraceCheckUtils]: 1: Hoare triple {27137#true} call #t~ret8 := is_do_write_p_triggered(); {27137#true} is VALID [2022-02-20 20:01:05,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {27137#true} havoc ~__retres1~0; {27137#true} is VALID [2022-02-20 20:01:05,076 INFO L290 TraceCheckUtils]: 3: Hoare triple {27137#true} assume !(1 == ~p_dw_pc~0); {27137#true} is VALID [2022-02-20 20:01:05,077 INFO L290 TraceCheckUtils]: 4: Hoare triple {27137#true} assume !(2 == ~p_dw_pc~0); {27137#true} is VALID [2022-02-20 20:01:05,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {27137#true} ~__retres1~0 := 0; {27137#true} is VALID [2022-02-20 20:01:05,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {27137#true} #res := ~__retres1~0; {27137#true} is VALID [2022-02-20 20:01:05,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {27137#true} assume true; {27137#true} is VALID [2022-02-20 20:01:05,077 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {27137#true} {27137#true} #1717#return; {27137#true} is VALID [2022-02-20 20:01:05,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {27137#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {27137#true} is VALID [2022-02-20 20:01:05,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {27137#true} assume !(0 != ~tmp~1); {27137#true} is VALID [2022-02-20 20:01:05,078 INFO L272 TraceCheckUtils]: 11: Hoare triple {27137#true} call #t~ret9 := is_do_read_c_triggered(); {27137#true} is VALID [2022-02-20 20:01:05,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {27137#true} havoc ~__retres1~1; {27137#true} is VALID [2022-02-20 20:01:05,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {27137#true} assume 1 == ~c_dr_pc~0; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,080 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} {27137#true} #1719#return; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,084 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} {27144#(not (= ~c_dr_pc~0 1))} #1725#return; {27138#false} is VALID [2022-02-20 20:01:05,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 20:01:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {27182#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {27137#true} is VALID [2022-02-20 20:01:05,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {27137#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {27137#true} is VALID [2022-02-20 20:01:05,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {27137#true} assume true; {27137#true} is VALID [2022-02-20 20:01:05,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27137#true} {27138#false} #1727#return; {27138#false} is VALID [2022-02-20 20:01:05,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 20:01:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:05,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {27137#true} havoc ~__retres1~2; {27137#true} is VALID [2022-02-20 20:01:05,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {27137#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {27137#true} is VALID [2022-02-20 20:01:05,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {27137#true} #res := ~__retres1~2; {27137#true} is VALID [2022-02-20 20:01:05,093 INFO L290 TraceCheckUtils]: 3: Hoare triple {27137#true} assume true; {27137#true} is VALID [2022-02-20 20:01:05,093 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {27137#true} {27138#false} #1729#return; {27138#false} is VALID [2022-02-20 20:01:05,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {27137#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {27139#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:05,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {27139#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {27139#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:05,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {27139#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {27140#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:01:05,095 INFO L290 TraceCheckUtils]: 3: Hoare triple {27140#(= ~c_dr_pc~0 ~q_req_up~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {27140#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 20:01:05,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {27140#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {27180#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:05,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {27180#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {27181#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:05,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {27181#(not (= |old(~q_req_up~0)| 1))} assume true; {27181#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 20:01:05,096 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {27181#(not (= |old(~q_req_up~0)| 1))} {27140#(= ~c_dr_pc~0 ~q_req_up~0)} #1721#return; {27144#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:05,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {27144#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {27144#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:05,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {27144#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {27144#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:05,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {27144#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {27144#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:05,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {27144#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {27144#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:05,098 INFO L272 TraceCheckUtils]: 12: Hoare triple {27144#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {27182#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:05,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {27182#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {27137#true} is VALID [2022-02-20 20:01:05,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {27137#true} assume !(0 == ~q_write_ev~0); {27137#true} is VALID [2022-02-20 20:01:05,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {27137#true} assume true; {27137#true} is VALID [2022-02-20 20:01:05,099 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {27137#true} {27144#(not (= ~c_dr_pc~0 1))} #1723#return; {27144#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 20:01:05,099 INFO L272 TraceCheckUtils]: 17: Hoare triple {27144#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {27183#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:05,099 INFO L290 TraceCheckUtils]: 18: Hoare triple {27183#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {27137#true} is VALID [2022-02-20 20:01:05,099 INFO L272 TraceCheckUtils]: 19: Hoare triple {27137#true} call #t~ret8 := is_do_write_p_triggered(); {27137#true} is VALID [2022-02-20 20:01:05,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {27137#true} havoc ~__retres1~0; {27137#true} is VALID [2022-02-20 20:01:05,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {27137#true} assume !(1 == ~p_dw_pc~0); {27137#true} is VALID [2022-02-20 20:01:05,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {27137#true} assume !(2 == ~p_dw_pc~0); {27137#true} is VALID [2022-02-20 20:01:05,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {27137#true} ~__retres1~0 := 0; {27137#true} is VALID [2022-02-20 20:01:05,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {27137#true} #res := ~__retres1~0; {27137#true} is VALID [2022-02-20 20:01:05,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {27137#true} assume true; {27137#true} is VALID [2022-02-20 20:01:05,100 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27137#true} {27137#true} #1717#return; {27137#true} is VALID [2022-02-20 20:01:05,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {27137#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {27137#true} is VALID [2022-02-20 20:01:05,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {27137#true} assume !(0 != ~tmp~1); {27137#true} is VALID [2022-02-20 20:01:05,100 INFO L272 TraceCheckUtils]: 29: Hoare triple {27137#true} call #t~ret9 := is_do_read_c_triggered(); {27137#true} is VALID [2022-02-20 20:01:05,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {27137#true} havoc ~__retres1~1; {27137#true} is VALID [2022-02-20 20:01:05,101 INFO L290 TraceCheckUtils]: 31: Hoare triple {27137#true} assume 1 == ~c_dr_pc~0; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~slow_clk_edge~0;~__retres1~1 := 1; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,102 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} {27137#true} #1719#return; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 20:01:05,103 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {27197#(= (+ (- 1) ~c_dr_pc~0) 0)} {27144#(not (= ~c_dr_pc~0 1))} #1725#return; {27138#false} is VALID [2022-02-20 20:01:05,103 INFO L272 TraceCheckUtils]: 40: Hoare triple {27138#false} call reset_delta_events1(); {27182#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:05,104 INFO L290 TraceCheckUtils]: 41: Hoare triple {27182#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {27137#true} is VALID [2022-02-20 20:01:05,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {27137#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {27137#true} is VALID [2022-02-20 20:01:05,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {27137#true} assume true; {27137#true} is VALID [2022-02-20 20:01:05,104 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {27137#true} {27138#false} #1727#return; {27138#false} is VALID [2022-02-20 20:01:05,104 INFO L290 TraceCheckUtils]: 45: Hoare triple {27138#false} assume !false; {27138#false} is VALID [2022-02-20 20:01:05,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {27138#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {27138#false} is VALID [2022-02-20 20:01:05,104 INFO L290 TraceCheckUtils]: 47: Hoare triple {27138#false} assume !false; {27138#false} is VALID [2022-02-20 20:01:05,104 INFO L272 TraceCheckUtils]: 48: Hoare triple {27138#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {27137#true} is VALID [2022-02-20 20:01:05,105 INFO L290 TraceCheckUtils]: 49: Hoare triple {27137#true} havoc ~__retres1~2; {27137#true} is VALID [2022-02-20 20:01:05,105 INFO L290 TraceCheckUtils]: 50: Hoare triple {27137#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {27137#true} is VALID [2022-02-20 20:01:05,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {27137#true} #res := ~__retres1~2; {27137#true} is VALID [2022-02-20 20:01:05,105 INFO L290 TraceCheckUtils]: 52: Hoare triple {27137#true} assume true; {27137#true} is VALID [2022-02-20 20:01:05,105 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {27137#true} {27138#false} #1729#return; {27138#false} is VALID [2022-02-20 20:01:05,105 INFO L290 TraceCheckUtils]: 54: Hoare triple {27138#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {27138#false} is VALID [2022-02-20 20:01:05,105 INFO L290 TraceCheckUtils]: 55: Hoare triple {27138#false} assume 0 != eval1_~tmp___1~0#1; {27138#false} is VALID [2022-02-20 20:01:05,105 INFO L290 TraceCheckUtils]: 56: Hoare triple {27138#false} assume !(0 == ~p_dw_st~0); {27138#false} is VALID [2022-02-20 20:01:05,105 INFO L290 TraceCheckUtils]: 57: Hoare triple {27138#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {27138#false} is VALID [2022-02-20 20:01:05,106 INFO L290 TraceCheckUtils]: 58: Hoare triple {27138#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {27138#false} is VALID [2022-02-20 20:01:05,106 INFO L290 TraceCheckUtils]: 59: Hoare triple {27138#false} assume !(0 == ~c_dr_pc~0); {27138#false} is VALID [2022-02-20 20:01:05,106 INFO L290 TraceCheckUtils]: 60: Hoare triple {27138#false} assume 2 == ~c_dr_pc~0; {27138#false} is VALID [2022-02-20 20:01:05,106 INFO L290 TraceCheckUtils]: 61: Hoare triple {27138#false} do_read_c_~a~0#1 := ~a_t~0; {27138#false} is VALID [2022-02-20 20:01:05,106 INFO L290 TraceCheckUtils]: 62: Hoare triple {27138#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {27138#false} is VALID [2022-02-20 20:01:05,106 INFO L290 TraceCheckUtils]: 63: Hoare triple {27138#false} assume !(~p_last_write~0 == ~c_last_read~0); {27138#false} is VALID [2022-02-20 20:01:05,106 INFO L272 TraceCheckUtils]: 64: Hoare triple {27138#false} call error1(); {27138#false} is VALID [2022-02-20 20:01:05,106 INFO L290 TraceCheckUtils]: 65: Hoare triple {27138#false} assume !false; {27138#false} is VALID [2022-02-20 20:01:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:01:05,107 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:05,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244284328] [2022-02-20 20:01:05,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244284328] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:05,107 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:05,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:01:05,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109790437] [2022-02-20 20:01:05,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:05,108 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-02-20 20:01:05,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:05,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:01:05,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:05,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:01:05,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:05,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:01:05,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:01:05,180 INFO L87 Difference]: Start difference. First operand 1756 states and 2410 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:01:12,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:12,658 INFO L93 Difference]: Finished difference Result 5328 states and 7284 transitions. [2022-02-20 20:01:12,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 20:01:12,658 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-02-20 20:01:12,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:01:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1465 transitions. [2022-02-20 20:01:12,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:01:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1465 transitions. [2022-02-20 20:01:12,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1465 transitions. [2022-02-20 20:01:13,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1465 edges. 1465 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:13,892 INFO L225 Difference]: With dead ends: 5328 [2022-02-20 20:01:13,892 INFO L226 Difference]: Without dead ends: 2147 [2022-02-20 20:01:13,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 20:01:13,899 INFO L933 BasicCegarLoop]: 797 mSDtfsCounter, 4047 mSDsluCounter, 1806 mSDsCounter, 0 mSdLazyCounter, 1648 mSolverCounterSat, 761 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4065 SdHoareTripleChecker+Valid, 2603 SdHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 761 IncrementalHoareTripleChecker+Valid, 1648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:13,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4065 Valid, 2603 Invalid, 2409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [761 Valid, 1648 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 20:01:13,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2022-02-20 20:01:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 1967. [2022-02-20 20:01:13,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:13,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2147 states. Second operand has 1967 states, 1583 states have (on average 1.3531269740998104) internal successors, (2142), 1608 states have internal predecessors, (2142), 216 states have call successors, (216), 139 states have call predecessors, (216), 166 states have return successors, (264), 222 states have call predecessors, (264), 214 states have call successors, (264) [2022-02-20 20:01:13,978 INFO L74 IsIncluded]: Start isIncluded. First operand 2147 states. Second operand has 1967 states, 1583 states have (on average 1.3531269740998104) internal successors, (2142), 1608 states have internal predecessors, (2142), 216 states have call successors, (216), 139 states have call predecessors, (216), 166 states have return successors, (264), 222 states have call predecessors, (264), 214 states have call successors, (264) [2022-02-20 20:01:13,980 INFO L87 Difference]: Start difference. First operand 2147 states. Second operand has 1967 states, 1583 states have (on average 1.3531269740998104) internal successors, (2142), 1608 states have internal predecessors, (2142), 216 states have call successors, (216), 139 states have call predecessors, (216), 166 states have return successors, (264), 222 states have call predecessors, (264), 214 states have call successors, (264) [2022-02-20 20:01:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:14,139 INFO L93 Difference]: Finished difference Result 2147 states and 2853 transitions. [2022-02-20 20:01:14,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2853 transitions. [2022-02-20 20:01:14,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:14,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:14,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 1967 states, 1583 states have (on average 1.3531269740998104) internal successors, (2142), 1608 states have internal predecessors, (2142), 216 states have call successors, (216), 139 states have call predecessors, (216), 166 states have return successors, (264), 222 states have call predecessors, (264), 214 states have call successors, (264) Second operand 2147 states. [2022-02-20 20:01:14,152 INFO L87 Difference]: Start difference. First operand has 1967 states, 1583 states have (on average 1.3531269740998104) internal successors, (2142), 1608 states have internal predecessors, (2142), 216 states have call successors, (216), 139 states have call predecessors, (216), 166 states have return successors, (264), 222 states have call predecessors, (264), 214 states have call successors, (264) Second operand 2147 states. [2022-02-20 20:01:14,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:14,322 INFO L93 Difference]: Finished difference Result 2147 states and 2853 transitions. [2022-02-20 20:01:14,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2853 transitions. [2022-02-20 20:01:14,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:14,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:14,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:14,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1583 states have (on average 1.3531269740998104) internal successors, (2142), 1608 states have internal predecessors, (2142), 216 states have call successors, (216), 139 states have call predecessors, (216), 166 states have return successors, (264), 222 states have call predecessors, (264), 214 states have call successors, (264) [2022-02-20 20:01:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 2622 transitions. [2022-02-20 20:01:14,585 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 2622 transitions. Word has length 66 [2022-02-20 20:01:14,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:14,586 INFO L470 AbstractCegarLoop]: Abstraction has 1967 states and 2622 transitions. [2022-02-20 20:01:14,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 20:01:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2622 transitions. [2022-02-20 20:01:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:14,587 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:14,587 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:14,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:01:14,588 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:14,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:14,588 INFO L85 PathProgramCache]: Analyzing trace with hash 135267171, now seen corresponding path program 1 times [2022-02-20 20:01:14,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:14,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828832657] [2022-02-20 20:01:14,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:14,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {41405#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {41359#true} is VALID [2022-02-20 20:01:14,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {41359#true} assume true; {41359#true} is VALID [2022-02-20 20:01:14,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41359#true} {41359#true} #1721#return; {41359#true} is VALID [2022-02-20 20:01:14,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {41406#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {41359#true} is VALID [2022-02-20 20:01:14,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {41359#true} assume !(0 == ~q_write_ev~0); {41359#true} is VALID [2022-02-20 20:01:14,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {41359#true} assume true; {41359#true} is VALID [2022-02-20 20:01:14,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41359#true} {41359#true} #1723#return; {41359#true} is VALID [2022-02-20 20:01:14,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {41359#true} havoc ~__retres1~0; {41359#true} is VALID [2022-02-20 20:01:14,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {41359#true} assume !(1 == ~p_dw_pc~0); {41359#true} is VALID [2022-02-20 20:01:14,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {41359#true} assume !(2 == ~p_dw_pc~0); {41359#true} is VALID [2022-02-20 20:01:14,662 INFO L290 TraceCheckUtils]: 3: Hoare triple {41359#true} ~__retres1~0 := 0; {41359#true} is VALID [2022-02-20 20:01:14,662 INFO L290 TraceCheckUtils]: 4: Hoare triple {41359#true} #res := ~__retres1~0; {41359#true} is VALID [2022-02-20 20:01:14,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {41359#true} assume true; {41359#true} is VALID [2022-02-20 20:01:14,662 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {41359#true} {41359#true} #1717#return; {41359#true} is VALID [2022-02-20 20:01:14,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {41359#true} havoc ~__retres1~1; {41359#true} is VALID [2022-02-20 20:01:14,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {41359#true} assume !(1 == ~c_dr_pc~0); {41359#true} is VALID [2022-02-20 20:01:14,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {41359#true} assume !(2 == ~c_dr_pc~0); {41359#true} is VALID [2022-02-20 20:01:14,687 INFO L290 TraceCheckUtils]: 3: Hoare triple {41359#true} ~__retres1~1 := 0; {41424#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:14,687 INFO L290 TraceCheckUtils]: 4: Hoare triple {41424#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {41425#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:14,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {41425#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {41425#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:14,688 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {41425#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {41359#true} #1719#return; {41422#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:14,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {41407#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {41359#true} is VALID [2022-02-20 20:01:14,688 INFO L272 TraceCheckUtils]: 1: Hoare triple {41359#true} call #t~ret8 := is_do_write_p_triggered(); {41359#true} is VALID [2022-02-20 20:01:14,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {41359#true} havoc ~__retres1~0; {41359#true} is VALID [2022-02-20 20:01:14,689 INFO L290 TraceCheckUtils]: 3: Hoare triple {41359#true} assume !(1 == ~p_dw_pc~0); {41359#true} is VALID [2022-02-20 20:01:14,689 INFO L290 TraceCheckUtils]: 4: Hoare triple {41359#true} assume !(2 == ~p_dw_pc~0); {41359#true} is VALID [2022-02-20 20:01:14,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {41359#true} ~__retres1~0 := 0; {41359#true} is VALID [2022-02-20 20:01:14,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {41359#true} #res := ~__retres1~0; {41359#true} is VALID [2022-02-20 20:01:14,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {41359#true} assume true; {41359#true} is VALID [2022-02-20 20:01:14,689 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {41359#true} {41359#true} #1717#return; {41359#true} is VALID [2022-02-20 20:01:14,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {41359#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {41359#true} is VALID [2022-02-20 20:01:14,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {41359#true} assume !(0 != ~tmp~1); {41359#true} is VALID [2022-02-20 20:01:14,690 INFO L272 TraceCheckUtils]: 11: Hoare triple {41359#true} call #t~ret9 := is_do_read_c_triggered(); {41359#true} is VALID [2022-02-20 20:01:14,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {41359#true} havoc ~__retres1~1; {41359#true} is VALID [2022-02-20 20:01:14,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {41359#true} assume !(1 == ~c_dr_pc~0); {41359#true} is VALID [2022-02-20 20:01:14,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {41359#true} assume !(2 == ~c_dr_pc~0); {41359#true} is VALID [2022-02-20 20:01:14,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {41359#true} ~__retres1~1 := 0; {41424#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:14,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {41424#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {41425#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:14,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {41425#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {41425#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:14,692 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {41425#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {41359#true} #1719#return; {41422#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:14,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {41422#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {41423#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:01:14,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {41423#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {41360#false} is VALID [2022-02-20 20:01:14,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {41360#false} assume true; {41360#false} is VALID [2022-02-20 20:01:14,693 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {41360#false} {41359#true} #1725#return; {41360#false} is VALID [2022-02-20 20:01:14,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {41406#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {41359#true} is VALID [2022-02-20 20:01:14,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {41359#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {41359#true} is VALID [2022-02-20 20:01:14,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {41359#true} assume true; {41359#true} is VALID [2022-02-20 20:01:14,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41359#true} {41360#false} #1727#return; {41360#false} is VALID [2022-02-20 20:01:14,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {41359#true} havoc ~__retres1~2; {41359#true} is VALID [2022-02-20 20:01:14,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {41359#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {41359#true} is VALID [2022-02-20 20:01:14,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {41359#true} #res := ~__retres1~2; {41359#true} is VALID [2022-02-20 20:01:14,706 INFO L290 TraceCheckUtils]: 3: Hoare triple {41359#true} assume true; {41359#true} is VALID [2022-02-20 20:01:14,706 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {41359#true} {41360#false} #1729#return; {41360#false} is VALID [2022-02-20 20:01:14,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:14,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {41359#true} havoc ~__retres1~2; {41359#true} is VALID [2022-02-20 20:01:14,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {41359#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {41359#true} is VALID [2022-02-20 20:01:14,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {41359#true} #res := ~__retres1~2; {41359#true} is VALID [2022-02-20 20:01:14,710 INFO L290 TraceCheckUtils]: 3: Hoare triple {41359#true} assume true; {41359#true} is VALID [2022-02-20 20:01:14,710 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {41359#true} {41360#false} #1729#return; {41360#false} is VALID [2022-02-20 20:01:14,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {41359#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {41359#true} is VALID [2022-02-20 20:01:14,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {41359#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {41359#true} is VALID [2022-02-20 20:01:14,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {41359#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {41359#true} is VALID [2022-02-20 20:01:14,711 INFO L290 TraceCheckUtils]: 3: Hoare triple {41359#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {41359#true} is VALID [2022-02-20 20:01:14,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {41359#true} call update_channels1(); {41405#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:14,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {41405#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {41359#true} is VALID [2022-02-20 20:01:14,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {41359#true} assume true; {41359#true} is VALID [2022-02-20 20:01:14,711 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {41359#true} {41359#true} #1721#return; {41359#true} is VALID [2022-02-20 20:01:14,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {41359#true} assume { :begin_inline_init_threads1 } true; {41359#true} is VALID [2022-02-20 20:01:14,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {41359#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {41359#true} is VALID [2022-02-20 20:01:14,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {41359#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {41359#true} is VALID [2022-02-20 20:01:14,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {41359#true} assume { :end_inline_init_threads1 } true; {41359#true} is VALID [2022-02-20 20:01:14,712 INFO L272 TraceCheckUtils]: 12: Hoare triple {41359#true} call fire_delta_events1(); {41406#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:14,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {41406#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {41359#true} is VALID [2022-02-20 20:01:14,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {41359#true} assume !(0 == ~q_write_ev~0); {41359#true} is VALID [2022-02-20 20:01:14,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {41359#true} assume true; {41359#true} is VALID [2022-02-20 20:01:14,713 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {41359#true} {41359#true} #1723#return; {41359#true} is VALID [2022-02-20 20:01:14,713 INFO L272 TraceCheckUtils]: 17: Hoare triple {41359#true} call activate_threads1(); {41407#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:14,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {41407#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {41359#true} is VALID [2022-02-20 20:01:14,714 INFO L272 TraceCheckUtils]: 19: Hoare triple {41359#true} call #t~ret8 := is_do_write_p_triggered(); {41359#true} is VALID [2022-02-20 20:01:14,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {41359#true} havoc ~__retres1~0; {41359#true} is VALID [2022-02-20 20:01:14,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {41359#true} assume !(1 == ~p_dw_pc~0); {41359#true} is VALID [2022-02-20 20:01:14,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {41359#true} assume !(2 == ~p_dw_pc~0); {41359#true} is VALID [2022-02-20 20:01:14,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {41359#true} ~__retres1~0 := 0; {41359#true} is VALID [2022-02-20 20:01:14,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {41359#true} #res := ~__retres1~0; {41359#true} is VALID [2022-02-20 20:01:14,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {41359#true} assume true; {41359#true} is VALID [2022-02-20 20:01:14,717 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41359#true} {41359#true} #1717#return; {41359#true} is VALID [2022-02-20 20:01:14,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {41359#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {41359#true} is VALID [2022-02-20 20:01:14,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {41359#true} assume !(0 != ~tmp~1); {41359#true} is VALID [2022-02-20 20:01:14,717 INFO L272 TraceCheckUtils]: 29: Hoare triple {41359#true} call #t~ret9 := is_do_read_c_triggered(); {41359#true} is VALID [2022-02-20 20:01:14,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {41359#true} havoc ~__retres1~1; {41359#true} is VALID [2022-02-20 20:01:14,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {41359#true} assume !(1 == ~c_dr_pc~0); {41359#true} is VALID [2022-02-20 20:01:14,717 INFO L290 TraceCheckUtils]: 32: Hoare triple {41359#true} assume !(2 == ~c_dr_pc~0); {41359#true} is VALID [2022-02-20 20:01:14,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {41359#true} ~__retres1~1 := 0; {41424#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 20:01:14,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {41424#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {41425#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:14,718 INFO L290 TraceCheckUtils]: 35: Hoare triple {41425#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {41425#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 20:01:14,719 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {41425#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {41359#true} #1719#return; {41422#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 20:01:14,719 INFO L290 TraceCheckUtils]: 37: Hoare triple {41422#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {41423#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 20:01:14,720 INFO L290 TraceCheckUtils]: 38: Hoare triple {41423#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {41360#false} is VALID [2022-02-20 20:01:14,720 INFO L290 TraceCheckUtils]: 39: Hoare triple {41360#false} assume true; {41360#false} is VALID [2022-02-20 20:01:14,720 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {41360#false} {41359#true} #1725#return; {41360#false} is VALID [2022-02-20 20:01:14,720 INFO L272 TraceCheckUtils]: 41: Hoare triple {41360#false} call reset_delta_events1(); {41406#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:14,720 INFO L290 TraceCheckUtils]: 42: Hoare triple {41406#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {41359#true} is VALID [2022-02-20 20:01:14,720 INFO L290 TraceCheckUtils]: 43: Hoare triple {41359#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {41359#true} is VALID [2022-02-20 20:01:14,721 INFO L290 TraceCheckUtils]: 44: Hoare triple {41359#true} assume true; {41359#true} is VALID [2022-02-20 20:01:14,721 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {41359#true} {41360#false} #1727#return; {41360#false} is VALID [2022-02-20 20:01:14,721 INFO L290 TraceCheckUtils]: 46: Hoare triple {41360#false} assume !false; {41360#false} is VALID [2022-02-20 20:01:14,721 INFO L290 TraceCheckUtils]: 47: Hoare triple {41360#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {41360#false} is VALID [2022-02-20 20:01:14,721 INFO L290 TraceCheckUtils]: 48: Hoare triple {41360#false} assume !false; {41360#false} is VALID [2022-02-20 20:01:14,721 INFO L272 TraceCheckUtils]: 49: Hoare triple {41360#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {41359#true} is VALID [2022-02-20 20:01:14,721 INFO L290 TraceCheckUtils]: 50: Hoare triple {41359#true} havoc ~__retres1~2; {41359#true} is VALID [2022-02-20 20:01:14,721 INFO L290 TraceCheckUtils]: 51: Hoare triple {41359#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {41359#true} is VALID [2022-02-20 20:01:14,722 INFO L290 TraceCheckUtils]: 52: Hoare triple {41359#true} #res := ~__retres1~2; {41359#true} is VALID [2022-02-20 20:01:14,722 INFO L290 TraceCheckUtils]: 53: Hoare triple {41359#true} assume true; {41359#true} is VALID [2022-02-20 20:01:14,722 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {41359#true} {41360#false} #1729#return; {41360#false} is VALID [2022-02-20 20:01:14,722 INFO L290 TraceCheckUtils]: 55: Hoare triple {41360#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {41360#false} is VALID [2022-02-20 20:01:14,722 INFO L290 TraceCheckUtils]: 56: Hoare triple {41360#false} assume 0 != eval1_~tmp___1~0#1; {41360#false} is VALID [2022-02-20 20:01:14,722 INFO L290 TraceCheckUtils]: 57: Hoare triple {41360#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {41360#false} is VALID [2022-02-20 20:01:14,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {41360#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {41360#false} is VALID [2022-02-20 20:01:14,723 INFO L290 TraceCheckUtils]: 59: Hoare triple {41360#false} assume 0 == ~p_dw_pc~0; {41360#false} is VALID [2022-02-20 20:01:14,723 INFO L290 TraceCheckUtils]: 60: Hoare triple {41360#false} assume !false; {41360#false} is VALID [2022-02-20 20:01:14,723 INFO L290 TraceCheckUtils]: 61: Hoare triple {41360#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {41360#false} is VALID [2022-02-20 20:01:14,723 INFO L290 TraceCheckUtils]: 62: Hoare triple {41360#false} assume { :end_inline_do_write_p } true; {41360#false} is VALID [2022-02-20 20:01:14,723 INFO L290 TraceCheckUtils]: 63: Hoare triple {41360#false} assume !(0 == ~c_dr_st~0); {41360#false} is VALID [2022-02-20 20:01:14,723 INFO L290 TraceCheckUtils]: 64: Hoare triple {41360#false} assume !false; {41360#false} is VALID [2022-02-20 20:01:14,723 INFO L272 TraceCheckUtils]: 65: Hoare triple {41360#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {41359#true} is VALID [2022-02-20 20:01:14,724 INFO L290 TraceCheckUtils]: 66: Hoare triple {41359#true} havoc ~__retres1~2; {41359#true} is VALID [2022-02-20 20:01:14,735 INFO L290 TraceCheckUtils]: 67: Hoare triple {41359#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {41359#true} is VALID [2022-02-20 20:01:14,745 INFO L290 TraceCheckUtils]: 68: Hoare triple {41359#true} #res := ~__retres1~2; {41359#true} is VALID [2022-02-20 20:01:14,745 INFO L290 TraceCheckUtils]: 69: Hoare triple {41359#true} assume true; {41359#true} is VALID [2022-02-20 20:01:14,745 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {41359#true} {41360#false} #1729#return; {41360#false} is VALID [2022-02-20 20:01:14,745 INFO L290 TraceCheckUtils]: 71: Hoare triple {41360#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {41360#false} is VALID [2022-02-20 20:01:14,745 INFO L290 TraceCheckUtils]: 72: Hoare triple {41360#false} assume 0 != eval1_~tmp___1~0#1; {41360#false} is VALID [2022-02-20 20:01:14,746 INFO L290 TraceCheckUtils]: 73: Hoare triple {41360#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {41360#false} is VALID [2022-02-20 20:01:14,746 INFO L290 TraceCheckUtils]: 74: Hoare triple {41360#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {41360#false} is VALID [2022-02-20 20:01:14,746 INFO L290 TraceCheckUtils]: 75: Hoare triple {41360#false} assume !(0 == ~p_dw_pc~0); {41360#false} is VALID [2022-02-20 20:01:14,746 INFO L290 TraceCheckUtils]: 76: Hoare triple {41360#false} assume 1 == ~p_dw_pc~0; {41360#false} is VALID [2022-02-20 20:01:14,746 INFO L290 TraceCheckUtils]: 77: Hoare triple {41360#false} assume !(0 == ~q_free~0); {41360#false} is VALID [2022-02-20 20:01:14,746 INFO L290 TraceCheckUtils]: 78: Hoare triple {41360#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {41360#false} is VALID [2022-02-20 20:01:14,746 INFO L290 TraceCheckUtils]: 79: Hoare triple {41360#false} assume !false; {41360#false} is VALID [2022-02-20 20:01:14,747 INFO L290 TraceCheckUtils]: 80: Hoare triple {41360#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {41360#false} is VALID [2022-02-20 20:01:14,747 INFO L290 TraceCheckUtils]: 81: Hoare triple {41360#false} assume { :end_inline_do_write_p } true; {41360#false} is VALID [2022-02-20 20:01:14,747 INFO L290 TraceCheckUtils]: 82: Hoare triple {41360#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {41360#false} is VALID [2022-02-20 20:01:14,747 INFO L290 TraceCheckUtils]: 83: Hoare triple {41360#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {41360#false} is VALID [2022-02-20 20:01:14,747 INFO L290 TraceCheckUtils]: 84: Hoare triple {41360#false} assume !(0 == ~c_dr_pc~0); {41360#false} is VALID [2022-02-20 20:01:14,747 INFO L290 TraceCheckUtils]: 85: Hoare triple {41360#false} assume 2 == ~c_dr_pc~0; {41360#false} is VALID [2022-02-20 20:01:14,747 INFO L290 TraceCheckUtils]: 86: Hoare triple {41360#false} do_read_c_~a~0#1 := ~a_t~0; {41360#false} is VALID [2022-02-20 20:01:14,747 INFO L290 TraceCheckUtils]: 87: Hoare triple {41360#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {41360#false} is VALID [2022-02-20 20:01:14,748 INFO L290 TraceCheckUtils]: 88: Hoare triple {41360#false} assume !(~p_last_write~0 == ~c_last_read~0); {41360#false} is VALID [2022-02-20 20:01:14,748 INFO L272 TraceCheckUtils]: 89: Hoare triple {41360#false} call error1(); {41360#false} is VALID [2022-02-20 20:01:14,748 INFO L290 TraceCheckUtils]: 90: Hoare triple {41360#false} assume !false; {41360#false} is VALID [2022-02-20 20:01:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 20:01:14,748 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:14,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828832657] [2022-02-20 20:01:14,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828832657] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:14,749 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:14,749 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:14,749 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185233352] [2022-02-20 20:01:14,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:14,750 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-02-20 20:01:14,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:14,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:14,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:14,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:14,791 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:14,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:14,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:14,792 INFO L87 Difference]: Start difference. First operand 1967 states and 2622 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:19,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:19,085 INFO L93 Difference]: Finished difference Result 3792 states and 5024 transitions. [2022-02-20 20:01:19,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:01:19,085 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-02-20 20:01:19,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:19,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 837 transitions. [2022-02-20 20:01:19,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:19,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 837 transitions. [2022-02-20 20:01:19,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 837 transitions. [2022-02-20 20:01:19,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 837 edges. 837 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:19,857 INFO L225 Difference]: With dead ends: 3792 [2022-02-20 20:01:19,857 INFO L226 Difference]: Without dead ends: 2161 [2022-02-20 20:01:19,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 20:01:19,861 INFO L933 BasicCegarLoop]: 646 mSDtfsCounter, 578 mSDsluCounter, 2229 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 2875 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:19,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [580 Valid, 2875 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 20:01:19,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2022-02-20 20:01:19,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 2027. [2022-02-20 20:01:19,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:19,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2161 states. Second operand has 2027 states, 1631 states have (on average 1.3390557939914163) internal successors, (2184), 1656 states have internal predecessors, (2184), 216 states have call successors, (216), 139 states have call predecessors, (216), 178 states have return successors, (276), 234 states have call predecessors, (276), 214 states have call successors, (276) [2022-02-20 20:01:19,961 INFO L74 IsIncluded]: Start isIncluded. First operand 2161 states. Second operand has 2027 states, 1631 states have (on average 1.3390557939914163) internal successors, (2184), 1656 states have internal predecessors, (2184), 216 states have call successors, (216), 139 states have call predecessors, (216), 178 states have return successors, (276), 234 states have call predecessors, (276), 214 states have call successors, (276) [2022-02-20 20:01:19,963 INFO L87 Difference]: Start difference. First operand 2161 states. Second operand has 2027 states, 1631 states have (on average 1.3390557939914163) internal successors, (2184), 1656 states have internal predecessors, (2184), 216 states have call successors, (216), 139 states have call predecessors, (216), 178 states have return successors, (276), 234 states have call predecessors, (276), 214 states have call successors, (276) [2022-02-20 20:01:20,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:20,113 INFO L93 Difference]: Finished difference Result 2161 states and 2865 transitions. [2022-02-20 20:01:20,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2865 transitions. [2022-02-20 20:01:20,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:20,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:20,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 2027 states, 1631 states have (on average 1.3390557939914163) internal successors, (2184), 1656 states have internal predecessors, (2184), 216 states have call successors, (216), 139 states have call predecessors, (216), 178 states have return successors, (276), 234 states have call predecessors, (276), 214 states have call successors, (276) Second operand 2161 states. [2022-02-20 20:01:20,122 INFO L87 Difference]: Start difference. First operand has 2027 states, 1631 states have (on average 1.3390557939914163) internal successors, (2184), 1656 states have internal predecessors, (2184), 216 states have call successors, (216), 139 states have call predecessors, (216), 178 states have return successors, (276), 234 states have call predecessors, (276), 214 states have call successors, (276) Second operand 2161 states. [2022-02-20 20:01:20,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:20,288 INFO L93 Difference]: Finished difference Result 2161 states and 2865 transitions. [2022-02-20 20:01:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2865 transitions. [2022-02-20 20:01:20,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:20,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:20,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:20,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 1631 states have (on average 1.3390557939914163) internal successors, (2184), 1656 states have internal predecessors, (2184), 216 states have call successors, (216), 139 states have call predecessors, (216), 178 states have return successors, (276), 234 states have call predecessors, (276), 214 states have call successors, (276) [2022-02-20 20:01:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2676 transitions. [2022-02-20 20:01:20,500 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2676 transitions. Word has length 91 [2022-02-20 20:01:20,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:20,500 INFO L470 AbstractCegarLoop]: Abstraction has 2027 states and 2676 transitions. [2022-02-20 20:01:20,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 20:01:20,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2676 transitions. [2022-02-20 20:01:20,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:20,503 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:20,503 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:20,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:01:20,503 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:20,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:20,504 INFO L85 PathProgramCache]: Analyzing trace with hash 579167845, now seen corresponding path program 1 times [2022-02-20 20:01:20,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:20,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603372959] [2022-02-20 20:01:20,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:20,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:20,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:20,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {53596#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:20,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:20,557 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {53551#(= ~q_write_ev~0 ~q_read_ev~0)} #1721#return; {53551#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:20,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:20,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:20,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:20,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:20,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {53551#(= ~q_write_ev~0 ~q_read_ev~0)} #1723#return; {53551#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:20,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:20,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:20,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {53549#true} havoc ~__retres1~0; {53549#true} is VALID [2022-02-20 20:01:20,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {53549#true} assume !(1 == ~p_dw_pc~0); {53549#true} is VALID [2022-02-20 20:01:20,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {53549#true} assume !(2 == ~p_dw_pc~0); {53549#true} is VALID [2022-02-20 20:01:20,590 INFO L290 TraceCheckUtils]: 3: Hoare triple {53549#true} ~__retres1~0 := 0; {53549#true} is VALID [2022-02-20 20:01:20,590 INFO L290 TraceCheckUtils]: 4: Hoare triple {53549#true} #res := ~__retres1~0; {53549#true} is VALID [2022-02-20 20:01:20,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {53549#true} assume true; {53549#true} is VALID [2022-02-20 20:01:20,590 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {53549#true} {53549#true} #1717#return; {53549#true} is VALID [2022-02-20 20:01:20,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:20,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {53549#true} havoc ~__retres1~1; {53549#true} is VALID [2022-02-20 20:01:20,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {53549#true} assume !(1 == ~c_dr_pc~0); {53549#true} is VALID [2022-02-20 20:01:20,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {53549#true} assume !(2 == ~c_dr_pc~0); {53549#true} is VALID [2022-02-20 20:01:20,595 INFO L290 TraceCheckUtils]: 3: Hoare triple {53549#true} ~__retres1~1 := 0; {53549#true} is VALID [2022-02-20 20:01:20,595 INFO L290 TraceCheckUtils]: 4: Hoare triple {53549#true} #res := ~__retres1~1; {53549#true} is VALID [2022-02-20 20:01:20,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {53549#true} assume true; {53549#true} is VALID [2022-02-20 20:01:20,595 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {53549#true} {53549#true} #1719#return; {53549#true} is VALID [2022-02-20 20:01:20,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {53598#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {53549#true} is VALID [2022-02-20 20:01:20,596 INFO L272 TraceCheckUtils]: 1: Hoare triple {53549#true} call #t~ret8 := is_do_write_p_triggered(); {53549#true} is VALID [2022-02-20 20:01:20,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {53549#true} havoc ~__retres1~0; {53549#true} is VALID [2022-02-20 20:01:20,596 INFO L290 TraceCheckUtils]: 3: Hoare triple {53549#true} assume !(1 == ~p_dw_pc~0); {53549#true} is VALID [2022-02-20 20:01:20,596 INFO L290 TraceCheckUtils]: 4: Hoare triple {53549#true} assume !(2 == ~p_dw_pc~0); {53549#true} is VALID [2022-02-20 20:01:20,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {53549#true} ~__retres1~0 := 0; {53549#true} is VALID [2022-02-20 20:01:20,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {53549#true} #res := ~__retres1~0; {53549#true} is VALID [2022-02-20 20:01:20,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {53549#true} assume true; {53549#true} is VALID [2022-02-20 20:01:20,597 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {53549#true} {53549#true} #1717#return; {53549#true} is VALID [2022-02-20 20:01:20,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {53549#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {53549#true} is VALID [2022-02-20 20:01:20,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {53549#true} assume !(0 != ~tmp~1); {53549#true} is VALID [2022-02-20 20:01:20,597 INFO L272 TraceCheckUtils]: 11: Hoare triple {53549#true} call #t~ret9 := is_do_read_c_triggered(); {53549#true} is VALID [2022-02-20 20:01:20,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {53549#true} havoc ~__retres1~1; {53549#true} is VALID [2022-02-20 20:01:20,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {53549#true} assume !(1 == ~c_dr_pc~0); {53549#true} is VALID [2022-02-20 20:01:20,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {53549#true} assume !(2 == ~c_dr_pc~0); {53549#true} is VALID [2022-02-20 20:01:20,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {53549#true} ~__retres1~1 := 0; {53549#true} is VALID [2022-02-20 20:01:20,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {53549#true} #res := ~__retres1~1; {53549#true} is VALID [2022-02-20 20:01:20,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {53549#true} assume true; {53549#true} is VALID [2022-02-20 20:01:20,598 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {53549#true} {53549#true} #1719#return; {53549#true} is VALID [2022-02-20 20:01:20,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {53549#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {53549#true} is VALID [2022-02-20 20:01:20,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {53549#true} assume !(0 != ~tmp___0~1); {53549#true} is VALID [2022-02-20 20:01:20,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {53549#true} assume true; {53549#true} is VALID [2022-02-20 20:01:20,599 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {53549#true} {53551#(= ~q_write_ev~0 ~q_read_ev~0)} #1725#return; {53551#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:20,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:20,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {53613#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:01:20,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {53613#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {53614#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:20,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {53614#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {53614#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:20,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53614#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {53551#(= ~q_write_ev~0 ~q_read_ev~0)} #1727#return; {53550#false} is VALID [2022-02-20 20:01:20,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:20,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {53549#true} havoc ~__retres1~2; {53549#true} is VALID [2022-02-20 20:01:20,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {53549#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {53549#true} is VALID [2022-02-20 20:01:20,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {53549#true} #res := ~__retres1~2; {53549#true} is VALID [2022-02-20 20:01:20,627 INFO L290 TraceCheckUtils]: 3: Hoare triple {53549#true} assume true; {53549#true} is VALID [2022-02-20 20:01:20,627 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {53549#true} {53550#false} #1729#return; {53550#false} is VALID [2022-02-20 20:01:20,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:20,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {53549#true} havoc ~__retres1~2; {53549#true} is VALID [2022-02-20 20:01:20,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {53549#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {53549#true} is VALID [2022-02-20 20:01:20,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {53549#true} #res := ~__retres1~2; {53549#true} is VALID [2022-02-20 20:01:20,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {53549#true} assume true; {53549#true} is VALID [2022-02-20 20:01:20,631 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {53549#true} {53550#false} #1729#return; {53550#false} is VALID [2022-02-20 20:01:20,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {53549#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {53549#true} is VALID [2022-02-20 20:01:20,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {53549#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {53549#true} is VALID [2022-02-20 20:01:20,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {53549#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {53551#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:20,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {53551#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {53551#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:20,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {53551#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {53596#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:20,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {53596#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:20,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:20,634 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {53551#(= ~q_write_ev~0 ~q_read_ev~0)} #1721#return; {53551#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:20,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {53551#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {53551#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:20,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {53551#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {53551#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:20,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {53551#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {53551#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:20,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {53551#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {53551#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:20,635 INFO L272 TraceCheckUtils]: 12: Hoare triple {53551#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:20,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:20,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_write_ev~0); {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:20,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:20,644 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {53551#(= ~q_write_ev~0 ~q_read_ev~0)} #1723#return; {53551#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:20,645 INFO L272 TraceCheckUtils]: 17: Hoare triple {53551#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {53598#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:20,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {53598#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {53549#true} is VALID [2022-02-20 20:01:20,645 INFO L272 TraceCheckUtils]: 19: Hoare triple {53549#true} call #t~ret8 := is_do_write_p_triggered(); {53549#true} is VALID [2022-02-20 20:01:20,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {53549#true} havoc ~__retres1~0; {53549#true} is VALID [2022-02-20 20:01:20,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {53549#true} assume !(1 == ~p_dw_pc~0); {53549#true} is VALID [2022-02-20 20:01:20,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {53549#true} assume !(2 == ~p_dw_pc~0); {53549#true} is VALID [2022-02-20 20:01:20,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {53549#true} ~__retres1~0 := 0; {53549#true} is VALID [2022-02-20 20:01:20,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {53549#true} #res := ~__retres1~0; {53549#true} is VALID [2022-02-20 20:01:20,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {53549#true} assume true; {53549#true} is VALID [2022-02-20 20:01:20,646 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {53549#true} {53549#true} #1717#return; {53549#true} is VALID [2022-02-20 20:01:20,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {53549#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {53549#true} is VALID [2022-02-20 20:01:20,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {53549#true} assume !(0 != ~tmp~1); {53549#true} is VALID [2022-02-20 20:01:20,646 INFO L272 TraceCheckUtils]: 29: Hoare triple {53549#true} call #t~ret9 := is_do_read_c_triggered(); {53549#true} is VALID [2022-02-20 20:01:20,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {53549#true} havoc ~__retres1~1; {53549#true} is VALID [2022-02-20 20:01:20,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {53549#true} assume !(1 == ~c_dr_pc~0); {53549#true} is VALID [2022-02-20 20:01:20,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {53549#true} assume !(2 == ~c_dr_pc~0); {53549#true} is VALID [2022-02-20 20:01:20,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {53549#true} ~__retres1~1 := 0; {53549#true} is VALID [2022-02-20 20:01:20,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {53549#true} #res := ~__retres1~1; {53549#true} is VALID [2022-02-20 20:01:20,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {53549#true} assume true; {53549#true} is VALID [2022-02-20 20:01:20,647 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {53549#true} {53549#true} #1719#return; {53549#true} is VALID [2022-02-20 20:01:20,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {53549#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {53549#true} is VALID [2022-02-20 20:01:20,647 INFO L290 TraceCheckUtils]: 38: Hoare triple {53549#true} assume !(0 != ~tmp___0~1); {53549#true} is VALID [2022-02-20 20:01:20,647 INFO L290 TraceCheckUtils]: 39: Hoare triple {53549#true} assume true; {53549#true} is VALID [2022-02-20 20:01:20,648 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {53549#true} {53551#(= ~q_write_ev~0 ~q_read_ev~0)} #1725#return; {53551#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 20:01:20,648 INFO L272 TraceCheckUtils]: 41: Hoare triple {53551#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:20,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {53597#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {53613#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 20:01:20,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {53613#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {53614#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:20,649 INFO L290 TraceCheckUtils]: 44: Hoare triple {53614#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {53614#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 20:01:20,650 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {53614#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {53551#(= ~q_write_ev~0 ~q_read_ev~0)} #1727#return; {53550#false} is VALID [2022-02-20 20:01:20,650 INFO L290 TraceCheckUtils]: 46: Hoare triple {53550#false} assume !false; {53550#false} is VALID [2022-02-20 20:01:20,650 INFO L290 TraceCheckUtils]: 47: Hoare triple {53550#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {53550#false} is VALID [2022-02-20 20:01:20,650 INFO L290 TraceCheckUtils]: 48: Hoare triple {53550#false} assume !false; {53550#false} is VALID [2022-02-20 20:01:20,650 INFO L272 TraceCheckUtils]: 49: Hoare triple {53550#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {53549#true} is VALID [2022-02-20 20:01:20,650 INFO L290 TraceCheckUtils]: 50: Hoare triple {53549#true} havoc ~__retres1~2; {53549#true} is VALID [2022-02-20 20:01:20,650 INFO L290 TraceCheckUtils]: 51: Hoare triple {53549#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {53549#true} is VALID [2022-02-20 20:01:20,651 INFO L290 TraceCheckUtils]: 52: Hoare triple {53549#true} #res := ~__retres1~2; {53549#true} is VALID [2022-02-20 20:01:20,651 INFO L290 TraceCheckUtils]: 53: Hoare triple {53549#true} assume true; {53549#true} is VALID [2022-02-20 20:01:20,651 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {53549#true} {53550#false} #1729#return; {53550#false} is VALID [2022-02-20 20:01:20,651 INFO L290 TraceCheckUtils]: 55: Hoare triple {53550#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {53550#false} is VALID [2022-02-20 20:01:20,651 INFO L290 TraceCheckUtils]: 56: Hoare triple {53550#false} assume 0 != eval1_~tmp___1~0#1; {53550#false} is VALID [2022-02-20 20:01:20,651 INFO L290 TraceCheckUtils]: 57: Hoare triple {53550#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {53550#false} is VALID [2022-02-20 20:01:20,651 INFO L290 TraceCheckUtils]: 58: Hoare triple {53550#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {53550#false} is VALID [2022-02-20 20:01:20,651 INFO L290 TraceCheckUtils]: 59: Hoare triple {53550#false} assume 0 == ~p_dw_pc~0; {53550#false} is VALID [2022-02-20 20:01:20,651 INFO L290 TraceCheckUtils]: 60: Hoare triple {53550#false} assume !false; {53550#false} is VALID [2022-02-20 20:01:20,652 INFO L290 TraceCheckUtils]: 61: Hoare triple {53550#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {53550#false} is VALID [2022-02-20 20:01:20,652 INFO L290 TraceCheckUtils]: 62: Hoare triple {53550#false} assume { :end_inline_do_write_p } true; {53550#false} is VALID [2022-02-20 20:01:20,652 INFO L290 TraceCheckUtils]: 63: Hoare triple {53550#false} assume !(0 == ~c_dr_st~0); {53550#false} is VALID [2022-02-20 20:01:20,652 INFO L290 TraceCheckUtils]: 64: Hoare triple {53550#false} assume !false; {53550#false} is VALID [2022-02-20 20:01:20,652 INFO L272 TraceCheckUtils]: 65: Hoare triple {53550#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {53549#true} is VALID [2022-02-20 20:01:20,652 INFO L290 TraceCheckUtils]: 66: Hoare triple {53549#true} havoc ~__retres1~2; {53549#true} is VALID [2022-02-20 20:01:20,652 INFO L290 TraceCheckUtils]: 67: Hoare triple {53549#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {53549#true} is VALID [2022-02-20 20:01:20,652 INFO L290 TraceCheckUtils]: 68: Hoare triple {53549#true} #res := ~__retres1~2; {53549#true} is VALID [2022-02-20 20:01:20,653 INFO L290 TraceCheckUtils]: 69: Hoare triple {53549#true} assume true; {53549#true} is VALID [2022-02-20 20:01:20,653 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {53549#true} {53550#false} #1729#return; {53550#false} is VALID [2022-02-20 20:01:20,653 INFO L290 TraceCheckUtils]: 71: Hoare triple {53550#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {53550#false} is VALID [2022-02-20 20:01:20,653 INFO L290 TraceCheckUtils]: 72: Hoare triple {53550#false} assume 0 != eval1_~tmp___1~0#1; {53550#false} is VALID [2022-02-20 20:01:20,653 INFO L290 TraceCheckUtils]: 73: Hoare triple {53550#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {53550#false} is VALID [2022-02-20 20:01:20,653 INFO L290 TraceCheckUtils]: 74: Hoare triple {53550#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {53550#false} is VALID [2022-02-20 20:01:20,653 INFO L290 TraceCheckUtils]: 75: Hoare triple {53550#false} assume !(0 == ~p_dw_pc~0); {53550#false} is VALID [2022-02-20 20:01:20,653 INFO L290 TraceCheckUtils]: 76: Hoare triple {53550#false} assume 1 == ~p_dw_pc~0; {53550#false} is VALID [2022-02-20 20:01:20,654 INFO L290 TraceCheckUtils]: 77: Hoare triple {53550#false} assume !(0 == ~q_free~0); {53550#false} is VALID [2022-02-20 20:01:20,654 INFO L290 TraceCheckUtils]: 78: Hoare triple {53550#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {53550#false} is VALID [2022-02-20 20:01:20,654 INFO L290 TraceCheckUtils]: 79: Hoare triple {53550#false} assume !false; {53550#false} is VALID [2022-02-20 20:01:20,654 INFO L290 TraceCheckUtils]: 80: Hoare triple {53550#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {53550#false} is VALID [2022-02-20 20:01:20,654 INFO L290 TraceCheckUtils]: 81: Hoare triple {53550#false} assume { :end_inline_do_write_p } true; {53550#false} is VALID [2022-02-20 20:01:20,654 INFO L290 TraceCheckUtils]: 82: Hoare triple {53550#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {53550#false} is VALID [2022-02-20 20:01:20,654 INFO L290 TraceCheckUtils]: 83: Hoare triple {53550#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {53550#false} is VALID [2022-02-20 20:01:20,654 INFO L290 TraceCheckUtils]: 84: Hoare triple {53550#false} assume !(0 == ~c_dr_pc~0); {53550#false} is VALID [2022-02-20 20:01:20,655 INFO L290 TraceCheckUtils]: 85: Hoare triple {53550#false} assume 2 == ~c_dr_pc~0; {53550#false} is VALID [2022-02-20 20:01:20,655 INFO L290 TraceCheckUtils]: 86: Hoare triple {53550#false} do_read_c_~a~0#1 := ~a_t~0; {53550#false} is VALID [2022-02-20 20:01:20,655 INFO L290 TraceCheckUtils]: 87: Hoare triple {53550#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {53550#false} is VALID [2022-02-20 20:01:20,655 INFO L290 TraceCheckUtils]: 88: Hoare triple {53550#false} assume !(~p_last_write~0 == ~c_last_read~0); {53550#false} is VALID [2022-02-20 20:01:20,655 INFO L272 TraceCheckUtils]: 89: Hoare triple {53550#false} call error1(); {53550#false} is VALID [2022-02-20 20:01:20,655 INFO L290 TraceCheckUtils]: 90: Hoare triple {53550#false} assume !false; {53550#false} is VALID [2022-02-20 20:01:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 20:01:20,656 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:20,656 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603372959] [2022-02-20 20:01:20,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603372959] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:20,656 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:20,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:01:20,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596776352] [2022-02-20 20:01:20,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:20,657 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:01:20,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:20,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:20,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:20,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:01:20,704 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:20,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:01:20,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:01:20,705 INFO L87 Difference]: Start difference. First operand 2027 states and 2676 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:24,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:24,104 INFO L93 Difference]: Finished difference Result 3554 states and 4640 transitions. [2022-02-20 20:01:24,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 20:01:24,104 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:01:24,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:24,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1029 transitions. [2022-02-20 20:01:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1029 transitions. [2022-02-20 20:01:24,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 1029 transitions. [2022-02-20 20:01:24,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1029 edges. 1029 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:24,857 INFO L225 Difference]: With dead ends: 3554 [2022-02-20 20:01:24,858 INFO L226 Difference]: Without dead ends: 2101 [2022-02-20 20:01:24,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-02-20 20:01:24,860 INFO L933 BasicCegarLoop]: 679 mSDtfsCounter, 1309 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 2317 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:24,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1340 Valid, 2317 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 20:01:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2022-02-20 20:01:24,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 1806. [2022-02-20 20:01:24,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:24,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2101 states. Second operand has 1806 states, 1463 states have (on average 1.343814080656186) internal successors, (1966), 1483 states have internal predecessors, (1966), 188 states have call successors, (188), 120 states have call predecessors, (188), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2022-02-20 20:01:24,950 INFO L74 IsIncluded]: Start isIncluded. First operand 2101 states. Second operand has 1806 states, 1463 states have (on average 1.343814080656186) internal successors, (1966), 1483 states have internal predecessors, (1966), 188 states have call successors, (188), 120 states have call predecessors, (188), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2022-02-20 20:01:24,952 INFO L87 Difference]: Start difference. First operand 2101 states. Second operand has 1806 states, 1463 states have (on average 1.343814080656186) internal successors, (1966), 1483 states have internal predecessors, (1966), 188 states have call successors, (188), 120 states have call predecessors, (188), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2022-02-20 20:01:25,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:25,134 INFO L93 Difference]: Finished difference Result 2101 states and 2763 transitions. [2022-02-20 20:01:25,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2763 transitions. [2022-02-20 20:01:25,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:25,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:25,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 1806 states, 1463 states have (on average 1.343814080656186) internal successors, (1966), 1483 states have internal predecessors, (1966), 188 states have call successors, (188), 120 states have call predecessors, (188), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) Second operand 2101 states. [2022-02-20 20:01:25,188 INFO L87 Difference]: Start difference. First operand has 1806 states, 1463 states have (on average 1.343814080656186) internal successors, (1966), 1483 states have internal predecessors, (1966), 188 states have call successors, (188), 120 states have call predecessors, (188), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) Second operand 2101 states. [2022-02-20 20:01:25,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:25,355 INFO L93 Difference]: Finished difference Result 2101 states and 2763 transitions. [2022-02-20 20:01:25,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2763 transitions. [2022-02-20 20:01:25,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:25,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:25,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:25,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1463 states have (on average 1.343814080656186) internal successors, (1966), 1483 states have internal predecessors, (1966), 188 states have call successors, (188), 120 states have call predecessors, (188), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2022-02-20 20:01:25,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2390 transitions. [2022-02-20 20:01:25,526 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2390 transitions. Word has length 91 [2022-02-20 20:01:25,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:25,526 INFO L470 AbstractCegarLoop]: Abstraction has 1806 states and 2390 transitions. [2022-02-20 20:01:25,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:25,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2390 transitions. [2022-02-20 20:01:25,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:25,527 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:25,528 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:25,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:01:25,528 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:25,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:25,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1776637405, now seen corresponding path program 1 times [2022-02-20 20:01:25,529 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:25,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790942813] [2022-02-20 20:01:25,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:25,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {65017#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {64970#true} is VALID [2022-02-20 20:01:25,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {64970#true} assume true; {64970#true} is VALID [2022-02-20 20:01:25,568 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64970#true} {64970#true} #1721#return; {64970#true} is VALID [2022-02-20 20:01:25,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {65018#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {64970#true} is VALID [2022-02-20 20:01:25,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {64970#true} assume !(0 == ~q_write_ev~0); {64970#true} is VALID [2022-02-20 20:01:25,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {64970#true} assume true; {64970#true} is VALID [2022-02-20 20:01:25,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64970#true} {64975#(= ~c_dr_st~0 0)} #1723#return; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {64970#true} havoc ~__retres1~0; {64970#true} is VALID [2022-02-20 20:01:25,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {64970#true} assume !(1 == ~p_dw_pc~0); {64970#true} is VALID [2022-02-20 20:01:25,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {64970#true} assume !(2 == ~p_dw_pc~0); {64970#true} is VALID [2022-02-20 20:01:25,598 INFO L290 TraceCheckUtils]: 3: Hoare triple {64970#true} ~__retres1~0 := 0; {64970#true} is VALID [2022-02-20 20:01:25,599 INFO L290 TraceCheckUtils]: 4: Hoare triple {64970#true} #res := ~__retres1~0; {64970#true} is VALID [2022-02-20 20:01:25,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {64970#true} assume true; {64970#true} is VALID [2022-02-20 20:01:25,599 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {64970#true} {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1717#return; {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:25,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {64970#true} havoc ~__retres1~1; {64970#true} is VALID [2022-02-20 20:01:25,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {64970#true} assume !(1 == ~c_dr_pc~0); {64970#true} is VALID [2022-02-20 20:01:25,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {64970#true} assume !(2 == ~c_dr_pc~0); {64970#true} is VALID [2022-02-20 20:01:25,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {64970#true} ~__retres1~1 := 0; {64970#true} is VALID [2022-02-20 20:01:25,603 INFO L290 TraceCheckUtils]: 4: Hoare triple {64970#true} #res := ~__retres1~1; {64970#true} is VALID [2022-02-20 20:01:25,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {64970#true} assume true; {64970#true} is VALID [2022-02-20 20:01:25,603 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {64970#true} {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1719#return; {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:25,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {65019#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:25,604 INFO L272 TraceCheckUtils]: 1: Hoare triple {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {64970#true} is VALID [2022-02-20 20:01:25,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {64970#true} havoc ~__retres1~0; {64970#true} is VALID [2022-02-20 20:01:25,604 INFO L290 TraceCheckUtils]: 3: Hoare triple {64970#true} assume !(1 == ~p_dw_pc~0); {64970#true} is VALID [2022-02-20 20:01:25,604 INFO L290 TraceCheckUtils]: 4: Hoare triple {64970#true} assume !(2 == ~p_dw_pc~0); {64970#true} is VALID [2022-02-20 20:01:25,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {64970#true} ~__retres1~0 := 0; {64970#true} is VALID [2022-02-20 20:01:25,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {64970#true} #res := ~__retres1~0; {64970#true} is VALID [2022-02-20 20:01:25,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {64970#true} assume true; {64970#true} is VALID [2022-02-20 20:01:25,605 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {64970#true} {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1717#return; {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:25,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:25,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:25,605 INFO L272 TraceCheckUtils]: 11: Hoare triple {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {64970#true} is VALID [2022-02-20 20:01:25,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {64970#true} havoc ~__retres1~1; {64970#true} is VALID [2022-02-20 20:01:25,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {64970#true} assume !(1 == ~c_dr_pc~0); {64970#true} is VALID [2022-02-20 20:01:25,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {64970#true} assume !(2 == ~c_dr_pc~0); {64970#true} is VALID [2022-02-20 20:01:25,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {64970#true} ~__retres1~1 := 0; {64970#true} is VALID [2022-02-20 20:01:25,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {64970#true} #res := ~__retres1~1; {64970#true} is VALID [2022-02-20 20:01:25,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {64970#true} assume true; {64970#true} is VALID [2022-02-20 20:01:25,607 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {64970#true} {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1719#return; {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:25,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:25,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:25,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:25,608 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {64975#(= ~c_dr_st~0 0)} #1725#return; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {65018#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {64970#true} is VALID [2022-02-20 20:01:25,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {64970#true} assume !(1 == ~q_write_ev~0); {64970#true} is VALID [2022-02-20 20:01:25,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {64970#true} assume true; {64970#true} is VALID [2022-02-20 20:01:25,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64970#true} {64975#(= ~c_dr_st~0 0)} #1727#return; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {64970#true} havoc ~__retres1~2; {64970#true} is VALID [2022-02-20 20:01:25,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {64970#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {64970#true} is VALID [2022-02-20 20:01:25,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {64970#true} #res := ~__retres1~2; {64970#true} is VALID [2022-02-20 20:01:25,615 INFO L290 TraceCheckUtils]: 3: Hoare triple {64970#true} assume true; {64970#true} is VALID [2022-02-20 20:01:25,616 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {64970#true} {64975#(= ~c_dr_st~0 0)} #1729#return; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:25,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {64970#true} havoc ~__retres1~2; {64970#true} is VALID [2022-02-20 20:01:25,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {64970#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {64970#true} is VALID [2022-02-20 20:01:25,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {64970#true} #res := ~__retres1~2; {64970#true} is VALID [2022-02-20 20:01:25,619 INFO L290 TraceCheckUtils]: 3: Hoare triple {64970#true} assume true; {64970#true} is VALID [2022-02-20 20:01:25,619 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {64970#true} {64971#false} #1729#return; {64971#false} is VALID [2022-02-20 20:01:25,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {64970#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {64970#true} is VALID [2022-02-20 20:01:25,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {64970#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {64970#true} is VALID [2022-02-20 20:01:25,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {64970#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {64970#true} is VALID [2022-02-20 20:01:25,620 INFO L290 TraceCheckUtils]: 3: Hoare triple {64970#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {64970#true} is VALID [2022-02-20 20:01:25,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {64970#true} call update_channels1(); {65017#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:25,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {65017#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {64970#true} is VALID [2022-02-20 20:01:25,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {64970#true} assume true; {64970#true} is VALID [2022-02-20 20:01:25,621 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {64970#true} {64970#true} #1721#return; {64970#true} is VALID [2022-02-20 20:01:25,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {64970#true} assume { :begin_inline_init_threads1 } true; {64970#true} is VALID [2022-02-20 20:01:25,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {64970#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {64970#true} is VALID [2022-02-20 20:01:25,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {64970#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {64975#(= ~c_dr_st~0 0)} assume { :end_inline_init_threads1 } true; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,622 INFO L272 TraceCheckUtils]: 12: Hoare triple {64975#(= ~c_dr_st~0 0)} call fire_delta_events1(); {65018#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:25,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {65018#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {64970#true} is VALID [2022-02-20 20:01:25,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {64970#true} assume !(0 == ~q_write_ev~0); {64970#true} is VALID [2022-02-20 20:01:25,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {64970#true} assume true; {64970#true} is VALID [2022-02-20 20:01:25,622 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {64970#true} {64975#(= ~c_dr_st~0 0)} #1723#return; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,623 INFO L272 TraceCheckUtils]: 17: Hoare triple {64975#(= ~c_dr_st~0 0)} call activate_threads1(); {65019#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:25,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {65019#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:25,623 INFO L272 TraceCheckUtils]: 19: Hoare triple {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret8 := is_do_write_p_triggered(); {64970#true} is VALID [2022-02-20 20:01:25,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {64970#true} havoc ~__retres1~0; {64970#true} is VALID [2022-02-20 20:01:25,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {64970#true} assume !(1 == ~p_dw_pc~0); {64970#true} is VALID [2022-02-20 20:01:25,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {64970#true} assume !(2 == ~p_dw_pc~0); {64970#true} is VALID [2022-02-20 20:01:25,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {64970#true} ~__retres1~0 := 0; {64970#true} is VALID [2022-02-20 20:01:25,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {64970#true} #res := ~__retres1~0; {64970#true} is VALID [2022-02-20 20:01:25,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {64970#true} assume true; {64970#true} is VALID [2022-02-20 20:01:25,624 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {64970#true} {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1717#return; {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:25,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:25,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp~1); {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:25,625 INFO L272 TraceCheckUtils]: 29: Hoare triple {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} call #t~ret9 := is_do_read_c_triggered(); {64970#true} is VALID [2022-02-20 20:01:25,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {64970#true} havoc ~__retres1~1; {64970#true} is VALID [2022-02-20 20:01:25,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {64970#true} assume !(1 == ~c_dr_pc~0); {64970#true} is VALID [2022-02-20 20:01:25,625 INFO L290 TraceCheckUtils]: 32: Hoare triple {64970#true} assume !(2 == ~c_dr_pc~0); {64970#true} is VALID [2022-02-20 20:01:25,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {64970#true} ~__retres1~1 := 0; {64970#true} is VALID [2022-02-20 20:01:25,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {64970#true} #res := ~__retres1~1; {64970#true} is VALID [2022-02-20 20:01:25,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {64970#true} assume true; {64970#true} is VALID [2022-02-20 20:01:25,626 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {64970#true} {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} #1719#return; {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:25,626 INFO L290 TraceCheckUtils]: 37: Hoare triple {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:25,627 INFO L290 TraceCheckUtils]: 38: Hoare triple {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume !(0 != ~tmp___0~1); {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:25,627 INFO L290 TraceCheckUtils]: 39: Hoare triple {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} assume true; {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} is VALID [2022-02-20 20:01:25,627 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {65020#(= ~c_dr_st~0 |old(~c_dr_st~0)|)} {64975#(= ~c_dr_st~0 0)} #1725#return; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,628 INFO L272 TraceCheckUtils]: 41: Hoare triple {64975#(= ~c_dr_st~0 0)} call reset_delta_events1(); {65018#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:25,628 INFO L290 TraceCheckUtils]: 42: Hoare triple {65018#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {64970#true} is VALID [2022-02-20 20:01:25,628 INFO L290 TraceCheckUtils]: 43: Hoare triple {64970#true} assume !(1 == ~q_write_ev~0); {64970#true} is VALID [2022-02-20 20:01:25,628 INFO L290 TraceCheckUtils]: 44: Hoare triple {64970#true} assume true; {64970#true} is VALID [2022-02-20 20:01:25,628 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {64970#true} {64975#(= ~c_dr_st~0 0)} #1727#return; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,629 INFO L290 TraceCheckUtils]: 46: Hoare triple {64975#(= ~c_dr_st~0 0)} assume !false; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,629 INFO L290 TraceCheckUtils]: 47: Hoare triple {64975#(= ~c_dr_st~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,629 INFO L290 TraceCheckUtils]: 48: Hoare triple {64975#(= ~c_dr_st~0 0)} assume !false; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,629 INFO L272 TraceCheckUtils]: 49: Hoare triple {64975#(= ~c_dr_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {64970#true} is VALID [2022-02-20 20:01:25,629 INFO L290 TraceCheckUtils]: 50: Hoare triple {64970#true} havoc ~__retres1~2; {64970#true} is VALID [2022-02-20 20:01:25,630 INFO L290 TraceCheckUtils]: 51: Hoare triple {64970#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {64970#true} is VALID [2022-02-20 20:01:25,630 INFO L290 TraceCheckUtils]: 52: Hoare triple {64970#true} #res := ~__retres1~2; {64970#true} is VALID [2022-02-20 20:01:25,630 INFO L290 TraceCheckUtils]: 53: Hoare triple {64970#true} assume true; {64970#true} is VALID [2022-02-20 20:01:25,630 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {64970#true} {64975#(= ~c_dr_st~0 0)} #1729#return; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,630 INFO L290 TraceCheckUtils]: 55: Hoare triple {64975#(= ~c_dr_st~0 0)} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,631 INFO L290 TraceCheckUtils]: 56: Hoare triple {64975#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,631 INFO L290 TraceCheckUtils]: 57: Hoare triple {64975#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,631 INFO L290 TraceCheckUtils]: 58: Hoare triple {64975#(= ~c_dr_st~0 0)} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,631 INFO L290 TraceCheckUtils]: 59: Hoare triple {64975#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_pc~0; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,632 INFO L290 TraceCheckUtils]: 60: Hoare triple {64975#(= ~c_dr_st~0 0)} assume !false; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,632 INFO L290 TraceCheckUtils]: 61: Hoare triple {64975#(= ~c_dr_st~0 0)} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,632 INFO L290 TraceCheckUtils]: 62: Hoare triple {64975#(= ~c_dr_st~0 0)} assume { :end_inline_do_write_p } true; {64975#(= ~c_dr_st~0 0)} is VALID [2022-02-20 20:01:25,632 INFO L290 TraceCheckUtils]: 63: Hoare triple {64975#(= ~c_dr_st~0 0)} assume !(0 == ~c_dr_st~0); {64971#false} is VALID [2022-02-20 20:01:25,633 INFO L290 TraceCheckUtils]: 64: Hoare triple {64971#false} assume !false; {64971#false} is VALID [2022-02-20 20:01:25,633 INFO L272 TraceCheckUtils]: 65: Hoare triple {64971#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {64970#true} is VALID [2022-02-20 20:01:25,633 INFO L290 TraceCheckUtils]: 66: Hoare triple {64970#true} havoc ~__retres1~2; {64970#true} is VALID [2022-02-20 20:01:25,633 INFO L290 TraceCheckUtils]: 67: Hoare triple {64970#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {64970#true} is VALID [2022-02-20 20:01:25,633 INFO L290 TraceCheckUtils]: 68: Hoare triple {64970#true} #res := ~__retres1~2; {64970#true} is VALID [2022-02-20 20:01:25,633 INFO L290 TraceCheckUtils]: 69: Hoare triple {64970#true} assume true; {64970#true} is VALID [2022-02-20 20:01:25,633 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {64970#true} {64971#false} #1729#return; {64971#false} is VALID [2022-02-20 20:01:25,633 INFO L290 TraceCheckUtils]: 71: Hoare triple {64971#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {64971#false} is VALID [2022-02-20 20:01:25,633 INFO L290 TraceCheckUtils]: 72: Hoare triple {64971#false} assume 0 != eval1_~tmp___1~0#1; {64971#false} is VALID [2022-02-20 20:01:25,634 INFO L290 TraceCheckUtils]: 73: Hoare triple {64971#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {64971#false} is VALID [2022-02-20 20:01:25,634 INFO L290 TraceCheckUtils]: 74: Hoare triple {64971#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {64971#false} is VALID [2022-02-20 20:01:25,634 INFO L290 TraceCheckUtils]: 75: Hoare triple {64971#false} assume !(0 == ~p_dw_pc~0); {64971#false} is VALID [2022-02-20 20:01:25,634 INFO L290 TraceCheckUtils]: 76: Hoare triple {64971#false} assume 1 == ~p_dw_pc~0; {64971#false} is VALID [2022-02-20 20:01:25,634 INFO L290 TraceCheckUtils]: 77: Hoare triple {64971#false} assume !(0 == ~q_free~0); {64971#false} is VALID [2022-02-20 20:01:25,634 INFO L290 TraceCheckUtils]: 78: Hoare triple {64971#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {64971#false} is VALID [2022-02-20 20:01:25,634 INFO L290 TraceCheckUtils]: 79: Hoare triple {64971#false} assume !false; {64971#false} is VALID [2022-02-20 20:01:25,634 INFO L290 TraceCheckUtils]: 80: Hoare triple {64971#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {64971#false} is VALID [2022-02-20 20:01:25,634 INFO L290 TraceCheckUtils]: 81: Hoare triple {64971#false} assume { :end_inline_do_write_p } true; {64971#false} is VALID [2022-02-20 20:01:25,635 INFO L290 TraceCheckUtils]: 82: Hoare triple {64971#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {64971#false} is VALID [2022-02-20 20:01:25,635 INFO L290 TraceCheckUtils]: 83: Hoare triple {64971#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {64971#false} is VALID [2022-02-20 20:01:25,635 INFO L290 TraceCheckUtils]: 84: Hoare triple {64971#false} assume !(0 == ~c_dr_pc~0); {64971#false} is VALID [2022-02-20 20:01:25,635 INFO L290 TraceCheckUtils]: 85: Hoare triple {64971#false} assume 2 == ~c_dr_pc~0; {64971#false} is VALID [2022-02-20 20:01:25,635 INFO L290 TraceCheckUtils]: 86: Hoare triple {64971#false} do_read_c_~a~0#1 := ~a_t~0; {64971#false} is VALID [2022-02-20 20:01:25,635 INFO L290 TraceCheckUtils]: 87: Hoare triple {64971#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {64971#false} is VALID [2022-02-20 20:01:25,635 INFO L290 TraceCheckUtils]: 88: Hoare triple {64971#false} assume !(~p_last_write~0 == ~c_last_read~0); {64971#false} is VALID [2022-02-20 20:01:25,635 INFO L272 TraceCheckUtils]: 89: Hoare triple {64971#false} call error1(); {64971#false} is VALID [2022-02-20 20:01:25,636 INFO L290 TraceCheckUtils]: 90: Hoare triple {64971#false} assume !false; {64971#false} is VALID [2022-02-20 20:01:25,636 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 20:01:25,636 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:25,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790942813] [2022-02-20 20:01:25,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790942813] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:25,636 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:25,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:01:25,637 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663169890] [2022-02-20 20:01:25,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:25,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-02-20 20:01:25,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:25,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:25,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:25,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:01:25,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:25,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:01:25,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:01:25,682 INFO L87 Difference]: Start difference. First operand 1806 states and 2390 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:28,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:28,733 INFO L93 Difference]: Finished difference Result 4958 states and 6502 transitions. [2022-02-20 20:01:28,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:01:28,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-02-20 20:01:28,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:28,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:28,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 978 transitions. [2022-02-20 20:01:28,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:28,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 978 transitions. [2022-02-20 20:01:28,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 978 transitions. [2022-02-20 20:01:29,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 978 edges. 978 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:29,956 INFO L225 Difference]: With dead ends: 4958 [2022-02-20 20:01:29,956 INFO L226 Difference]: Without dead ends: 3489 [2022-02-20 20:01:29,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 20:01:29,959 INFO L933 BasicCegarLoop]: 677 mSDtfsCounter, 1849 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1881 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:29,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1881 Valid, 1376 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 20:01:29,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3489 states. [2022-02-20 20:01:30,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3489 to 3275. [2022-02-20 20:01:30,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:30,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3489 states. Second operand has 3275 states, 2612 states have (on average 1.2993874425727412) internal successors, (3394), 2661 states have internal predecessors, (3394), 349 states have call successors, (349), 233 states have call predecessors, (349), 312 states have return successors, (519), 383 states have call predecessors, (519), 347 states have call successors, (519) [2022-02-20 20:01:30,171 INFO L74 IsIncluded]: Start isIncluded. First operand 3489 states. Second operand has 3275 states, 2612 states have (on average 1.2993874425727412) internal successors, (3394), 2661 states have internal predecessors, (3394), 349 states have call successors, (349), 233 states have call predecessors, (349), 312 states have return successors, (519), 383 states have call predecessors, (519), 347 states have call successors, (519) [2022-02-20 20:01:30,175 INFO L87 Difference]: Start difference. First operand 3489 states. Second operand has 3275 states, 2612 states have (on average 1.2993874425727412) internal successors, (3394), 2661 states have internal predecessors, (3394), 349 states have call successors, (349), 233 states have call predecessors, (349), 312 states have return successors, (519), 383 states have call predecessors, (519), 347 states have call successors, (519) [2022-02-20 20:01:30,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:30,770 INFO L93 Difference]: Finished difference Result 3489 states and 4558 transitions. [2022-02-20 20:01:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 4558 transitions. [2022-02-20 20:01:30,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:30,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:30,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 3275 states, 2612 states have (on average 1.2993874425727412) internal successors, (3394), 2661 states have internal predecessors, (3394), 349 states have call successors, (349), 233 states have call predecessors, (349), 312 states have return successors, (519), 383 states have call predecessors, (519), 347 states have call successors, (519) Second operand 3489 states. [2022-02-20 20:01:30,784 INFO L87 Difference]: Start difference. First operand has 3275 states, 2612 states have (on average 1.2993874425727412) internal successors, (3394), 2661 states have internal predecessors, (3394), 349 states have call successors, (349), 233 states have call predecessors, (349), 312 states have return successors, (519), 383 states have call predecessors, (519), 347 states have call successors, (519) Second operand 3489 states. [2022-02-20 20:01:31,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:31,187 INFO L93 Difference]: Finished difference Result 3489 states and 4558 transitions. [2022-02-20 20:01:31,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 4558 transitions. [2022-02-20 20:01:31,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:31,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:31,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:31,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 2612 states have (on average 1.2993874425727412) internal successors, (3394), 2661 states have internal predecessors, (3394), 349 states have call successors, (349), 233 states have call predecessors, (349), 312 states have return successors, (519), 383 states have call predecessors, (519), 347 states have call successors, (519) [2022-02-20 20:01:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 4262 transitions. [2022-02-20 20:01:31,714 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 4262 transitions. Word has length 91 [2022-02-20 20:01:31,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:31,715 INFO L470 AbstractCegarLoop]: Abstraction has 3275 states and 4262 transitions. [2022-02-20 20:01:31,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 20:01:31,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 4262 transitions. [2022-02-20 20:01:31,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 20:01:31,716 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:31,716 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:31,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:01:31,717 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:31,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:31,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1460491813, now seen corresponding path program 1 times [2022-02-20 20:01:31,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:31,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113984400] [2022-02-20 20:01:31,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:31,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {83083#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {83036#true} is VALID [2022-02-20 20:01:31,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {83036#true} assume true; {83036#true} is VALID [2022-02-20 20:01:31,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83036#true} {83038#(= 1 ~c_dr_i~0)} #1721#return; {83038#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:31,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {83084#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {83036#true} is VALID [2022-02-20 20:01:31,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {83036#true} assume !(0 == ~q_write_ev~0); {83036#true} is VALID [2022-02-20 20:01:31,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {83036#true} assume true; {83036#true} is VALID [2022-02-20 20:01:31,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83036#true} {83037#false} #1723#return; {83037#false} is VALID [2022-02-20 20:01:31,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {83036#true} havoc ~__retres1~0; {83036#true} is VALID [2022-02-20 20:01:31,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {83036#true} assume !(1 == ~p_dw_pc~0); {83036#true} is VALID [2022-02-20 20:01:31,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {83036#true} assume !(2 == ~p_dw_pc~0); {83036#true} is VALID [2022-02-20 20:01:31,833 INFO L290 TraceCheckUtils]: 3: Hoare triple {83036#true} ~__retres1~0 := 0; {83036#true} is VALID [2022-02-20 20:01:31,833 INFO L290 TraceCheckUtils]: 4: Hoare triple {83036#true} #res := ~__retres1~0; {83036#true} is VALID [2022-02-20 20:01:31,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {83036#true} assume true; {83036#true} is VALID [2022-02-20 20:01:31,833 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {83036#true} {83036#true} #1717#return; {83036#true} is VALID [2022-02-20 20:01:31,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {83036#true} havoc ~__retres1~1; {83036#true} is VALID [2022-02-20 20:01:31,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {83036#true} assume !(1 == ~c_dr_pc~0); {83036#true} is VALID [2022-02-20 20:01:31,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {83036#true} assume !(2 == ~c_dr_pc~0); {83036#true} is VALID [2022-02-20 20:01:31,836 INFO L290 TraceCheckUtils]: 3: Hoare triple {83036#true} ~__retres1~1 := 0; {83036#true} is VALID [2022-02-20 20:01:31,836 INFO L290 TraceCheckUtils]: 4: Hoare triple {83036#true} #res := ~__retres1~1; {83036#true} is VALID [2022-02-20 20:01:31,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {83036#true} assume true; {83036#true} is VALID [2022-02-20 20:01:31,836 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {83036#true} {83036#true} #1719#return; {83036#true} is VALID [2022-02-20 20:01:31,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {83085#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {83036#true} is VALID [2022-02-20 20:01:31,837 INFO L272 TraceCheckUtils]: 1: Hoare triple {83036#true} call #t~ret8 := is_do_write_p_triggered(); {83036#true} is VALID [2022-02-20 20:01:31,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {83036#true} havoc ~__retres1~0; {83036#true} is VALID [2022-02-20 20:01:31,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {83036#true} assume !(1 == ~p_dw_pc~0); {83036#true} is VALID [2022-02-20 20:01:31,837 INFO L290 TraceCheckUtils]: 4: Hoare triple {83036#true} assume !(2 == ~p_dw_pc~0); {83036#true} is VALID [2022-02-20 20:01:31,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {83036#true} ~__retres1~0 := 0; {83036#true} is VALID [2022-02-20 20:01:31,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {83036#true} #res := ~__retres1~0; {83036#true} is VALID [2022-02-20 20:01:31,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {83036#true} assume true; {83036#true} is VALID [2022-02-20 20:01:31,838 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {83036#true} {83036#true} #1717#return; {83036#true} is VALID [2022-02-20 20:01:31,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {83036#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {83036#true} is VALID [2022-02-20 20:01:31,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {83036#true} assume !(0 != ~tmp~1); {83036#true} is VALID [2022-02-20 20:01:31,838 INFO L272 TraceCheckUtils]: 11: Hoare triple {83036#true} call #t~ret9 := is_do_read_c_triggered(); {83036#true} is VALID [2022-02-20 20:01:31,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {83036#true} havoc ~__retres1~1; {83036#true} is VALID [2022-02-20 20:01:31,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {83036#true} assume !(1 == ~c_dr_pc~0); {83036#true} is VALID [2022-02-20 20:01:31,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {83036#true} assume !(2 == ~c_dr_pc~0); {83036#true} is VALID [2022-02-20 20:01:31,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {83036#true} ~__retres1~1 := 0; {83036#true} is VALID [2022-02-20 20:01:31,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {83036#true} #res := ~__retres1~1; {83036#true} is VALID [2022-02-20 20:01:31,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {83036#true} assume true; {83036#true} is VALID [2022-02-20 20:01:31,839 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {83036#true} {83036#true} #1719#return; {83036#true} is VALID [2022-02-20 20:01:31,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {83036#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {83036#true} is VALID [2022-02-20 20:01:31,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {83036#true} assume !(0 != ~tmp___0~1); {83036#true} is VALID [2022-02-20 20:01:31,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {83036#true} assume true; {83036#true} is VALID [2022-02-20 20:01:31,840 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {83036#true} {83037#false} #1725#return; {83037#false} is VALID [2022-02-20 20:01:31,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {83084#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {83036#true} is VALID [2022-02-20 20:01:31,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {83036#true} assume !(1 == ~q_write_ev~0); {83036#true} is VALID [2022-02-20 20:01:31,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {83036#true} assume true; {83036#true} is VALID [2022-02-20 20:01:31,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83036#true} {83037#false} #1727#return; {83037#false} is VALID [2022-02-20 20:01:31,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {83036#true} havoc ~__retres1~2; {83036#true} is VALID [2022-02-20 20:01:31,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {83036#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {83036#true} is VALID [2022-02-20 20:01:31,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {83036#true} #res := ~__retres1~2; {83036#true} is VALID [2022-02-20 20:01:31,847 INFO L290 TraceCheckUtils]: 3: Hoare triple {83036#true} assume true; {83036#true} is VALID [2022-02-20 20:01:31,847 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {83036#true} {83037#false} #1729#return; {83037#false} is VALID [2022-02-20 20:01:31,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 20:01:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:31,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {83036#true} havoc ~__retres1~2; {83036#true} is VALID [2022-02-20 20:01:31,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {83036#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {83036#true} is VALID [2022-02-20 20:01:31,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {83036#true} #res := ~__retres1~2; {83036#true} is VALID [2022-02-20 20:01:31,850 INFO L290 TraceCheckUtils]: 3: Hoare triple {83036#true} assume true; {83036#true} is VALID [2022-02-20 20:01:31,850 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {83036#true} {83037#false} #1729#return; {83037#false} is VALID [2022-02-20 20:01:31,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {83036#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {83036#true} is VALID [2022-02-20 20:01:31,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {83036#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {83036#true} is VALID [2022-02-20 20:01:31,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {83036#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {83038#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:31,851 INFO L290 TraceCheckUtils]: 3: Hoare triple {83038#(= 1 ~c_dr_i~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {83038#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:31,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {83038#(= 1 ~c_dr_i~0)} call update_channels1(); {83083#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:31,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {83083#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {83036#true} is VALID [2022-02-20 20:01:31,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {83036#true} assume true; {83036#true} is VALID [2022-02-20 20:01:31,853 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {83036#true} {83038#(= 1 ~c_dr_i~0)} #1721#return; {83038#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:31,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {83038#(= 1 ~c_dr_i~0)} assume { :begin_inline_init_threads1 } true; {83038#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:31,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {83038#(= 1 ~c_dr_i~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {83038#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 20:01:31,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {83038#(= 1 ~c_dr_i~0)} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {83037#false} is VALID [2022-02-20 20:01:31,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {83037#false} assume { :end_inline_init_threads1 } true; {83037#false} is VALID [2022-02-20 20:01:31,854 INFO L272 TraceCheckUtils]: 12: Hoare triple {83037#false} call fire_delta_events1(); {83084#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:31,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {83084#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {83036#true} is VALID [2022-02-20 20:01:31,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {83036#true} assume !(0 == ~q_write_ev~0); {83036#true} is VALID [2022-02-20 20:01:31,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {83036#true} assume true; {83036#true} is VALID [2022-02-20 20:01:31,854 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {83036#true} {83037#false} #1723#return; {83037#false} is VALID [2022-02-20 20:01:31,854 INFO L272 TraceCheckUtils]: 17: Hoare triple {83037#false} call activate_threads1(); {83085#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:31,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {83085#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {83036#true} is VALID [2022-02-20 20:01:31,855 INFO L272 TraceCheckUtils]: 19: Hoare triple {83036#true} call #t~ret8 := is_do_write_p_triggered(); {83036#true} is VALID [2022-02-20 20:01:31,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {83036#true} havoc ~__retres1~0; {83036#true} is VALID [2022-02-20 20:01:31,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {83036#true} assume !(1 == ~p_dw_pc~0); {83036#true} is VALID [2022-02-20 20:01:31,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {83036#true} assume !(2 == ~p_dw_pc~0); {83036#true} is VALID [2022-02-20 20:01:31,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {83036#true} ~__retres1~0 := 0; {83036#true} is VALID [2022-02-20 20:01:31,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {83036#true} #res := ~__retres1~0; {83036#true} is VALID [2022-02-20 20:01:31,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {83036#true} assume true; {83036#true} is VALID [2022-02-20 20:01:31,855 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {83036#true} {83036#true} #1717#return; {83036#true} is VALID [2022-02-20 20:01:31,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {83036#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {83036#true} is VALID [2022-02-20 20:01:31,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {83036#true} assume !(0 != ~tmp~1); {83036#true} is VALID [2022-02-20 20:01:31,856 INFO L272 TraceCheckUtils]: 29: Hoare triple {83036#true} call #t~ret9 := is_do_read_c_triggered(); {83036#true} is VALID [2022-02-20 20:01:31,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {83036#true} havoc ~__retres1~1; {83036#true} is VALID [2022-02-20 20:01:31,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {83036#true} assume !(1 == ~c_dr_pc~0); {83036#true} is VALID [2022-02-20 20:01:31,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {83036#true} assume !(2 == ~c_dr_pc~0); {83036#true} is VALID [2022-02-20 20:01:31,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {83036#true} ~__retres1~1 := 0; {83036#true} is VALID [2022-02-20 20:01:31,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {83036#true} #res := ~__retres1~1; {83036#true} is VALID [2022-02-20 20:01:31,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {83036#true} assume true; {83036#true} is VALID [2022-02-20 20:01:31,857 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {83036#true} {83036#true} #1719#return; {83036#true} is VALID [2022-02-20 20:01:31,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {83036#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {83036#true} is VALID [2022-02-20 20:01:31,857 INFO L290 TraceCheckUtils]: 38: Hoare triple {83036#true} assume !(0 != ~tmp___0~1); {83036#true} is VALID [2022-02-20 20:01:31,857 INFO L290 TraceCheckUtils]: 39: Hoare triple {83036#true} assume true; {83036#true} is VALID [2022-02-20 20:01:31,857 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {83036#true} {83037#false} #1725#return; {83037#false} is VALID [2022-02-20 20:01:31,857 INFO L272 TraceCheckUtils]: 41: Hoare triple {83037#false} call reset_delta_events1(); {83084#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:31,857 INFO L290 TraceCheckUtils]: 42: Hoare triple {83084#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {83036#true} is VALID [2022-02-20 20:01:31,857 INFO L290 TraceCheckUtils]: 43: Hoare triple {83036#true} assume !(1 == ~q_write_ev~0); {83036#true} is VALID [2022-02-20 20:01:31,858 INFO L290 TraceCheckUtils]: 44: Hoare triple {83036#true} assume true; {83036#true} is VALID [2022-02-20 20:01:31,858 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {83036#true} {83037#false} #1727#return; {83037#false} is VALID [2022-02-20 20:01:31,858 INFO L290 TraceCheckUtils]: 46: Hoare triple {83037#false} assume !false; {83037#false} is VALID [2022-02-20 20:01:31,858 INFO L290 TraceCheckUtils]: 47: Hoare triple {83037#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {83037#false} is VALID [2022-02-20 20:01:31,858 INFO L290 TraceCheckUtils]: 48: Hoare triple {83037#false} assume !false; {83037#false} is VALID [2022-02-20 20:01:31,858 INFO L272 TraceCheckUtils]: 49: Hoare triple {83037#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {83036#true} is VALID [2022-02-20 20:01:31,858 INFO L290 TraceCheckUtils]: 50: Hoare triple {83036#true} havoc ~__retres1~2; {83036#true} is VALID [2022-02-20 20:01:31,859 INFO L290 TraceCheckUtils]: 51: Hoare triple {83036#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {83036#true} is VALID [2022-02-20 20:01:31,859 INFO L290 TraceCheckUtils]: 52: Hoare triple {83036#true} #res := ~__retres1~2; {83036#true} is VALID [2022-02-20 20:01:31,859 INFO L290 TraceCheckUtils]: 53: Hoare triple {83036#true} assume true; {83036#true} is VALID [2022-02-20 20:01:31,859 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {83036#true} {83037#false} #1729#return; {83037#false} is VALID [2022-02-20 20:01:31,859 INFO L290 TraceCheckUtils]: 55: Hoare triple {83037#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {83037#false} is VALID [2022-02-20 20:01:31,859 INFO L290 TraceCheckUtils]: 56: Hoare triple {83037#false} assume 0 != eval1_~tmp___1~0#1; {83037#false} is VALID [2022-02-20 20:01:31,859 INFO L290 TraceCheckUtils]: 57: Hoare triple {83037#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {83037#false} is VALID [2022-02-20 20:01:31,860 INFO L290 TraceCheckUtils]: 58: Hoare triple {83037#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {83037#false} is VALID [2022-02-20 20:01:31,860 INFO L290 TraceCheckUtils]: 59: Hoare triple {83037#false} assume 0 == ~p_dw_pc~0; {83037#false} is VALID [2022-02-20 20:01:31,860 INFO L290 TraceCheckUtils]: 60: Hoare triple {83037#false} assume !false; {83037#false} is VALID [2022-02-20 20:01:31,860 INFO L290 TraceCheckUtils]: 61: Hoare triple {83037#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {83037#false} is VALID [2022-02-20 20:01:31,860 INFO L290 TraceCheckUtils]: 62: Hoare triple {83037#false} assume { :end_inline_do_write_p } true; {83037#false} is VALID [2022-02-20 20:01:31,860 INFO L290 TraceCheckUtils]: 63: Hoare triple {83037#false} assume !(0 == ~c_dr_st~0); {83037#false} is VALID [2022-02-20 20:01:31,860 INFO L290 TraceCheckUtils]: 64: Hoare triple {83037#false} assume !false; {83037#false} is VALID [2022-02-20 20:01:31,861 INFO L272 TraceCheckUtils]: 65: Hoare triple {83037#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {83036#true} is VALID [2022-02-20 20:01:31,861 INFO L290 TraceCheckUtils]: 66: Hoare triple {83036#true} havoc ~__retres1~2; {83036#true} is VALID [2022-02-20 20:01:31,861 INFO L290 TraceCheckUtils]: 67: Hoare triple {83036#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {83036#true} is VALID [2022-02-20 20:01:31,861 INFO L290 TraceCheckUtils]: 68: Hoare triple {83036#true} #res := ~__retres1~2; {83036#true} is VALID [2022-02-20 20:01:31,861 INFO L290 TraceCheckUtils]: 69: Hoare triple {83036#true} assume true; {83036#true} is VALID [2022-02-20 20:01:31,861 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {83036#true} {83037#false} #1729#return; {83037#false} is VALID [2022-02-20 20:01:31,861 INFO L290 TraceCheckUtils]: 71: Hoare triple {83037#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {83037#false} is VALID [2022-02-20 20:01:31,861 INFO L290 TraceCheckUtils]: 72: Hoare triple {83037#false} assume 0 != eval1_~tmp___1~0#1; {83037#false} is VALID [2022-02-20 20:01:31,862 INFO L290 TraceCheckUtils]: 73: Hoare triple {83037#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {83037#false} is VALID [2022-02-20 20:01:31,862 INFO L290 TraceCheckUtils]: 74: Hoare triple {83037#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {83037#false} is VALID [2022-02-20 20:01:31,862 INFO L290 TraceCheckUtils]: 75: Hoare triple {83037#false} assume !(0 == ~p_dw_pc~0); {83037#false} is VALID [2022-02-20 20:01:31,862 INFO L290 TraceCheckUtils]: 76: Hoare triple {83037#false} assume 1 == ~p_dw_pc~0; {83037#false} is VALID [2022-02-20 20:01:31,862 INFO L290 TraceCheckUtils]: 77: Hoare triple {83037#false} assume !(0 == ~q_free~0); {83037#false} is VALID [2022-02-20 20:01:31,862 INFO L290 TraceCheckUtils]: 78: Hoare triple {83037#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {83037#false} is VALID [2022-02-20 20:01:31,862 INFO L290 TraceCheckUtils]: 79: Hoare triple {83037#false} assume !false; {83037#false} is VALID [2022-02-20 20:01:31,862 INFO L290 TraceCheckUtils]: 80: Hoare triple {83037#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {83037#false} is VALID [2022-02-20 20:01:31,863 INFO L290 TraceCheckUtils]: 81: Hoare triple {83037#false} assume { :end_inline_do_write_p } true; {83037#false} is VALID [2022-02-20 20:01:31,863 INFO L290 TraceCheckUtils]: 82: Hoare triple {83037#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {83037#false} is VALID [2022-02-20 20:01:31,863 INFO L290 TraceCheckUtils]: 83: Hoare triple {83037#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {83037#false} is VALID [2022-02-20 20:01:31,863 INFO L290 TraceCheckUtils]: 84: Hoare triple {83037#false} assume !(0 == ~c_dr_pc~0); {83037#false} is VALID [2022-02-20 20:01:31,863 INFO L290 TraceCheckUtils]: 85: Hoare triple {83037#false} assume 2 == ~c_dr_pc~0; {83037#false} is VALID [2022-02-20 20:01:31,863 INFO L290 TraceCheckUtils]: 86: Hoare triple {83037#false} do_read_c_~a~0#1 := ~a_t~0; {83037#false} is VALID [2022-02-20 20:01:31,863 INFO L290 TraceCheckUtils]: 87: Hoare triple {83037#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {83037#false} is VALID [2022-02-20 20:01:31,863 INFO L290 TraceCheckUtils]: 88: Hoare triple {83037#false} assume !(~p_last_write~0 == ~c_last_read~0); {83037#false} is VALID [2022-02-20 20:01:31,864 INFO L272 TraceCheckUtils]: 89: Hoare triple {83037#false} call error1(); {83037#false} is VALID [2022-02-20 20:01:31,864 INFO L290 TraceCheckUtils]: 90: Hoare triple {83037#false} assume !false; {83037#false} is VALID [2022-02-20 20:01:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 20:01:31,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:31,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113984400] [2022-02-20 20:01:31,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113984400] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:31,865 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:31,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:01:31,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737916051] [2022-02-20 20:01:31,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:31,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:01:31,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:31,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:31,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:31,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:01:31,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:31,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:01:31,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:01:31,952 INFO L87 Difference]: Start difference. First operand 3275 states and 4262 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:34,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:34,682 INFO L93 Difference]: Finished difference Result 4859 states and 6246 transitions. [2022-02-20 20:01:34,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:01:34,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-02-20 20:01:34,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:34,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 823 transitions. [2022-02-20 20:01:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:34,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 823 transitions. [2022-02-20 20:01:34,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 823 transitions. [2022-02-20 20:01:35,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 823 edges. 823 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:35,340 INFO L225 Difference]: With dead ends: 4859 [2022-02-20 20:01:35,341 INFO L226 Difference]: Without dead ends: 1921 [2022-02-20 20:01:35,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:01:35,344 INFO L933 BasicCegarLoop]: 645 mSDtfsCounter, 698 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:35,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [713 Valid, 1780 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 20:01:35,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2022-02-20 20:01:35,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1806. [2022-02-20 20:01:35,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:35,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1921 states. Second operand has 1806 states, 1463 states have (on average 1.3185235816814764) internal successors, (1929), 1483 states have internal predecessors, (1929), 188 states have call successors, (188), 120 states have call predecessors, (188), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2022-02-20 20:01:35,448 INFO L74 IsIncluded]: Start isIncluded. First operand 1921 states. Second operand has 1806 states, 1463 states have (on average 1.3185235816814764) internal successors, (1929), 1483 states have internal predecessors, (1929), 188 states have call successors, (188), 120 states have call predecessors, (188), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2022-02-20 20:01:35,449 INFO L87 Difference]: Start difference. First operand 1921 states. Second operand has 1806 states, 1463 states have (on average 1.3185235816814764) internal successors, (1929), 1483 states have internal predecessors, (1929), 188 states have call successors, (188), 120 states have call predecessors, (188), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2022-02-20 20:01:35,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:35,560 INFO L93 Difference]: Finished difference Result 1921 states and 2513 transitions. [2022-02-20 20:01:35,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2513 transitions. [2022-02-20 20:01:35,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:35,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:35,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 1806 states, 1463 states have (on average 1.3185235816814764) internal successors, (1929), 1483 states have internal predecessors, (1929), 188 states have call successors, (188), 120 states have call predecessors, (188), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) Second operand 1921 states. [2022-02-20 20:01:35,566 INFO L87 Difference]: Start difference. First operand has 1806 states, 1463 states have (on average 1.3185235816814764) internal successors, (1929), 1483 states have internal predecessors, (1929), 188 states have call successors, (188), 120 states have call predecessors, (188), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) Second operand 1921 states. [2022-02-20 20:01:35,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:35,683 INFO L93 Difference]: Finished difference Result 1921 states and 2513 transitions. [2022-02-20 20:01:35,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2513 transitions. [2022-02-20 20:01:35,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:35,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:35,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:35,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:35,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1463 states have (on average 1.3185235816814764) internal successors, (1929), 1483 states have internal predecessors, (1929), 188 states have call successors, (188), 120 states have call predecessors, (188), 153 states have return successors, (236), 204 states have call predecessors, (236), 186 states have call successors, (236) [2022-02-20 20:01:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2353 transitions. [2022-02-20 20:01:35,837 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2353 transitions. Word has length 91 [2022-02-20 20:01:35,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:35,838 INFO L470 AbstractCegarLoop]: Abstraction has 1806 states and 2353 transitions. [2022-02-20 20:01:35,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 20:01:35,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2353 transitions. [2022-02-20 20:01:35,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-20 20:01:35,840 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:35,840 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:35,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:01:35,840 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:35,841 INFO L85 PathProgramCache]: Analyzing trace with hash 186814586, now seen corresponding path program 1 times [2022-02-20 20:01:35,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:35,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411166406] [2022-02-20 20:01:35,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:35,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:35,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:35,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {95918#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {95919#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:35,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {95919#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {95919#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:35,912 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95919#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {95872#(= ~q_read_ev~0 2)} #1721#return; {95872#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:35,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:35,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {95920#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {95870#true} is VALID [2022-02-20 20:01:35,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {95870#true} assume !(0 == ~q_write_ev~0); {95870#true} is VALID [2022-02-20 20:01:35,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {95870#true} assume true; {95870#true} is VALID [2022-02-20 20:01:35,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95870#true} {95872#(= ~q_read_ev~0 2)} #1723#return; {95870#true} is VALID [2022-02-20 20:01:35,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:35,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:35,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {95870#true} havoc ~__retres1~0; {95870#true} is VALID [2022-02-20 20:01:35,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {95870#true} assume !(1 == ~p_dw_pc~0); {95870#true} is VALID [2022-02-20 20:01:35,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {95870#true} assume !(2 == ~p_dw_pc~0); {95870#true} is VALID [2022-02-20 20:01:35,932 INFO L290 TraceCheckUtils]: 3: Hoare triple {95870#true} ~__retres1~0 := 0; {95870#true} is VALID [2022-02-20 20:01:35,932 INFO L290 TraceCheckUtils]: 4: Hoare triple {95870#true} #res := ~__retres1~0; {95870#true} is VALID [2022-02-20 20:01:35,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {95870#true} assume true; {95870#true} is VALID [2022-02-20 20:01:35,932 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {95870#true} {95870#true} #1717#return; {95870#true} is VALID [2022-02-20 20:01:35,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:35,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {95870#true} havoc ~__retres1~1; {95870#true} is VALID [2022-02-20 20:01:35,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {95870#true} assume !(1 == ~c_dr_pc~0); {95870#true} is VALID [2022-02-20 20:01:35,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {95870#true} assume !(2 == ~c_dr_pc~0); {95870#true} is VALID [2022-02-20 20:01:35,935 INFO L290 TraceCheckUtils]: 3: Hoare triple {95870#true} ~__retres1~1 := 0; {95870#true} is VALID [2022-02-20 20:01:35,935 INFO L290 TraceCheckUtils]: 4: Hoare triple {95870#true} #res := ~__retres1~1; {95870#true} is VALID [2022-02-20 20:01:35,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {95870#true} assume true; {95870#true} is VALID [2022-02-20 20:01:35,935 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {95870#true} {95870#true} #1719#return; {95870#true} is VALID [2022-02-20 20:01:35,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {95921#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {95870#true} is VALID [2022-02-20 20:01:35,935 INFO L272 TraceCheckUtils]: 1: Hoare triple {95870#true} call #t~ret8 := is_do_write_p_triggered(); {95870#true} is VALID [2022-02-20 20:01:35,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {95870#true} havoc ~__retres1~0; {95870#true} is VALID [2022-02-20 20:01:35,936 INFO L290 TraceCheckUtils]: 3: Hoare triple {95870#true} assume !(1 == ~p_dw_pc~0); {95870#true} is VALID [2022-02-20 20:01:35,936 INFO L290 TraceCheckUtils]: 4: Hoare triple {95870#true} assume !(2 == ~p_dw_pc~0); {95870#true} is VALID [2022-02-20 20:01:35,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {95870#true} ~__retres1~0 := 0; {95870#true} is VALID [2022-02-20 20:01:35,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {95870#true} #res := ~__retres1~0; {95870#true} is VALID [2022-02-20 20:01:35,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {95870#true} assume true; {95870#true} is VALID [2022-02-20 20:01:35,936 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {95870#true} {95870#true} #1717#return; {95870#true} is VALID [2022-02-20 20:01:35,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {95870#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {95870#true} is VALID [2022-02-20 20:01:35,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {95870#true} assume !(0 != ~tmp~1); {95870#true} is VALID [2022-02-20 20:01:35,937 INFO L272 TraceCheckUtils]: 11: Hoare triple {95870#true} call #t~ret9 := is_do_read_c_triggered(); {95870#true} is VALID [2022-02-20 20:01:35,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {95870#true} havoc ~__retres1~1; {95870#true} is VALID [2022-02-20 20:01:35,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {95870#true} assume !(1 == ~c_dr_pc~0); {95870#true} is VALID [2022-02-20 20:01:35,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {95870#true} assume !(2 == ~c_dr_pc~0); {95870#true} is VALID [2022-02-20 20:01:35,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {95870#true} ~__retres1~1 := 0; {95870#true} is VALID [2022-02-20 20:01:35,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {95870#true} #res := ~__retres1~1; {95870#true} is VALID [2022-02-20 20:01:35,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {95870#true} assume true; {95870#true} is VALID [2022-02-20 20:01:35,938 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {95870#true} {95870#true} #1719#return; {95870#true} is VALID [2022-02-20 20:01:35,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {95870#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {95870#true} is VALID [2022-02-20 20:01:35,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {95870#true} assume !(0 != ~tmp___0~1); {95870#true} is VALID [2022-02-20 20:01:35,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {95870#true} assume true; {95870#true} is VALID [2022-02-20 20:01:35,938 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {95870#true} {95870#true} #1725#return; {95870#true} is VALID [2022-02-20 20:01:35,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:35,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {95920#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {95870#true} is VALID [2022-02-20 20:01:35,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {95870#true} assume !(1 == ~q_write_ev~0); {95870#true} is VALID [2022-02-20 20:01:35,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {95870#true} assume true; {95870#true} is VALID [2022-02-20 20:01:35,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95870#true} {95870#true} #1727#return; {95870#true} is VALID [2022-02-20 20:01:35,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:35,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {95870#true} havoc ~__retres1~2; {95870#true} is VALID [2022-02-20 20:01:35,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {95870#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {95870#true} is VALID [2022-02-20 20:01:35,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {95870#true} #res := ~__retres1~2; {95870#true} is VALID [2022-02-20 20:01:35,944 INFO L290 TraceCheckUtils]: 3: Hoare triple {95870#true} assume true; {95870#true} is VALID [2022-02-20 20:01:35,945 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {95870#true} {95870#true} #1729#return; {95870#true} is VALID [2022-02-20 20:01:35,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 20:01:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:35,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {95870#true} havoc ~__retres1~2; {95870#true} is VALID [2022-02-20 20:01:35,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {95870#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {95936#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:35,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {95936#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {95936#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:35,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {95936#(= ~p_dw_st~0 0)} assume true; {95936#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:35,954 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {95936#(= ~p_dw_st~0 0)} {95912#(not (= ~p_dw_st~0 0))} #1729#return; {95871#false} is VALID [2022-02-20 20:01:35,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {95870#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {95870#true} is VALID [2022-02-20 20:01:35,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {95870#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {95870#true} is VALID [2022-02-20 20:01:35,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {95870#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {95872#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:35,955 INFO L290 TraceCheckUtils]: 3: Hoare triple {95872#(= ~q_read_ev~0 2)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {95872#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:35,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {95872#(= ~q_read_ev~0 2)} call update_channels1(); {95918#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:35,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {95918#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {95919#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:35,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {95919#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {95919#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 20:01:35,956 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {95919#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {95872#(= ~q_read_ev~0 2)} #1721#return; {95872#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:35,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {95872#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {95872#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:35,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {95872#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {95872#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:35,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {95872#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {95872#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:35,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {95872#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {95872#(= ~q_read_ev~0 2)} is VALID [2022-02-20 20:01:35,958 INFO L272 TraceCheckUtils]: 12: Hoare triple {95872#(= ~q_read_ev~0 2)} call fire_delta_events1(); {95920#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:35,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {95920#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {95870#true} is VALID [2022-02-20 20:01:35,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {95870#true} assume !(0 == ~q_write_ev~0); {95870#true} is VALID [2022-02-20 20:01:35,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {95870#true} assume true; {95870#true} is VALID [2022-02-20 20:01:35,959 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {95870#true} {95872#(= ~q_read_ev~0 2)} #1723#return; {95870#true} is VALID [2022-02-20 20:01:35,959 INFO L272 TraceCheckUtils]: 17: Hoare triple {95870#true} call activate_threads1(); {95921#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:35,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {95921#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {95870#true} is VALID [2022-02-20 20:01:35,959 INFO L272 TraceCheckUtils]: 19: Hoare triple {95870#true} call #t~ret8 := is_do_write_p_triggered(); {95870#true} is VALID [2022-02-20 20:01:35,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {95870#true} havoc ~__retres1~0; {95870#true} is VALID [2022-02-20 20:01:35,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {95870#true} assume !(1 == ~p_dw_pc~0); {95870#true} is VALID [2022-02-20 20:01:35,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {95870#true} assume !(2 == ~p_dw_pc~0); {95870#true} is VALID [2022-02-20 20:01:35,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {95870#true} ~__retres1~0 := 0; {95870#true} is VALID [2022-02-20 20:01:35,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {95870#true} #res := ~__retres1~0; {95870#true} is VALID [2022-02-20 20:01:35,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {95870#true} assume true; {95870#true} is VALID [2022-02-20 20:01:35,960 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {95870#true} {95870#true} #1717#return; {95870#true} is VALID [2022-02-20 20:01:35,961 INFO L290 TraceCheckUtils]: 27: Hoare triple {95870#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {95870#true} is VALID [2022-02-20 20:01:35,961 INFO L290 TraceCheckUtils]: 28: Hoare triple {95870#true} assume !(0 != ~tmp~1); {95870#true} is VALID [2022-02-20 20:01:35,961 INFO L272 TraceCheckUtils]: 29: Hoare triple {95870#true} call #t~ret9 := is_do_read_c_triggered(); {95870#true} is VALID [2022-02-20 20:01:35,961 INFO L290 TraceCheckUtils]: 30: Hoare triple {95870#true} havoc ~__retres1~1; {95870#true} is VALID [2022-02-20 20:01:35,961 INFO L290 TraceCheckUtils]: 31: Hoare triple {95870#true} assume !(1 == ~c_dr_pc~0); {95870#true} is VALID [2022-02-20 20:01:35,961 INFO L290 TraceCheckUtils]: 32: Hoare triple {95870#true} assume !(2 == ~c_dr_pc~0); {95870#true} is VALID [2022-02-20 20:01:35,961 INFO L290 TraceCheckUtils]: 33: Hoare triple {95870#true} ~__retres1~1 := 0; {95870#true} is VALID [2022-02-20 20:01:35,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {95870#true} #res := ~__retres1~1; {95870#true} is VALID [2022-02-20 20:01:35,962 INFO L290 TraceCheckUtils]: 35: Hoare triple {95870#true} assume true; {95870#true} is VALID [2022-02-20 20:01:35,962 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {95870#true} {95870#true} #1719#return; {95870#true} is VALID [2022-02-20 20:01:35,962 INFO L290 TraceCheckUtils]: 37: Hoare triple {95870#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {95870#true} is VALID [2022-02-20 20:01:35,962 INFO L290 TraceCheckUtils]: 38: Hoare triple {95870#true} assume !(0 != ~tmp___0~1); {95870#true} is VALID [2022-02-20 20:01:35,962 INFO L290 TraceCheckUtils]: 39: Hoare triple {95870#true} assume true; {95870#true} is VALID [2022-02-20 20:01:35,962 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {95870#true} {95870#true} #1725#return; {95870#true} is VALID [2022-02-20 20:01:35,963 INFO L272 TraceCheckUtils]: 41: Hoare triple {95870#true} call reset_delta_events1(); {95920#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:35,963 INFO L290 TraceCheckUtils]: 42: Hoare triple {95920#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {95870#true} is VALID [2022-02-20 20:01:35,963 INFO L290 TraceCheckUtils]: 43: Hoare triple {95870#true} assume !(1 == ~q_write_ev~0); {95870#true} is VALID [2022-02-20 20:01:35,963 INFO L290 TraceCheckUtils]: 44: Hoare triple {95870#true} assume true; {95870#true} is VALID [2022-02-20 20:01:35,963 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {95870#true} {95870#true} #1727#return; {95870#true} is VALID [2022-02-20 20:01:35,964 INFO L290 TraceCheckUtils]: 46: Hoare triple {95870#true} assume !false; {95870#true} is VALID [2022-02-20 20:01:35,964 INFO L290 TraceCheckUtils]: 47: Hoare triple {95870#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {95870#true} is VALID [2022-02-20 20:01:35,964 INFO L290 TraceCheckUtils]: 48: Hoare triple {95870#true} assume !false; {95870#true} is VALID [2022-02-20 20:01:35,964 INFO L272 TraceCheckUtils]: 49: Hoare triple {95870#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {95870#true} is VALID [2022-02-20 20:01:35,964 INFO L290 TraceCheckUtils]: 50: Hoare triple {95870#true} havoc ~__retres1~2; {95870#true} is VALID [2022-02-20 20:01:35,964 INFO L290 TraceCheckUtils]: 51: Hoare triple {95870#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {95870#true} is VALID [2022-02-20 20:01:35,964 INFO L290 TraceCheckUtils]: 52: Hoare triple {95870#true} #res := ~__retres1~2; {95870#true} is VALID [2022-02-20 20:01:35,965 INFO L290 TraceCheckUtils]: 53: Hoare triple {95870#true} assume true; {95870#true} is VALID [2022-02-20 20:01:35,965 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {95870#true} {95870#true} #1729#return; {95870#true} is VALID [2022-02-20 20:01:35,965 INFO L290 TraceCheckUtils]: 55: Hoare triple {95870#true} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {95870#true} is VALID [2022-02-20 20:01:35,965 INFO L290 TraceCheckUtils]: 56: Hoare triple {95870#true} assume 0 != eval1_~tmp___1~0#1; {95870#true} is VALID [2022-02-20 20:01:35,965 INFO L290 TraceCheckUtils]: 57: Hoare triple {95870#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {95870#true} is VALID [2022-02-20 20:01:35,965 INFO L290 TraceCheckUtils]: 58: Hoare triple {95870#true} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {95870#true} is VALID [2022-02-20 20:01:35,965 INFO L290 TraceCheckUtils]: 59: Hoare triple {95870#true} assume 0 == ~p_dw_pc~0; {95870#true} is VALID [2022-02-20 20:01:35,966 INFO L290 TraceCheckUtils]: 60: Hoare triple {95870#true} assume !false; {95870#true} is VALID [2022-02-20 20:01:35,966 INFO L290 TraceCheckUtils]: 61: Hoare triple {95870#true} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {95912#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:35,966 INFO L290 TraceCheckUtils]: 62: Hoare triple {95912#(not (= ~p_dw_st~0 0))} assume { :end_inline_do_write_p } true; {95912#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:35,967 INFO L290 TraceCheckUtils]: 63: Hoare triple {95912#(not (= ~p_dw_st~0 0))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {95912#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:35,967 INFO L290 TraceCheckUtils]: 64: Hoare triple {95912#(not (= ~p_dw_st~0 0))} assume !(0 != eval1_~tmp___0~2#1); {95912#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:35,967 INFO L290 TraceCheckUtils]: 65: Hoare triple {95912#(not (= ~p_dw_st~0 0))} assume !false; {95912#(not (= ~p_dw_st~0 0))} is VALID [2022-02-20 20:01:35,967 INFO L272 TraceCheckUtils]: 66: Hoare triple {95912#(not (= ~p_dw_st~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {95870#true} is VALID [2022-02-20 20:01:35,967 INFO L290 TraceCheckUtils]: 67: Hoare triple {95870#true} havoc ~__retres1~2; {95870#true} is VALID [2022-02-20 20:01:35,968 INFO L290 TraceCheckUtils]: 68: Hoare triple {95870#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {95936#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:35,968 INFO L290 TraceCheckUtils]: 69: Hoare triple {95936#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {95936#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:35,968 INFO L290 TraceCheckUtils]: 70: Hoare triple {95936#(= ~p_dw_st~0 0)} assume true; {95936#(= ~p_dw_st~0 0)} is VALID [2022-02-20 20:01:35,969 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {95936#(= ~p_dw_st~0 0)} {95912#(not (= ~p_dw_st~0 0))} #1729#return; {95871#false} is VALID [2022-02-20 20:01:35,969 INFO L290 TraceCheckUtils]: 72: Hoare triple {95871#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {95871#false} is VALID [2022-02-20 20:01:35,969 INFO L290 TraceCheckUtils]: 73: Hoare triple {95871#false} assume 0 != eval1_~tmp___1~0#1; {95871#false} is VALID [2022-02-20 20:01:35,969 INFO L290 TraceCheckUtils]: 74: Hoare triple {95871#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {95871#false} is VALID [2022-02-20 20:01:35,969 INFO L290 TraceCheckUtils]: 75: Hoare triple {95871#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {95871#false} is VALID [2022-02-20 20:01:35,969 INFO L290 TraceCheckUtils]: 76: Hoare triple {95871#false} assume !(0 == ~p_dw_pc~0); {95871#false} is VALID [2022-02-20 20:01:35,969 INFO L290 TraceCheckUtils]: 77: Hoare triple {95871#false} assume 1 == ~p_dw_pc~0; {95871#false} is VALID [2022-02-20 20:01:35,970 INFO L290 TraceCheckUtils]: 78: Hoare triple {95871#false} assume !(0 == ~q_free~0); {95871#false} is VALID [2022-02-20 20:01:35,970 INFO L290 TraceCheckUtils]: 79: Hoare triple {95871#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {95871#false} is VALID [2022-02-20 20:01:35,970 INFO L290 TraceCheckUtils]: 80: Hoare triple {95871#false} assume !false; {95871#false} is VALID [2022-02-20 20:01:35,970 INFO L290 TraceCheckUtils]: 81: Hoare triple {95871#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {95871#false} is VALID [2022-02-20 20:01:35,970 INFO L290 TraceCheckUtils]: 82: Hoare triple {95871#false} assume { :end_inline_do_write_p } true; {95871#false} is VALID [2022-02-20 20:01:35,970 INFO L290 TraceCheckUtils]: 83: Hoare triple {95871#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {95871#false} is VALID [2022-02-20 20:01:35,970 INFO L290 TraceCheckUtils]: 84: Hoare triple {95871#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {95871#false} is VALID [2022-02-20 20:01:35,970 INFO L290 TraceCheckUtils]: 85: Hoare triple {95871#false} assume !(0 == ~c_dr_pc~0); {95871#false} is VALID [2022-02-20 20:01:35,970 INFO L290 TraceCheckUtils]: 86: Hoare triple {95871#false} assume 2 == ~c_dr_pc~0; {95871#false} is VALID [2022-02-20 20:01:35,971 INFO L290 TraceCheckUtils]: 87: Hoare triple {95871#false} do_read_c_~a~0#1 := ~a_t~0; {95871#false} is VALID [2022-02-20 20:01:35,971 INFO L290 TraceCheckUtils]: 88: Hoare triple {95871#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {95871#false} is VALID [2022-02-20 20:01:35,971 INFO L290 TraceCheckUtils]: 89: Hoare triple {95871#false} assume !(~p_last_write~0 == ~c_last_read~0); {95871#false} is VALID [2022-02-20 20:01:35,971 INFO L272 TraceCheckUtils]: 90: Hoare triple {95871#false} call error1(); {95871#false} is VALID [2022-02-20 20:01:35,971 INFO L290 TraceCheckUtils]: 91: Hoare triple {95871#false} assume !false; {95871#false} is VALID [2022-02-20 20:01:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 20:01:35,972 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:35,972 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411166406] [2022-02-20 20:01:35,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411166406] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:35,972 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:01:35,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:01:35,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65687920] [2022-02-20 20:01:35,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:35,973 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-02-20 20:01:35,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:35,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:01:36,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:36,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:01:36,017 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:36,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:01:36,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:01:36,018 INFO L87 Difference]: Start difference. First operand 1806 states and 2353 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:01:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:40,666 INFO L93 Difference]: Finished difference Result 4224 states and 5436 transitions. [2022-02-20 20:01:40,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 20:01:40,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-02-20 20:01:40,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 20:01:40,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:01:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1263 transitions. [2022-02-20 20:01:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:01:40,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1263 transitions. [2022-02-20 20:01:40,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 1263 transitions. [2022-02-20 20:01:41,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1263 edges. 1263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:42,064 INFO L225 Difference]: With dead ends: 4224 [2022-02-20 20:01:42,064 INFO L226 Difference]: Without dead ends: 2604 [2022-02-20 20:01:42,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-02-20 20:01:42,068 INFO L933 BasicCegarLoop]: 716 mSDtfsCounter, 2310 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2351 SdHoareTripleChecker+Valid, 2069 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 20:01:42,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2351 Valid, 2069 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 20:01:42,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2022-02-20 20:01:42,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 2427. [2022-02-20 20:01:42,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 20:01:42,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2604 states. Second operand has 2427 states, 1930 states have (on average 1.2803108808290156) internal successors, (2471), 1958 states have internal predecessors, (2471), 265 states have call successors, (265), 168 states have call predecessors, (265), 230 states have return successors, (367), 302 states have call predecessors, (367), 263 states have call successors, (367) [2022-02-20 20:01:42,346 INFO L74 IsIncluded]: Start isIncluded. First operand 2604 states. Second operand has 2427 states, 1930 states have (on average 1.2803108808290156) internal successors, (2471), 1958 states have internal predecessors, (2471), 265 states have call successors, (265), 168 states have call predecessors, (265), 230 states have return successors, (367), 302 states have call predecessors, (367), 263 states have call successors, (367) [2022-02-20 20:01:42,348 INFO L87 Difference]: Start difference. First operand 2604 states. Second operand has 2427 states, 1930 states have (on average 1.2803108808290156) internal successors, (2471), 1958 states have internal predecessors, (2471), 265 states have call successors, (265), 168 states have call predecessors, (265), 230 states have return successors, (367), 302 states have call predecessors, (367), 263 states have call successors, (367) [2022-02-20 20:01:42,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:42,829 INFO L93 Difference]: Finished difference Result 2604 states and 3308 transitions. [2022-02-20 20:01:42,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2604 states and 3308 transitions. [2022-02-20 20:01:42,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:42,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:42,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 2427 states, 1930 states have (on average 1.2803108808290156) internal successors, (2471), 1958 states have internal predecessors, (2471), 265 states have call successors, (265), 168 states have call predecessors, (265), 230 states have return successors, (367), 302 states have call predecessors, (367), 263 states have call successors, (367) Second operand 2604 states. [2022-02-20 20:01:42,842 INFO L87 Difference]: Start difference. First operand has 2427 states, 1930 states have (on average 1.2803108808290156) internal successors, (2471), 1958 states have internal predecessors, (2471), 265 states have call successors, (265), 168 states have call predecessors, (265), 230 states have return successors, (367), 302 states have call predecessors, (367), 263 states have call successors, (367) Second operand 2604 states. [2022-02-20 20:01:43,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 20:01:43,084 INFO L93 Difference]: Finished difference Result 2604 states and 3308 transitions. [2022-02-20 20:01:43,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2604 states and 3308 transitions. [2022-02-20 20:01:43,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 20:01:43,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 20:01:43,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 20:01:43,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 20:01:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 1930 states have (on average 1.2803108808290156) internal successors, (2471), 1958 states have internal predecessors, (2471), 265 states have call successors, (265), 168 states have call predecessors, (265), 230 states have return successors, (367), 302 states have call predecessors, (367), 263 states have call successors, (367) [2022-02-20 20:01:43,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 3103 transitions. [2022-02-20 20:01:43,390 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 3103 transitions. Word has length 92 [2022-02-20 20:01:43,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:01:43,390 INFO L470 AbstractCegarLoop]: Abstraction has 2427 states and 3103 transitions. [2022-02-20 20:01:43,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 20:01:43,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 3103 transitions. [2022-02-20 20:01:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-02-20 20:01:43,394 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 20:01:43,394 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:01:43,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 20:01:43,394 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:01:43,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:01:43,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1184625881, now seen corresponding path program 1 times [2022-02-20 20:01:43,396 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:01:43,396 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631445013] [2022-02-20 20:01:43,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:43,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:01:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 20:01:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {110169#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {110071#true} is VALID [2022-02-20 20:01:43,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,459 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110071#true} {110073#(= ~q_req_up~0 0)} #1721#return; {110071#true} is VALID [2022-02-20 20:01:43,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 20:01:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {110170#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {110071#true} is VALID [2022-02-20 20:01:43,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {110071#true} assume !(0 == ~q_write_ev~0); {110071#true} is VALID [2022-02-20 20:01:43,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110071#true} {110071#true} #1723#return; {110071#true} is VALID [2022-02-20 20:01:43,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 20:01:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {110071#true} havoc ~__retres1~0; {110071#true} is VALID [2022-02-20 20:01:43,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {110071#true} assume !(1 == ~p_dw_pc~0); {110071#true} is VALID [2022-02-20 20:01:43,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {110071#true} assume !(2 == ~p_dw_pc~0); {110071#true} is VALID [2022-02-20 20:01:43,487 INFO L290 TraceCheckUtils]: 3: Hoare triple {110071#true} ~__retres1~0 := 0; {110071#true} is VALID [2022-02-20 20:01:43,488 INFO L290 TraceCheckUtils]: 4: Hoare triple {110071#true} #res := ~__retres1~0; {110071#true} is VALID [2022-02-20 20:01:43,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,488 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {110071#true} {110071#true} #1717#return; {110071#true} is VALID [2022-02-20 20:01:43,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 20:01:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {110071#true} havoc ~__retres1~1; {110071#true} is VALID [2022-02-20 20:01:43,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {110071#true} assume !(1 == ~c_dr_pc~0); {110071#true} is VALID [2022-02-20 20:01:43,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {110071#true} assume !(2 == ~c_dr_pc~0); {110071#true} is VALID [2022-02-20 20:01:43,491 INFO L290 TraceCheckUtils]: 3: Hoare triple {110071#true} ~__retres1~1 := 0; {110071#true} is VALID [2022-02-20 20:01:43,491 INFO L290 TraceCheckUtils]: 4: Hoare triple {110071#true} #res := ~__retres1~1; {110071#true} is VALID [2022-02-20 20:01:43,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,492 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {110071#true} {110071#true} #1719#return; {110071#true} is VALID [2022-02-20 20:01:43,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {110171#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {110071#true} is VALID [2022-02-20 20:01:43,492 INFO L272 TraceCheckUtils]: 1: Hoare triple {110071#true} call #t~ret8 := is_do_write_p_triggered(); {110071#true} is VALID [2022-02-20 20:01:43,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {110071#true} havoc ~__retres1~0; {110071#true} is VALID [2022-02-20 20:01:43,492 INFO L290 TraceCheckUtils]: 3: Hoare triple {110071#true} assume !(1 == ~p_dw_pc~0); {110071#true} is VALID [2022-02-20 20:01:43,492 INFO L290 TraceCheckUtils]: 4: Hoare triple {110071#true} assume !(2 == ~p_dw_pc~0); {110071#true} is VALID [2022-02-20 20:01:43,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {110071#true} ~__retres1~0 := 0; {110071#true} is VALID [2022-02-20 20:01:43,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {110071#true} #res := ~__retres1~0; {110071#true} is VALID [2022-02-20 20:01:43,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,493 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {110071#true} {110071#true} #1717#return; {110071#true} is VALID [2022-02-20 20:01:43,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {110071#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {110071#true} is VALID [2022-02-20 20:01:43,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {110071#true} assume !(0 != ~tmp~1); {110071#true} is VALID [2022-02-20 20:01:43,493 INFO L272 TraceCheckUtils]: 11: Hoare triple {110071#true} call #t~ret9 := is_do_read_c_triggered(); {110071#true} is VALID [2022-02-20 20:01:43,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {110071#true} havoc ~__retres1~1; {110071#true} is VALID [2022-02-20 20:01:43,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {110071#true} assume !(1 == ~c_dr_pc~0); {110071#true} is VALID [2022-02-20 20:01:43,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {110071#true} assume !(2 == ~c_dr_pc~0); {110071#true} is VALID [2022-02-20 20:01:43,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {110071#true} ~__retres1~1 := 0; {110071#true} is VALID [2022-02-20 20:01:43,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {110071#true} #res := ~__retres1~1; {110071#true} is VALID [2022-02-20 20:01:43,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,494 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {110071#true} {110071#true} #1719#return; {110071#true} is VALID [2022-02-20 20:01:43,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {110071#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {110071#true} is VALID [2022-02-20 20:01:43,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {110071#true} assume !(0 != ~tmp___0~1); {110071#true} is VALID [2022-02-20 20:01:43,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,495 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {110071#true} {110071#true} #1725#return; {110071#true} is VALID [2022-02-20 20:01:43,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 20:01:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {110170#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {110071#true} is VALID [2022-02-20 20:01:43,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {110071#true} assume !(1 == ~q_write_ev~0); {110071#true} is VALID [2022-02-20 20:01:43,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110071#true} {110071#true} #1727#return; {110071#true} is VALID [2022-02-20 20:01:43,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 20:01:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {110071#true} havoc ~__retres1~2; {110071#true} is VALID [2022-02-20 20:01:43,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {110071#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {110071#true} is VALID [2022-02-20 20:01:43,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {110071#true} #res := ~__retres1~2; {110071#true} is VALID [2022-02-20 20:01:43,503 INFO L290 TraceCheckUtils]: 3: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,503 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {110071#true} {110071#true} #1729#return; {110071#true} is VALID [2022-02-20 20:01:43,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 20:01:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {110071#true} havoc ~__retres1~2; {110071#true} is VALID [2022-02-20 20:01:43,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {110071#true} assume !(0 == ~p_dw_st~0); {110071#true} is VALID [2022-02-20 20:01:43,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {110071#true} assume 0 == ~c_dr_st~0;~__retres1~2 := 1; {110186#(<= 1 exists_runnable_thread1_~__retres1~2)} is VALID [2022-02-20 20:01:43,535 INFO L290 TraceCheckUtils]: 3: Hoare triple {110186#(<= 1 exists_runnable_thread1_~__retres1~2)} #res := ~__retres1~2; {110187#(<= 1 |exists_runnable_thread1_#res|)} is VALID [2022-02-20 20:01:43,535 INFO L290 TraceCheckUtils]: 4: Hoare triple {110187#(<= 1 |exists_runnable_thread1_#res|)} assume true; {110187#(<= 1 |exists_runnable_thread1_#res|)} is VALID [2022-02-20 20:01:43,536 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {110187#(<= 1 |exists_runnable_thread1_#res|)} {110071#true} #1729#return; {110119#(not (= |ULTIMATE.start_eval1_#t~ret10#1| 0))} is VALID [2022-02-20 20:01:43,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-02-20 20:01:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {110169#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {110071#true} is VALID [2022-02-20 20:01:43,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110071#true} {110072#false} #1735#return; {110072#false} is VALID [2022-02-20 20:01:43,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-02-20 20:01:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {110170#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {110071#true} is VALID [2022-02-20 20:01:43,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {110071#true} assume !(0 == ~q_write_ev~0); {110071#true} is VALID [2022-02-20 20:01:43,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110071#true} {110072#false} #1737#return; {110072#false} is VALID [2022-02-20 20:01:43,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-02-20 20:01:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 20:01:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {110071#true} havoc ~__retres1~0; {110071#true} is VALID [2022-02-20 20:01:43,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {110071#true} assume 1 == ~p_dw_pc~0; {110071#true} is VALID [2022-02-20 20:01:43,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {110071#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {110071#true} is VALID [2022-02-20 20:01:43,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {110071#true} #res := ~__retres1~0; {110071#true} is VALID [2022-02-20 20:01:43,551 INFO L290 TraceCheckUtils]: 4: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,551 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {110071#true} {110071#true} #1717#return; {110071#true} is VALID [2022-02-20 20:01:43,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 20:01:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {110071#true} havoc ~__retres1~1; {110071#true} is VALID [2022-02-20 20:01:43,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {110071#true} assume !(1 == ~c_dr_pc~0); {110071#true} is VALID [2022-02-20 20:01:43,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {110071#true} assume !(2 == ~c_dr_pc~0); {110071#true} is VALID [2022-02-20 20:01:43,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {110071#true} ~__retres1~1 := 0; {110071#true} is VALID [2022-02-20 20:01:43,565 INFO L290 TraceCheckUtils]: 4: Hoare triple {110071#true} #res := ~__retres1~1; {110071#true} is VALID [2022-02-20 20:01:43,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,565 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {110071#true} {110071#true} #1719#return; {110071#true} is VALID [2022-02-20 20:01:43,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {110171#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {110071#true} is VALID [2022-02-20 20:01:43,565 INFO L272 TraceCheckUtils]: 1: Hoare triple {110071#true} call #t~ret8 := is_do_write_p_triggered(); {110071#true} is VALID [2022-02-20 20:01:43,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {110071#true} havoc ~__retres1~0; {110071#true} is VALID [2022-02-20 20:01:43,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {110071#true} assume 1 == ~p_dw_pc~0; {110071#true} is VALID [2022-02-20 20:01:43,566 INFO L290 TraceCheckUtils]: 4: Hoare triple {110071#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {110071#true} is VALID [2022-02-20 20:01:43,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {110071#true} #res := ~__retres1~0; {110071#true} is VALID [2022-02-20 20:01:43,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,566 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {110071#true} {110071#true} #1717#return; {110071#true} is VALID [2022-02-20 20:01:43,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {110071#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {110071#true} is VALID [2022-02-20 20:01:43,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {110071#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {110071#true} is VALID [2022-02-20 20:01:43,566 INFO L272 TraceCheckUtils]: 10: Hoare triple {110071#true} call #t~ret9 := is_do_read_c_triggered(); {110071#true} is VALID [2022-02-20 20:01:43,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {110071#true} havoc ~__retres1~1; {110071#true} is VALID [2022-02-20 20:01:43,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {110071#true} assume !(1 == ~c_dr_pc~0); {110071#true} is VALID [2022-02-20 20:01:43,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {110071#true} assume !(2 == ~c_dr_pc~0); {110071#true} is VALID [2022-02-20 20:01:43,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {110071#true} ~__retres1~1 := 0; {110071#true} is VALID [2022-02-20 20:01:43,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {110071#true} #res := ~__retres1~1; {110071#true} is VALID [2022-02-20 20:01:43,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,567 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {110071#true} {110071#true} #1719#return; {110071#true} is VALID [2022-02-20 20:01:43,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {110071#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {110071#true} is VALID [2022-02-20 20:01:43,567 INFO L290 TraceCheckUtils]: 19: Hoare triple {110071#true} assume !(0 != ~tmp___0~1); {110071#true} is VALID [2022-02-20 20:01:43,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,568 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {110071#true} {110072#false} #1739#return; {110072#false} is VALID [2022-02-20 20:01:43,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-02-20 20:01:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {110170#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {110071#true} is VALID [2022-02-20 20:01:43,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {110071#true} assume !(1 == ~q_write_ev~0); {110071#true} is VALID [2022-02-20 20:01:43,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110071#true} {110072#false} #1741#return; {110072#false} is VALID [2022-02-20 20:01:43,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-02-20 20:01:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {110071#true} havoc ~__retres1~2; {110071#true} is VALID [2022-02-20 20:01:43,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {110071#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {110071#true} is VALID [2022-02-20 20:01:43,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {110071#true} #res := ~__retres1~2; {110071#true} is VALID [2022-02-20 20:01:43,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,576 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {110071#true} {110072#false} #1743#return; {110072#false} is VALID [2022-02-20 20:01:43,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-02-20 20:01:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {110071#true} havoc ~__retres1~2; {110071#true} is VALID [2022-02-20 20:01:43,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {110071#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {110071#true} is VALID [2022-02-20 20:01:43,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {110071#true} #res := ~__retres1~2; {110071#true} is VALID [2022-02-20 20:01:43,582 INFO L290 TraceCheckUtils]: 3: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,582 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {110071#true} {110072#false} #1747#return; {110072#false} is VALID [2022-02-20 20:01:43,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-02-20 20:01:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {110071#true} havoc ~__retres1~2; {110071#true} is VALID [2022-02-20 20:01:43,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {110071#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {110071#true} is VALID [2022-02-20 20:01:43,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {110071#true} #res := ~__retres1~2; {110071#true} is VALID [2022-02-20 20:01:43,587 INFO L290 TraceCheckUtils]: 3: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,587 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {110071#true} {110072#false} #1729#return; {110072#false} is VALID [2022-02-20 20:01:43,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {110071#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {110073#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:43,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {110073#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {110073#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:43,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {110073#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {110073#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:43,589 INFO L290 TraceCheckUtils]: 3: Hoare triple {110073#(= ~q_req_up~0 0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {110073#(= ~q_req_up~0 0)} is VALID [2022-02-20 20:01:43,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {110073#(= ~q_req_up~0 0)} call update_channels1(); {110169#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:43,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {110169#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {110071#true} is VALID [2022-02-20 20:01:43,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,590 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {110071#true} {110073#(= ~q_req_up~0 0)} #1721#return; {110071#true} is VALID [2022-02-20 20:01:43,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {110071#true} assume { :begin_inline_init_threads1 } true; {110071#true} is VALID [2022-02-20 20:01:43,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {110071#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {110071#true} is VALID [2022-02-20 20:01:43,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {110071#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {110071#true} is VALID [2022-02-20 20:01:43,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {110071#true} assume { :end_inline_init_threads1 } true; {110071#true} is VALID [2022-02-20 20:01:43,591 INFO L272 TraceCheckUtils]: 12: Hoare triple {110071#true} call fire_delta_events1(); {110170#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:43,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {110170#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {110071#true} is VALID [2022-02-20 20:01:43,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {110071#true} assume !(0 == ~q_write_ev~0); {110071#true} is VALID [2022-02-20 20:01:43,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,592 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {110071#true} {110071#true} #1723#return; {110071#true} is VALID [2022-02-20 20:01:43,592 INFO L272 TraceCheckUtils]: 17: Hoare triple {110071#true} call activate_threads1(); {110171#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:43,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {110171#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {110071#true} is VALID [2022-02-20 20:01:43,592 INFO L272 TraceCheckUtils]: 19: Hoare triple {110071#true} call #t~ret8 := is_do_write_p_triggered(); {110071#true} is VALID [2022-02-20 20:01:43,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {110071#true} havoc ~__retres1~0; {110071#true} is VALID [2022-02-20 20:01:43,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {110071#true} assume !(1 == ~p_dw_pc~0); {110071#true} is VALID [2022-02-20 20:01:43,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {110071#true} assume !(2 == ~p_dw_pc~0); {110071#true} is VALID [2022-02-20 20:01:43,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {110071#true} ~__retres1~0 := 0; {110071#true} is VALID [2022-02-20 20:01:43,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {110071#true} #res := ~__retres1~0; {110071#true} is VALID [2022-02-20 20:01:43,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,593 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {110071#true} {110071#true} #1717#return; {110071#true} is VALID [2022-02-20 20:01:43,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {110071#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {110071#true} is VALID [2022-02-20 20:01:43,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {110071#true} assume !(0 != ~tmp~1); {110071#true} is VALID [2022-02-20 20:01:43,594 INFO L272 TraceCheckUtils]: 29: Hoare triple {110071#true} call #t~ret9 := is_do_read_c_triggered(); {110071#true} is VALID [2022-02-20 20:01:43,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {110071#true} havoc ~__retres1~1; {110071#true} is VALID [2022-02-20 20:01:43,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {110071#true} assume !(1 == ~c_dr_pc~0); {110071#true} is VALID [2022-02-20 20:01:43,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {110071#true} assume !(2 == ~c_dr_pc~0); {110071#true} is VALID [2022-02-20 20:01:43,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {110071#true} ~__retres1~1 := 0; {110071#true} is VALID [2022-02-20 20:01:43,595 INFO L290 TraceCheckUtils]: 34: Hoare triple {110071#true} #res := ~__retres1~1; {110071#true} is VALID [2022-02-20 20:01:43,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,595 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {110071#true} {110071#true} #1719#return; {110071#true} is VALID [2022-02-20 20:01:43,595 INFO L290 TraceCheckUtils]: 37: Hoare triple {110071#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {110071#true} is VALID [2022-02-20 20:01:43,595 INFO L290 TraceCheckUtils]: 38: Hoare triple {110071#true} assume !(0 != ~tmp___0~1); {110071#true} is VALID [2022-02-20 20:01:43,595 INFO L290 TraceCheckUtils]: 39: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,595 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {110071#true} {110071#true} #1725#return; {110071#true} is VALID [2022-02-20 20:01:43,596 INFO L272 TraceCheckUtils]: 41: Hoare triple {110071#true} call reset_delta_events1(); {110170#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:43,596 INFO L290 TraceCheckUtils]: 42: Hoare triple {110170#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {110071#true} is VALID [2022-02-20 20:01:43,596 INFO L290 TraceCheckUtils]: 43: Hoare triple {110071#true} assume !(1 == ~q_write_ev~0); {110071#true} is VALID [2022-02-20 20:01:43,596 INFO L290 TraceCheckUtils]: 44: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,597 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {110071#true} {110071#true} #1727#return; {110071#true} is VALID [2022-02-20 20:01:43,597 INFO L290 TraceCheckUtils]: 46: Hoare triple {110071#true} assume !false; {110071#true} is VALID [2022-02-20 20:01:43,597 INFO L290 TraceCheckUtils]: 47: Hoare triple {110071#true} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {110071#true} is VALID [2022-02-20 20:01:43,597 INFO L290 TraceCheckUtils]: 48: Hoare triple {110071#true} assume !false; {110071#true} is VALID [2022-02-20 20:01:43,597 INFO L272 TraceCheckUtils]: 49: Hoare triple {110071#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {110071#true} is VALID [2022-02-20 20:01:43,597 INFO L290 TraceCheckUtils]: 50: Hoare triple {110071#true} havoc ~__retres1~2; {110071#true} is VALID [2022-02-20 20:01:43,597 INFO L290 TraceCheckUtils]: 51: Hoare triple {110071#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {110071#true} is VALID [2022-02-20 20:01:43,598 INFO L290 TraceCheckUtils]: 52: Hoare triple {110071#true} #res := ~__retres1~2; {110071#true} is VALID [2022-02-20 20:01:43,598 INFO L290 TraceCheckUtils]: 53: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,598 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {110071#true} {110071#true} #1729#return; {110071#true} is VALID [2022-02-20 20:01:43,598 INFO L290 TraceCheckUtils]: 55: Hoare triple {110071#true} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {110071#true} is VALID [2022-02-20 20:01:43,598 INFO L290 TraceCheckUtils]: 56: Hoare triple {110071#true} assume 0 != eval1_~tmp___1~0#1; {110071#true} is VALID [2022-02-20 20:01:43,598 INFO L290 TraceCheckUtils]: 57: Hoare triple {110071#true} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {110071#true} is VALID [2022-02-20 20:01:43,598 INFO L290 TraceCheckUtils]: 58: Hoare triple {110071#true} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {110071#true} is VALID [2022-02-20 20:01:43,599 INFO L290 TraceCheckUtils]: 59: Hoare triple {110071#true} assume 0 == ~p_dw_pc~0; {110071#true} is VALID [2022-02-20 20:01:43,599 INFO L290 TraceCheckUtils]: 60: Hoare triple {110071#true} assume !false; {110071#true} is VALID [2022-02-20 20:01:43,599 INFO L290 TraceCheckUtils]: 61: Hoare triple {110071#true} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {110071#true} is VALID [2022-02-20 20:01:43,599 INFO L290 TraceCheckUtils]: 62: Hoare triple {110071#true} assume { :end_inline_do_write_p } true; {110071#true} is VALID [2022-02-20 20:01:43,599 INFO L290 TraceCheckUtils]: 63: Hoare triple {110071#true} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {110071#true} is VALID [2022-02-20 20:01:43,599 INFO L290 TraceCheckUtils]: 64: Hoare triple {110071#true} assume !(0 != eval1_~tmp___0~2#1); {110071#true} is VALID [2022-02-20 20:01:43,600 INFO L290 TraceCheckUtils]: 65: Hoare triple {110071#true} assume !false; {110071#true} is VALID [2022-02-20 20:01:43,600 INFO L272 TraceCheckUtils]: 66: Hoare triple {110071#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {110071#true} is VALID [2022-02-20 20:01:43,600 INFO L290 TraceCheckUtils]: 67: Hoare triple {110071#true} havoc ~__retres1~2; {110071#true} is VALID [2022-02-20 20:01:43,600 INFO L290 TraceCheckUtils]: 68: Hoare triple {110071#true} assume !(0 == ~p_dw_st~0); {110071#true} is VALID [2022-02-20 20:01:43,600 INFO L290 TraceCheckUtils]: 69: Hoare triple {110071#true} assume 0 == ~c_dr_st~0;~__retres1~2 := 1; {110186#(<= 1 exists_runnable_thread1_~__retres1~2)} is VALID [2022-02-20 20:01:43,601 INFO L290 TraceCheckUtils]: 70: Hoare triple {110186#(<= 1 exists_runnable_thread1_~__retres1~2)} #res := ~__retres1~2; {110187#(<= 1 |exists_runnable_thread1_#res|)} is VALID [2022-02-20 20:01:43,601 INFO L290 TraceCheckUtils]: 71: Hoare triple {110187#(<= 1 |exists_runnable_thread1_#res|)} assume true; {110187#(<= 1 |exists_runnable_thread1_#res|)} is VALID [2022-02-20 20:01:43,602 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {110187#(<= 1 |exists_runnable_thread1_#res|)} {110071#true} #1729#return; {110119#(not (= |ULTIMATE.start_eval1_#t~ret10#1| 0))} is VALID [2022-02-20 20:01:43,602 INFO L290 TraceCheckUtils]: 73: Hoare triple {110119#(not (= |ULTIMATE.start_eval1_#t~ret10#1| 0))} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {110120#(not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))} is VALID [2022-02-20 20:01:43,603 INFO L290 TraceCheckUtils]: 74: Hoare triple {110120#(not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))} assume !(0 != eval1_~tmp___1~0#1); {110072#false} is VALID [2022-02-20 20:01:43,603 INFO L290 TraceCheckUtils]: 75: Hoare triple {110072#false} assume { :end_inline_eval1 } true;start_simulation1_~kernel_st~0#1 := 2; {110072#false} is VALID [2022-02-20 20:01:43,603 INFO L272 TraceCheckUtils]: 76: Hoare triple {110072#false} call update_channels1(); {110169#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 20:01:43,603 INFO L290 TraceCheckUtils]: 77: Hoare triple {110169#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} assume !(1 == ~q_req_up~0); {110071#true} is VALID [2022-02-20 20:01:43,604 INFO L290 TraceCheckUtils]: 78: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,604 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {110071#true} {110072#false} #1735#return; {110072#false} is VALID [2022-02-20 20:01:43,604 INFO L290 TraceCheckUtils]: 80: Hoare triple {110072#false} start_simulation1_~kernel_st~0#1 := 3; {110072#false} is VALID [2022-02-20 20:01:43,604 INFO L272 TraceCheckUtils]: 81: Hoare triple {110072#false} call fire_delta_events1(); {110170#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:43,604 INFO L290 TraceCheckUtils]: 82: Hoare triple {110170#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(0 == ~q_read_ev~0); {110071#true} is VALID [2022-02-20 20:01:43,605 INFO L290 TraceCheckUtils]: 83: Hoare triple {110071#true} assume !(0 == ~q_write_ev~0); {110071#true} is VALID [2022-02-20 20:01:43,605 INFO L290 TraceCheckUtils]: 84: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,605 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {110071#true} {110072#false} #1737#return; {110072#false} is VALID [2022-02-20 20:01:43,605 INFO L272 TraceCheckUtils]: 86: Hoare triple {110072#false} call activate_threads1(); {110171#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 20:01:43,605 INFO L290 TraceCheckUtils]: 87: Hoare triple {110171#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} havoc ~tmp~1;havoc ~tmp___0~1; {110071#true} is VALID [2022-02-20 20:01:43,605 INFO L272 TraceCheckUtils]: 88: Hoare triple {110071#true} call #t~ret8 := is_do_write_p_triggered(); {110071#true} is VALID [2022-02-20 20:01:43,605 INFO L290 TraceCheckUtils]: 89: Hoare triple {110071#true} havoc ~__retres1~0; {110071#true} is VALID [2022-02-20 20:01:43,606 INFO L290 TraceCheckUtils]: 90: Hoare triple {110071#true} assume 1 == ~p_dw_pc~0; {110071#true} is VALID [2022-02-20 20:01:43,606 INFO L290 TraceCheckUtils]: 91: Hoare triple {110071#true} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {110071#true} is VALID [2022-02-20 20:01:43,606 INFO L290 TraceCheckUtils]: 92: Hoare triple {110071#true} #res := ~__retres1~0; {110071#true} is VALID [2022-02-20 20:01:43,606 INFO L290 TraceCheckUtils]: 93: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,606 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {110071#true} {110071#true} #1717#return; {110071#true} is VALID [2022-02-20 20:01:43,606 INFO L290 TraceCheckUtils]: 95: Hoare triple {110071#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {110071#true} is VALID [2022-02-20 20:01:43,606 INFO L290 TraceCheckUtils]: 96: Hoare triple {110071#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {110071#true} is VALID [2022-02-20 20:01:43,607 INFO L272 TraceCheckUtils]: 97: Hoare triple {110071#true} call #t~ret9 := is_do_read_c_triggered(); {110071#true} is VALID [2022-02-20 20:01:43,607 INFO L290 TraceCheckUtils]: 98: Hoare triple {110071#true} havoc ~__retres1~1; {110071#true} is VALID [2022-02-20 20:01:43,607 INFO L290 TraceCheckUtils]: 99: Hoare triple {110071#true} assume !(1 == ~c_dr_pc~0); {110071#true} is VALID [2022-02-20 20:01:43,607 INFO L290 TraceCheckUtils]: 100: Hoare triple {110071#true} assume !(2 == ~c_dr_pc~0); {110071#true} is VALID [2022-02-20 20:01:43,607 INFO L290 TraceCheckUtils]: 101: Hoare triple {110071#true} ~__retres1~1 := 0; {110071#true} is VALID [2022-02-20 20:01:43,607 INFO L290 TraceCheckUtils]: 102: Hoare triple {110071#true} #res := ~__retres1~1; {110071#true} is VALID [2022-02-20 20:01:43,607 INFO L290 TraceCheckUtils]: 103: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,608 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {110071#true} {110071#true} #1719#return; {110071#true} is VALID [2022-02-20 20:01:43,608 INFO L290 TraceCheckUtils]: 105: Hoare triple {110071#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {110071#true} is VALID [2022-02-20 20:01:43,608 INFO L290 TraceCheckUtils]: 106: Hoare triple {110071#true} assume !(0 != ~tmp___0~1); {110071#true} is VALID [2022-02-20 20:01:43,608 INFO L290 TraceCheckUtils]: 107: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,608 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {110071#true} {110072#false} #1739#return; {110072#false} is VALID [2022-02-20 20:01:43,608 INFO L272 TraceCheckUtils]: 109: Hoare triple {110072#false} call reset_delta_events1(); {110170#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 20:01:43,609 INFO L290 TraceCheckUtils]: 110: Hoare triple {110170#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume !(1 == ~q_read_ev~0); {110071#true} is VALID [2022-02-20 20:01:43,609 INFO L290 TraceCheckUtils]: 111: Hoare triple {110071#true} assume !(1 == ~q_write_ev~0); {110071#true} is VALID [2022-02-20 20:01:43,609 INFO L290 TraceCheckUtils]: 112: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,609 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {110071#true} {110072#false} #1741#return; {110072#false} is VALID [2022-02-20 20:01:43,609 INFO L272 TraceCheckUtils]: 114: Hoare triple {110072#false} call start_simulation1_#t~ret14#1 := exists_runnable_thread1(); {110071#true} is VALID [2022-02-20 20:01:43,609 INFO L290 TraceCheckUtils]: 115: Hoare triple {110071#true} havoc ~__retres1~2; {110071#true} is VALID [2022-02-20 20:01:43,609 INFO L290 TraceCheckUtils]: 116: Hoare triple {110071#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {110071#true} is VALID [2022-02-20 20:01:43,609 INFO L290 TraceCheckUtils]: 117: Hoare triple {110071#true} #res := ~__retres1~2; {110071#true} is VALID [2022-02-20 20:01:43,610 INFO L290 TraceCheckUtils]: 118: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,610 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {110071#true} {110072#false} #1743#return; {110072#false} is VALID [2022-02-20 20:01:43,610 INFO L290 TraceCheckUtils]: 120: Hoare triple {110072#false} assume -2147483648 <= start_simulation1_#t~ret14#1 && start_simulation1_#t~ret14#1 <= 2147483647;start_simulation1_~tmp~4#1 := start_simulation1_#t~ret14#1;havoc start_simulation1_#t~ret14#1; {110072#false} is VALID [2022-02-20 20:01:43,610 INFO L290 TraceCheckUtils]: 121: Hoare triple {110072#false} assume !(0 == start_simulation1_~tmp~4#1); {110072#false} is VALID [2022-02-20 20:01:43,610 INFO L290 TraceCheckUtils]: 122: Hoare triple {110072#false} assume { :begin_inline_stop_simulation1 } true;havoc stop_simulation1_#res#1;havoc stop_simulation1_#t~ret13#1, stop_simulation1_~tmp~3#1, stop_simulation1_~__retres2~0#1;havoc stop_simulation1_~tmp~3#1;havoc stop_simulation1_~__retres2~0#1; {110072#false} is VALID [2022-02-20 20:01:43,611 INFO L272 TraceCheckUtils]: 123: Hoare triple {110072#false} call stop_simulation1_#t~ret13#1 := exists_runnable_thread1(); {110071#true} is VALID [2022-02-20 20:01:43,611 INFO L290 TraceCheckUtils]: 124: Hoare triple {110071#true} havoc ~__retres1~2; {110071#true} is VALID [2022-02-20 20:01:43,611 INFO L290 TraceCheckUtils]: 125: Hoare triple {110071#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {110071#true} is VALID [2022-02-20 20:01:43,611 INFO L290 TraceCheckUtils]: 126: Hoare triple {110071#true} #res := ~__retres1~2; {110071#true} is VALID [2022-02-20 20:01:43,611 INFO L290 TraceCheckUtils]: 127: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,611 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {110071#true} {110072#false} #1747#return; {110072#false} is VALID [2022-02-20 20:01:43,611 INFO L290 TraceCheckUtils]: 129: Hoare triple {110072#false} assume -2147483648 <= stop_simulation1_#t~ret13#1 && stop_simulation1_#t~ret13#1 <= 2147483647;stop_simulation1_~tmp~3#1 := stop_simulation1_#t~ret13#1;havoc stop_simulation1_#t~ret13#1; {110072#false} is VALID [2022-02-20 20:01:43,612 INFO L290 TraceCheckUtils]: 130: Hoare triple {110072#false} assume 0 != stop_simulation1_~tmp~3#1;stop_simulation1_~__retres2~0#1 := 0; {110072#false} is VALID [2022-02-20 20:01:43,612 INFO L290 TraceCheckUtils]: 131: Hoare triple {110072#false} stop_simulation1_#res#1 := stop_simulation1_~__retres2~0#1; {110072#false} is VALID [2022-02-20 20:01:43,612 INFO L290 TraceCheckUtils]: 132: Hoare triple {110072#false} start_simulation1_#t~ret15#1 := stop_simulation1_#res#1;assume { :end_inline_stop_simulation1 } true;assume -2147483648 <= start_simulation1_#t~ret15#1 && start_simulation1_#t~ret15#1 <= 2147483647;start_simulation1_~tmp___0~3#1 := start_simulation1_#t~ret15#1;havoc start_simulation1_#t~ret15#1; {110072#false} is VALID [2022-02-20 20:01:43,612 INFO L290 TraceCheckUtils]: 133: Hoare triple {110072#false} assume !(0 != start_simulation1_~tmp___0~3#1); {110072#false} is VALID [2022-02-20 20:01:43,612 INFO L290 TraceCheckUtils]: 134: Hoare triple {110072#false} assume !false; {110072#false} is VALID [2022-02-20 20:01:43,612 INFO L290 TraceCheckUtils]: 135: Hoare triple {110072#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {110072#false} is VALID [2022-02-20 20:01:43,613 INFO L290 TraceCheckUtils]: 136: Hoare triple {110072#false} assume !false; {110072#false} is VALID [2022-02-20 20:01:43,613 INFO L272 TraceCheckUtils]: 137: Hoare triple {110072#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {110071#true} is VALID [2022-02-20 20:01:43,613 INFO L290 TraceCheckUtils]: 138: Hoare triple {110071#true} havoc ~__retres1~2; {110071#true} is VALID [2022-02-20 20:01:43,613 INFO L290 TraceCheckUtils]: 139: Hoare triple {110071#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {110071#true} is VALID [2022-02-20 20:01:43,613 INFO L290 TraceCheckUtils]: 140: Hoare triple {110071#true} #res := ~__retres1~2; {110071#true} is VALID [2022-02-20 20:01:43,613 INFO L290 TraceCheckUtils]: 141: Hoare triple {110071#true} assume true; {110071#true} is VALID [2022-02-20 20:01:43,613 INFO L284 TraceCheckUtils]: 142: Hoare quadruple {110071#true} {110072#false} #1729#return; {110072#false} is VALID [2022-02-20 20:01:43,614 INFO L290 TraceCheckUtils]: 143: Hoare triple {110072#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {110072#false} is VALID [2022-02-20 20:01:43,614 INFO L290 TraceCheckUtils]: 144: Hoare triple {110072#false} assume 0 != eval1_~tmp___1~0#1; {110072#false} is VALID [2022-02-20 20:01:43,614 INFO L290 TraceCheckUtils]: 145: Hoare triple {110072#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {110072#false} is VALID [2022-02-20 20:01:43,614 INFO L290 TraceCheckUtils]: 146: Hoare triple {110072#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {110072#false} is VALID [2022-02-20 20:01:43,614 INFO L290 TraceCheckUtils]: 147: Hoare triple {110072#false} assume !(0 == ~p_dw_pc~0); {110072#false} is VALID [2022-02-20 20:01:43,614 INFO L290 TraceCheckUtils]: 148: Hoare triple {110072#false} assume 1 == ~p_dw_pc~0; {110072#false} is VALID [2022-02-20 20:01:43,614 INFO L290 TraceCheckUtils]: 149: Hoare triple {110072#false} assume !(0 == ~q_free~0); {110072#false} is VALID [2022-02-20 20:01:43,615 INFO L290 TraceCheckUtils]: 150: Hoare triple {110072#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {110072#false} is VALID [2022-02-20 20:01:43,615 INFO L290 TraceCheckUtils]: 151: Hoare triple {110072#false} assume !false; {110072#false} is VALID [2022-02-20 20:01:43,615 INFO L290 TraceCheckUtils]: 152: Hoare triple {110072#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {110072#false} is VALID [2022-02-20 20:01:43,615 INFO L290 TraceCheckUtils]: 153: Hoare triple {110072#false} assume { :end_inline_do_write_p } true; {110072#false} is VALID [2022-02-20 20:01:43,615 INFO L290 TraceCheckUtils]: 154: Hoare triple {110072#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {110072#false} is VALID [2022-02-20 20:01:43,616 INFO L290 TraceCheckUtils]: 155: Hoare triple {110072#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {110072#false} is VALID [2022-02-20 20:01:43,616 INFO L290 TraceCheckUtils]: 156: Hoare triple {110072#false} assume !(0 == ~c_dr_pc~0); {110072#false} is VALID [2022-02-20 20:01:43,616 INFO L290 TraceCheckUtils]: 157: Hoare triple {110072#false} assume 2 == ~c_dr_pc~0; {110072#false} is VALID [2022-02-20 20:01:43,616 INFO L290 TraceCheckUtils]: 158: Hoare triple {110072#false} do_read_c_~a~0#1 := ~a_t~0; {110072#false} is VALID [2022-02-20 20:01:43,616 INFO L290 TraceCheckUtils]: 159: Hoare triple {110072#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {110072#false} is VALID [2022-02-20 20:01:43,616 INFO L290 TraceCheckUtils]: 160: Hoare triple {110072#false} assume !(~p_last_write~0 == ~c_last_read~0); {110072#false} is VALID [2022-02-20 20:01:43,616 INFO L272 TraceCheckUtils]: 161: Hoare triple {110072#false} call error1(); {110072#false} is VALID [2022-02-20 20:01:43,617 INFO L290 TraceCheckUtils]: 162: Hoare triple {110072#false} assume !false; {110072#false} is VALID [2022-02-20 20:01:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-02-20 20:01:43,617 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:01:43,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631445013] [2022-02-20 20:01:43,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631445013] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 20:01:43,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030925951] [2022-02-20 20:01:43,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:01:43,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 20:01:43,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:01:43,630 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 20:01:43,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 20:01:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 20:01:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:01:43,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 20:01:44,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {110071#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3);~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;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {110071#true} is VALID [2022-02-20 20:01:44,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {110071#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {110071#true} is VALID [2022-02-20 20:01:44,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {110071#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_~__retres1~3#1;havoc main1_~__retres1~3#1;assume { :begin_inline_init_model1 } true;~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; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_#t~ret15#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1, start_simulation1_~tmp___0~3#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;havoc start_simulation1_~tmp___0~3#1;start_simulation1_~kernel_st~0#1 := 0; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} call update_channels1(); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !(1 == ~q_req_up~0); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume true; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,285 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {110210#(<= 2 ~fast_clk_edge~0)} {110210#(<= 2 ~fast_clk_edge~0)} #1721#return; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume { :begin_inline_init_threads1 } true; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume { :end_inline_init_threads1 } true; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,287 INFO L272 TraceCheckUtils]: 12: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} call fire_delta_events1(); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !(0 == ~q_read_ev~0); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !(0 == ~q_write_ev~0); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume true; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,288 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {110210#(<= 2 ~fast_clk_edge~0)} {110210#(<= 2 ~fast_clk_edge~0)} #1723#return; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,288 INFO L272 TraceCheckUtils]: 17: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} call activate_threads1(); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} havoc ~tmp~1;havoc ~tmp___0~1; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,289 INFO L272 TraceCheckUtils]: 19: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} call #t~ret8 := is_do_write_p_triggered(); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} havoc ~__retres1~0; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !(1 == ~p_dw_pc~0); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !(2 == ~p_dw_pc~0); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} ~__retres1~0 := 0; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} #res := ~__retres1~0; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume true; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,291 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {110210#(<= 2 ~fast_clk_edge~0)} {110210#(<= 2 ~fast_clk_edge~0)} #1717#return; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !(0 != ~tmp~1); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,291 INFO L272 TraceCheckUtils]: 29: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} call #t~ret9 := is_do_read_c_triggered(); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} havoc ~__retres1~1; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,292 INFO L290 TraceCheckUtils]: 31: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !(1 == ~c_dr_pc~0); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,292 INFO L290 TraceCheckUtils]: 32: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !(2 == ~c_dr_pc~0); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} ~__retres1~1 := 0; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} #res := ~__retres1~1; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume true; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,293 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {110210#(<= 2 ~fast_clk_edge~0)} {110210#(<= 2 ~fast_clk_edge~0)} #1719#return; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,294 INFO L290 TraceCheckUtils]: 37: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,294 INFO L290 TraceCheckUtils]: 38: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !(0 != ~tmp___0~1); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,294 INFO L290 TraceCheckUtils]: 39: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume true; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,294 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {110210#(<= 2 ~fast_clk_edge~0)} {110210#(<= 2 ~fast_clk_edge~0)} #1725#return; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,295 INFO L272 TraceCheckUtils]: 41: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} call reset_delta_events1(); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !(1 == ~q_read_ev~0); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,295 INFO L290 TraceCheckUtils]: 43: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !(1 == ~q_write_ev~0); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,296 INFO L290 TraceCheckUtils]: 44: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume true; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,296 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {110210#(<= 2 ~fast_clk_edge~0)} {110210#(<= 2 ~fast_clk_edge~0)} #1727#return; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,296 INFO L290 TraceCheckUtils]: 46: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !false; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,296 INFO L290 TraceCheckUtils]: 47: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,297 INFO L290 TraceCheckUtils]: 48: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !false; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,297 INFO L272 TraceCheckUtils]: 49: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,297 INFO L290 TraceCheckUtils]: 50: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} havoc ~__retres1~2; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,298 INFO L290 TraceCheckUtils]: 51: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,298 INFO L290 TraceCheckUtils]: 52: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} #res := ~__retres1~2; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,298 INFO L290 TraceCheckUtils]: 53: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume true; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,299 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {110210#(<= 2 ~fast_clk_edge~0)} {110210#(<= 2 ~fast_clk_edge~0)} #1729#return; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,299 INFO L290 TraceCheckUtils]: 55: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,299 INFO L290 TraceCheckUtils]: 56: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume 0 != eval1_~tmp___1~0#1; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,299 INFO L290 TraceCheckUtils]: 57: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,300 INFO L290 TraceCheckUtils]: 58: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,300 INFO L290 TraceCheckUtils]: 59: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume 0 == ~p_dw_pc~0; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,300 INFO L290 TraceCheckUtils]: 60: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !false; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,300 INFO L290 TraceCheckUtils]: 61: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,301 INFO L290 TraceCheckUtils]: 62: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume { :end_inline_do_write_p } true; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,301 INFO L290 TraceCheckUtils]: 63: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,301 INFO L290 TraceCheckUtils]: 64: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !(0 != eval1_~tmp___0~2#1); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,301 INFO L290 TraceCheckUtils]: 65: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !false; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,302 INFO L272 TraceCheckUtils]: 66: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,302 INFO L290 TraceCheckUtils]: 67: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} havoc ~__retres1~2; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,302 INFO L290 TraceCheckUtils]: 68: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !(0 == ~p_dw_st~0); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,303 INFO L290 TraceCheckUtils]: 69: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume 0 == ~c_dr_st~0;~__retres1~2 := 1; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,303 INFO L290 TraceCheckUtils]: 70: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} #res := ~__retres1~2; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,303 INFO L290 TraceCheckUtils]: 71: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume true; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,304 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {110210#(<= 2 ~fast_clk_edge~0)} {110210#(<= 2 ~fast_clk_edge~0)} #1729#return; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,304 INFO L290 TraceCheckUtils]: 73: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,304 INFO L290 TraceCheckUtils]: 74: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !(0 != eval1_~tmp___1~0#1); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,305 INFO L290 TraceCheckUtils]: 75: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume { :end_inline_eval1 } true;start_simulation1_~kernel_st~0#1 := 2; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,305 INFO L272 TraceCheckUtils]: 76: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} call update_channels1(); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,305 INFO L290 TraceCheckUtils]: 77: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !(1 == ~q_req_up~0); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,306 INFO L290 TraceCheckUtils]: 78: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume true; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,306 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {110210#(<= 2 ~fast_clk_edge~0)} {110210#(<= 2 ~fast_clk_edge~0)} #1735#return; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,306 INFO L290 TraceCheckUtils]: 80: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} start_simulation1_~kernel_st~0#1 := 3; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,307 INFO L272 TraceCheckUtils]: 81: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} call fire_delta_events1(); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,307 INFO L290 TraceCheckUtils]: 82: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !(0 == ~q_read_ev~0); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,307 INFO L290 TraceCheckUtils]: 83: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume !(0 == ~q_write_ev~0); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,307 INFO L290 TraceCheckUtils]: 84: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume true; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,308 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {110210#(<= 2 ~fast_clk_edge~0)} {110210#(<= 2 ~fast_clk_edge~0)} #1737#return; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,308 INFO L272 TraceCheckUtils]: 86: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} call activate_threads1(); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,308 INFO L290 TraceCheckUtils]: 87: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} havoc ~tmp~1;havoc ~tmp___0~1; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,309 INFO L272 TraceCheckUtils]: 88: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} call #t~ret8 := is_do_write_p_triggered(); {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,309 INFO L290 TraceCheckUtils]: 89: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} havoc ~__retres1~0; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,309 INFO L290 TraceCheckUtils]: 90: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume 1 == ~p_dw_pc~0; {110210#(<= 2 ~fast_clk_edge~0)} is VALID [2022-02-20 20:01:44,310 INFO L290 TraceCheckUtils]: 91: Hoare triple {110210#(<= 2 ~fast_clk_edge~0)} assume 1 == ~fast_clk_edge~0;~__retres1~0 := 1; {110072#false} is VALID [2022-02-20 20:01:44,310 INFO L290 TraceCheckUtils]: 92: Hoare triple {110072#false} #res := ~__retres1~0; {110072#false} is VALID [2022-02-20 20:01:44,310 INFO L290 TraceCheckUtils]: 93: Hoare triple {110072#false} assume true; {110072#false} is VALID [2022-02-20 20:01:44,310 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {110072#false} {110210#(<= 2 ~fast_clk_edge~0)} #1717#return; {110072#false} is VALID [2022-02-20 20:01:44,310 INFO L290 TraceCheckUtils]: 95: Hoare triple {110072#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {110072#false} is VALID [2022-02-20 20:01:44,310 INFO L290 TraceCheckUtils]: 96: Hoare triple {110072#false} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {110072#false} is VALID [2022-02-20 20:01:44,310 INFO L272 TraceCheckUtils]: 97: Hoare triple {110072#false} call #t~ret9 := is_do_read_c_triggered(); {110072#false} is VALID [2022-02-20 20:01:44,311 INFO L290 TraceCheckUtils]: 98: Hoare triple {110072#false} havoc ~__retres1~1; {110072#false} is VALID [2022-02-20 20:01:44,311 INFO L290 TraceCheckUtils]: 99: Hoare triple {110072#false} assume !(1 == ~c_dr_pc~0); {110072#false} is VALID [2022-02-20 20:01:44,311 INFO L290 TraceCheckUtils]: 100: Hoare triple {110072#false} assume !(2 == ~c_dr_pc~0); {110072#false} is VALID [2022-02-20 20:01:44,311 INFO L290 TraceCheckUtils]: 101: Hoare triple {110072#false} ~__retres1~1 := 0; {110072#false} is VALID [2022-02-20 20:01:44,311 INFO L290 TraceCheckUtils]: 102: Hoare triple {110072#false} #res := ~__retres1~1; {110072#false} is VALID [2022-02-20 20:01:44,311 INFO L290 TraceCheckUtils]: 103: Hoare triple {110072#false} assume true; {110072#false} is VALID [2022-02-20 20:01:44,311 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {110072#false} {110072#false} #1719#return; {110072#false} is VALID [2022-02-20 20:01:44,311 INFO L290 TraceCheckUtils]: 105: Hoare triple {110072#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {110072#false} is VALID [2022-02-20 20:01:44,311 INFO L290 TraceCheckUtils]: 106: Hoare triple {110072#false} assume !(0 != ~tmp___0~1); {110072#false} is VALID [2022-02-20 20:01:44,312 INFO L290 TraceCheckUtils]: 107: Hoare triple {110072#false} assume true; {110072#false} is VALID [2022-02-20 20:01:44,312 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {110072#false} {110210#(<= 2 ~fast_clk_edge~0)} #1739#return; {110072#false} is VALID [2022-02-20 20:01:44,312 INFO L272 TraceCheckUtils]: 109: Hoare triple {110072#false} call reset_delta_events1(); {110072#false} is VALID [2022-02-20 20:01:44,312 INFO L290 TraceCheckUtils]: 110: Hoare triple {110072#false} assume !(1 == ~q_read_ev~0); {110072#false} is VALID [2022-02-20 20:01:44,312 INFO L290 TraceCheckUtils]: 111: Hoare triple {110072#false} assume !(1 == ~q_write_ev~0); {110072#false} is VALID [2022-02-20 20:01:44,312 INFO L290 TraceCheckUtils]: 112: Hoare triple {110072#false} assume true; {110072#false} is VALID [2022-02-20 20:01:44,312 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {110072#false} {110072#false} #1741#return; {110072#false} is VALID [2022-02-20 20:01:44,312 INFO L272 TraceCheckUtils]: 114: Hoare triple {110072#false} call start_simulation1_#t~ret14#1 := exists_runnable_thread1(); {110072#false} is VALID [2022-02-20 20:01:44,313 INFO L290 TraceCheckUtils]: 115: Hoare triple {110072#false} havoc ~__retres1~2; {110072#false} is VALID [2022-02-20 20:01:44,313 INFO L290 TraceCheckUtils]: 116: Hoare triple {110072#false} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {110072#false} is VALID [2022-02-20 20:01:44,313 INFO L290 TraceCheckUtils]: 117: Hoare triple {110072#false} #res := ~__retres1~2; {110072#false} is VALID [2022-02-20 20:01:44,313 INFO L290 TraceCheckUtils]: 118: Hoare triple {110072#false} assume true; {110072#false} is VALID [2022-02-20 20:01:44,314 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {110072#false} {110072#false} #1743#return; {110072#false} is VALID [2022-02-20 20:01:44,314 INFO L290 TraceCheckUtils]: 120: Hoare triple {110072#false} assume -2147483648 <= start_simulation1_#t~ret14#1 && start_simulation1_#t~ret14#1 <= 2147483647;start_simulation1_~tmp~4#1 := start_simulation1_#t~ret14#1;havoc start_simulation1_#t~ret14#1; {110072#false} is VALID [2022-02-20 20:01:44,314 INFO L290 TraceCheckUtils]: 121: Hoare triple {110072#false} assume !(0 == start_simulation1_~tmp~4#1); {110072#false} is VALID [2022-02-20 20:01:44,314 INFO L290 TraceCheckUtils]: 122: Hoare triple {110072#false} assume { :begin_inline_stop_simulation1 } true;havoc stop_simulation1_#res#1;havoc stop_simulation1_#t~ret13#1, stop_simulation1_~tmp~3#1, stop_simulation1_~__retres2~0#1;havoc stop_simulation1_~tmp~3#1;havoc stop_simulation1_~__retres2~0#1; {110072#false} is VALID [2022-02-20 20:01:44,314 INFO L272 TraceCheckUtils]: 123: Hoare triple {110072#false} call stop_simulation1_#t~ret13#1 := exists_runnable_thread1(); {110072#false} is VALID [2022-02-20 20:01:44,314 INFO L290 TraceCheckUtils]: 124: Hoare triple {110072#false} havoc ~__retres1~2; {110072#false} is VALID [2022-02-20 20:01:44,314 INFO L290 TraceCheckUtils]: 125: Hoare triple {110072#false} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {110072#false} is VALID [2022-02-20 20:01:44,314 INFO L290 TraceCheckUtils]: 126: Hoare triple {110072#false} #res := ~__retres1~2; {110072#false} is VALID [2022-02-20 20:01:44,315 INFO L290 TraceCheckUtils]: 127: Hoare triple {110072#false} assume true; {110072#false} is VALID [2022-02-20 20:01:44,315 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {110072#false} {110072#false} #1747#return; {110072#false} is VALID [2022-02-20 20:01:44,315 INFO L290 TraceCheckUtils]: 129: Hoare triple {110072#false} assume -2147483648 <= stop_simulation1_#t~ret13#1 && stop_simulation1_#t~ret13#1 <= 2147483647;stop_simulation1_~tmp~3#1 := stop_simulation1_#t~ret13#1;havoc stop_simulation1_#t~ret13#1; {110072#false} is VALID [2022-02-20 20:01:44,315 INFO L290 TraceCheckUtils]: 130: Hoare triple {110072#false} assume 0 != stop_simulation1_~tmp~3#1;stop_simulation1_~__retres2~0#1 := 0; {110072#false} is VALID [2022-02-20 20:01:44,315 INFO L290 TraceCheckUtils]: 131: Hoare triple {110072#false} stop_simulation1_#res#1 := stop_simulation1_~__retres2~0#1; {110072#false} is VALID [2022-02-20 20:01:44,315 INFO L290 TraceCheckUtils]: 132: Hoare triple {110072#false} start_simulation1_#t~ret15#1 := stop_simulation1_#res#1;assume { :end_inline_stop_simulation1 } true;assume -2147483648 <= start_simulation1_#t~ret15#1 && start_simulation1_#t~ret15#1 <= 2147483647;start_simulation1_~tmp___0~3#1 := start_simulation1_#t~ret15#1;havoc start_simulation1_#t~ret15#1; {110072#false} is VALID [2022-02-20 20:01:44,315 INFO L290 TraceCheckUtils]: 133: Hoare triple {110072#false} assume !(0 != start_simulation1_~tmp___0~3#1); {110072#false} is VALID [2022-02-20 20:01:44,315 INFO L290 TraceCheckUtils]: 134: Hoare triple {110072#false} assume !false; {110072#false} is VALID [2022-02-20 20:01:44,316 INFO L290 TraceCheckUtils]: 135: Hoare triple {110072#false} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {110072#false} is VALID [2022-02-20 20:01:44,316 INFO L290 TraceCheckUtils]: 136: Hoare triple {110072#false} assume !false; {110072#false} is VALID [2022-02-20 20:01:44,316 INFO L272 TraceCheckUtils]: 137: Hoare triple {110072#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {110072#false} is VALID [2022-02-20 20:01:44,316 INFO L290 TraceCheckUtils]: 138: Hoare triple {110072#false} havoc ~__retres1~2; {110072#false} is VALID [2022-02-20 20:01:44,316 INFO L290 TraceCheckUtils]: 139: Hoare triple {110072#false} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {110072#false} is VALID [2022-02-20 20:01:44,316 INFO L290 TraceCheckUtils]: 140: Hoare triple {110072#false} #res := ~__retres1~2; {110072#false} is VALID [2022-02-20 20:01:44,316 INFO L290 TraceCheckUtils]: 141: Hoare triple {110072#false} assume true; {110072#false} is VALID [2022-02-20 20:01:44,316 INFO L284 TraceCheckUtils]: 142: Hoare quadruple {110072#false} {110072#false} #1729#return; {110072#false} is VALID [2022-02-20 20:01:44,317 INFO L290 TraceCheckUtils]: 143: Hoare triple {110072#false} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {110072#false} is VALID [2022-02-20 20:01:44,317 INFO L290 TraceCheckUtils]: 144: Hoare triple {110072#false} assume 0 != eval1_~tmp___1~0#1; {110072#false} is VALID [2022-02-20 20:01:44,317 INFO L290 TraceCheckUtils]: 145: Hoare triple {110072#false} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {110072#false} is VALID [2022-02-20 20:01:44,317 INFO L290 TraceCheckUtils]: 146: Hoare triple {110072#false} assume 0 != eval1_~tmp~2#1;~p_dw_st~0 := 1;assume { :begin_inline_do_write_p } true;havoc do_write_p_#t~nondet7#1; {110072#false} is VALID [2022-02-20 20:01:44,317 INFO L290 TraceCheckUtils]: 147: Hoare triple {110072#false} assume !(0 == ~p_dw_pc~0); {110072#false} is VALID [2022-02-20 20:01:44,317 INFO L290 TraceCheckUtils]: 148: Hoare triple {110072#false} assume 1 == ~p_dw_pc~0; {110072#false} is VALID [2022-02-20 20:01:44,317 INFO L290 TraceCheckUtils]: 149: Hoare triple {110072#false} assume !(0 == ~q_free~0); {110072#false} is VALID [2022-02-20 20:01:44,317 INFO L290 TraceCheckUtils]: 150: Hoare triple {110072#false} assume -2147483648 <= do_write_p_#t~nondet7#1 && do_write_p_#t~nondet7#1 <= 2147483647;~q_buf_0~0 := do_write_p_#t~nondet7#1;havoc do_write_p_#t~nondet7#1;~p_last_write~0 := ~q_buf_0~0;~p_num_write~0 := 1 + ~p_num_write~0;~q_free~0 := 0;~q_req_up~0 := 1; {110072#false} is VALID [2022-02-20 20:01:44,317 INFO L290 TraceCheckUtils]: 151: Hoare triple {110072#false} assume !false; {110072#false} is VALID [2022-02-20 20:01:44,318 INFO L290 TraceCheckUtils]: 152: Hoare triple {110072#false} ~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {110072#false} is VALID [2022-02-20 20:01:44,318 INFO L290 TraceCheckUtils]: 153: Hoare triple {110072#false} assume { :end_inline_do_write_p } true; {110072#false} is VALID [2022-02-20 20:01:44,318 INFO L290 TraceCheckUtils]: 154: Hoare triple {110072#false} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {110072#false} is VALID [2022-02-20 20:01:44,318 INFO L290 TraceCheckUtils]: 155: Hoare triple {110072#false} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {110072#false} is VALID [2022-02-20 20:01:44,318 INFO L290 TraceCheckUtils]: 156: Hoare triple {110072#false} assume !(0 == ~c_dr_pc~0); {110072#false} is VALID [2022-02-20 20:01:44,318 INFO L290 TraceCheckUtils]: 157: Hoare triple {110072#false} assume 2 == ~c_dr_pc~0; {110072#false} is VALID [2022-02-20 20:01:44,318 INFO L290 TraceCheckUtils]: 158: Hoare triple {110072#false} do_read_c_~a~0#1 := ~a_t~0; {110072#false} is VALID [2022-02-20 20:01:44,318 INFO L290 TraceCheckUtils]: 159: Hoare triple {110072#false} do_read_c_~a~0#1 := ~q_buf_0~0;~c_last_read~0 := do_read_c_~a~0#1;~c_num_read~0 := 1 + ~c_num_read~0;~q_free~0 := 1;~q_req_up~0 := 1; {110072#false} is VALID [2022-02-20 20:01:44,319 INFO L290 TraceCheckUtils]: 160: Hoare triple {110072#false} assume !(~p_last_write~0 == ~c_last_read~0); {110072#false} is VALID [2022-02-20 20:01:44,319 INFO L272 TraceCheckUtils]: 161: Hoare triple {110072#false} call error1(); {110072#false} is VALID [2022-02-20 20:01:44,319 INFO L290 TraceCheckUtils]: 162: Hoare triple {110072#false} assume !false; {110072#false} is VALID [2022-02-20 20:01:44,319 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-02-20 20:01:44,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 20:01:44,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030925951] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:01:44,320 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 20:01:44,320 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-02-20 20:01:44,320 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730543440] [2022-02-20 20:01:44,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:01:44,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2022-02-20 20:01:44,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:01:44,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-02-20 20:01:44,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:01:44,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:01:44,440 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:01:44,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:01:44,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-02-20 20:01:44,441 INFO L87 Difference]: Start difference. First operand 2427 states and 3103 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16)