./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.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_2.cil-1+token_ring.12.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 a46e7920fd800fb5978581c250ecd4216776e6eac1b8dfb89d2f8a9c2732a33c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:58:07,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:58:07,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:58:07,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:58:07,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:58:07,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:58:07,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:58:07,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:58:07,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:58:07,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:58:07,252 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:58:07,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:58:07,254 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:58:07,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:58:07,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:58:07,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:58:07,259 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:58:07,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:58:07,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:58:07,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:58:07,267 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:58:07,268 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:58:07,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:58:07,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:58:07,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:58:07,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:58:07,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:58:07,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:58:07,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:58:07,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:58:07,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:58:07,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:58:07,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:58:07,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:58:07,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:58:07,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:58:07,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:58:07,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:58:07,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:58:07,282 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:58:07,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:58:07,284 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:58:07,323 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:58:07,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:58:07,324 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:58:07,324 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:58:07,324 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:58:07,324 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:58:07,325 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:58:07,325 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:58:07,325 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:58:07,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:58:07,326 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:58:07,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:58:07,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:58:07,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:58:07,336 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:58:07,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:58:07,337 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:58:07,337 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:58:07,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:58:07,337 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:58:07,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:58:07,337 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:58:07,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:58:07,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:58:07,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:07,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:58:07,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:58:07,339 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:58:07,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:58:07,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:58:07,340 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:58:07,340 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:58:07,340 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:58:07,340 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 -> a46e7920fd800fb5978581c250ecd4216776e6eac1b8dfb89d2f8a9c2732a33c [2022-02-20 19:58:07,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:58:07,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:58:07,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:58:07,520 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:58:07,521 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:58:07,521 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c [2022-02-20 19:58:07,561 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9858469e8/183d7ea91f364bde95e84eddd5eba52d/FLAG61e46b3f5 [2022-02-20 19:58:07,952 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:58:07,953 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c [2022-02-20 19:58:07,972 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9858469e8/183d7ea91f364bde95e84eddd5eba52d/FLAG61e46b3f5 [2022-02-20 19:58:08,386 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9858469e8/183d7ea91f364bde95e84eddd5eba52d [2022-02-20 19:58:08,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:58:08,389 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:58:08,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:08,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:58:08,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:58:08,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e60719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08, skipping insertion in model container [2022-02-20 19:58:08,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:58:08,434 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:58:08,514 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_2.cil-1+token_ring.12.cil-2.c[914,927] [2022-02-20 19:58:08,580 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_2.cil-1+token_ring.12.cil-2.c[7115,7128] [2022-02-20 19:58:08,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:08,716 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:58:08,725 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_2.cil-1+token_ring.12.cil-2.c[914,927] [2022-02-20 19:58:08,754 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_2.cil-1+token_ring.12.cil-2.c[7115,7128] [2022-02-20 19:58:08,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:08,821 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:58:08,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08 WrapperNode [2022-02-20 19:58:08,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:08,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:08,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:58:08,823 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:58:08,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,849 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,901 INFO L137 Inliner]: procedures = 77, calls = 93, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 1040 [2022-02-20 19:58:08,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:08,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:58:08,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:58:08,903 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:58:08,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:58:08,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:58:08,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:58:08,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:58:08,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (1/1) ... [2022-02-20 19:58:08,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:08,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:08,989 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 19:58:08,994 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 19:58:09,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:58:09,025 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:58:09,025 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:58:09,025 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:58:09,026 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:58:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:58:09,026 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:58:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:58:09,026 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:58:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:58:09,026 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:58:09,027 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:58:09,027 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:58:09,027 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:58:09,027 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:58:09,027 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:58:09,027 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:58:09,027 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:58:09,028 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:58:09,028 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:58:09,028 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:58:09,028 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:58:09,028 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:58:09,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:58:09,029 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:58:09,029 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:58:09,029 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:58:09,029 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:58:09,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:58:09,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:58:09,030 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:58:09,030 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:58:09,126 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:58:09,127 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:58:09,875 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:58:09,889 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:58:09,889 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2022-02-20 19:58:09,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:09 BoogieIcfgContainer [2022-02-20 19:58:09,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:58:09,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:58:09,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:58:09,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:58:09,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:58:08" (1/3) ... [2022-02-20 19:58:09,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c81635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:09, skipping insertion in model container [2022-02-20 19:58:09,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:08" (2/3) ... [2022-02-20 19:58:09,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c81635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:09, skipping insertion in model container [2022-02-20 19:58:09,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:09" (3/3) ... [2022-02-20 19:58:09,896 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.12.cil-2.c [2022-02-20 19:58:09,902 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:58:09,902 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:58:09,931 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:58:09,935 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 19:58:09,935 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:58:09,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 483 states, 426 states have (on average 1.6408450704225352) internal successors, (699), 432 states have internal predecessors, (699), 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 19:58:09,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:09,977 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:09,977 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 19:58:09,978 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:09,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:09,981 INFO L85 PathProgramCache]: Analyzing trace with hash -353968614, now seen corresponding path program 1 times [2022-02-20 19:58:09,986 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:09,999 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045869344] [2022-02-20 19:58:09,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:10,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {526#(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); {527#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:10,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {527#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:10,196 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {527#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {488#(= ~q_read_ev~0 2)} #1884#return; {488#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:10,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {528#(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; {529#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:10,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {529#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {529#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:10,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {529#(= |old(~q_read_ev~0)| 0)} assume true; {529#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:10,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {529#(= |old(~q_read_ev~0)| 0)} {488#(= ~q_read_ev~0 2)} #1886#return; {487#false} is VALID [2022-02-20 19:58:10,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {486#true} havoc ~__retres1~0; {486#true} is VALID [2022-02-20 19:58:10,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {486#true} assume 1 == ~p_dw_pc~0; {486#true} is VALID [2022-02-20 19:58:10,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {486#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {486#true} is VALID [2022-02-20 19:58:10,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {486#true} #res := ~__retres1~0; {486#true} is VALID [2022-02-20 19:58:10,239 INFO L290 TraceCheckUtils]: 4: Hoare triple {486#true} assume true; {486#true} is VALID [2022-02-20 19:58:10,239 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {486#true} {486#true} #1880#return; {486#true} is VALID [2022-02-20 19:58:10,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {486#true} havoc ~__retres1~1; {486#true} is VALID [2022-02-20 19:58:10,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {486#true} assume 1 == ~c_dr_pc~0; {486#true} is VALID [2022-02-20 19:58:10,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {486#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {486#true} is VALID [2022-02-20 19:58:10,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {486#true} #res := ~__retres1~1; {486#true} is VALID [2022-02-20 19:58:10,243 INFO L290 TraceCheckUtils]: 4: Hoare triple {486#true} assume true; {486#true} is VALID [2022-02-20 19:58:10,243 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {486#true} {486#true} #1882#return; {486#true} is VALID [2022-02-20 19:58:10,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {530#(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; {486#true} is VALID [2022-02-20 19:58:10,244 INFO L272 TraceCheckUtils]: 1: Hoare triple {486#true} call #t~ret8 := is_do_write_p_triggered(); {486#true} is VALID [2022-02-20 19:58:10,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {486#true} havoc ~__retres1~0; {486#true} is VALID [2022-02-20 19:58:10,244 INFO L290 TraceCheckUtils]: 3: Hoare triple {486#true} assume 1 == ~p_dw_pc~0; {486#true} is VALID [2022-02-20 19:58:10,244 INFO L290 TraceCheckUtils]: 4: Hoare triple {486#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {486#true} is VALID [2022-02-20 19:58:10,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {486#true} #res := ~__retres1~0; {486#true} is VALID [2022-02-20 19:58:10,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {486#true} assume true; {486#true} is VALID [2022-02-20 19:58:10,245 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {486#true} {486#true} #1880#return; {486#true} is VALID [2022-02-20 19:58:10,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {486#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {486#true} is VALID [2022-02-20 19:58:10,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {486#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {486#true} is VALID [2022-02-20 19:58:10,245 INFO L272 TraceCheckUtils]: 10: Hoare triple {486#true} call #t~ret9 := is_do_read_c_triggered(); {486#true} is VALID [2022-02-20 19:58:10,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {486#true} havoc ~__retres1~1; {486#true} is VALID [2022-02-20 19:58:10,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {486#true} assume 1 == ~c_dr_pc~0; {486#true} is VALID [2022-02-20 19:58:10,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {486#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {486#true} is VALID [2022-02-20 19:58:10,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {486#true} #res := ~__retres1~1; {486#true} is VALID [2022-02-20 19:58:10,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {486#true} assume true; {486#true} is VALID [2022-02-20 19:58:10,246 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {486#true} {486#true} #1882#return; {486#true} is VALID [2022-02-20 19:58:10,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {486#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {486#true} is VALID [2022-02-20 19:58:10,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {486#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {486#true} is VALID [2022-02-20 19:58:10,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {486#true} assume true; {486#true} is VALID [2022-02-20 19:58:10,247 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {486#true} {487#false} #1888#return; {487#false} is VALID [2022-02-20 19:58:10,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {528#(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; {486#true} is VALID [2022-02-20 19:58:10,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {486#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {486#true} is VALID [2022-02-20 19:58:10,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {486#true} assume true; {486#true} is VALID [2022-02-20 19:58:10,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {486#true} {487#false} #1890#return; {487#false} is VALID [2022-02-20 19:58:10,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {486#true} havoc ~__retres1~2; {486#true} is VALID [2022-02-20 19:58:10,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {486#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {486#true} is VALID [2022-02-20 19:58:10,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {486#true} #res := ~__retres1~2; {486#true} is VALID [2022-02-20 19:58:10,257 INFO L290 TraceCheckUtils]: 3: Hoare triple {486#true} assume true; {486#true} is VALID [2022-02-20 19:58:10,257 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {486#true} {487#false} #1892#return; {487#false} is VALID [2022-02-20 19:58:10,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {486#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~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;~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;~t11_pc~0 := 0;~t12_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;~t11_st~0 := 0;~t12_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;~t11_i~0 := 0;~t12_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;~T11_E~0 := 2;~T12_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;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {486#true} is VALID [2022-02-20 19:58:10,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {486#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {486#true} is VALID [2022-02-20 19:58:10,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {486#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#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;~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; {488#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:10,259 INFO L290 TraceCheckUtils]: 3: Hoare triple {488#(= ~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_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {488#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:10,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {488#(= ~q_read_ev~0 2)} call update_channels1(); {526#(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 19:58:10,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#(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); {527#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:10,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {527#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {527#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:10,261 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {527#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {488#(= ~q_read_ev~0 2)} #1884#return; {488#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:10,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {488#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {488#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:10,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {488#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {488#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:10,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {488#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {488#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:10,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {488#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {488#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:10,263 INFO L272 TraceCheckUtils]: 12: Hoare triple {488#(= ~q_read_ev~0 2)} call fire_delta_events1(); {528#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:10,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {528#(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; {529#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:10,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {529#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {529#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:10,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {529#(= |old(~q_read_ev~0)| 0)} assume true; {529#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:10,265 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {529#(= |old(~q_read_ev~0)| 0)} {488#(= ~q_read_ev~0 2)} #1886#return; {487#false} is VALID [2022-02-20 19:58:10,265 INFO L272 TraceCheckUtils]: 17: Hoare triple {487#false} call activate_threads1(); {530#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:10,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {530#(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; {486#true} is VALID [2022-02-20 19:58:10,266 INFO L272 TraceCheckUtils]: 19: Hoare triple {486#true} call #t~ret8 := is_do_write_p_triggered(); {486#true} is VALID [2022-02-20 19:58:10,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {486#true} havoc ~__retres1~0; {486#true} is VALID [2022-02-20 19:58:10,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {486#true} assume 1 == ~p_dw_pc~0; {486#true} is VALID [2022-02-20 19:58:10,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {486#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {486#true} is VALID [2022-02-20 19:58:10,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {486#true} #res := ~__retres1~0; {486#true} is VALID [2022-02-20 19:58:10,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {486#true} assume true; {486#true} is VALID [2022-02-20 19:58:10,267 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {486#true} {486#true} #1880#return; {486#true} is VALID [2022-02-20 19:58:10,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {486#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {486#true} is VALID [2022-02-20 19:58:10,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {486#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {486#true} is VALID [2022-02-20 19:58:10,267 INFO L272 TraceCheckUtils]: 28: Hoare triple {486#true} call #t~ret9 := is_do_read_c_triggered(); {486#true} is VALID [2022-02-20 19:58:10,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {486#true} havoc ~__retres1~1; {486#true} is VALID [2022-02-20 19:58:10,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {486#true} assume 1 == ~c_dr_pc~0; {486#true} is VALID [2022-02-20 19:58:10,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {486#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {486#true} is VALID [2022-02-20 19:58:10,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {486#true} #res := ~__retres1~1; {486#true} is VALID [2022-02-20 19:58:10,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {486#true} assume true; {486#true} is VALID [2022-02-20 19:58:10,268 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {486#true} {486#true} #1882#return; {486#true} is VALID [2022-02-20 19:58:10,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {486#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {486#true} is VALID [2022-02-20 19:58:10,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {486#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {486#true} is VALID [2022-02-20 19:58:10,269 INFO L290 TraceCheckUtils]: 37: Hoare triple {486#true} assume true; {486#true} is VALID [2022-02-20 19:58:10,269 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {486#true} {487#false} #1888#return; {487#false} is VALID [2022-02-20 19:58:10,269 INFO L272 TraceCheckUtils]: 39: Hoare triple {487#false} call reset_delta_events1(); {528#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:10,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {528#(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; {486#true} is VALID [2022-02-20 19:58:10,269 INFO L290 TraceCheckUtils]: 41: Hoare triple {486#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {486#true} is VALID [2022-02-20 19:58:10,270 INFO L290 TraceCheckUtils]: 42: Hoare triple {486#true} assume true; {486#true} is VALID [2022-02-20 19:58:10,270 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {486#true} {487#false} #1890#return; {487#false} is VALID [2022-02-20 19:58:10,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {487#false} assume !false; {487#false} is VALID [2022-02-20 19:58:10,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {487#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; {487#false} is VALID [2022-02-20 19:58:10,270 INFO L290 TraceCheckUtils]: 46: Hoare triple {487#false} assume !false; {487#false} is VALID [2022-02-20 19:58:10,271 INFO L272 TraceCheckUtils]: 47: Hoare triple {487#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {486#true} is VALID [2022-02-20 19:58:10,271 INFO L290 TraceCheckUtils]: 48: Hoare triple {486#true} havoc ~__retres1~2; {486#true} is VALID [2022-02-20 19:58:10,271 INFO L290 TraceCheckUtils]: 49: Hoare triple {486#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {486#true} is VALID [2022-02-20 19:58:10,271 INFO L290 TraceCheckUtils]: 50: Hoare triple {486#true} #res := ~__retres1~2; {486#true} is VALID [2022-02-20 19:58:10,271 INFO L290 TraceCheckUtils]: 51: Hoare triple {486#true} assume true; {486#true} is VALID [2022-02-20 19:58:10,271 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {486#true} {487#false} #1892#return; {487#false} is VALID [2022-02-20 19:58:10,272 INFO L290 TraceCheckUtils]: 53: Hoare triple {487#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; {487#false} is VALID [2022-02-20 19:58:10,272 INFO L290 TraceCheckUtils]: 54: Hoare triple {487#false} assume 0 != eval1_~tmp___1~0#1; {487#false} is VALID [2022-02-20 19:58:10,272 INFO L290 TraceCheckUtils]: 55: Hoare triple {487#false} assume !(0 == ~p_dw_st~0); {487#false} is VALID [2022-02-20 19:58:10,272 INFO L290 TraceCheckUtils]: 56: Hoare triple {487#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; {487#false} is VALID [2022-02-20 19:58:10,272 INFO L290 TraceCheckUtils]: 57: Hoare triple {487#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; {487#false} is VALID [2022-02-20 19:58:10,272 INFO L290 TraceCheckUtils]: 58: Hoare triple {487#false} assume !(0 == ~c_dr_pc~0); {487#false} is VALID [2022-02-20 19:58:10,273 INFO L290 TraceCheckUtils]: 59: Hoare triple {487#false} assume 1 == ~c_dr_pc~0; {487#false} is VALID [2022-02-20 19:58:10,273 INFO L290 TraceCheckUtils]: 60: Hoare triple {487#false} do_read_c_~a~0#1 := ~a_t~0; {487#false} is VALID [2022-02-20 19:58:10,273 INFO L290 TraceCheckUtils]: 61: Hoare triple {487#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; {487#false} is VALID [2022-02-20 19:58:10,273 INFO L290 TraceCheckUtils]: 62: Hoare triple {487#false} assume !(~p_last_write~0 == ~c_last_read~0); {487#false} is VALID [2022-02-20 19:58:10,273 INFO L272 TraceCheckUtils]: 63: Hoare triple {487#false} call error1(); {487#false} is VALID [2022-02-20 19:58:10,273 INFO L290 TraceCheckUtils]: 64: Hoare triple {487#false} assume !false; {487#false} is VALID [2022-02-20 19:58:10,274 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 19:58:10,274 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:10,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045869344] [2022-02-20 19:58:10,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045869344] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:10,275 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:10,275 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:10,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765850414] [2022-02-20 19:58:10,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:10,280 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 19:58:10,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:10,283 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 19:58:10,330 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 19:58:10,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:10,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:10,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:10,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:10,346 INFO L87 Difference]: Start difference. First operand has 483 states, 426 states have (on average 1.6408450704225352) internal successors, (699), 432 states have internal predecessors, (699), 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 19:58:13,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:13,762 INFO L93 Difference]: Finished difference Result 1073 states and 1716 transitions. [2022-02-20 19:58:13,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:58:13,762 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 19:58:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:13,763 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 19:58:13,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1716 transitions. [2022-02-20 19:58:13,788 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 19:58:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1716 transitions. [2022-02-20 19:58:13,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1716 transitions. [2022-02-20 19:58:14,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1716 edges. 1716 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:14,960 INFO L225 Difference]: With dead ends: 1073 [2022-02-20 19:58:14,960 INFO L226 Difference]: Without dead ends: 608 [2022-02-20 19:58:14,964 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 19:58:14,966 INFO L933 BasicCegarLoop]: 740 mSDtfsCounter, 853 mSDsluCounter, 2045 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 2785 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:14,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [858 Valid, 2785 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:58:14,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-02-20 19:58:15,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 569. [2022-02-20 19:58:15,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:15,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 608 states. Second operand has 569 states, 494 states have (on average 1.5263157894736843) internal successors, (754), 500 states have internal predecessors, (754), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:58:15,016 INFO L74 IsIncluded]: Start isIncluded. First operand 608 states. Second operand has 569 states, 494 states have (on average 1.5263157894736843) internal successors, (754), 500 states have internal predecessors, (754), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:58:15,018 INFO L87 Difference]: Start difference. First operand 608 states. Second operand has 569 states, 494 states have (on average 1.5263157894736843) internal successors, (754), 500 states have internal predecessors, (754), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:58:15,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:15,039 INFO L93 Difference]: Finished difference Result 608 states and 913 transitions. [2022-02-20 19:58:15,040 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 913 transitions. [2022-02-20 19:58:15,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:15,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:15,045 INFO L74 IsIncluded]: Start isIncluded. First operand has 569 states, 494 states have (on average 1.5263157894736843) internal successors, (754), 500 states have internal predecessors, (754), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) Second operand 608 states. [2022-02-20 19:58:15,046 INFO L87 Difference]: Start difference. First operand has 569 states, 494 states have (on average 1.5263157894736843) internal successors, (754), 500 states have internal predecessors, (754), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) Second operand 608 states. [2022-02-20 19:58:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:15,066 INFO L93 Difference]: Finished difference Result 608 states and 913 transitions. [2022-02-20 19:58:15,066 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 913 transitions. [2022-02-20 19:58:15,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:15,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:15,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:15,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:15,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 494 states have (on average 1.5263157894736843) internal successors, (754), 500 states have internal predecessors, (754), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:58:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 859 transitions. [2022-02-20 19:58:15,090 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 859 transitions. Word has length 65 [2022-02-20 19:58:15,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:15,091 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 859 transitions. [2022-02-20 19:58:15,091 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 19:58:15,091 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 859 transitions. [2022-02-20 19:58:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:15,093 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:15,093 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 19:58:15,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:58:15,093 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:15,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:15,094 INFO L85 PathProgramCache]: Analyzing trace with hash 49817337, now seen corresponding path program 1 times [2022-02-20 19:58:15,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:15,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438370421] [2022-02-20 19:58:15,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:15,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {3980#(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); {3981#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:15,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {3981#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3981#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:15,153 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3981#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3942#(= ~q_write_ev~0 ~q_read_ev~0)} #1884#return; {3942#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:15,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {3981#(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); {3982#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:15,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {3982#(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; {3983#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:15,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {3983#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3983#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:15,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3983#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3942#(= ~q_write_ev~0 ~q_read_ev~0)} #1886#return; {3941#false} is VALID [2022-02-20 19:58:15,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {3940#true} havoc ~__retres1~0; {3940#true} is VALID [2022-02-20 19:58:15,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {3940#true} assume !(1 == ~p_dw_pc~0); {3940#true} is VALID [2022-02-20 19:58:15,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {3940#true} ~__retres1~0 := 0; {3940#true} is VALID [2022-02-20 19:58:15,187 INFO L290 TraceCheckUtils]: 3: Hoare triple {3940#true} #res := ~__retres1~0; {3940#true} is VALID [2022-02-20 19:58:15,188 INFO L290 TraceCheckUtils]: 4: Hoare triple {3940#true} assume true; {3940#true} is VALID [2022-02-20 19:58:15,188 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3940#true} {3940#true} #1880#return; {3940#true} is VALID [2022-02-20 19:58:15,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {3940#true} havoc ~__retres1~1; {3940#true} is VALID [2022-02-20 19:58:15,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {3940#true} assume 1 == ~c_dr_pc~0; {3940#true} is VALID [2022-02-20 19:58:15,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {3940#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3940#true} is VALID [2022-02-20 19:58:15,204 INFO L290 TraceCheckUtils]: 3: Hoare triple {3940#true} #res := ~__retres1~1; {3940#true} is VALID [2022-02-20 19:58:15,204 INFO L290 TraceCheckUtils]: 4: Hoare triple {3940#true} assume true; {3940#true} is VALID [2022-02-20 19:58:15,204 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3940#true} {3940#true} #1882#return; {3940#true} is VALID [2022-02-20 19:58:15,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {3984#(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; {3940#true} is VALID [2022-02-20 19:58:15,205 INFO L272 TraceCheckUtils]: 1: Hoare triple {3940#true} call #t~ret8 := is_do_write_p_triggered(); {3940#true} is VALID [2022-02-20 19:58:15,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {3940#true} havoc ~__retres1~0; {3940#true} is VALID [2022-02-20 19:58:15,205 INFO L290 TraceCheckUtils]: 3: Hoare triple {3940#true} assume !(1 == ~p_dw_pc~0); {3940#true} is VALID [2022-02-20 19:58:15,205 INFO L290 TraceCheckUtils]: 4: Hoare triple {3940#true} ~__retres1~0 := 0; {3940#true} is VALID [2022-02-20 19:58:15,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {3940#true} #res := ~__retres1~0; {3940#true} is VALID [2022-02-20 19:58:15,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {3940#true} assume true; {3940#true} is VALID [2022-02-20 19:58:15,206 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3940#true} {3940#true} #1880#return; {3940#true} is VALID [2022-02-20 19:58:15,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {3940#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3940#true} is VALID [2022-02-20 19:58:15,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {3940#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3940#true} is VALID [2022-02-20 19:58:15,206 INFO L272 TraceCheckUtils]: 10: Hoare triple {3940#true} call #t~ret9 := is_do_read_c_triggered(); {3940#true} is VALID [2022-02-20 19:58:15,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {3940#true} havoc ~__retres1~1; {3940#true} is VALID [2022-02-20 19:58:15,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {3940#true} assume 1 == ~c_dr_pc~0; {3940#true} is VALID [2022-02-20 19:58:15,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {3940#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3940#true} is VALID [2022-02-20 19:58:15,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {3940#true} #res := ~__retres1~1; {3940#true} is VALID [2022-02-20 19:58:15,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {3940#true} assume true; {3940#true} is VALID [2022-02-20 19:58:15,207 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3940#true} {3940#true} #1882#return; {3940#true} is VALID [2022-02-20 19:58:15,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {3940#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3940#true} is VALID [2022-02-20 19:58:15,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {3940#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3940#true} is VALID [2022-02-20 19:58:15,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {3940#true} assume true; {3940#true} is VALID [2022-02-20 19:58:15,208 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3940#true} {3941#false} #1888#return; {3941#false} is VALID [2022-02-20 19:58:15,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {3981#(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); {3940#true} is VALID [2022-02-20 19:58:15,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {3940#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3940#true} is VALID [2022-02-20 19:58:15,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {3940#true} assume true; {3940#true} is VALID [2022-02-20 19:58:15,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3940#true} {3941#false} #1890#return; {3941#false} is VALID [2022-02-20 19:58:15,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:15,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {3940#true} havoc ~__retres1~2; {3940#true} is VALID [2022-02-20 19:58:15,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {3940#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3940#true} is VALID [2022-02-20 19:58:15,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {3940#true} #res := ~__retres1~2; {3940#true} is VALID [2022-02-20 19:58:15,219 INFO L290 TraceCheckUtils]: 3: Hoare triple {3940#true} assume true; {3940#true} is VALID [2022-02-20 19:58:15,219 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3940#true} {3941#false} #1892#return; {3941#false} is VALID [2022-02-20 19:58:15,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {3940#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~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;~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;~t11_pc~0 := 0;~t12_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;~t11_st~0 := 0;~t12_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;~t11_i~0 := 0;~t12_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;~T11_E~0 := 2;~T12_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;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {3940#true} is VALID [2022-02-20 19:58:15,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {3940#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {3940#true} is VALID [2022-02-20 19:58:15,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {3940#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#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;~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; {3942#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:15,220 INFO L290 TraceCheckUtils]: 3: Hoare triple {3942#(= ~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_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {3942#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:15,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {3942#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {3980#(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 19:58:15,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {3980#(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); {3981#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:15,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {3981#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3981#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:15,222 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3981#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3942#(= ~q_write_ev~0 ~q_read_ev~0)} #1884#return; {3942#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:15,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {3942#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {3942#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:15,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {3942#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3942#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:15,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {3942#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3942#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:15,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {3942#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {3942#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:15,224 INFO L272 TraceCheckUtils]: 12: Hoare triple {3942#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {3981#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:15,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {3981#(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); {3982#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:15,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {3982#(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; {3983#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:15,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {3983#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3983#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:15,225 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3983#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3942#(= ~q_write_ev~0 ~q_read_ev~0)} #1886#return; {3941#false} is VALID [2022-02-20 19:58:15,225 INFO L272 TraceCheckUtils]: 17: Hoare triple {3941#false} call activate_threads1(); {3984#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:15,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {3984#(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; {3940#true} is VALID [2022-02-20 19:58:15,226 INFO L272 TraceCheckUtils]: 19: Hoare triple {3940#true} call #t~ret8 := is_do_write_p_triggered(); {3940#true} is VALID [2022-02-20 19:58:15,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {3940#true} havoc ~__retres1~0; {3940#true} is VALID [2022-02-20 19:58:15,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {3940#true} assume !(1 == ~p_dw_pc~0); {3940#true} is VALID [2022-02-20 19:58:15,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {3940#true} ~__retres1~0 := 0; {3940#true} is VALID [2022-02-20 19:58:15,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {3940#true} #res := ~__retres1~0; {3940#true} is VALID [2022-02-20 19:58:15,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {3940#true} assume true; {3940#true} is VALID [2022-02-20 19:58:15,227 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3940#true} {3940#true} #1880#return; {3940#true} is VALID [2022-02-20 19:58:15,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {3940#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3940#true} is VALID [2022-02-20 19:58:15,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {3940#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3940#true} is VALID [2022-02-20 19:58:15,227 INFO L272 TraceCheckUtils]: 28: Hoare triple {3940#true} call #t~ret9 := is_do_read_c_triggered(); {3940#true} is VALID [2022-02-20 19:58:15,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {3940#true} havoc ~__retres1~1; {3940#true} is VALID [2022-02-20 19:58:15,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {3940#true} assume 1 == ~c_dr_pc~0; {3940#true} is VALID [2022-02-20 19:58:15,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {3940#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3940#true} is VALID [2022-02-20 19:58:15,228 INFO L290 TraceCheckUtils]: 32: Hoare triple {3940#true} #res := ~__retres1~1; {3940#true} is VALID [2022-02-20 19:58:15,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {3940#true} assume true; {3940#true} is VALID [2022-02-20 19:58:15,228 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3940#true} {3940#true} #1882#return; {3940#true} is VALID [2022-02-20 19:58:15,228 INFO L290 TraceCheckUtils]: 35: Hoare triple {3940#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3940#true} is VALID [2022-02-20 19:58:15,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {3940#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3940#true} is VALID [2022-02-20 19:58:15,228 INFO L290 TraceCheckUtils]: 37: Hoare triple {3940#true} assume true; {3940#true} is VALID [2022-02-20 19:58:15,229 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3940#true} {3941#false} #1888#return; {3941#false} is VALID [2022-02-20 19:58:15,229 INFO L272 TraceCheckUtils]: 39: Hoare triple {3941#false} call reset_delta_events1(); {3981#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:15,229 INFO L290 TraceCheckUtils]: 40: Hoare triple {3981#(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); {3940#true} is VALID [2022-02-20 19:58:15,229 INFO L290 TraceCheckUtils]: 41: Hoare triple {3940#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3940#true} is VALID [2022-02-20 19:58:15,229 INFO L290 TraceCheckUtils]: 42: Hoare triple {3940#true} assume true; {3940#true} is VALID [2022-02-20 19:58:15,229 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3940#true} {3941#false} #1890#return; {3941#false} is VALID [2022-02-20 19:58:15,229 INFO L290 TraceCheckUtils]: 44: Hoare triple {3941#false} assume !false; {3941#false} is VALID [2022-02-20 19:58:15,230 INFO L290 TraceCheckUtils]: 45: Hoare triple {3941#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; {3941#false} is VALID [2022-02-20 19:58:15,230 INFO L290 TraceCheckUtils]: 46: Hoare triple {3941#false} assume !false; {3941#false} is VALID [2022-02-20 19:58:15,230 INFO L272 TraceCheckUtils]: 47: Hoare triple {3941#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3940#true} is VALID [2022-02-20 19:58:15,230 INFO L290 TraceCheckUtils]: 48: Hoare triple {3940#true} havoc ~__retres1~2; {3940#true} is VALID [2022-02-20 19:58:15,230 INFO L290 TraceCheckUtils]: 49: Hoare triple {3940#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3940#true} is VALID [2022-02-20 19:58:15,230 INFO L290 TraceCheckUtils]: 50: Hoare triple {3940#true} #res := ~__retres1~2; {3940#true} is VALID [2022-02-20 19:58:15,231 INFO L290 TraceCheckUtils]: 51: Hoare triple {3940#true} assume true; {3940#true} is VALID [2022-02-20 19:58:15,231 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3940#true} {3941#false} #1892#return; {3941#false} is VALID [2022-02-20 19:58:15,231 INFO L290 TraceCheckUtils]: 53: Hoare triple {3941#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; {3941#false} is VALID [2022-02-20 19:58:15,231 INFO L290 TraceCheckUtils]: 54: Hoare triple {3941#false} assume 0 != eval1_~tmp___1~0#1; {3941#false} is VALID [2022-02-20 19:58:15,231 INFO L290 TraceCheckUtils]: 55: Hoare triple {3941#false} assume !(0 == ~p_dw_st~0); {3941#false} is VALID [2022-02-20 19:58:15,231 INFO L290 TraceCheckUtils]: 56: Hoare triple {3941#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; {3941#false} is VALID [2022-02-20 19:58:15,231 INFO L290 TraceCheckUtils]: 57: Hoare triple {3941#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; {3941#false} is VALID [2022-02-20 19:58:15,232 INFO L290 TraceCheckUtils]: 58: Hoare triple {3941#false} assume !(0 == ~c_dr_pc~0); {3941#false} is VALID [2022-02-20 19:58:15,232 INFO L290 TraceCheckUtils]: 59: Hoare triple {3941#false} assume 1 == ~c_dr_pc~0; {3941#false} is VALID [2022-02-20 19:58:15,232 INFO L290 TraceCheckUtils]: 60: Hoare triple {3941#false} do_read_c_~a~0#1 := ~a_t~0; {3941#false} is VALID [2022-02-20 19:58:15,232 INFO L290 TraceCheckUtils]: 61: Hoare triple {3941#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; {3941#false} is VALID [2022-02-20 19:58:15,232 INFO L290 TraceCheckUtils]: 62: Hoare triple {3941#false} assume !(~p_last_write~0 == ~c_last_read~0); {3941#false} is VALID [2022-02-20 19:58:15,232 INFO L272 TraceCheckUtils]: 63: Hoare triple {3941#false} call error1(); {3941#false} is VALID [2022-02-20 19:58:15,233 INFO L290 TraceCheckUtils]: 64: Hoare triple {3941#false} assume !false; {3941#false} is VALID [2022-02-20 19:58:15,233 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 19:58:15,233 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:15,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438370421] [2022-02-20 19:58:15,233 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438370421] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:15,233 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:15,234 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:15,234 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793355505] [2022-02-20 19:58:15,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:15,235 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 19:58:15,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:15,235 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 19:58:15,269 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 19:58:15,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:15,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:15,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:15,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:15,270 INFO L87 Difference]: Start difference. First operand 569 states and 859 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 19:58:18,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:18,740 INFO L93 Difference]: Finished difference Result 916 states and 1336 transitions. [2022-02-20 19:58:18,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:18,742 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 19:58:18,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:18,742 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 19:58:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1065 transitions. [2022-02-20 19:58:18,752 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 19:58:18,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1065 transitions. [2022-02-20 19:58:18,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1065 transitions. [2022-02-20 19:58:19,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1065 edges. 1065 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:19,549 INFO L225 Difference]: With dead ends: 916 [2022-02-20 19:58:19,549 INFO L226 Difference]: Without dead ends: 739 [2022-02-20 19:58:19,552 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 19:58:19,554 INFO L933 BasicCegarLoop]: 772 mSDtfsCounter, 1840 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1872 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:19,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1872 Valid, 2314 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:58:19,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-02-20 19:58:19,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 665. [2022-02-20 19:58:19,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:19,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 739 states. Second operand has 665 states, 570 states have (on average 1.5052631578947369) internal successors, (858), 578 states have internal predecessors, (858), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:58:19,599 INFO L74 IsIncluded]: Start isIncluded. First operand 739 states. Second operand has 665 states, 570 states have (on average 1.5052631578947369) internal successors, (858), 578 states have internal predecessors, (858), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:58:19,601 INFO L87 Difference]: Start difference. First operand 739 states. Second operand has 665 states, 570 states have (on average 1.5052631578947369) internal successors, (858), 578 states have internal predecessors, (858), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:58:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:19,623 INFO L93 Difference]: Finished difference Result 739 states and 1096 transitions. [2022-02-20 19:58:19,623 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1096 transitions. [2022-02-20 19:58:19,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:19,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:19,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 665 states, 570 states have (on average 1.5052631578947369) internal successors, (858), 578 states have internal predecessors, (858), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) Second operand 739 states. [2022-02-20 19:58:19,628 INFO L87 Difference]: Start difference. First operand has 665 states, 570 states have (on average 1.5052631578947369) internal successors, (858), 578 states have internal predecessors, (858), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) Second operand 739 states. [2022-02-20 19:58:19,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:19,650 INFO L93 Difference]: Finished difference Result 739 states and 1096 transitions. [2022-02-20 19:58:19,650 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1096 transitions. [2022-02-20 19:58:19,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:19,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:19,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:19,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:19,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 570 states have (on average 1.5052631578947369) internal successors, (858), 578 states have internal predecessors, (858), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:58:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 993 transitions. [2022-02-20 19:58:19,675 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 993 transitions. Word has length 65 [2022-02-20 19:58:19,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:19,676 INFO L470 AbstractCegarLoop]: Abstraction has 665 states and 993 transitions. [2022-02-20 19:58:19,676 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 19:58:19,676 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 993 transitions. [2022-02-20 19:58:19,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:19,679 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:19,679 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 19:58:19,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:58:19,679 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:19,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:19,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1978768773, now seen corresponding path program 1 times [2022-02-20 19:58:19,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:19,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227475865] [2022-02-20 19:58:19,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:19,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {7636#(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); {7597#true} is VALID [2022-02-20 19:58:19,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {7597#true} assume true; {7597#true} is VALID [2022-02-20 19:58:19,765 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7597#true} {7597#true} #1884#return; {7597#true} is VALID [2022-02-20 19:58:19,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {7637#(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); {7597#true} is VALID [2022-02-20 19:58:19,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {7597#true} assume !(0 == ~q_write_ev~0); {7597#true} is VALID [2022-02-20 19:58:19,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {7597#true} assume true; {7597#true} is VALID [2022-02-20 19:58:19,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7597#true} {7597#true} #1886#return; {7597#true} is VALID [2022-02-20 19:58:19,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {7597#true} havoc ~__retres1~0; {7597#true} is VALID [2022-02-20 19:58:19,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {7597#true} assume !(1 == ~p_dw_pc~0); {7597#true} is VALID [2022-02-20 19:58:19,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {7597#true} ~__retres1~0 := 0; {7653#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:19,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {7653#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:19,864 INFO L290 TraceCheckUtils]: 4: Hoare triple {7654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:19,864 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7597#true} #1880#return; {7645#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:19,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {7597#true} havoc ~__retres1~1; {7597#true} is VALID [2022-02-20 19:58:19,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {7597#true} assume 1 == ~c_dr_pc~0; {7597#true} is VALID [2022-02-20 19:58:19,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {7597#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7597#true} is VALID [2022-02-20 19:58:19,868 INFO L290 TraceCheckUtils]: 3: Hoare triple {7597#true} #res := ~__retres1~1; {7597#true} is VALID [2022-02-20 19:58:19,868 INFO L290 TraceCheckUtils]: 4: Hoare triple {7597#true} assume true; {7597#true} is VALID [2022-02-20 19:58:19,868 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7597#true} {7598#false} #1882#return; {7598#false} is VALID [2022-02-20 19:58:19,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {7638#(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; {7597#true} is VALID [2022-02-20 19:58:19,869 INFO L272 TraceCheckUtils]: 1: Hoare triple {7597#true} call #t~ret8 := is_do_write_p_triggered(); {7597#true} is VALID [2022-02-20 19:58:19,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {7597#true} havoc ~__retres1~0; {7597#true} is VALID [2022-02-20 19:58:19,869 INFO L290 TraceCheckUtils]: 3: Hoare triple {7597#true} assume !(1 == ~p_dw_pc~0); {7597#true} is VALID [2022-02-20 19:58:19,869 INFO L290 TraceCheckUtils]: 4: Hoare triple {7597#true} ~__retres1~0 := 0; {7653#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:19,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {7653#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:19,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {7654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:19,871 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7597#true} #1880#return; {7645#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:19,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {7645#(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; {7646#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:19,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {7646#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7598#false} is VALID [2022-02-20 19:58:19,872 INFO L272 TraceCheckUtils]: 10: Hoare triple {7598#false} call #t~ret9 := is_do_read_c_triggered(); {7597#true} is VALID [2022-02-20 19:58:19,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {7597#true} havoc ~__retres1~1; {7597#true} is VALID [2022-02-20 19:58:19,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {7597#true} assume 1 == ~c_dr_pc~0; {7597#true} is VALID [2022-02-20 19:58:19,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {7597#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7597#true} is VALID [2022-02-20 19:58:19,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {7597#true} #res := ~__retres1~1; {7597#true} is VALID [2022-02-20 19:58:19,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {7597#true} assume true; {7597#true} is VALID [2022-02-20 19:58:19,873 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7597#true} {7598#false} #1882#return; {7598#false} is VALID [2022-02-20 19:58:19,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {7598#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7598#false} is VALID [2022-02-20 19:58:19,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {7598#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7598#false} is VALID [2022-02-20 19:58:19,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {7598#false} assume true; {7598#false} is VALID [2022-02-20 19:58:19,873 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7598#false} {7597#true} #1888#return; {7598#false} is VALID [2022-02-20 19:58:19,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {7637#(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); {7597#true} is VALID [2022-02-20 19:58:19,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {7597#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7597#true} is VALID [2022-02-20 19:58:19,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {7597#true} assume true; {7597#true} is VALID [2022-02-20 19:58:19,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7597#true} {7598#false} #1890#return; {7598#false} is VALID [2022-02-20 19:58:19,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {7597#true} havoc ~__retres1~2; {7597#true} is VALID [2022-02-20 19:58:19,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {7597#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7597#true} is VALID [2022-02-20 19:58:19,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {7597#true} #res := ~__retres1~2; {7597#true} is VALID [2022-02-20 19:58:19,881 INFO L290 TraceCheckUtils]: 3: Hoare triple {7597#true} assume true; {7597#true} is VALID [2022-02-20 19:58:19,881 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7597#true} {7598#false} #1892#return; {7598#false} is VALID [2022-02-20 19:58:19,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {7597#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~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;~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;~t11_pc~0 := 0;~t12_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;~t11_st~0 := 0;~t12_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;~t11_i~0 := 0;~t12_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;~T11_E~0 := 2;~T12_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;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {7597#true} is VALID [2022-02-20 19:58:19,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {7597#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {7597#true} is VALID [2022-02-20 19:58:19,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {7597#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#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;~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; {7597#true} is VALID [2022-02-20 19:58:19,882 INFO L290 TraceCheckUtils]: 3: Hoare triple {7597#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {7597#true} is VALID [2022-02-20 19:58:19,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {7597#true} call update_channels1(); {7636#(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 19:58:19,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {7636#(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); {7597#true} is VALID [2022-02-20 19:58:19,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {7597#true} assume true; {7597#true} is VALID [2022-02-20 19:58:19,883 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7597#true} {7597#true} #1884#return; {7597#true} is VALID [2022-02-20 19:58:19,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {7597#true} assume { :begin_inline_init_threads1 } true; {7597#true} is VALID [2022-02-20 19:58:19,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {7597#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7597#true} is VALID [2022-02-20 19:58:19,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {7597#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7597#true} is VALID [2022-02-20 19:58:19,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {7597#true} assume { :end_inline_init_threads1 } true; {7597#true} is VALID [2022-02-20 19:58:19,884 INFO L272 TraceCheckUtils]: 12: Hoare triple {7597#true} call fire_delta_events1(); {7637#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:19,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {7637#(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); {7597#true} is VALID [2022-02-20 19:58:19,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {7597#true} assume !(0 == ~q_write_ev~0); {7597#true} is VALID [2022-02-20 19:58:19,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {7597#true} assume true; {7597#true} is VALID [2022-02-20 19:58:19,885 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7597#true} {7597#true} #1886#return; {7597#true} is VALID [2022-02-20 19:58:19,885 INFO L272 TraceCheckUtils]: 17: Hoare triple {7597#true} call activate_threads1(); {7638#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:19,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {7638#(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; {7597#true} is VALID [2022-02-20 19:58:19,885 INFO L272 TraceCheckUtils]: 19: Hoare triple {7597#true} call #t~ret8 := is_do_write_p_triggered(); {7597#true} is VALID [2022-02-20 19:58:19,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {7597#true} havoc ~__retres1~0; {7597#true} is VALID [2022-02-20 19:58:19,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {7597#true} assume !(1 == ~p_dw_pc~0); {7597#true} is VALID [2022-02-20 19:58:19,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {7597#true} ~__retres1~0 := 0; {7653#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:19,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {7653#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:19,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {7654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:19,887 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7654#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7597#true} #1880#return; {7645#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:19,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {7645#(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; {7646#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:19,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {7646#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7598#false} is VALID [2022-02-20 19:58:19,888 INFO L272 TraceCheckUtils]: 28: Hoare triple {7598#false} call #t~ret9 := is_do_read_c_triggered(); {7597#true} is VALID [2022-02-20 19:58:19,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {7597#true} havoc ~__retres1~1; {7597#true} is VALID [2022-02-20 19:58:19,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {7597#true} assume 1 == ~c_dr_pc~0; {7597#true} is VALID [2022-02-20 19:58:19,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {7597#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7597#true} is VALID [2022-02-20 19:58:19,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {7597#true} #res := ~__retres1~1; {7597#true} is VALID [2022-02-20 19:58:19,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {7597#true} assume true; {7597#true} is VALID [2022-02-20 19:58:19,889 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7597#true} {7598#false} #1882#return; {7598#false} is VALID [2022-02-20 19:58:19,889 INFO L290 TraceCheckUtils]: 35: Hoare triple {7598#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7598#false} is VALID [2022-02-20 19:58:19,889 INFO L290 TraceCheckUtils]: 36: Hoare triple {7598#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7598#false} is VALID [2022-02-20 19:58:19,890 INFO L290 TraceCheckUtils]: 37: Hoare triple {7598#false} assume true; {7598#false} is VALID [2022-02-20 19:58:19,890 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7598#false} {7597#true} #1888#return; {7598#false} is VALID [2022-02-20 19:58:19,890 INFO L272 TraceCheckUtils]: 39: Hoare triple {7598#false} call reset_delta_events1(); {7637#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:19,890 INFO L290 TraceCheckUtils]: 40: Hoare triple {7637#(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); {7597#true} is VALID [2022-02-20 19:58:19,890 INFO L290 TraceCheckUtils]: 41: Hoare triple {7597#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7597#true} is VALID [2022-02-20 19:58:19,890 INFO L290 TraceCheckUtils]: 42: Hoare triple {7597#true} assume true; {7597#true} is VALID [2022-02-20 19:58:19,890 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7597#true} {7598#false} #1890#return; {7598#false} is VALID [2022-02-20 19:58:19,890 INFO L290 TraceCheckUtils]: 44: Hoare triple {7598#false} assume !false; {7598#false} is VALID [2022-02-20 19:58:19,891 INFO L290 TraceCheckUtils]: 45: Hoare triple {7598#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; {7598#false} is VALID [2022-02-20 19:58:19,891 INFO L290 TraceCheckUtils]: 46: Hoare triple {7598#false} assume !false; {7598#false} is VALID [2022-02-20 19:58:19,891 INFO L272 TraceCheckUtils]: 47: Hoare triple {7598#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7597#true} is VALID [2022-02-20 19:58:19,891 INFO L290 TraceCheckUtils]: 48: Hoare triple {7597#true} havoc ~__retres1~2; {7597#true} is VALID [2022-02-20 19:58:19,891 INFO L290 TraceCheckUtils]: 49: Hoare triple {7597#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7597#true} is VALID [2022-02-20 19:58:19,891 INFO L290 TraceCheckUtils]: 50: Hoare triple {7597#true} #res := ~__retres1~2; {7597#true} is VALID [2022-02-20 19:58:19,891 INFO L290 TraceCheckUtils]: 51: Hoare triple {7597#true} assume true; {7597#true} is VALID [2022-02-20 19:58:19,892 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7597#true} {7598#false} #1892#return; {7598#false} is VALID [2022-02-20 19:58:19,892 INFO L290 TraceCheckUtils]: 53: Hoare triple {7598#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; {7598#false} is VALID [2022-02-20 19:58:19,892 INFO L290 TraceCheckUtils]: 54: Hoare triple {7598#false} assume 0 != eval1_~tmp___1~0#1; {7598#false} is VALID [2022-02-20 19:58:19,892 INFO L290 TraceCheckUtils]: 55: Hoare triple {7598#false} assume !(0 == ~p_dw_st~0); {7598#false} is VALID [2022-02-20 19:58:19,892 INFO L290 TraceCheckUtils]: 56: Hoare triple {7598#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; {7598#false} is VALID [2022-02-20 19:58:19,892 INFO L290 TraceCheckUtils]: 57: Hoare triple {7598#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; {7598#false} is VALID [2022-02-20 19:58:19,892 INFO L290 TraceCheckUtils]: 58: Hoare triple {7598#false} assume !(0 == ~c_dr_pc~0); {7598#false} is VALID [2022-02-20 19:58:19,893 INFO L290 TraceCheckUtils]: 59: Hoare triple {7598#false} assume 1 == ~c_dr_pc~0; {7598#false} is VALID [2022-02-20 19:58:19,893 INFO L290 TraceCheckUtils]: 60: Hoare triple {7598#false} do_read_c_~a~0#1 := ~a_t~0; {7598#false} is VALID [2022-02-20 19:58:19,893 INFO L290 TraceCheckUtils]: 61: Hoare triple {7598#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; {7598#false} is VALID [2022-02-20 19:58:19,893 INFO L290 TraceCheckUtils]: 62: Hoare triple {7598#false} assume !(~p_last_write~0 == ~c_last_read~0); {7598#false} is VALID [2022-02-20 19:58:19,893 INFO L272 TraceCheckUtils]: 63: Hoare triple {7598#false} call error1(); {7598#false} is VALID [2022-02-20 19:58:19,893 INFO L290 TraceCheckUtils]: 64: Hoare triple {7598#false} assume !false; {7598#false} is VALID [2022-02-20 19:58:19,894 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 19:58:19,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:19,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227475865] [2022-02-20 19:58:19,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227475865] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:19,894 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:19,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:19,894 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204883516] [2022-02-20 19:58:19,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:19,895 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:58:19,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:19,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:58:19,975 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 19:58:19,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:19,976 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:19,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:19,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:19,977 INFO L87 Difference]: Start difference. First operand 665 states and 993 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:58:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:23,624 INFO L93 Difference]: Finished difference Result 966 states and 1407 transitions. [2022-02-20 19:58:23,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:23,624 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:58:23,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:58:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 883 transitions. [2022-02-20 19:58:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:58:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 883 transitions. [2022-02-20 19:58:23,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 883 transitions. [2022-02-20 19:58:24,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 883 edges. 883 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:24,247 INFO L225 Difference]: With dead ends: 966 [2022-02-20 19:58:24,247 INFO L226 Difference]: Without dead ends: 699 [2022-02-20 19:58:24,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-02-20 19:58:24,249 INFO L933 BasicCegarLoop]: 715 mSDtfsCounter, 968 mSDsluCounter, 2113 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:24,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [969 Valid, 2828 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1633 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 19:58:24,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-02-20 19:58:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 670. [2022-02-20 19:58:24,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:24,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 699 states. Second operand has 670 states, 574 states have (on average 1.4982578397212543) internal successors, (860), 582 states have internal predecessors, (860), 62 states have call successors, (62), 28 states have call predecessors, (62), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2022-02-20 19:58:24,290 INFO L74 IsIncluded]: Start isIncluded. First operand 699 states. Second operand has 670 states, 574 states have (on average 1.4982578397212543) internal successors, (860), 582 states have internal predecessors, (860), 62 states have call successors, (62), 28 states have call predecessors, (62), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2022-02-20 19:58:24,291 INFO L87 Difference]: Start difference. First operand 699 states. Second operand has 670 states, 574 states have (on average 1.4982578397212543) internal successors, (860), 582 states have internal predecessors, (860), 62 states have call successors, (62), 28 states have call predecessors, (62), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2022-02-20 19:58:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:24,309 INFO L93 Difference]: Finished difference Result 699 states and 1037 transitions. [2022-02-20 19:58:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1037 transitions. [2022-02-20 19:58:24,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:24,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:24,312 INFO L74 IsIncluded]: Start isIncluded. First operand has 670 states, 574 states have (on average 1.4982578397212543) internal successors, (860), 582 states have internal predecessors, (860), 62 states have call successors, (62), 28 states have call predecessors, (62), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) Second operand 699 states. [2022-02-20 19:58:24,313 INFO L87 Difference]: Start difference. First operand has 670 states, 574 states have (on average 1.4982578397212543) internal successors, (860), 582 states have internal predecessors, (860), 62 states have call successors, (62), 28 states have call predecessors, (62), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) Second operand 699 states. [2022-02-20 19:58:24,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:24,332 INFO L93 Difference]: Finished difference Result 699 states and 1037 transitions. [2022-02-20 19:58:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1037 transitions. [2022-02-20 19:58:24,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:24,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:24,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:24,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:24,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 574 states have (on average 1.4982578397212543) internal successors, (860), 582 states have internal predecessors, (860), 62 states have call successors, (62), 28 states have call predecessors, (62), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2022-02-20 19:58:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 996 transitions. [2022-02-20 19:58:24,355 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 996 transitions. Word has length 65 [2022-02-20 19:58:24,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:24,356 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 996 transitions. [2022-02-20 19:58:24,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:58:24,356 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 996 transitions. [2022-02-20 19:58:24,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:24,357 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:24,357 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 19:58:24,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:58:24,357 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:24,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:24,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1286839225, now seen corresponding path program 1 times [2022-02-20 19:58:24,358 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:24,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432830979] [2022-02-20 19:58:24,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:24,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {11281#(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); {11282#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:24,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {11282#(not (= |old(~q_req_up~0)| 1))} assume true; {11282#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:24,404 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11282#(not (= |old(~q_req_up~0)| 1))} {11242#(= ~c_dr_pc~0 ~q_req_up~0)} #1884#return; {11246#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:24,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {11283#(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); {11239#true} is VALID [2022-02-20 19:58:24,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {11239#true} assume !(0 == ~q_write_ev~0); {11239#true} is VALID [2022-02-20 19:58:24,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {11239#true} assume true; {11239#true} is VALID [2022-02-20 19:58:24,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11239#true} {11246#(not (= ~c_dr_pc~0 1))} #1886#return; {11246#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:24,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {11239#true} havoc ~__retres1~0; {11239#true} is VALID [2022-02-20 19:58:24,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {11239#true} assume !(1 == ~p_dw_pc~0); {11239#true} is VALID [2022-02-20 19:58:24,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {11239#true} ~__retres1~0 := 0; {11239#true} is VALID [2022-02-20 19:58:24,437 INFO L290 TraceCheckUtils]: 3: Hoare triple {11239#true} #res := ~__retres1~0; {11239#true} is VALID [2022-02-20 19:58:24,437 INFO L290 TraceCheckUtils]: 4: Hoare triple {11239#true} assume true; {11239#true} is VALID [2022-02-20 19:58:24,437 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11239#true} {11239#true} #1880#return; {11239#true} is VALID [2022-02-20 19:58:24,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {11239#true} havoc ~__retres1~1; {11239#true} is VALID [2022-02-20 19:58:24,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {11239#true} assume 1 == ~c_dr_pc~0; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,443 INFO L290 TraceCheckUtils]: 3: Hoare triple {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,443 INFO L290 TraceCheckUtils]: 4: Hoare triple {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,444 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} {11239#true} #1882#return; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {11284#(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; {11239#true} is VALID [2022-02-20 19:58:24,444 INFO L272 TraceCheckUtils]: 1: Hoare triple {11239#true} call #t~ret8 := is_do_write_p_triggered(); {11239#true} is VALID [2022-02-20 19:58:24,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {11239#true} havoc ~__retres1~0; {11239#true} is VALID [2022-02-20 19:58:24,444 INFO L290 TraceCheckUtils]: 3: Hoare triple {11239#true} assume !(1 == ~p_dw_pc~0); {11239#true} is VALID [2022-02-20 19:58:24,444 INFO L290 TraceCheckUtils]: 4: Hoare triple {11239#true} ~__retres1~0 := 0; {11239#true} is VALID [2022-02-20 19:58:24,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {11239#true} #res := ~__retres1~0; {11239#true} is VALID [2022-02-20 19:58:24,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {11239#true} assume true; {11239#true} is VALID [2022-02-20 19:58:24,445 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11239#true} {11239#true} #1880#return; {11239#true} is VALID [2022-02-20 19:58:24,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {11239#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {11239#true} is VALID [2022-02-20 19:58:24,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {11239#true} assume !(0 != ~tmp~1); {11239#true} is VALID [2022-02-20 19:58:24,445 INFO L272 TraceCheckUtils]: 10: Hoare triple {11239#true} call #t~ret9 := is_do_read_c_triggered(); {11239#true} is VALID [2022-02-20 19:58:24,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {11239#true} havoc ~__retres1~1; {11239#true} is VALID [2022-02-20 19:58:24,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {11239#true} assume 1 == ~c_dr_pc~0; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,447 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} {11239#true} #1882#return; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,448 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} {11246#(not (= ~c_dr_pc~0 1))} #1888#return; {11240#false} is VALID [2022-02-20 19:58:24,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {11283#(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); {11239#true} is VALID [2022-02-20 19:58:24,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {11239#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {11239#true} is VALID [2022-02-20 19:58:24,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {11239#true} assume true; {11239#true} is VALID [2022-02-20 19:58:24,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11239#true} {11240#false} #1890#return; {11240#false} is VALID [2022-02-20 19:58:24,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {11239#true} havoc ~__retres1~2; {11239#true} is VALID [2022-02-20 19:58:24,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {11239#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {11239#true} is VALID [2022-02-20 19:58:24,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {11239#true} #res := ~__retres1~2; {11239#true} is VALID [2022-02-20 19:58:24,455 INFO L290 TraceCheckUtils]: 3: Hoare triple {11239#true} assume true; {11239#true} is VALID [2022-02-20 19:58:24,455 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11239#true} {11240#false} #1892#return; {11240#false} is VALID [2022-02-20 19:58:24,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {11239#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~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;~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;~t11_pc~0 := 0;~t12_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;~t11_st~0 := 0;~t12_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;~t11_i~0 := 0;~t12_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;~T11_E~0 := 2;~T12_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;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {11241#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:58:24,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {11241#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {11241#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:58:24,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {11241#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#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;~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; {11242#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:58:24,457 INFO L290 TraceCheckUtils]: 3: Hoare triple {11242#(= ~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_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {11242#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:58:24,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {11242#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {11281#(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 19:58:24,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {11281#(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); {11282#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:24,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {11282#(not (= |old(~q_req_up~0)| 1))} assume true; {11282#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:24,458 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11282#(not (= |old(~q_req_up~0)| 1))} {11242#(= ~c_dr_pc~0 ~q_req_up~0)} #1884#return; {11246#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:24,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {11246#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {11246#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:24,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {11246#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {11246#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:24,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {11246#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {11246#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:24,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {11246#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {11246#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:24,460 INFO L272 TraceCheckUtils]: 12: Hoare triple {11246#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {11283#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:24,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {11283#(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); {11239#true} is VALID [2022-02-20 19:58:24,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {11239#true} assume !(0 == ~q_write_ev~0); {11239#true} is VALID [2022-02-20 19:58:24,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {11239#true} assume true; {11239#true} is VALID [2022-02-20 19:58:24,460 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11239#true} {11246#(not (= ~c_dr_pc~0 1))} #1886#return; {11246#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:24,461 INFO L272 TraceCheckUtils]: 17: Hoare triple {11246#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {11284#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:24,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {11284#(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; {11239#true} is VALID [2022-02-20 19:58:24,461 INFO L272 TraceCheckUtils]: 19: Hoare triple {11239#true} call #t~ret8 := is_do_write_p_triggered(); {11239#true} is VALID [2022-02-20 19:58:24,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {11239#true} havoc ~__retres1~0; {11239#true} is VALID [2022-02-20 19:58:24,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {11239#true} assume !(1 == ~p_dw_pc~0); {11239#true} is VALID [2022-02-20 19:58:24,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {11239#true} ~__retres1~0 := 0; {11239#true} is VALID [2022-02-20 19:58:24,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {11239#true} #res := ~__retres1~0; {11239#true} is VALID [2022-02-20 19:58:24,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {11239#true} assume true; {11239#true} is VALID [2022-02-20 19:58:24,462 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11239#true} {11239#true} #1880#return; {11239#true} is VALID [2022-02-20 19:58:24,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {11239#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {11239#true} is VALID [2022-02-20 19:58:24,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {11239#true} assume !(0 != ~tmp~1); {11239#true} is VALID [2022-02-20 19:58:24,462 INFO L272 TraceCheckUtils]: 28: Hoare triple {11239#true} call #t~ret9 := is_do_read_c_triggered(); {11239#true} is VALID [2022-02-20 19:58:24,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {11239#true} havoc ~__retres1~1; {11239#true} is VALID [2022-02-20 19:58:24,463 INFO L290 TraceCheckUtils]: 30: Hoare triple {11239#true} assume 1 == ~c_dr_pc~0; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,463 INFO L290 TraceCheckUtils]: 31: Hoare triple {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,463 INFO L290 TraceCheckUtils]: 32: Hoare triple {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,463 INFO L290 TraceCheckUtils]: 33: Hoare triple {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,464 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} {11239#true} #1882#return; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,465 INFO L290 TraceCheckUtils]: 37: Hoare triple {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:24,465 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11297#(= (+ (- 1) ~c_dr_pc~0) 0)} {11246#(not (= ~c_dr_pc~0 1))} #1888#return; {11240#false} is VALID [2022-02-20 19:58:24,465 INFO L272 TraceCheckUtils]: 39: Hoare triple {11240#false} call reset_delta_events1(); {11283#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:24,465 INFO L290 TraceCheckUtils]: 40: Hoare triple {11283#(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); {11239#true} is VALID [2022-02-20 19:58:24,465 INFO L290 TraceCheckUtils]: 41: Hoare triple {11239#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {11239#true} is VALID [2022-02-20 19:58:24,466 INFO L290 TraceCheckUtils]: 42: Hoare triple {11239#true} assume true; {11239#true} is VALID [2022-02-20 19:58:24,466 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {11239#true} {11240#false} #1890#return; {11240#false} is VALID [2022-02-20 19:58:24,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {11240#false} assume !false; {11240#false} is VALID [2022-02-20 19:58:24,466 INFO L290 TraceCheckUtils]: 45: Hoare triple {11240#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; {11240#false} is VALID [2022-02-20 19:58:24,466 INFO L290 TraceCheckUtils]: 46: Hoare triple {11240#false} assume !false; {11240#false} is VALID [2022-02-20 19:58:24,466 INFO L272 TraceCheckUtils]: 47: Hoare triple {11240#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {11239#true} is VALID [2022-02-20 19:58:24,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {11239#true} havoc ~__retres1~2; {11239#true} is VALID [2022-02-20 19:58:24,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {11239#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {11239#true} is VALID [2022-02-20 19:58:24,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {11239#true} #res := ~__retres1~2; {11239#true} is VALID [2022-02-20 19:58:24,467 INFO L290 TraceCheckUtils]: 51: Hoare triple {11239#true} assume true; {11239#true} is VALID [2022-02-20 19:58:24,467 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11239#true} {11240#false} #1892#return; {11240#false} is VALID [2022-02-20 19:58:24,467 INFO L290 TraceCheckUtils]: 53: Hoare triple {11240#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; {11240#false} is VALID [2022-02-20 19:58:24,467 INFO L290 TraceCheckUtils]: 54: Hoare triple {11240#false} assume 0 != eval1_~tmp___1~0#1; {11240#false} is VALID [2022-02-20 19:58:24,467 INFO L290 TraceCheckUtils]: 55: Hoare triple {11240#false} assume !(0 == ~p_dw_st~0); {11240#false} is VALID [2022-02-20 19:58:24,467 INFO L290 TraceCheckUtils]: 56: Hoare triple {11240#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; {11240#false} is VALID [2022-02-20 19:58:24,467 INFO L290 TraceCheckUtils]: 57: Hoare triple {11240#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; {11240#false} is VALID [2022-02-20 19:58:24,467 INFO L290 TraceCheckUtils]: 58: Hoare triple {11240#false} assume !(0 == ~c_dr_pc~0); {11240#false} is VALID [2022-02-20 19:58:24,468 INFO L290 TraceCheckUtils]: 59: Hoare triple {11240#false} assume 1 == ~c_dr_pc~0; {11240#false} is VALID [2022-02-20 19:58:24,468 INFO L290 TraceCheckUtils]: 60: Hoare triple {11240#false} do_read_c_~a~0#1 := ~a_t~0; {11240#false} is VALID [2022-02-20 19:58:24,468 INFO L290 TraceCheckUtils]: 61: Hoare triple {11240#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; {11240#false} is VALID [2022-02-20 19:58:24,468 INFO L290 TraceCheckUtils]: 62: Hoare triple {11240#false} assume !(~p_last_write~0 == ~c_last_read~0); {11240#false} is VALID [2022-02-20 19:58:24,468 INFO L272 TraceCheckUtils]: 63: Hoare triple {11240#false} call error1(); {11240#false} is VALID [2022-02-20 19:58:24,468 INFO L290 TraceCheckUtils]: 64: Hoare triple {11240#false} assume !false; {11240#false} is VALID [2022-02-20 19:58:24,468 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 19:58:24,469 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:24,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432830979] [2022-02-20 19:58:24,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432830979] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:24,469 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:24,469 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:58:24,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581974753] [2022-02-20 19:58:24,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:24,470 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), 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 65 [2022-02-20 19:58:24,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:24,470 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), 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 19:58:24,507 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 19:58:24,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:58:24,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:24,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:58:24,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:58:24,508 INFO L87 Difference]: Start difference. First operand 670 states and 996 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 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 19:58:30,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:30,354 INFO L93 Difference]: Finished difference Result 1992 states and 2792 transitions. [2022-02-20 19:58:30,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:58:30,355 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), 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 65 [2022-02-20 19:58:30,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:30,355 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), 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 19:58:30,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1401 transitions. [2022-02-20 19:58:30,365 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), 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 19:58:30,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1401 transitions. [2022-02-20 19:58:30,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1401 transitions. [2022-02-20 19:58:31,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1401 edges. 1401 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:31,495 INFO L225 Difference]: With dead ends: 1992 [2022-02-20 19:58:31,496 INFO L226 Difference]: Without dead ends: 1702 [2022-02-20 19:58:31,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:58:31,498 INFO L933 BasicCegarLoop]: 817 mSDtfsCounter, 3607 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3621 SdHoareTripleChecker+Valid, 2966 SdHoareTripleChecker+Invalid, 2324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:31,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3621 Valid, 2966 Invalid, 2324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 1702 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-02-20 19:58:31,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2022-02-20 19:58:31,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1571. [2022-02-20 19:58:31,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:31,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1702 states. Second operand has 1571 states, 1289 states have (on average 1.395655546935609) internal successors, (1799), 1312 states have internal predecessors, (1799), 150 states have call successors, (150), 111 states have call predecessors, (150), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2022-02-20 19:58:31,566 INFO L74 IsIncluded]: Start isIncluded. First operand 1702 states. Second operand has 1571 states, 1289 states have (on average 1.395655546935609) internal successors, (1799), 1312 states have internal predecessors, (1799), 150 states have call successors, (150), 111 states have call predecessors, (150), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2022-02-20 19:58:31,568 INFO L87 Difference]: Start difference. First operand 1702 states. Second operand has 1571 states, 1289 states have (on average 1.395655546935609) internal successors, (1799), 1312 states have internal predecessors, (1799), 150 states have call successors, (150), 111 states have call predecessors, (150), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2022-02-20 19:58:31,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:31,653 INFO L93 Difference]: Finished difference Result 1702 states and 2286 transitions. [2022-02-20 19:58:31,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2286 transitions. [2022-02-20 19:58:31,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:31,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:31,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 1571 states, 1289 states have (on average 1.395655546935609) internal successors, (1799), 1312 states have internal predecessors, (1799), 150 states have call successors, (150), 111 states have call predecessors, (150), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) Second operand 1702 states. [2022-02-20 19:58:31,661 INFO L87 Difference]: Start difference. First operand has 1571 states, 1289 states have (on average 1.395655546935609) internal successors, (1799), 1312 states have internal predecessors, (1799), 150 states have call successors, (150), 111 states have call predecessors, (150), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) Second operand 1702 states. [2022-02-20 19:58:31,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:31,746 INFO L93 Difference]: Finished difference Result 1702 states and 2286 transitions. [2022-02-20 19:58:31,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2286 transitions. [2022-02-20 19:58:31,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:31,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:31,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:31,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:31,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1289 states have (on average 1.395655546935609) internal successors, (1799), 1312 states have internal predecessors, (1799), 150 states have call successors, (150), 111 states have call predecessors, (150), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2022-02-20 19:58:31,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2137 transitions. [2022-02-20 19:58:31,887 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2137 transitions. Word has length 65 [2022-02-20 19:58:31,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:31,888 INFO L470 AbstractCegarLoop]: Abstraction has 1571 states and 2137 transitions. [2022-02-20 19:58:31,888 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), 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 19:58:31,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2137 transitions. [2022-02-20 19:58:31,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:31,890 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:31,890 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 19:58:31,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:58:31,890 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:31,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:31,891 INFO L85 PathProgramCache]: Analyzing trace with hash 880048655, now seen corresponding path program 1 times [2022-02-20 19:58:31,891 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:31,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316699897] [2022-02-20 19:58:31,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:31,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {19574#(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); {19535#true} is VALID [2022-02-20 19:58:31,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {19535#true} assume true; {19535#true} is VALID [2022-02-20 19:58:31,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19535#true} {19535#true} #1884#return; {19535#true} is VALID [2022-02-20 19:58:31,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {19575#(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); {19535#true} is VALID [2022-02-20 19:58:31,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {19535#true} assume !(0 == ~q_write_ev~0); {19535#true} is VALID [2022-02-20 19:58:31,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {19535#true} assume true; {19535#true} is VALID [2022-02-20 19:58:31,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19535#true} {19535#true} #1886#return; {19535#true} is VALID [2022-02-20 19:58:31,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:31,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {19535#true} havoc ~__retres1~0; {19535#true} is VALID [2022-02-20 19:58:31,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {19535#true} assume !(1 == ~p_dw_pc~0); {19535#true} is VALID [2022-02-20 19:58:31,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {19535#true} ~__retres1~0 := 0; {19535#true} is VALID [2022-02-20 19:58:31,982 INFO L290 TraceCheckUtils]: 3: Hoare triple {19535#true} #res := ~__retres1~0; {19535#true} is VALID [2022-02-20 19:58:31,982 INFO L290 TraceCheckUtils]: 4: Hoare triple {19535#true} assume true; {19535#true} is VALID [2022-02-20 19:58:31,982 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19535#true} {19535#true} #1880#return; {19535#true} is VALID [2022-02-20 19:58:31,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {19535#true} havoc ~__retres1~1; {19535#true} is VALID [2022-02-20 19:58:32,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {19535#true} assume !(1 == ~c_dr_pc~0); {19535#true} is VALID [2022-02-20 19:58:32,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {19535#true} ~__retres1~1 := 0; {19591#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:32,012 INFO L290 TraceCheckUtils]: 3: Hoare triple {19591#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19592#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:32,013 INFO L290 TraceCheckUtils]: 4: Hoare triple {19592#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19592#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:32,013 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19592#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19535#true} #1882#return; {19589#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:32,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {19576#(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; {19535#true} is VALID [2022-02-20 19:58:32,014 INFO L272 TraceCheckUtils]: 1: Hoare triple {19535#true} call #t~ret8 := is_do_write_p_triggered(); {19535#true} is VALID [2022-02-20 19:58:32,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {19535#true} havoc ~__retres1~0; {19535#true} is VALID [2022-02-20 19:58:32,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {19535#true} assume !(1 == ~p_dw_pc~0); {19535#true} is VALID [2022-02-20 19:58:32,015 INFO L290 TraceCheckUtils]: 4: Hoare triple {19535#true} ~__retres1~0 := 0; {19535#true} is VALID [2022-02-20 19:58:32,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {19535#true} #res := ~__retres1~0; {19535#true} is VALID [2022-02-20 19:58:32,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {19535#true} assume true; {19535#true} is VALID [2022-02-20 19:58:32,015 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19535#true} {19535#true} #1880#return; {19535#true} is VALID [2022-02-20 19:58:32,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {19535#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {19535#true} is VALID [2022-02-20 19:58:32,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {19535#true} assume !(0 != ~tmp~1); {19535#true} is VALID [2022-02-20 19:58:32,016 INFO L272 TraceCheckUtils]: 10: Hoare triple {19535#true} call #t~ret9 := is_do_read_c_triggered(); {19535#true} is VALID [2022-02-20 19:58:32,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {19535#true} havoc ~__retres1~1; {19535#true} is VALID [2022-02-20 19:58:32,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {19535#true} assume !(1 == ~c_dr_pc~0); {19535#true} is VALID [2022-02-20 19:58:32,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {19535#true} ~__retres1~1 := 0; {19591#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:32,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {19591#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19592#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:32,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {19592#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19592#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:32,017 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19592#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19535#true} #1882#return; {19589#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:32,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {19589#(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; {19590#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:32,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {19590#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {19536#false} is VALID [2022-02-20 19:58:32,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {19536#false} assume true; {19536#false} is VALID [2022-02-20 19:58:32,019 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {19536#false} {19535#true} #1888#return; {19536#false} is VALID [2022-02-20 19:58:32,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {19575#(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); {19535#true} is VALID [2022-02-20 19:58:32,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {19535#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {19535#true} is VALID [2022-02-20 19:58:32,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {19535#true} assume true; {19535#true} is VALID [2022-02-20 19:58:32,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19535#true} {19536#false} #1890#return; {19536#false} is VALID [2022-02-20 19:58:32,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:32,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {19535#true} havoc ~__retres1~2; {19535#true} is VALID [2022-02-20 19:58:32,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {19535#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {19535#true} is VALID [2022-02-20 19:58:32,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {19535#true} #res := ~__retres1~2; {19535#true} is VALID [2022-02-20 19:58:32,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {19535#true} assume true; {19535#true} is VALID [2022-02-20 19:58:32,033 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19535#true} {19536#false} #1892#return; {19536#false} is VALID [2022-02-20 19:58:32,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {19535#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~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;~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;~t11_pc~0 := 0;~t12_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;~t11_st~0 := 0;~t12_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;~t11_i~0 := 0;~t12_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;~T11_E~0 := 2;~T12_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;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {19535#true} is VALID [2022-02-20 19:58:32,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {19535#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {19535#true} is VALID [2022-02-20 19:58:32,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {19535#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#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;~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; {19535#true} is VALID [2022-02-20 19:58:32,034 INFO L290 TraceCheckUtils]: 3: Hoare triple {19535#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {19535#true} is VALID [2022-02-20 19:58:32,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {19535#true} call update_channels1(); {19574#(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 19:58:32,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {19574#(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); {19535#true} is VALID [2022-02-20 19:58:32,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {19535#true} assume true; {19535#true} is VALID [2022-02-20 19:58:32,037 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19535#true} {19535#true} #1884#return; {19535#true} is VALID [2022-02-20 19:58:32,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {19535#true} assume { :begin_inline_init_threads1 } true; {19535#true} is VALID [2022-02-20 19:58:32,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {19535#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {19535#true} is VALID [2022-02-20 19:58:32,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {19535#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {19535#true} is VALID [2022-02-20 19:58:32,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {19535#true} assume { :end_inline_init_threads1 } true; {19535#true} is VALID [2022-02-20 19:58:32,039 INFO L272 TraceCheckUtils]: 12: Hoare triple {19535#true} call fire_delta_events1(); {19575#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {19575#(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); {19535#true} is VALID [2022-02-20 19:58:32,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {19535#true} assume !(0 == ~q_write_ev~0); {19535#true} is VALID [2022-02-20 19:58:32,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {19535#true} assume true; {19535#true} is VALID [2022-02-20 19:58:32,040 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19535#true} {19535#true} #1886#return; {19535#true} is VALID [2022-02-20 19:58:32,040 INFO L272 TraceCheckUtils]: 17: Hoare triple {19535#true} call activate_threads1(); {19576#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:32,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {19576#(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; {19535#true} is VALID [2022-02-20 19:58:32,040 INFO L272 TraceCheckUtils]: 19: Hoare triple {19535#true} call #t~ret8 := is_do_write_p_triggered(); {19535#true} is VALID [2022-02-20 19:58:32,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {19535#true} havoc ~__retres1~0; {19535#true} is VALID [2022-02-20 19:58:32,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {19535#true} assume !(1 == ~p_dw_pc~0); {19535#true} is VALID [2022-02-20 19:58:32,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {19535#true} ~__retres1~0 := 0; {19535#true} is VALID [2022-02-20 19:58:32,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {19535#true} #res := ~__retres1~0; {19535#true} is VALID [2022-02-20 19:58:32,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {19535#true} assume true; {19535#true} is VALID [2022-02-20 19:58:32,041 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {19535#true} {19535#true} #1880#return; {19535#true} is VALID [2022-02-20 19:58:32,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {19535#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {19535#true} is VALID [2022-02-20 19:58:32,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {19535#true} assume !(0 != ~tmp~1); {19535#true} is VALID [2022-02-20 19:58:32,041 INFO L272 TraceCheckUtils]: 28: Hoare triple {19535#true} call #t~ret9 := is_do_read_c_triggered(); {19535#true} is VALID [2022-02-20 19:58:32,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {19535#true} havoc ~__retres1~1; {19535#true} is VALID [2022-02-20 19:58:32,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {19535#true} assume !(1 == ~c_dr_pc~0); {19535#true} is VALID [2022-02-20 19:58:32,042 INFO L290 TraceCheckUtils]: 31: Hoare triple {19535#true} ~__retres1~1 := 0; {19591#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:32,042 INFO L290 TraceCheckUtils]: 32: Hoare triple {19591#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19592#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:32,043 INFO L290 TraceCheckUtils]: 33: Hoare triple {19592#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19592#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:32,043 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {19592#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19535#true} #1882#return; {19589#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:32,044 INFO L290 TraceCheckUtils]: 35: Hoare triple {19589#(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; {19590#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:32,044 INFO L290 TraceCheckUtils]: 36: Hoare triple {19590#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {19536#false} is VALID [2022-02-20 19:58:32,044 INFO L290 TraceCheckUtils]: 37: Hoare triple {19536#false} assume true; {19536#false} is VALID [2022-02-20 19:58:32,044 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {19536#false} {19535#true} #1888#return; {19536#false} is VALID [2022-02-20 19:58:32,045 INFO L272 TraceCheckUtils]: 39: Hoare triple {19536#false} call reset_delta_events1(); {19575#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:32,045 INFO L290 TraceCheckUtils]: 40: Hoare triple {19575#(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); {19535#true} is VALID [2022-02-20 19:58:32,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {19535#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {19535#true} is VALID [2022-02-20 19:58:32,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {19535#true} assume true; {19535#true} is VALID [2022-02-20 19:58:32,045 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {19535#true} {19536#false} #1890#return; {19536#false} is VALID [2022-02-20 19:58:32,045 INFO L290 TraceCheckUtils]: 44: Hoare triple {19536#false} assume !false; {19536#false} is VALID [2022-02-20 19:58:32,045 INFO L290 TraceCheckUtils]: 45: Hoare triple {19536#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; {19536#false} is VALID [2022-02-20 19:58:32,045 INFO L290 TraceCheckUtils]: 46: Hoare triple {19536#false} assume !false; {19536#false} is VALID [2022-02-20 19:58:32,046 INFO L272 TraceCheckUtils]: 47: Hoare triple {19536#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {19535#true} is VALID [2022-02-20 19:58:32,046 INFO L290 TraceCheckUtils]: 48: Hoare triple {19535#true} havoc ~__retres1~2; {19535#true} is VALID [2022-02-20 19:58:32,046 INFO L290 TraceCheckUtils]: 49: Hoare triple {19535#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {19535#true} is VALID [2022-02-20 19:58:32,046 INFO L290 TraceCheckUtils]: 50: Hoare triple {19535#true} #res := ~__retres1~2; {19535#true} is VALID [2022-02-20 19:58:32,046 INFO L290 TraceCheckUtils]: 51: Hoare triple {19535#true} assume true; {19535#true} is VALID [2022-02-20 19:58:32,046 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19535#true} {19536#false} #1892#return; {19536#false} is VALID [2022-02-20 19:58:32,046 INFO L290 TraceCheckUtils]: 53: Hoare triple {19536#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; {19536#false} is VALID [2022-02-20 19:58:32,046 INFO L290 TraceCheckUtils]: 54: Hoare triple {19536#false} assume 0 != eval1_~tmp___1~0#1; {19536#false} is VALID [2022-02-20 19:58:32,047 INFO L290 TraceCheckUtils]: 55: Hoare triple {19536#false} assume !(0 == ~p_dw_st~0); {19536#false} is VALID [2022-02-20 19:58:32,047 INFO L290 TraceCheckUtils]: 56: Hoare triple {19536#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; {19536#false} is VALID [2022-02-20 19:58:32,047 INFO L290 TraceCheckUtils]: 57: Hoare triple {19536#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; {19536#false} is VALID [2022-02-20 19:58:32,047 INFO L290 TraceCheckUtils]: 58: Hoare triple {19536#false} assume 0 == ~c_dr_pc~0; {19536#false} is VALID [2022-02-20 19:58:32,047 INFO L290 TraceCheckUtils]: 59: Hoare triple {19536#false} assume !false; {19536#false} is VALID [2022-02-20 19:58:32,047 INFO L290 TraceCheckUtils]: 60: Hoare triple {19536#false} assume !(1 == ~q_free~0); {19536#false} is VALID [2022-02-20 19:58:32,047 INFO L290 TraceCheckUtils]: 61: Hoare triple {19536#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; {19536#false} is VALID [2022-02-20 19:58:32,047 INFO L290 TraceCheckUtils]: 62: Hoare triple {19536#false} assume !(~p_last_write~0 == ~c_last_read~0); {19536#false} is VALID [2022-02-20 19:58:32,048 INFO L272 TraceCheckUtils]: 63: Hoare triple {19536#false} call error1(); {19536#false} is VALID [2022-02-20 19:58:32,048 INFO L290 TraceCheckUtils]: 64: Hoare triple {19536#false} assume !false; {19536#false} is VALID [2022-02-20 19:58:32,048 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 19:58:32,048 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:32,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316699897] [2022-02-20 19:58:32,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316699897] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:32,050 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:32,050 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:32,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150268075] [2022-02-20 19:58:32,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:32,051 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:58:32,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:32,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:58:32,088 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 19:58:32,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:32,088 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:32,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:32,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:32,090 INFO L87 Difference]: Start difference. First operand 1571 states and 2137 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:58:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:35,610 INFO L93 Difference]: Finished difference Result 2862 states and 3810 transitions. [2022-02-20 19:58:35,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:35,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-02-20 19:58:35,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:58:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 882 transitions. [2022-02-20 19:58:35,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:58:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 882 transitions. [2022-02-20 19:58:35,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 882 transitions. [2022-02-20 19:58:36,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 882 edges. 882 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:36,258 INFO L225 Difference]: With dead ends: 2862 [2022-02-20 19:58:36,259 INFO L226 Difference]: Without dead ends: 1677 [2022-02-20 19:58:36,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 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 19:58:36,261 INFO L933 BasicCegarLoop]: 710 mSDtfsCounter, 969 mSDsluCounter, 2113 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 2823 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:36,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [971 Valid, 2823 Invalid, 1754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:58:36,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2022-02-20 19:58:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1601. [2022-02-20 19:58:36,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:36,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1677 states. Second operand has 1601 states, 1313 states have (on average 1.3823305407463824) internal successors, (1815), 1336 states have internal predecessors, (1815), 150 states have call successors, (150), 111 states have call predecessors, (150), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2022-02-20 19:58:36,330 INFO L74 IsIncluded]: Start isIncluded. First operand 1677 states. Second operand has 1601 states, 1313 states have (on average 1.3823305407463824) internal successors, (1815), 1336 states have internal predecessors, (1815), 150 states have call successors, (150), 111 states have call predecessors, (150), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2022-02-20 19:58:36,331 INFO L87 Difference]: Start difference. First operand 1677 states. Second operand has 1601 states, 1313 states have (on average 1.3823305407463824) internal successors, (1815), 1336 states have internal predecessors, (1815), 150 states have call successors, (150), 111 states have call predecessors, (150), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2022-02-20 19:58:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:36,411 INFO L93 Difference]: Finished difference Result 1677 states and 2250 transitions. [2022-02-20 19:58:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2250 transitions. [2022-02-20 19:58:36,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:36,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:36,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 1601 states, 1313 states have (on average 1.3823305407463824) internal successors, (1815), 1336 states have internal predecessors, (1815), 150 states have call successors, (150), 111 states have call predecessors, (150), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) Second operand 1677 states. [2022-02-20 19:58:36,420 INFO L87 Difference]: Start difference. First operand has 1601 states, 1313 states have (on average 1.3823305407463824) internal successors, (1815), 1336 states have internal predecessors, (1815), 150 states have call successors, (150), 111 states have call predecessors, (150), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) Second operand 1677 states. [2022-02-20 19:58:36,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:36,501 INFO L93 Difference]: Finished difference Result 1677 states and 2250 transitions. [2022-02-20 19:58:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2250 transitions. [2022-02-20 19:58:36,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:36,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:36,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:36,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:36,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1313 states have (on average 1.3823305407463824) internal successors, (1815), 1336 states have internal predecessors, (1815), 150 states have call successors, (150), 111 states have call predecessors, (150), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2022-02-20 19:58:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2159 transitions. [2022-02-20 19:58:36,632 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2159 transitions. Word has length 65 [2022-02-20 19:58:36,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:36,632 INFO L470 AbstractCegarLoop]: Abstraction has 1601 states and 2159 transitions. [2022-02-20 19:58:36,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 19:58:36,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2159 transitions. [2022-02-20 19:58:36,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:36,633 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:36,633 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 19:58:36,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:58:36,634 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:36,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:36,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2028715247, now seen corresponding path program 1 times [2022-02-20 19:58:36,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:36,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036896833] [2022-02-20 19:58:36,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:36,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {28976#(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); {28977#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:36,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {28977#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {28977#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:36,697 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28977#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {28938#(= ~q_write_ev~0 ~q_read_ev~0)} #1884#return; {28938#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:36,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {28977#(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); {28977#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:36,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {28977#(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); {28977#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:36,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {28977#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {28977#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:36,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28977#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {28938#(= ~q_write_ev~0 ~q_read_ev~0)} #1886#return; {28938#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:36,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {28936#true} havoc ~__retres1~0; {28936#true} is VALID [2022-02-20 19:58:36,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {28936#true} assume !(1 == ~p_dw_pc~0); {28936#true} is VALID [2022-02-20 19:58:36,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {28936#true} ~__retres1~0 := 0; {28936#true} is VALID [2022-02-20 19:58:36,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {28936#true} #res := ~__retres1~0; {28936#true} is VALID [2022-02-20 19:58:36,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {28936#true} assume true; {28936#true} is VALID [2022-02-20 19:58:36,735 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {28936#true} {28936#true} #1880#return; {28936#true} is VALID [2022-02-20 19:58:36,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {28936#true} havoc ~__retres1~1; {28936#true} is VALID [2022-02-20 19:58:36,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {28936#true} assume !(1 == ~c_dr_pc~0); {28936#true} is VALID [2022-02-20 19:58:36,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {28936#true} ~__retres1~1 := 0; {28936#true} is VALID [2022-02-20 19:58:36,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {28936#true} #res := ~__retres1~1; {28936#true} is VALID [2022-02-20 19:58:36,738 INFO L290 TraceCheckUtils]: 4: Hoare triple {28936#true} assume true; {28936#true} is VALID [2022-02-20 19:58:36,738 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {28936#true} {28936#true} #1882#return; {28936#true} is VALID [2022-02-20 19:58:36,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {28978#(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; {28936#true} is VALID [2022-02-20 19:58:36,738 INFO L272 TraceCheckUtils]: 1: Hoare triple {28936#true} call #t~ret8 := is_do_write_p_triggered(); {28936#true} is VALID [2022-02-20 19:58:36,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {28936#true} havoc ~__retres1~0; {28936#true} is VALID [2022-02-20 19:58:36,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {28936#true} assume !(1 == ~p_dw_pc~0); {28936#true} is VALID [2022-02-20 19:58:36,739 INFO L290 TraceCheckUtils]: 4: Hoare triple {28936#true} ~__retres1~0 := 0; {28936#true} is VALID [2022-02-20 19:58:36,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {28936#true} #res := ~__retres1~0; {28936#true} is VALID [2022-02-20 19:58:36,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {28936#true} assume true; {28936#true} is VALID [2022-02-20 19:58:36,739 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28936#true} {28936#true} #1880#return; {28936#true} is VALID [2022-02-20 19:58:36,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {28936#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {28936#true} is VALID [2022-02-20 19:58:36,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {28936#true} assume !(0 != ~tmp~1); {28936#true} is VALID [2022-02-20 19:58:36,739 INFO L272 TraceCheckUtils]: 10: Hoare triple {28936#true} call #t~ret9 := is_do_read_c_triggered(); {28936#true} is VALID [2022-02-20 19:58:36,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {28936#true} havoc ~__retres1~1; {28936#true} is VALID [2022-02-20 19:58:36,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {28936#true} assume !(1 == ~c_dr_pc~0); {28936#true} is VALID [2022-02-20 19:58:36,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {28936#true} ~__retres1~1 := 0; {28936#true} is VALID [2022-02-20 19:58:36,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {28936#true} #res := ~__retres1~1; {28936#true} is VALID [2022-02-20 19:58:36,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {28936#true} assume true; {28936#true} is VALID [2022-02-20 19:58:36,741 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28936#true} {28936#true} #1882#return; {28936#true} is VALID [2022-02-20 19:58:36,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {28936#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {28936#true} is VALID [2022-02-20 19:58:36,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {28936#true} assume !(0 != ~tmp___0~1); {28936#true} is VALID [2022-02-20 19:58:36,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {28936#true} assume true; {28936#true} is VALID [2022-02-20 19:58:36,742 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {28936#true} {28938#(= ~q_write_ev~0 ~q_read_ev~0)} #1888#return; {28938#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:36,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {28977#(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); {28991#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:36,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {28991#(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; {28992#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:36,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {28992#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {28992#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:36,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28992#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {28938#(= ~q_write_ev~0 ~q_read_ev~0)} #1890#return; {28937#false} is VALID [2022-02-20 19:58:36,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:36,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {28936#true} havoc ~__retres1~2; {28936#true} is VALID [2022-02-20 19:58:36,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {28936#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {28936#true} is VALID [2022-02-20 19:58:36,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {28936#true} #res := ~__retres1~2; {28936#true} is VALID [2022-02-20 19:58:36,761 INFO L290 TraceCheckUtils]: 3: Hoare triple {28936#true} assume true; {28936#true} is VALID [2022-02-20 19:58:36,761 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {28936#true} {28937#false} #1892#return; {28937#false} is VALID [2022-02-20 19:58:36,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {28936#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~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;~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;~t11_pc~0 := 0;~t12_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;~t11_st~0 := 0;~t12_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;~t11_i~0 := 0;~t12_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;~T11_E~0 := 2;~T12_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;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {28936#true} is VALID [2022-02-20 19:58:36,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {28936#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {28936#true} is VALID [2022-02-20 19:58:36,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {28936#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#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;~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; {28938#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:36,762 INFO L290 TraceCheckUtils]: 3: Hoare triple {28938#(= ~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_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {28938#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:36,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {28938#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {28976#(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 19:58:36,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {28976#(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); {28977#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:36,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {28977#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {28977#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:36,763 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28977#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {28938#(= ~q_write_ev~0 ~q_read_ev~0)} #1884#return; {28938#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:36,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {28938#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {28938#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:36,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {28938#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {28938#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:36,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {28938#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {28938#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:36,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {28938#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {28938#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:36,766 INFO L272 TraceCheckUtils]: 12: Hoare triple {28938#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {28977#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:36,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {28977#(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); {28977#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:36,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {28977#(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); {28977#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:36,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {28977#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {28977#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:36,768 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28977#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {28938#(= ~q_write_ev~0 ~q_read_ev~0)} #1886#return; {28938#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:36,768 INFO L272 TraceCheckUtils]: 17: Hoare triple {28938#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {28978#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:36,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {28978#(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; {28936#true} is VALID [2022-02-20 19:58:36,768 INFO L272 TraceCheckUtils]: 19: Hoare triple {28936#true} call #t~ret8 := is_do_write_p_triggered(); {28936#true} is VALID [2022-02-20 19:58:36,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {28936#true} havoc ~__retres1~0; {28936#true} is VALID [2022-02-20 19:58:36,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {28936#true} assume !(1 == ~p_dw_pc~0); {28936#true} is VALID [2022-02-20 19:58:36,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {28936#true} ~__retres1~0 := 0; {28936#true} is VALID [2022-02-20 19:58:36,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {28936#true} #res := ~__retres1~0; {28936#true} is VALID [2022-02-20 19:58:36,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {28936#true} assume true; {28936#true} is VALID [2022-02-20 19:58:36,769 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {28936#true} {28936#true} #1880#return; {28936#true} is VALID [2022-02-20 19:58:36,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {28936#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {28936#true} is VALID [2022-02-20 19:58:36,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {28936#true} assume !(0 != ~tmp~1); {28936#true} is VALID [2022-02-20 19:58:36,769 INFO L272 TraceCheckUtils]: 28: Hoare triple {28936#true} call #t~ret9 := is_do_read_c_triggered(); {28936#true} is VALID [2022-02-20 19:58:36,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {28936#true} havoc ~__retres1~1; {28936#true} is VALID [2022-02-20 19:58:36,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {28936#true} assume !(1 == ~c_dr_pc~0); {28936#true} is VALID [2022-02-20 19:58:36,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {28936#true} ~__retres1~1 := 0; {28936#true} is VALID [2022-02-20 19:58:36,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {28936#true} #res := ~__retres1~1; {28936#true} is VALID [2022-02-20 19:58:36,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {28936#true} assume true; {28936#true} is VALID [2022-02-20 19:58:36,770 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {28936#true} {28936#true} #1882#return; {28936#true} is VALID [2022-02-20 19:58:36,770 INFO L290 TraceCheckUtils]: 35: Hoare triple {28936#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {28936#true} is VALID [2022-02-20 19:58:36,770 INFO L290 TraceCheckUtils]: 36: Hoare triple {28936#true} assume !(0 != ~tmp___0~1); {28936#true} is VALID [2022-02-20 19:58:36,770 INFO L290 TraceCheckUtils]: 37: Hoare triple {28936#true} assume true; {28936#true} is VALID [2022-02-20 19:58:36,771 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {28936#true} {28938#(= ~q_write_ev~0 ~q_read_ev~0)} #1888#return; {28938#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:36,771 INFO L272 TraceCheckUtils]: 39: Hoare triple {28938#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {28977#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:36,771 INFO L290 TraceCheckUtils]: 40: Hoare triple {28977#(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); {28991#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:36,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {28991#(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; {28992#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:36,772 INFO L290 TraceCheckUtils]: 42: Hoare triple {28992#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {28992#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:36,774 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {28992#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {28938#(= ~q_write_ev~0 ~q_read_ev~0)} #1890#return; {28937#false} is VALID [2022-02-20 19:58:36,775 INFO L290 TraceCheckUtils]: 44: Hoare triple {28937#false} assume !false; {28937#false} is VALID [2022-02-20 19:58:36,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {28937#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; {28937#false} is VALID [2022-02-20 19:58:36,775 INFO L290 TraceCheckUtils]: 46: Hoare triple {28937#false} assume !false; {28937#false} is VALID [2022-02-20 19:58:36,775 INFO L272 TraceCheckUtils]: 47: Hoare triple {28937#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {28936#true} is VALID [2022-02-20 19:58:36,775 INFO L290 TraceCheckUtils]: 48: Hoare triple {28936#true} havoc ~__retres1~2; {28936#true} is VALID [2022-02-20 19:58:36,775 INFO L290 TraceCheckUtils]: 49: Hoare triple {28936#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {28936#true} is VALID [2022-02-20 19:58:36,776 INFO L290 TraceCheckUtils]: 50: Hoare triple {28936#true} #res := ~__retres1~2; {28936#true} is VALID [2022-02-20 19:58:36,776 INFO L290 TraceCheckUtils]: 51: Hoare triple {28936#true} assume true; {28936#true} is VALID [2022-02-20 19:58:36,776 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {28936#true} {28937#false} #1892#return; {28937#false} is VALID [2022-02-20 19:58:36,776 INFO L290 TraceCheckUtils]: 53: Hoare triple {28937#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; {28937#false} is VALID [2022-02-20 19:58:36,776 INFO L290 TraceCheckUtils]: 54: Hoare triple {28937#false} assume 0 != eval1_~tmp___1~0#1; {28937#false} is VALID [2022-02-20 19:58:36,776 INFO L290 TraceCheckUtils]: 55: Hoare triple {28937#false} assume !(0 == ~p_dw_st~0); {28937#false} is VALID [2022-02-20 19:58:36,776 INFO L290 TraceCheckUtils]: 56: Hoare triple {28937#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; {28937#false} is VALID [2022-02-20 19:58:36,776 INFO L290 TraceCheckUtils]: 57: Hoare triple {28937#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; {28937#false} is VALID [2022-02-20 19:58:36,776 INFO L290 TraceCheckUtils]: 58: Hoare triple {28937#false} assume 0 == ~c_dr_pc~0; {28937#false} is VALID [2022-02-20 19:58:36,777 INFO L290 TraceCheckUtils]: 59: Hoare triple {28937#false} assume !false; {28937#false} is VALID [2022-02-20 19:58:36,777 INFO L290 TraceCheckUtils]: 60: Hoare triple {28937#false} assume !(1 == ~q_free~0); {28937#false} is VALID [2022-02-20 19:58:36,777 INFO L290 TraceCheckUtils]: 61: Hoare triple {28937#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; {28937#false} is VALID [2022-02-20 19:58:36,777 INFO L290 TraceCheckUtils]: 62: Hoare triple {28937#false} assume !(~p_last_write~0 == ~c_last_read~0); {28937#false} is VALID [2022-02-20 19:58:36,777 INFO L272 TraceCheckUtils]: 63: Hoare triple {28937#false} call error1(); {28937#false} is VALID [2022-02-20 19:58:36,777 INFO L290 TraceCheckUtils]: 64: Hoare triple {28937#false} assume !false; {28937#false} is VALID [2022-02-20 19:58:36,777 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 19:58:36,777 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:36,778 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036896833] [2022-02-20 19:58:36,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036896833] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:36,778 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:36,778 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:36,778 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903391669] [2022-02-20 19:58:36,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:36,778 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 19:58:36,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:36,779 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 19:58:36,808 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 19:58:36,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:36,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:36,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:36,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:36,810 INFO L87 Difference]: Start difference. First operand 1601 states and 2159 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 19:58:39,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:39,896 INFO L93 Difference]: Finished difference Result 2856 states and 3706 transitions. [2022-02-20 19:58:39,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:39,897 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 19:58:39,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:39,897 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 19:58:39,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1040 transitions. [2022-02-20 19:58:39,902 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 19:58:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1040 transitions. [2022-02-20 19:58:39,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1040 transitions. [2022-02-20 19:58:40,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1040 edges. 1040 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:40,759 INFO L225 Difference]: With dead ends: 2856 [2022-02-20 19:58:40,760 INFO L226 Difference]: Without dead ends: 1864 [2022-02-20 19:58:40,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:58:40,762 INFO L933 BasicCegarLoop]: 720 mSDtfsCounter, 1774 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1803 SdHoareTripleChecker+Valid, 2101 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:40,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1803 Valid, 2101 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:58:40,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2022-02-20 19:58:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1543. [2022-02-20 19:58:40,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:40,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1864 states. Second operand has 1543 states, 1271 states have (on average 1.3800157356412275) internal successors, (1754), 1289 states have internal predecessors, (1754), 144 states have call successors, (144), 106 states have call predecessors, (144), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2022-02-20 19:58:40,836 INFO L74 IsIncluded]: Start isIncluded. First operand 1864 states. Second operand has 1543 states, 1271 states have (on average 1.3800157356412275) internal successors, (1754), 1289 states have internal predecessors, (1754), 144 states have call successors, (144), 106 states have call predecessors, (144), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2022-02-20 19:58:40,837 INFO L87 Difference]: Start difference. First operand 1864 states. Second operand has 1543 states, 1271 states have (on average 1.3800157356412275) internal successors, (1754), 1289 states have internal predecessors, (1754), 144 states have call successors, (144), 106 states have call predecessors, (144), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2022-02-20 19:58:40,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:40,930 INFO L93 Difference]: Finished difference Result 1864 states and 2421 transitions. [2022-02-20 19:58:40,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2421 transitions. [2022-02-20 19:58:40,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:40,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:40,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 1543 states, 1271 states have (on average 1.3800157356412275) internal successors, (1754), 1289 states have internal predecessors, (1754), 144 states have call successors, (144), 106 states have call predecessors, (144), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) Second operand 1864 states. [2022-02-20 19:58:40,937 INFO L87 Difference]: Start difference. First operand has 1543 states, 1271 states have (on average 1.3800157356412275) internal successors, (1754), 1289 states have internal predecessors, (1754), 144 states have call successors, (144), 106 states have call predecessors, (144), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) Second operand 1864 states. [2022-02-20 19:58:41,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:41,032 INFO L93 Difference]: Finished difference Result 1864 states and 2421 transitions. [2022-02-20 19:58:41,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2421 transitions. [2022-02-20 19:58:41,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:41,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:41,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:41,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1271 states have (on average 1.3800157356412275) internal successors, (1754), 1289 states have internal predecessors, (1754), 144 states have call successors, (144), 106 states have call predecessors, (144), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2022-02-20 19:58:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2077 transitions. [2022-02-20 19:58:41,155 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2077 transitions. Word has length 65 [2022-02-20 19:58:41,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:41,155 INFO L470 AbstractCegarLoop]: Abstraction has 1543 states and 2077 transitions. [2022-02-20 19:58:41,155 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 19:58:41,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2077 transitions. [2022-02-20 19:58:41,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:41,156 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:41,156 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 19:58:41,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:58:41,157 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:41,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:41,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2132238543, now seen corresponding path program 1 times [2022-02-20 19:58:41,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:41,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619800086] [2022-02-20 19:58:41,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:41,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {38634#(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); {38594#true} is VALID [2022-02-20 19:58:41,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {38594#true} assume true; {38594#true} is VALID [2022-02-20 19:58:41,196 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38594#true} {38594#true} #1884#return; {38594#true} is VALID [2022-02-20 19:58:41,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {38635#(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); {38594#true} is VALID [2022-02-20 19:58:41,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {38594#true} assume !(0 == ~q_write_ev~0); {38594#true} is VALID [2022-02-20 19:58:41,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {38594#true} assume true; {38594#true} is VALID [2022-02-20 19:58:41,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38594#true} {38599#(= ~p_dw_st~0 0)} #1886#return; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {38594#true} havoc ~__retres1~0; {38594#true} is VALID [2022-02-20 19:58:41,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {38594#true} assume !(1 == ~p_dw_pc~0); {38594#true} is VALID [2022-02-20 19:58:41,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {38594#true} ~__retres1~0 := 0; {38594#true} is VALID [2022-02-20 19:58:41,226 INFO L290 TraceCheckUtils]: 3: Hoare triple {38594#true} #res := ~__retres1~0; {38594#true} is VALID [2022-02-20 19:58:41,226 INFO L290 TraceCheckUtils]: 4: Hoare triple {38594#true} assume true; {38594#true} is VALID [2022-02-20 19:58:41,226 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {38594#true} {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1880#return; {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:41,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {38594#true} havoc ~__retres1~1; {38594#true} is VALID [2022-02-20 19:58:41,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {38594#true} assume !(1 == ~c_dr_pc~0); {38594#true} is VALID [2022-02-20 19:58:41,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {38594#true} ~__retres1~1 := 0; {38594#true} is VALID [2022-02-20 19:58:41,231 INFO L290 TraceCheckUtils]: 3: Hoare triple {38594#true} #res := ~__retres1~1; {38594#true} is VALID [2022-02-20 19:58:41,231 INFO L290 TraceCheckUtils]: 4: Hoare triple {38594#true} assume true; {38594#true} is VALID [2022-02-20 19:58:41,231 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {38594#true} {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1882#return; {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:41,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {38636#(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; {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:41,232 INFO L272 TraceCheckUtils]: 1: Hoare triple {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {38594#true} is VALID [2022-02-20 19:58:41,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {38594#true} havoc ~__retres1~0; {38594#true} is VALID [2022-02-20 19:58:41,232 INFO L290 TraceCheckUtils]: 3: Hoare triple {38594#true} assume !(1 == ~p_dw_pc~0); {38594#true} is VALID [2022-02-20 19:58:41,232 INFO L290 TraceCheckUtils]: 4: Hoare triple {38594#true} ~__retres1~0 := 0; {38594#true} is VALID [2022-02-20 19:58:41,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {38594#true} #res := ~__retres1~0; {38594#true} is VALID [2022-02-20 19:58:41,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {38594#true} assume true; {38594#true} is VALID [2022-02-20 19:58:41,233 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {38594#true} {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1880#return; {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:41,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:41,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:41,234 INFO L272 TraceCheckUtils]: 10: Hoare triple {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {38594#true} is VALID [2022-02-20 19:58:41,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {38594#true} havoc ~__retres1~1; {38594#true} is VALID [2022-02-20 19:58:41,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {38594#true} assume !(1 == ~c_dr_pc~0); {38594#true} is VALID [2022-02-20 19:58:41,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {38594#true} ~__retres1~1 := 0; {38594#true} is VALID [2022-02-20 19:58:41,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {38594#true} #res := ~__retres1~1; {38594#true} is VALID [2022-02-20 19:58:41,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {38594#true} assume true; {38594#true} is VALID [2022-02-20 19:58:41,235 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38594#true} {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1882#return; {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:41,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:41,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:41,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:41,236 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {38599#(= ~p_dw_st~0 0)} #1888#return; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {38635#(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); {38594#true} is VALID [2022-02-20 19:58:41,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {38594#true} assume !(1 == ~q_write_ev~0); {38594#true} is VALID [2022-02-20 19:58:41,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {38594#true} assume true; {38594#true} is VALID [2022-02-20 19:58:41,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38594#true} {38599#(= ~p_dw_st~0 0)} #1890#return; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:41,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {38594#true} havoc ~__retres1~2; {38594#true} is VALID [2022-02-20 19:58:41,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {38594#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {38599#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {38599#(= ~p_dw_st~0 0)} assume true; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,255 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {38599#(= ~p_dw_st~0 0)} {38599#(= ~p_dw_st~0 0)} #1892#return; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {38594#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~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;~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;~t11_pc~0 := 0;~t12_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;~t11_st~0 := 0;~t12_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;~t11_i~0 := 0;~t12_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;~T11_E~0 := 2;~T12_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;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {38594#true} is VALID [2022-02-20 19:58:41,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {38594#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {38594#true} is VALID [2022-02-20 19:58:41,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {38594#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#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;~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; {38594#true} is VALID [2022-02-20 19:58:41,255 INFO L290 TraceCheckUtils]: 3: Hoare triple {38594#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {38594#true} is VALID [2022-02-20 19:58:41,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {38594#true} call update_channels1(); {38634#(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 19:58:41,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {38634#(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); {38594#true} is VALID [2022-02-20 19:58:41,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {38594#true} assume true; {38594#true} is VALID [2022-02-20 19:58:41,256 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {38594#true} {38594#true} #1884#return; {38594#true} is VALID [2022-02-20 19:58:41,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {38594#true} assume { :begin_inline_init_threads1 } true; {38594#true} is VALID [2022-02-20 19:58:41,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {38594#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {38599#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {38599#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,268 INFO L272 TraceCheckUtils]: 12: Hoare triple {38599#(= ~p_dw_st~0 0)} call fire_delta_events1(); {38635#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:41,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {38635#(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); {38594#true} is VALID [2022-02-20 19:58:41,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {38594#true} assume !(0 == ~q_write_ev~0); {38594#true} is VALID [2022-02-20 19:58:41,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {38594#true} assume true; {38594#true} is VALID [2022-02-20 19:58:41,278 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38594#true} {38599#(= ~p_dw_st~0 0)} #1886#return; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,278 INFO L272 TraceCheckUtils]: 17: Hoare triple {38599#(= ~p_dw_st~0 0)} call activate_threads1(); {38636#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:41,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {38636#(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; {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:41,279 INFO L272 TraceCheckUtils]: 19: Hoare triple {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {38594#true} is VALID [2022-02-20 19:58:41,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {38594#true} havoc ~__retres1~0; {38594#true} is VALID [2022-02-20 19:58:41,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {38594#true} assume !(1 == ~p_dw_pc~0); {38594#true} is VALID [2022-02-20 19:58:41,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {38594#true} ~__retres1~0 := 0; {38594#true} is VALID [2022-02-20 19:58:41,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {38594#true} #res := ~__retres1~0; {38594#true} is VALID [2022-02-20 19:58:41,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {38594#true} assume true; {38594#true} is VALID [2022-02-20 19:58:41,280 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {38594#true} {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1880#return; {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:41,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:41,281 INFO L290 TraceCheckUtils]: 27: Hoare triple {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:41,281 INFO L272 TraceCheckUtils]: 28: Hoare triple {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {38594#true} is VALID [2022-02-20 19:58:41,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {38594#true} havoc ~__retres1~1; {38594#true} is VALID [2022-02-20 19:58:41,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {38594#true} assume !(1 == ~c_dr_pc~0); {38594#true} is VALID [2022-02-20 19:58:41,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {38594#true} ~__retres1~1 := 0; {38594#true} is VALID [2022-02-20 19:58:41,281 INFO L290 TraceCheckUtils]: 32: Hoare triple {38594#true} #res := ~__retres1~1; {38594#true} is VALID [2022-02-20 19:58:41,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {38594#true} assume true; {38594#true} is VALID [2022-02-20 19:58:41,281 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {38594#true} {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1882#return; {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:41,282 INFO L290 TraceCheckUtils]: 35: Hoare triple {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:41,282 INFO L290 TraceCheckUtils]: 36: Hoare triple {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:41,282 INFO L290 TraceCheckUtils]: 37: Hoare triple {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:41,283 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {38637#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {38599#(= ~p_dw_st~0 0)} #1888#return; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,283 INFO L272 TraceCheckUtils]: 39: Hoare triple {38599#(= ~p_dw_st~0 0)} call reset_delta_events1(); {38635#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:41,283 INFO L290 TraceCheckUtils]: 40: Hoare triple {38635#(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); {38594#true} is VALID [2022-02-20 19:58:41,283 INFO L290 TraceCheckUtils]: 41: Hoare triple {38594#true} assume !(1 == ~q_write_ev~0); {38594#true} is VALID [2022-02-20 19:58:41,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {38594#true} assume true; {38594#true} is VALID [2022-02-20 19:58:41,284 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {38594#true} {38599#(= ~p_dw_st~0 0)} #1890#return; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,284 INFO L290 TraceCheckUtils]: 44: Hoare triple {38599#(= ~p_dw_st~0 0)} assume !false; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,284 INFO L290 TraceCheckUtils]: 45: Hoare triple {38599#(= ~p_dw_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; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,284 INFO L290 TraceCheckUtils]: 46: Hoare triple {38599#(= ~p_dw_st~0 0)} assume !false; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,285 INFO L272 TraceCheckUtils]: 47: Hoare triple {38599#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {38594#true} is VALID [2022-02-20 19:58:41,285 INFO L290 TraceCheckUtils]: 48: Hoare triple {38594#true} havoc ~__retres1~2; {38594#true} is VALID [2022-02-20 19:58:41,285 INFO L290 TraceCheckUtils]: 49: Hoare triple {38594#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,285 INFO L290 TraceCheckUtils]: 50: Hoare triple {38599#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,285 INFO L290 TraceCheckUtils]: 51: Hoare triple {38599#(= ~p_dw_st~0 0)} assume true; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,286 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {38599#(= ~p_dw_st~0 0)} {38599#(= ~p_dw_st~0 0)} #1892#return; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,286 INFO L290 TraceCheckUtils]: 53: Hoare triple {38599#(= ~p_dw_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; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,286 INFO L290 TraceCheckUtils]: 54: Hoare triple {38599#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {38599#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:41,287 INFO L290 TraceCheckUtils]: 55: Hoare triple {38599#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {38595#false} is VALID [2022-02-20 19:58:41,287 INFO L290 TraceCheckUtils]: 56: Hoare triple {38595#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; {38595#false} is VALID [2022-02-20 19:58:41,287 INFO L290 TraceCheckUtils]: 57: Hoare triple {38595#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; {38595#false} is VALID [2022-02-20 19:58:41,287 INFO L290 TraceCheckUtils]: 58: Hoare triple {38595#false} assume 0 == ~c_dr_pc~0; {38595#false} is VALID [2022-02-20 19:58:41,287 INFO L290 TraceCheckUtils]: 59: Hoare triple {38595#false} assume !false; {38595#false} is VALID [2022-02-20 19:58:41,287 INFO L290 TraceCheckUtils]: 60: Hoare triple {38595#false} assume !(1 == ~q_free~0); {38595#false} is VALID [2022-02-20 19:58:41,287 INFO L290 TraceCheckUtils]: 61: Hoare triple {38595#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; {38595#false} is VALID [2022-02-20 19:58:41,287 INFO L290 TraceCheckUtils]: 62: Hoare triple {38595#false} assume !(~p_last_write~0 == ~c_last_read~0); {38595#false} is VALID [2022-02-20 19:58:41,287 INFO L272 TraceCheckUtils]: 63: Hoare triple {38595#false} call error1(); {38595#false} is VALID [2022-02-20 19:58:41,287 INFO L290 TraceCheckUtils]: 64: Hoare triple {38595#false} assume !false; {38595#false} is VALID [2022-02-20 19:58:41,287 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 19:58:41,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:41,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619800086] [2022-02-20 19:58:41,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619800086] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:41,288 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:41,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:41,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339875818] [2022-02-20 19:58:41,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:41,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:58:41,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:41,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:58:41,331 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 19:58:41,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:41,332 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:41,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:41,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:41,332 INFO L87 Difference]: Start difference. First operand 1543 states and 2077 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:58:43,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:43,871 INFO L93 Difference]: Finished difference Result 3882 states and 5038 transitions. [2022-02-20 19:58:43,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:43,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:58:43,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:43,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:58:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1000 transitions. [2022-02-20 19:58:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:58:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1000 transitions. [2022-02-20 19:58:43,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 1000 transitions. [2022-02-20 19:58:44,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1000 edges. 1000 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:44,857 INFO L225 Difference]: With dead ends: 3882 [2022-02-20 19:58:44,857 INFO L226 Difference]: Without dead ends: 2726 [2022-02-20 19:58:44,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:58:44,880 INFO L933 BasicCegarLoop]: 692 mSDtfsCounter, 1757 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1790 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:44,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1790 Valid, 1731 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:58:44,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2022-02-20 19:58:45,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 2606. [2022-02-20 19:58:45,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:45,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2726 states. Second operand has 2606 states, 2091 states have (on average 1.31324725011956) internal successors, (2746), 2126 states have internal predecessors, (2746), 263 states have call successors, (263), 205 states have call predecessors, (263), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) [2022-02-20 19:58:45,019 INFO L74 IsIncluded]: Start isIncluded. First operand 2726 states. Second operand has 2606 states, 2091 states have (on average 1.31324725011956) internal successors, (2746), 2126 states have internal predecessors, (2746), 263 states have call successors, (263), 205 states have call predecessors, (263), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) [2022-02-20 19:58:45,021 INFO L87 Difference]: Start difference. First operand 2726 states. Second operand has 2606 states, 2091 states have (on average 1.31324725011956) internal successors, (2746), 2126 states have internal predecessors, (2746), 263 states have call successors, (263), 205 states have call predecessors, (263), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) [2022-02-20 19:58:45,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:45,208 INFO L93 Difference]: Finished difference Result 2726 states and 3512 transitions. [2022-02-20 19:58:45,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3512 transitions. [2022-02-20 19:58:45,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:45,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:45,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 2606 states, 2091 states have (on average 1.31324725011956) internal successors, (2746), 2126 states have internal predecessors, (2746), 263 states have call successors, (263), 205 states have call predecessors, (263), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) Second operand 2726 states. [2022-02-20 19:58:45,218 INFO L87 Difference]: Start difference. First operand has 2606 states, 2091 states have (on average 1.31324725011956) internal successors, (2746), 2126 states have internal predecessors, (2746), 263 states have call successors, (263), 205 states have call predecessors, (263), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) Second operand 2726 states. [2022-02-20 19:58:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:45,409 INFO L93 Difference]: Finished difference Result 2726 states and 3512 transitions. [2022-02-20 19:58:45,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3512 transitions. [2022-02-20 19:58:45,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:45,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:45,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:45,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2606 states, 2091 states have (on average 1.31324725011956) internal successors, (2746), 2126 states have internal predecessors, (2746), 263 states have call successors, (263), 205 states have call predecessors, (263), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) [2022-02-20 19:58:45,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2606 states and 3379 transitions. [2022-02-20 19:58:45,697 INFO L78 Accepts]: Start accepts. Automaton has 2606 states and 3379 transitions. Word has length 65 [2022-02-20 19:58:45,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:45,698 INFO L470 AbstractCegarLoop]: Abstraction has 2606 states and 3379 transitions. [2022-02-20 19:58:45,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 19:58:45,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 3379 transitions. [2022-02-20 19:58:45,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:58:45,699 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:45,699 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 19:58:45,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:58:45,699 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:45,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:45,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1937549811, now seen corresponding path program 1 times [2022-02-20 19:58:45,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:45,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498109322] [2022-02-20 19:58:45,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:45,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:45,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:45,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {52858#(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); {52818#true} is VALID [2022-02-20 19:58:45,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {52818#true} assume true; {52818#true} is VALID [2022-02-20 19:58:45,761 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52818#true} {52820#(= ~q_free~0 1)} #1884#return; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:45,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {52859#(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); {52818#true} is VALID [2022-02-20 19:58:45,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {52818#true} assume !(0 == ~q_write_ev~0); {52818#true} is VALID [2022-02-20 19:58:45,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {52818#true} assume true; {52818#true} is VALID [2022-02-20 19:58:45,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52818#true} {52820#(= ~q_free~0 1)} #1886#return; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:45,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:45,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {52818#true} havoc ~__retres1~0; {52818#true} is VALID [2022-02-20 19:58:45,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {52818#true} assume !(1 == ~p_dw_pc~0); {52818#true} is VALID [2022-02-20 19:58:45,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {52818#true} ~__retres1~0 := 0; {52818#true} is VALID [2022-02-20 19:58:45,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {52818#true} #res := ~__retres1~0; {52818#true} is VALID [2022-02-20 19:58:45,780 INFO L290 TraceCheckUtils]: 4: Hoare triple {52818#true} assume true; {52818#true} is VALID [2022-02-20 19:58:45,780 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {52818#true} {52818#true} #1880#return; {52818#true} is VALID [2022-02-20 19:58:45,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:45,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {52818#true} havoc ~__retres1~1; {52818#true} is VALID [2022-02-20 19:58:45,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {52818#true} assume !(1 == ~c_dr_pc~0); {52818#true} is VALID [2022-02-20 19:58:45,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {52818#true} ~__retres1~1 := 0; {52818#true} is VALID [2022-02-20 19:58:45,792 INFO L290 TraceCheckUtils]: 3: Hoare triple {52818#true} #res := ~__retres1~1; {52818#true} is VALID [2022-02-20 19:58:45,792 INFO L290 TraceCheckUtils]: 4: Hoare triple {52818#true} assume true; {52818#true} is VALID [2022-02-20 19:58:45,792 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {52818#true} {52818#true} #1882#return; {52818#true} is VALID [2022-02-20 19:58:45,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {52860#(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; {52818#true} is VALID [2022-02-20 19:58:45,792 INFO L272 TraceCheckUtils]: 1: Hoare triple {52818#true} call #t~ret8 := is_do_write_p_triggered(); {52818#true} is VALID [2022-02-20 19:58:45,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {52818#true} havoc ~__retres1~0; {52818#true} is VALID [2022-02-20 19:58:45,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {52818#true} assume !(1 == ~p_dw_pc~0); {52818#true} is VALID [2022-02-20 19:58:45,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {52818#true} ~__retres1~0 := 0; {52818#true} is VALID [2022-02-20 19:58:45,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {52818#true} #res := ~__retres1~0; {52818#true} is VALID [2022-02-20 19:58:45,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {52818#true} assume true; {52818#true} is VALID [2022-02-20 19:58:45,793 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {52818#true} {52818#true} #1880#return; {52818#true} is VALID [2022-02-20 19:58:45,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {52818#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {52818#true} is VALID [2022-02-20 19:58:45,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {52818#true} assume !(0 != ~tmp~1); {52818#true} is VALID [2022-02-20 19:58:45,793 INFO L272 TraceCheckUtils]: 10: Hoare triple {52818#true} call #t~ret9 := is_do_read_c_triggered(); {52818#true} is VALID [2022-02-20 19:58:45,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {52818#true} havoc ~__retres1~1; {52818#true} is VALID [2022-02-20 19:58:45,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {52818#true} assume !(1 == ~c_dr_pc~0); {52818#true} is VALID [2022-02-20 19:58:45,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {52818#true} ~__retres1~1 := 0; {52818#true} is VALID [2022-02-20 19:58:45,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {52818#true} #res := ~__retres1~1; {52818#true} is VALID [2022-02-20 19:58:45,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {52818#true} assume true; {52818#true} is VALID [2022-02-20 19:58:45,794 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {52818#true} {52818#true} #1882#return; {52818#true} is VALID [2022-02-20 19:58:45,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {52818#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {52818#true} is VALID [2022-02-20 19:58:45,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {52818#true} assume !(0 != ~tmp___0~1); {52818#true} is VALID [2022-02-20 19:58:45,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {52818#true} assume true; {52818#true} is VALID [2022-02-20 19:58:45,795 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {52818#true} {52820#(= ~q_free~0 1)} #1888#return; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:45,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {52859#(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); {52818#true} is VALID [2022-02-20 19:58:45,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {52818#true} assume !(1 == ~q_write_ev~0); {52818#true} is VALID [2022-02-20 19:58:45,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {52818#true} assume true; {52818#true} is VALID [2022-02-20 19:58:45,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52818#true} {52820#(= ~q_free~0 1)} #1890#return; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:45,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {52818#true} havoc ~__retres1~2; {52818#true} is VALID [2022-02-20 19:58:45,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {52818#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {52818#true} is VALID [2022-02-20 19:58:45,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {52818#true} #res := ~__retres1~2; {52818#true} is VALID [2022-02-20 19:58:45,802 INFO L290 TraceCheckUtils]: 3: Hoare triple {52818#true} assume true; {52818#true} is VALID [2022-02-20 19:58:45,802 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {52818#true} {52820#(= ~q_free~0 1)} #1892#return; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {52818#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~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;~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;~t11_pc~0 := 0;~t12_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;~t11_st~0 := 0;~t12_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;~t11_i~0 := 0;~t12_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;~T11_E~0 := 2;~T12_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;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {52818#true} is VALID [2022-02-20 19:58:45,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {52818#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {52818#true} is VALID [2022-02-20 19:58:45,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {52818#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#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;~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; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,803 INFO L290 TraceCheckUtils]: 3: Hoare triple {52820#(= ~q_free~0 1)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {52820#(= ~q_free~0 1)} call update_channels1(); {52858#(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 19:58:45,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {52858#(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); {52818#true} is VALID [2022-02-20 19:58:45,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {52818#true} assume true; {52818#true} is VALID [2022-02-20 19:58:45,804 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {52818#true} {52820#(= ~q_free~0 1)} #1884#return; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {52820#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {52820#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {52820#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {52820#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,805 INFO L272 TraceCheckUtils]: 12: Hoare triple {52820#(= ~q_free~0 1)} call fire_delta_events1(); {52859#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:45,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {52859#(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); {52818#true} is VALID [2022-02-20 19:58:45,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {52818#true} assume !(0 == ~q_write_ev~0); {52818#true} is VALID [2022-02-20 19:58:45,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {52818#true} assume true; {52818#true} is VALID [2022-02-20 19:58:45,806 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {52818#true} {52820#(= ~q_free~0 1)} #1886#return; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,806 INFO L272 TraceCheckUtils]: 17: Hoare triple {52820#(= ~q_free~0 1)} call activate_threads1(); {52860#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:45,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {52860#(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; {52818#true} is VALID [2022-02-20 19:58:45,807 INFO L272 TraceCheckUtils]: 19: Hoare triple {52818#true} call #t~ret8 := is_do_write_p_triggered(); {52818#true} is VALID [2022-02-20 19:58:45,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {52818#true} havoc ~__retres1~0; {52818#true} is VALID [2022-02-20 19:58:45,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {52818#true} assume !(1 == ~p_dw_pc~0); {52818#true} is VALID [2022-02-20 19:58:45,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {52818#true} ~__retres1~0 := 0; {52818#true} is VALID [2022-02-20 19:58:45,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {52818#true} #res := ~__retres1~0; {52818#true} is VALID [2022-02-20 19:58:45,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {52818#true} assume true; {52818#true} is VALID [2022-02-20 19:58:45,807 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {52818#true} {52818#true} #1880#return; {52818#true} is VALID [2022-02-20 19:58:45,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {52818#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {52818#true} is VALID [2022-02-20 19:58:45,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {52818#true} assume !(0 != ~tmp~1); {52818#true} is VALID [2022-02-20 19:58:45,808 INFO L272 TraceCheckUtils]: 28: Hoare triple {52818#true} call #t~ret9 := is_do_read_c_triggered(); {52818#true} is VALID [2022-02-20 19:58:45,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {52818#true} havoc ~__retres1~1; {52818#true} is VALID [2022-02-20 19:58:45,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {52818#true} assume !(1 == ~c_dr_pc~0); {52818#true} is VALID [2022-02-20 19:58:45,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {52818#true} ~__retres1~1 := 0; {52818#true} is VALID [2022-02-20 19:58:45,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {52818#true} #res := ~__retres1~1; {52818#true} is VALID [2022-02-20 19:58:45,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {52818#true} assume true; {52818#true} is VALID [2022-02-20 19:58:45,808 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {52818#true} {52818#true} #1882#return; {52818#true} is VALID [2022-02-20 19:58:45,808 INFO L290 TraceCheckUtils]: 35: Hoare triple {52818#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {52818#true} is VALID [2022-02-20 19:58:45,808 INFO L290 TraceCheckUtils]: 36: Hoare triple {52818#true} assume !(0 != ~tmp___0~1); {52818#true} is VALID [2022-02-20 19:58:45,809 INFO L290 TraceCheckUtils]: 37: Hoare triple {52818#true} assume true; {52818#true} is VALID [2022-02-20 19:58:45,809 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {52818#true} {52820#(= ~q_free~0 1)} #1888#return; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,809 INFO L272 TraceCheckUtils]: 39: Hoare triple {52820#(= ~q_free~0 1)} call reset_delta_events1(); {52859#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:45,809 INFO L290 TraceCheckUtils]: 40: Hoare triple {52859#(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); {52818#true} is VALID [2022-02-20 19:58:45,809 INFO L290 TraceCheckUtils]: 41: Hoare triple {52818#true} assume !(1 == ~q_write_ev~0); {52818#true} is VALID [2022-02-20 19:58:45,810 INFO L290 TraceCheckUtils]: 42: Hoare triple {52818#true} assume true; {52818#true} is VALID [2022-02-20 19:58:45,810 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {52818#true} {52820#(= ~q_free~0 1)} #1890#return; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,810 INFO L290 TraceCheckUtils]: 44: Hoare triple {52820#(= ~q_free~0 1)} assume !false; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,810 INFO L290 TraceCheckUtils]: 45: Hoare triple {52820#(= ~q_free~0 1)} 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; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,811 INFO L290 TraceCheckUtils]: 46: Hoare triple {52820#(= ~q_free~0 1)} assume !false; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,811 INFO L272 TraceCheckUtils]: 47: Hoare triple {52820#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {52818#true} is VALID [2022-02-20 19:58:45,811 INFO L290 TraceCheckUtils]: 48: Hoare triple {52818#true} havoc ~__retres1~2; {52818#true} is VALID [2022-02-20 19:58:45,811 INFO L290 TraceCheckUtils]: 49: Hoare triple {52818#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {52818#true} is VALID [2022-02-20 19:58:45,811 INFO L290 TraceCheckUtils]: 50: Hoare triple {52818#true} #res := ~__retres1~2; {52818#true} is VALID [2022-02-20 19:58:45,811 INFO L290 TraceCheckUtils]: 51: Hoare triple {52818#true} assume true; {52818#true} is VALID [2022-02-20 19:58:45,812 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {52818#true} {52820#(= ~q_free~0 1)} #1892#return; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,812 INFO L290 TraceCheckUtils]: 53: Hoare triple {52820#(= ~q_free~0 1)} 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; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,812 INFO L290 TraceCheckUtils]: 54: Hoare triple {52820#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,812 INFO L290 TraceCheckUtils]: 55: Hoare triple {52820#(= ~q_free~0 1)} 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; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,813 INFO L290 TraceCheckUtils]: 56: Hoare triple {52820#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,813 INFO L290 TraceCheckUtils]: 57: Hoare triple {52820#(= ~q_free~0 1)} 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; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,813 INFO L290 TraceCheckUtils]: 58: Hoare triple {52820#(= ~q_free~0 1)} 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; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,813 INFO L290 TraceCheckUtils]: 59: Hoare triple {52820#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,814 INFO L290 TraceCheckUtils]: 60: Hoare triple {52820#(= ~q_free~0 1)} assume !false; {52820#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:45,814 INFO L290 TraceCheckUtils]: 61: Hoare triple {52820#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {52819#false} is VALID [2022-02-20 19:58:45,814 INFO L290 TraceCheckUtils]: 62: Hoare triple {52819#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; {52819#false} is VALID [2022-02-20 19:58:45,814 INFO L290 TraceCheckUtils]: 63: Hoare triple {52819#false} assume !(~p_last_write~0 == ~c_last_read~0); {52819#false} is VALID [2022-02-20 19:58:45,814 INFO L272 TraceCheckUtils]: 64: Hoare triple {52819#false} call error1(); {52819#false} is VALID [2022-02-20 19:58:45,814 INFO L290 TraceCheckUtils]: 65: Hoare triple {52819#false} assume !false; {52819#false} is VALID [2022-02-20 19:58:45,815 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 19:58:45,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:45,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498109322] [2022-02-20 19:58:45,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498109322] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:45,815 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:45,815 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:45,815 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030330824] [2022-02-20 19:58:45,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:45,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:45,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:45,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:45,854 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 19:58:45,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:45,854 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:45,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:45,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:45,855 INFO L87 Difference]: Start difference. First operand 2606 states and 3379 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:49,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:49,114 INFO L93 Difference]: Finished difference Result 5922 states and 7524 transitions. [2022-02-20 19:58:49,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:49,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:49,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:49,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 990 transitions. [2022-02-20 19:58:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:49,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 990 transitions. [2022-02-20 19:58:49,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 990 transitions. [2022-02-20 19:58:49,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 990 edges. 990 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:50,368 INFO L225 Difference]: With dead ends: 5922 [2022-02-20 19:58:50,368 INFO L226 Difference]: Without dead ends: 3708 [2022-02-20 19:58:50,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:58:50,371 INFO L933 BasicCegarLoop]: 721 mSDtfsCounter, 1184 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:50,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1193 Valid, 1710 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:58:50,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3708 states. [2022-02-20 19:58:50,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3708 to 3440. [2022-02-20 19:58:50,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:50,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3708 states. Second operand has 3440 states, 2739 states have (on average 1.2928075940124133) internal successors, (3541), 2779 states have internal predecessors, (3541), 355 states have call successors, (355), 285 states have call predecessors, (355), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) [2022-02-20 19:58:50,592 INFO L74 IsIncluded]: Start isIncluded. First operand 3708 states. Second operand has 3440 states, 2739 states have (on average 1.2928075940124133) internal successors, (3541), 2779 states have internal predecessors, (3541), 355 states have call successors, (355), 285 states have call predecessors, (355), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) [2022-02-20 19:58:50,596 INFO L87 Difference]: Start difference. First operand 3708 states. Second operand has 3440 states, 2739 states have (on average 1.2928075940124133) internal successors, (3541), 2779 states have internal predecessors, (3541), 355 states have call successors, (355), 285 states have call predecessors, (355), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) [2022-02-20 19:58:50,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:50,971 INFO L93 Difference]: Finished difference Result 3708 states and 4692 transitions. [2022-02-20 19:58:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3708 states and 4692 transitions. [2022-02-20 19:58:50,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:50,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:50,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 3440 states, 2739 states have (on average 1.2928075940124133) internal successors, (3541), 2779 states have internal predecessors, (3541), 355 states have call successors, (355), 285 states have call predecessors, (355), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) Second operand 3708 states. [2022-02-20 19:58:50,984 INFO L87 Difference]: Start difference. First operand has 3440 states, 2739 states have (on average 1.2928075940124133) internal successors, (3541), 2779 states have internal predecessors, (3541), 355 states have call successors, (355), 285 states have call predecessors, (355), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) Second operand 3708 states. [2022-02-20 19:58:51,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:51,362 INFO L93 Difference]: Finished difference Result 3708 states and 4692 transitions. [2022-02-20 19:58:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3708 states and 4692 transitions. [2022-02-20 19:58:51,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:51,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:51,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:51,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:51,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3440 states, 2739 states have (on average 1.2928075940124133) internal successors, (3541), 2779 states have internal predecessors, (3541), 355 states have call successors, (355), 285 states have call predecessors, (355), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) [2022-02-20 19:58:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3440 states to 3440 states and 4380 transitions. [2022-02-20 19:58:51,830 INFO L78 Accepts]: Start accepts. Automaton has 3440 states and 4380 transitions. Word has length 66 [2022-02-20 19:58:51,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:51,830 INFO L470 AbstractCegarLoop]: Abstraction has 3440 states and 4380 transitions. [2022-02-20 19:58:51,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:51,830 INFO L276 IsEmpty]: Start isEmpty. Operand 3440 states and 4380 transitions. [2022-02-20 19:58:51,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:58:51,831 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:51,831 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, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:51,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:58:51,832 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:51,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:51,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1977597300, now seen corresponding path program 1 times [2022-02-20 19:58:51,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:51,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744473510] [2022-02-20 19:58:51,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:51,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {72893#(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); {72853#true} is VALID [2022-02-20 19:58:51,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {72853#true} assume true; {72853#true} is VALID [2022-02-20 19:58:51,880 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {72853#true} {72855#(= ~p_dw_pc~0 0)} #1884#return; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {72894#(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); {72853#true} is VALID [2022-02-20 19:58:51,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {72853#true} assume !(0 == ~q_write_ev~0); {72853#true} is VALID [2022-02-20 19:58:51,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {72853#true} assume true; {72853#true} is VALID [2022-02-20 19:58:51,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72853#true} {72855#(= ~p_dw_pc~0 0)} #1886#return; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {72853#true} havoc ~__retres1~0; {72853#true} is VALID [2022-02-20 19:58:51,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {72853#true} assume !(1 == ~p_dw_pc~0); {72853#true} is VALID [2022-02-20 19:58:51,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {72853#true} ~__retres1~0 := 0; {72853#true} is VALID [2022-02-20 19:58:51,899 INFO L290 TraceCheckUtils]: 3: Hoare triple {72853#true} #res := ~__retres1~0; {72853#true} is VALID [2022-02-20 19:58:51,900 INFO L290 TraceCheckUtils]: 4: Hoare triple {72853#true} assume true; {72853#true} is VALID [2022-02-20 19:58:51,900 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {72853#true} {72853#true} #1880#return; {72853#true} is VALID [2022-02-20 19:58:51,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {72853#true} havoc ~__retres1~1; {72853#true} is VALID [2022-02-20 19:58:51,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {72853#true} assume !(1 == ~c_dr_pc~0); {72853#true} is VALID [2022-02-20 19:58:51,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {72853#true} ~__retres1~1 := 0; {72853#true} is VALID [2022-02-20 19:58:51,902 INFO L290 TraceCheckUtils]: 3: Hoare triple {72853#true} #res := ~__retres1~1; {72853#true} is VALID [2022-02-20 19:58:51,902 INFO L290 TraceCheckUtils]: 4: Hoare triple {72853#true} assume true; {72853#true} is VALID [2022-02-20 19:58:51,902 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {72853#true} {72853#true} #1882#return; {72853#true} is VALID [2022-02-20 19:58:51,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {72895#(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; {72853#true} is VALID [2022-02-20 19:58:51,902 INFO L272 TraceCheckUtils]: 1: Hoare triple {72853#true} call #t~ret8 := is_do_write_p_triggered(); {72853#true} is VALID [2022-02-20 19:58:51,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {72853#true} havoc ~__retres1~0; {72853#true} is VALID [2022-02-20 19:58:51,902 INFO L290 TraceCheckUtils]: 3: Hoare triple {72853#true} assume !(1 == ~p_dw_pc~0); {72853#true} is VALID [2022-02-20 19:58:51,903 INFO L290 TraceCheckUtils]: 4: Hoare triple {72853#true} ~__retres1~0 := 0; {72853#true} is VALID [2022-02-20 19:58:51,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {72853#true} #res := ~__retres1~0; {72853#true} is VALID [2022-02-20 19:58:51,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {72853#true} assume true; {72853#true} is VALID [2022-02-20 19:58:51,903 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {72853#true} {72853#true} #1880#return; {72853#true} is VALID [2022-02-20 19:58:51,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {72853#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {72853#true} is VALID [2022-02-20 19:58:51,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {72853#true} assume !(0 != ~tmp~1); {72853#true} is VALID [2022-02-20 19:58:51,903 INFO L272 TraceCheckUtils]: 10: Hoare triple {72853#true} call #t~ret9 := is_do_read_c_triggered(); {72853#true} is VALID [2022-02-20 19:58:51,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {72853#true} havoc ~__retres1~1; {72853#true} is VALID [2022-02-20 19:58:51,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {72853#true} assume !(1 == ~c_dr_pc~0); {72853#true} is VALID [2022-02-20 19:58:51,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {72853#true} ~__retres1~1 := 0; {72853#true} is VALID [2022-02-20 19:58:51,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {72853#true} #res := ~__retres1~1; {72853#true} is VALID [2022-02-20 19:58:51,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {72853#true} assume true; {72853#true} is VALID [2022-02-20 19:58:51,904 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {72853#true} {72853#true} #1882#return; {72853#true} is VALID [2022-02-20 19:58:51,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {72853#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {72853#true} is VALID [2022-02-20 19:58:51,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {72853#true} assume !(0 != ~tmp___0~1); {72853#true} is VALID [2022-02-20 19:58:51,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {72853#true} assume true; {72853#true} is VALID [2022-02-20 19:58:51,905 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {72853#true} {72855#(= ~p_dw_pc~0 0)} #1888#return; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {72894#(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); {72853#true} is VALID [2022-02-20 19:58:51,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {72853#true} assume !(1 == ~q_write_ev~0); {72853#true} is VALID [2022-02-20 19:58:51,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {72853#true} assume true; {72853#true} is VALID [2022-02-20 19:58:51,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72853#true} {72855#(= ~p_dw_pc~0 0)} #1890#return; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {72853#true} havoc ~__retres1~2; {72853#true} is VALID [2022-02-20 19:58:51,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {72853#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {72853#true} is VALID [2022-02-20 19:58:51,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {72853#true} #res := ~__retres1~2; {72853#true} is VALID [2022-02-20 19:58:51,911 INFO L290 TraceCheckUtils]: 3: Hoare triple {72853#true} assume true; {72853#true} is VALID [2022-02-20 19:58:51,911 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {72853#true} {72855#(= ~p_dw_pc~0 0)} #1892#return; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {72853#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~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;~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;~t11_pc~0 := 0;~t12_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;~t11_st~0 := 0;~t12_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;~t11_i~0 := 0;~t12_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;~T11_E~0 := 2;~T12_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;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {72853#true} is VALID [2022-02-20 19:58:51,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {72853#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {72853#true} is VALID [2022-02-20 19:58:51,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {72853#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#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;~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; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,912 INFO L290 TraceCheckUtils]: 3: Hoare triple {72855#(= ~p_dw_pc~0 0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {72855#(= ~p_dw_pc~0 0)} call update_channels1(); {72893#(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 19:58:51,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {72893#(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); {72853#true} is VALID [2022-02-20 19:58:51,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {72853#true} assume true; {72853#true} is VALID [2022-02-20 19:58:51,913 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {72853#true} {72855#(= ~p_dw_pc~0 0)} #1884#return; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {72855#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {72855#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {72855#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {72855#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,914 INFO L272 TraceCheckUtils]: 12: Hoare triple {72855#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {72894#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:51,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {72894#(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); {72853#true} is VALID [2022-02-20 19:58:51,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {72853#true} assume !(0 == ~q_write_ev~0); {72853#true} is VALID [2022-02-20 19:58:51,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {72853#true} assume true; {72853#true} is VALID [2022-02-20 19:58:51,915 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {72853#true} {72855#(= ~p_dw_pc~0 0)} #1886#return; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,915 INFO L272 TraceCheckUtils]: 17: Hoare triple {72855#(= ~p_dw_pc~0 0)} call activate_threads1(); {72895#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:51,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {72895#(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; {72853#true} is VALID [2022-02-20 19:58:51,916 INFO L272 TraceCheckUtils]: 19: Hoare triple {72853#true} call #t~ret8 := is_do_write_p_triggered(); {72853#true} is VALID [2022-02-20 19:58:51,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {72853#true} havoc ~__retres1~0; {72853#true} is VALID [2022-02-20 19:58:51,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {72853#true} assume !(1 == ~p_dw_pc~0); {72853#true} is VALID [2022-02-20 19:58:51,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {72853#true} ~__retres1~0 := 0; {72853#true} is VALID [2022-02-20 19:58:51,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {72853#true} #res := ~__retres1~0; {72853#true} is VALID [2022-02-20 19:58:51,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {72853#true} assume true; {72853#true} is VALID [2022-02-20 19:58:51,916 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {72853#true} {72853#true} #1880#return; {72853#true} is VALID [2022-02-20 19:58:51,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {72853#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {72853#true} is VALID [2022-02-20 19:58:51,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {72853#true} assume !(0 != ~tmp~1); {72853#true} is VALID [2022-02-20 19:58:51,917 INFO L272 TraceCheckUtils]: 28: Hoare triple {72853#true} call #t~ret9 := is_do_read_c_triggered(); {72853#true} is VALID [2022-02-20 19:58:51,917 INFO L290 TraceCheckUtils]: 29: Hoare triple {72853#true} havoc ~__retres1~1; {72853#true} is VALID [2022-02-20 19:58:51,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {72853#true} assume !(1 == ~c_dr_pc~0); {72853#true} is VALID [2022-02-20 19:58:51,917 INFO L290 TraceCheckUtils]: 31: Hoare triple {72853#true} ~__retres1~1 := 0; {72853#true} is VALID [2022-02-20 19:58:51,917 INFO L290 TraceCheckUtils]: 32: Hoare triple {72853#true} #res := ~__retres1~1; {72853#true} is VALID [2022-02-20 19:58:51,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {72853#true} assume true; {72853#true} is VALID [2022-02-20 19:58:51,917 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {72853#true} {72853#true} #1882#return; {72853#true} is VALID [2022-02-20 19:58:51,917 INFO L290 TraceCheckUtils]: 35: Hoare triple {72853#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {72853#true} is VALID [2022-02-20 19:58:51,917 INFO L290 TraceCheckUtils]: 36: Hoare triple {72853#true} assume !(0 != ~tmp___0~1); {72853#true} is VALID [2022-02-20 19:58:51,918 INFO L290 TraceCheckUtils]: 37: Hoare triple {72853#true} assume true; {72853#true} is VALID [2022-02-20 19:58:51,918 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {72853#true} {72855#(= ~p_dw_pc~0 0)} #1888#return; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,918 INFO L272 TraceCheckUtils]: 39: Hoare triple {72855#(= ~p_dw_pc~0 0)} call reset_delta_events1(); {72894#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:51,918 INFO L290 TraceCheckUtils]: 40: Hoare triple {72894#(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); {72853#true} is VALID [2022-02-20 19:58:51,918 INFO L290 TraceCheckUtils]: 41: Hoare triple {72853#true} assume !(1 == ~q_write_ev~0); {72853#true} is VALID [2022-02-20 19:58:51,919 INFO L290 TraceCheckUtils]: 42: Hoare triple {72853#true} assume true; {72853#true} is VALID [2022-02-20 19:58:51,919 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {72853#true} {72855#(= ~p_dw_pc~0 0)} #1890#return; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,919 INFO L290 TraceCheckUtils]: 44: Hoare triple {72855#(= ~p_dw_pc~0 0)} assume !false; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,919 INFO L290 TraceCheckUtils]: 45: Hoare triple {72855#(= ~p_dw_pc~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; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,920 INFO L290 TraceCheckUtils]: 46: Hoare triple {72855#(= ~p_dw_pc~0 0)} assume !false; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,920 INFO L272 TraceCheckUtils]: 47: Hoare triple {72855#(= ~p_dw_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {72853#true} is VALID [2022-02-20 19:58:51,920 INFO L290 TraceCheckUtils]: 48: Hoare triple {72853#true} havoc ~__retres1~2; {72853#true} is VALID [2022-02-20 19:58:51,920 INFO L290 TraceCheckUtils]: 49: Hoare triple {72853#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {72853#true} is VALID [2022-02-20 19:58:51,920 INFO L290 TraceCheckUtils]: 50: Hoare triple {72853#true} #res := ~__retres1~2; {72853#true} is VALID [2022-02-20 19:58:51,920 INFO L290 TraceCheckUtils]: 51: Hoare triple {72853#true} assume true; {72853#true} is VALID [2022-02-20 19:58:51,921 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {72853#true} {72855#(= ~p_dw_pc~0 0)} #1892#return; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,921 INFO L290 TraceCheckUtils]: 53: Hoare triple {72855#(= ~p_dw_pc~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; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,921 INFO L290 TraceCheckUtils]: 54: Hoare triple {72855#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,921 INFO L290 TraceCheckUtils]: 55: Hoare triple {72855#(= ~p_dw_pc~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; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,922 INFO L290 TraceCheckUtils]: 56: Hoare triple {72855#(= ~p_dw_pc~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; {72855#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:51,922 INFO L290 TraceCheckUtils]: 57: Hoare triple {72855#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {72854#false} is VALID [2022-02-20 19:58:51,922 INFO L290 TraceCheckUtils]: 58: Hoare triple {72854#false} assume 1 == ~p_dw_pc~0; {72854#false} is VALID [2022-02-20 19:58:51,922 INFO L290 TraceCheckUtils]: 59: Hoare triple {72854#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; {72854#false} is VALID [2022-02-20 19:58:51,922 INFO L290 TraceCheckUtils]: 60: Hoare triple {72854#false} assume !false; {72854#false} is VALID [2022-02-20 19:58:51,922 INFO L290 TraceCheckUtils]: 61: Hoare triple {72854#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {72854#false} is VALID [2022-02-20 19:58:51,922 INFO L290 TraceCheckUtils]: 62: Hoare triple {72854#false} assume { :end_inline_do_write_p } true; {72854#false} is VALID [2022-02-20 19:58:51,923 INFO L290 TraceCheckUtils]: 63: Hoare triple {72854#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; {72854#false} is VALID [2022-02-20 19:58:51,923 INFO L290 TraceCheckUtils]: 64: Hoare triple {72854#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; {72854#false} is VALID [2022-02-20 19:58:51,923 INFO L290 TraceCheckUtils]: 65: Hoare triple {72854#false} assume 0 == ~c_dr_pc~0; {72854#false} is VALID [2022-02-20 19:58:51,923 INFO L290 TraceCheckUtils]: 66: Hoare triple {72854#false} assume !false; {72854#false} is VALID [2022-02-20 19:58:51,923 INFO L290 TraceCheckUtils]: 67: Hoare triple {72854#false} assume !(1 == ~q_free~0); {72854#false} is VALID [2022-02-20 19:58:51,923 INFO L290 TraceCheckUtils]: 68: Hoare triple {72854#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; {72854#false} is VALID [2022-02-20 19:58:51,923 INFO L290 TraceCheckUtils]: 69: Hoare triple {72854#false} assume !(~p_last_write~0 == ~c_last_read~0); {72854#false} is VALID [2022-02-20 19:58:51,923 INFO L272 TraceCheckUtils]: 70: Hoare triple {72854#false} call error1(); {72854#false} is VALID [2022-02-20 19:58:51,923 INFO L290 TraceCheckUtils]: 71: Hoare triple {72854#false} assume !false; {72854#false} is VALID [2022-02-20 19:58:51,924 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 19:58:51,924 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:51,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744473510] [2022-02-20 19:58:51,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744473510] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:51,924 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:51,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:51,924 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885720403] [2022-02-20 19:58:51,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:51,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:58:51,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:51,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:51,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:51,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:51,968 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:51,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:51,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:51,968 INFO L87 Difference]: Start difference. First operand 3440 states and 4380 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:55,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:55,850 INFO L93 Difference]: Finished difference Result 7312 states and 9154 transitions. [2022-02-20 19:58:55,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:55,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:58:55,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:55,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 987 transitions. [2022-02-20 19:58:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 987 transitions. [2022-02-20 19:58:55,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 987 transitions. [2022-02-20 19:58:56,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 987 edges. 987 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:57,310 INFO L225 Difference]: With dead ends: 7312 [2022-02-20 19:58:57,310 INFO L226 Difference]: Without dead ends: 4262 [2022-02-20 19:58:57,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:58:57,314 INFO L933 BasicCegarLoop]: 738 mSDtfsCounter, 1371 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1405 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:57,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1405 Valid, 1790 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:58:57,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2022-02-20 19:58:57,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 3994. [2022-02-20 19:58:57,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:57,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4262 states. Second operand has 3994 states, 3179 states have (on average 1.2837370242214532) internal successors, (4081), 3223 states have internal predecessors, (4081), 411 states have call successors, (411), 335 states have call predecessors, (411), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) [2022-02-20 19:58:57,534 INFO L74 IsIncluded]: Start isIncluded. First operand 4262 states. Second operand has 3994 states, 3179 states have (on average 1.2837370242214532) internal successors, (4081), 3223 states have internal predecessors, (4081), 411 states have call successors, (411), 335 states have call predecessors, (411), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) [2022-02-20 19:58:57,537 INFO L87 Difference]: Start difference. First operand 4262 states. Second operand has 3994 states, 3179 states have (on average 1.2837370242214532) internal successors, (4081), 3223 states have internal predecessors, (4081), 411 states have call successors, (411), 335 states have call predecessors, (411), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) [2022-02-20 19:58:58,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:58,032 INFO L93 Difference]: Finished difference Result 4262 states and 5358 transitions. [2022-02-20 19:58:58,032 INFO L276 IsEmpty]: Start isEmpty. Operand 4262 states and 5358 transitions. [2022-02-20 19:58:58,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:58,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:58,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 3994 states, 3179 states have (on average 1.2837370242214532) internal successors, (4081), 3223 states have internal predecessors, (4081), 411 states have call successors, (411), 335 states have call predecessors, (411), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) Second operand 4262 states. [2022-02-20 19:58:58,048 INFO L87 Difference]: Start difference. First operand has 3994 states, 3179 states have (on average 1.2837370242214532) internal successors, (4081), 3223 states have internal predecessors, (4081), 411 states have call successors, (411), 335 states have call predecessors, (411), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) Second operand 4262 states. [2022-02-20 19:58:58,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:58,534 INFO L93 Difference]: Finished difference Result 4262 states and 5358 transitions. [2022-02-20 19:58:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 4262 states and 5358 transitions. [2022-02-20 19:58:58,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:58,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:58,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:58,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3994 states, 3179 states have (on average 1.2837370242214532) internal successors, (4081), 3223 states have internal predecessors, (4081), 411 states have call successors, (411), 335 states have call predecessors, (411), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) [2022-02-20 19:58:59,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3994 states to 3994 states and 5049 transitions. [2022-02-20 19:58:59,168 INFO L78 Accepts]: Start accepts. Automaton has 3994 states and 5049 transitions. Word has length 72 [2022-02-20 19:58:59,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:59,169 INFO L470 AbstractCegarLoop]: Abstraction has 3994 states and 5049 transitions. [2022-02-20 19:58:59,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3994 states and 5049 transitions. [2022-02-20 19:58:59,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:58:59,170 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:59,170 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:59,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:58:59,170 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:59,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:59,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1692903955, now seen corresponding path program 1 times [2022-02-20 19:58:59,171 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:59,171 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351398486] [2022-02-20 19:58:59,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:59,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:59,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:59,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {96659#(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); {96618#true} is VALID [2022-02-20 19:58:59,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {96618#true} assume true; {96618#true} is VALID [2022-02-20 19:58:59,220 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96618#true} {96618#true} #1884#return; {96618#true} is VALID [2022-02-20 19:58:59,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:59,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {96660#(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); {96618#true} is VALID [2022-02-20 19:58:59,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {96618#true} assume !(0 == ~q_write_ev~0); {96618#true} is VALID [2022-02-20 19:58:59,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {96618#true} assume true; {96618#true} is VALID [2022-02-20 19:58:59,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96618#true} {96618#true} #1886#return; {96618#true} is VALID [2022-02-20 19:58:59,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:59,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:59,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {96618#true} havoc ~__retres1~0; {96618#true} is VALID [2022-02-20 19:58:59,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {96618#true} assume !(1 == ~p_dw_pc~0); {96618#true} is VALID [2022-02-20 19:58:59,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {96618#true} ~__retres1~0 := 0; {96618#true} is VALID [2022-02-20 19:58:59,238 INFO L290 TraceCheckUtils]: 3: Hoare triple {96618#true} #res := ~__retres1~0; {96618#true} is VALID [2022-02-20 19:58:59,238 INFO L290 TraceCheckUtils]: 4: Hoare triple {96618#true} assume true; {96618#true} is VALID [2022-02-20 19:58:59,238 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {96618#true} {96618#true} #1880#return; {96618#true} is VALID [2022-02-20 19:58:59,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:59,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {96618#true} havoc ~__retres1~1; {96618#true} is VALID [2022-02-20 19:58:59,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {96618#true} assume !(1 == ~c_dr_pc~0); {96618#true} is VALID [2022-02-20 19:58:59,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {96618#true} ~__retres1~1 := 0; {96618#true} is VALID [2022-02-20 19:58:59,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {96618#true} #res := ~__retres1~1; {96618#true} is VALID [2022-02-20 19:58:59,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {96618#true} assume true; {96618#true} is VALID [2022-02-20 19:58:59,241 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {96618#true} {96618#true} #1882#return; {96618#true} is VALID [2022-02-20 19:58:59,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {96661#(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; {96618#true} is VALID [2022-02-20 19:58:59,242 INFO L272 TraceCheckUtils]: 1: Hoare triple {96618#true} call #t~ret8 := is_do_write_p_triggered(); {96618#true} is VALID [2022-02-20 19:58:59,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {96618#true} havoc ~__retres1~0; {96618#true} is VALID [2022-02-20 19:58:59,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {96618#true} assume !(1 == ~p_dw_pc~0); {96618#true} is VALID [2022-02-20 19:58:59,242 INFO L290 TraceCheckUtils]: 4: Hoare triple {96618#true} ~__retres1~0 := 0; {96618#true} is VALID [2022-02-20 19:58:59,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {96618#true} #res := ~__retres1~0; {96618#true} is VALID [2022-02-20 19:58:59,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {96618#true} assume true; {96618#true} is VALID [2022-02-20 19:58:59,243 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {96618#true} {96618#true} #1880#return; {96618#true} is VALID [2022-02-20 19:58:59,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {96618#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {96618#true} is VALID [2022-02-20 19:58:59,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {96618#true} assume !(0 != ~tmp~1); {96618#true} is VALID [2022-02-20 19:58:59,243 INFO L272 TraceCheckUtils]: 10: Hoare triple {96618#true} call #t~ret9 := is_do_read_c_triggered(); {96618#true} is VALID [2022-02-20 19:58:59,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {96618#true} havoc ~__retres1~1; {96618#true} is VALID [2022-02-20 19:58:59,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {96618#true} assume !(1 == ~c_dr_pc~0); {96618#true} is VALID [2022-02-20 19:58:59,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {96618#true} ~__retres1~1 := 0; {96618#true} is VALID [2022-02-20 19:58:59,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {96618#true} #res := ~__retres1~1; {96618#true} is VALID [2022-02-20 19:58:59,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {96618#true} assume true; {96618#true} is VALID [2022-02-20 19:58:59,244 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {96618#true} {96618#true} #1882#return; {96618#true} is VALID [2022-02-20 19:58:59,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {96618#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {96618#true} is VALID [2022-02-20 19:58:59,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {96618#true} assume !(0 != ~tmp___0~1); {96618#true} is VALID [2022-02-20 19:58:59,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {96618#true} assume true; {96618#true} is VALID [2022-02-20 19:58:59,244 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {96618#true} {96618#true} #1888#return; {96618#true} is VALID [2022-02-20 19:58:59,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:59,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {96660#(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); {96618#true} is VALID [2022-02-20 19:58:59,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {96618#true} assume !(1 == ~q_write_ev~0); {96618#true} is VALID [2022-02-20 19:58:59,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {96618#true} assume true; {96618#true} is VALID [2022-02-20 19:58:59,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96618#true} {96618#true} #1890#return; {96618#true} is VALID [2022-02-20 19:58:59,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:59,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {96618#true} havoc ~__retres1~2; {96618#true} is VALID [2022-02-20 19:58:59,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {96618#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {96618#true} is VALID [2022-02-20 19:58:59,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {96618#true} #res := ~__retres1~2; {96618#true} is VALID [2022-02-20 19:58:59,251 INFO L290 TraceCheckUtils]: 3: Hoare triple {96618#true} assume true; {96618#true} is VALID [2022-02-20 19:58:59,251 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {96618#true} {96618#true} #1892#return; {96618#true} is VALID [2022-02-20 19:58:59,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {96618#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~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;~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;~t11_pc~0 := 0;~t12_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;~t11_st~0 := 0;~t12_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;~t11_i~0 := 0;~t12_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;~T11_E~0 := 2;~T12_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;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {96618#true} is VALID [2022-02-20 19:58:59,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {96618#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {96618#true} is VALID [2022-02-20 19:58:59,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {96618#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#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;~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; {96618#true} is VALID [2022-02-20 19:58:59,252 INFO L290 TraceCheckUtils]: 3: Hoare triple {96618#true} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {96618#true} is VALID [2022-02-20 19:58:59,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {96618#true} call update_channels1(); {96659#(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 19:58:59,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {96659#(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); {96618#true} is VALID [2022-02-20 19:58:59,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {96618#true} assume true; {96618#true} is VALID [2022-02-20 19:58:59,252 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {96618#true} {96618#true} #1884#return; {96618#true} is VALID [2022-02-20 19:58:59,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {96618#true} assume { :begin_inline_init_threads1 } true; {96618#true} is VALID [2022-02-20 19:58:59,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {96618#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {96618#true} is VALID [2022-02-20 19:58:59,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {96618#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {96618#true} is VALID [2022-02-20 19:58:59,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {96618#true} assume { :end_inline_init_threads1 } true; {96618#true} is VALID [2022-02-20 19:58:59,253 INFO L272 TraceCheckUtils]: 12: Hoare triple {96618#true} call fire_delta_events1(); {96660#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:59,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {96660#(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); {96618#true} is VALID [2022-02-20 19:58:59,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {96618#true} assume !(0 == ~q_write_ev~0); {96618#true} is VALID [2022-02-20 19:58:59,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {96618#true} assume true; {96618#true} is VALID [2022-02-20 19:58:59,254 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {96618#true} {96618#true} #1886#return; {96618#true} is VALID [2022-02-20 19:58:59,254 INFO L272 TraceCheckUtils]: 17: Hoare triple {96618#true} call activate_threads1(); {96661#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:59,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {96661#(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; {96618#true} is VALID [2022-02-20 19:58:59,254 INFO L272 TraceCheckUtils]: 19: Hoare triple {96618#true} call #t~ret8 := is_do_write_p_triggered(); {96618#true} is VALID [2022-02-20 19:58:59,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {96618#true} havoc ~__retres1~0; {96618#true} is VALID [2022-02-20 19:58:59,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {96618#true} assume !(1 == ~p_dw_pc~0); {96618#true} is VALID [2022-02-20 19:58:59,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {96618#true} ~__retres1~0 := 0; {96618#true} is VALID [2022-02-20 19:58:59,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {96618#true} #res := ~__retres1~0; {96618#true} is VALID [2022-02-20 19:58:59,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {96618#true} assume true; {96618#true} is VALID [2022-02-20 19:58:59,255 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {96618#true} {96618#true} #1880#return; {96618#true} is VALID [2022-02-20 19:58:59,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {96618#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {96618#true} is VALID [2022-02-20 19:58:59,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {96618#true} assume !(0 != ~tmp~1); {96618#true} is VALID [2022-02-20 19:58:59,255 INFO L272 TraceCheckUtils]: 28: Hoare triple {96618#true} call #t~ret9 := is_do_read_c_triggered(); {96618#true} is VALID [2022-02-20 19:58:59,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {96618#true} havoc ~__retres1~1; {96618#true} is VALID [2022-02-20 19:58:59,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {96618#true} assume !(1 == ~c_dr_pc~0); {96618#true} is VALID [2022-02-20 19:58:59,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {96618#true} ~__retres1~1 := 0; {96618#true} is VALID [2022-02-20 19:58:59,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {96618#true} #res := ~__retres1~1; {96618#true} is VALID [2022-02-20 19:58:59,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {96618#true} assume true; {96618#true} is VALID [2022-02-20 19:58:59,256 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {96618#true} {96618#true} #1882#return; {96618#true} is VALID [2022-02-20 19:58:59,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {96618#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {96618#true} is VALID [2022-02-20 19:58:59,256 INFO L290 TraceCheckUtils]: 36: Hoare triple {96618#true} assume !(0 != ~tmp___0~1); {96618#true} is VALID [2022-02-20 19:58:59,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {96618#true} assume true; {96618#true} is VALID [2022-02-20 19:58:59,256 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {96618#true} {96618#true} #1888#return; {96618#true} is VALID [2022-02-20 19:58:59,256 INFO L272 TraceCheckUtils]: 39: Hoare triple {96618#true} call reset_delta_events1(); {96660#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:59,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {96660#(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); {96618#true} is VALID [2022-02-20 19:58:59,257 INFO L290 TraceCheckUtils]: 41: Hoare triple {96618#true} assume !(1 == ~q_write_ev~0); {96618#true} is VALID [2022-02-20 19:58:59,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {96618#true} assume true; {96618#true} is VALID [2022-02-20 19:58:59,257 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {96618#true} {96618#true} #1890#return; {96618#true} is VALID [2022-02-20 19:58:59,257 INFO L290 TraceCheckUtils]: 44: Hoare triple {96618#true} assume !false; {96618#true} is VALID [2022-02-20 19:58:59,257 INFO L290 TraceCheckUtils]: 45: Hoare triple {96618#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; {96618#true} is VALID [2022-02-20 19:58:59,257 INFO L290 TraceCheckUtils]: 46: Hoare triple {96618#true} assume !false; {96618#true} is VALID [2022-02-20 19:58:59,257 INFO L272 TraceCheckUtils]: 47: Hoare triple {96618#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {96618#true} is VALID [2022-02-20 19:58:59,257 INFO L290 TraceCheckUtils]: 48: Hoare triple {96618#true} havoc ~__retres1~2; {96618#true} is VALID [2022-02-20 19:58:59,257 INFO L290 TraceCheckUtils]: 49: Hoare triple {96618#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {96618#true} is VALID [2022-02-20 19:58:59,258 INFO L290 TraceCheckUtils]: 50: Hoare triple {96618#true} #res := ~__retres1~2; {96618#true} is VALID [2022-02-20 19:58:59,258 INFO L290 TraceCheckUtils]: 51: Hoare triple {96618#true} assume true; {96618#true} is VALID [2022-02-20 19:58:59,258 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {96618#true} {96618#true} #1892#return; {96618#true} is VALID [2022-02-20 19:58:59,258 INFO L290 TraceCheckUtils]: 53: Hoare triple {96618#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; {96618#true} is VALID [2022-02-20 19:58:59,258 INFO L290 TraceCheckUtils]: 54: Hoare triple {96618#true} assume 0 != eval1_~tmp___1~0#1; {96618#true} is VALID [2022-02-20 19:58:59,258 INFO L290 TraceCheckUtils]: 55: Hoare triple {96618#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; {96618#true} is VALID [2022-02-20 19:58:59,258 INFO L290 TraceCheckUtils]: 56: Hoare triple {96618#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; {96618#true} is VALID [2022-02-20 19:58:59,258 INFO L290 TraceCheckUtils]: 57: Hoare triple {96618#true} assume 0 == ~p_dw_pc~0; {96618#true} is VALID [2022-02-20 19:58:59,258 INFO L290 TraceCheckUtils]: 58: Hoare triple {96618#true} assume !false; {96618#true} is VALID [2022-02-20 19:58:59,259 INFO L290 TraceCheckUtils]: 59: Hoare triple {96618#true} assume !(0 == ~q_free~0); {96618#true} is VALID [2022-02-20 19:58:59,259 INFO L290 TraceCheckUtils]: 60: Hoare triple {96618#true} 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; {96657#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:59,259 INFO L290 TraceCheckUtils]: 61: Hoare triple {96657#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {96657#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:59,260 INFO L290 TraceCheckUtils]: 62: Hoare triple {96657#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {96657#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:59,260 INFO L290 TraceCheckUtils]: 63: Hoare triple {96657#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {96657#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:59,260 INFO L290 TraceCheckUtils]: 64: Hoare triple {96657#(= ~p_last_write~0 ~q_buf_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; {96657#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:59,260 INFO L290 TraceCheckUtils]: 65: Hoare triple {96657#(= ~p_last_write~0 ~q_buf_0~0)} 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; {96657#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:59,261 INFO L290 TraceCheckUtils]: 66: Hoare triple {96657#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {96657#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:59,261 INFO L290 TraceCheckUtils]: 67: Hoare triple {96657#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {96657#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:59,261 INFO L290 TraceCheckUtils]: 68: Hoare triple {96657#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {96657#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:59,262 INFO L290 TraceCheckUtils]: 69: Hoare triple {96657#(= ~p_last_write~0 ~q_buf_0~0)} 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; {96658#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:58:59,262 INFO L290 TraceCheckUtils]: 70: Hoare triple {96658#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {96619#false} is VALID [2022-02-20 19:58:59,262 INFO L272 TraceCheckUtils]: 71: Hoare triple {96619#false} call error1(); {96619#false} is VALID [2022-02-20 19:58:59,262 INFO L290 TraceCheckUtils]: 72: Hoare triple {96619#false} assume !false; {96619#false} is VALID [2022-02-20 19:58:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:59,263 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:59,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351398486] [2022-02-20 19:58:59,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351398486] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:59,263 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:59,263 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:59,263 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447230308] [2022-02-20 19:58:59,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:59,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:58:59,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:59,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:59,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:59,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:59,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:59,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:59,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:59,306 INFO L87 Difference]: Start difference. First operand 3994 states and 5049 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:59:02,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:02,620 INFO L93 Difference]: Finished difference Result 5080 states and 6344 transitions. [2022-02-20 19:59:02,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:02,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:59:02,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:59:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 870 transitions. [2022-02-20 19:59:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:59:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 870 transitions. [2022-02-20 19:59:02,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 870 transitions. [2022-02-20 19:59:03,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 870 edges. 870 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:04,256 INFO L225 Difference]: With dead ends: 5080 [2022-02-20 19:59:04,257 INFO L226 Difference]: Without dead ends: 5077 [2022-02-20 19:59:04,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:59:04,258 INFO L933 BasicCegarLoop]: 733 mSDtfsCounter, 2413 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2423 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:04,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2423 Valid, 1432 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:59:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5077 states. [2022-02-20 19:59:04,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5077 to 4456. [2022-02-20 19:59:04,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:04,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5077 states. Second operand has 4456 states, 3534 states have (on average 1.272495755517827) internal successors, (4497), 3581 states have internal predecessors, (4497), 461 states have call successors, (461), 379 states have call predecessors, (461), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) [2022-02-20 19:59:04,556 INFO L74 IsIncluded]: Start isIncluded. First operand 5077 states. Second operand has 4456 states, 3534 states have (on average 1.272495755517827) internal successors, (4497), 3581 states have internal predecessors, (4497), 461 states have call successors, (461), 379 states have call predecessors, (461), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) [2022-02-20 19:59:04,562 INFO L87 Difference]: Start difference. First operand 5077 states. Second operand has 4456 states, 3534 states have (on average 1.272495755517827) internal successors, (4497), 3581 states have internal predecessors, (4497), 461 states have call successors, (461), 379 states have call predecessors, (461), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) [2022-02-20 19:59:05,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:05,243 INFO L93 Difference]: Finished difference Result 5077 states and 6324 transitions. [2022-02-20 19:59:05,243 INFO L276 IsEmpty]: Start isEmpty. Operand 5077 states and 6324 transitions. [2022-02-20 19:59:05,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:05,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:05,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 4456 states, 3534 states have (on average 1.272495755517827) internal successors, (4497), 3581 states have internal predecessors, (4497), 461 states have call successors, (461), 379 states have call predecessors, (461), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) Second operand 5077 states. [2022-02-20 19:59:05,262 INFO L87 Difference]: Start difference. First operand has 4456 states, 3534 states have (on average 1.272495755517827) internal successors, (4497), 3581 states have internal predecessors, (4497), 461 states have call successors, (461), 379 states have call predecessors, (461), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) Second operand 5077 states. [2022-02-20 19:59:05,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:05,960 INFO L93 Difference]: Finished difference Result 5077 states and 6324 transitions. [2022-02-20 19:59:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 5077 states and 6324 transitions. [2022-02-20 19:59:05,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:05,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:05,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:05,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4456 states, 3534 states have (on average 1.272495755517827) internal successors, (4497), 3581 states have internal predecessors, (4497), 461 states have call successors, (461), 379 states have call predecessors, (461), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) [2022-02-20 19:59:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4456 states to 4456 states and 5592 transitions. [2022-02-20 19:59:06,853 INFO L78 Accepts]: Start accepts. Automaton has 4456 states and 5592 transitions. Word has length 73 [2022-02-20 19:59:06,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:06,853 INFO L470 AbstractCegarLoop]: Abstraction has 4456 states and 5592 transitions. [2022-02-20 19:59:06,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:59:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4456 states and 5592 transitions. [2022-02-20 19:59:06,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 19:59:06,854 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:06,854 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:59:06,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:59:06,854 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:06,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:06,855 INFO L85 PathProgramCache]: Analyzing trace with hash -941848842, now seen corresponding path program 1 times [2022-02-20 19:59:06,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:06,855 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294642362] [2022-02-20 19:59:06,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:06,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {119636#(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); {119594#true} is VALID [2022-02-20 19:59:06,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:06,954 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {119594#true} {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1884#return; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {119637#(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); {119594#true} is VALID [2022-02-20 19:59:06,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {119594#true} assume !(0 == ~q_write_ev~0); {119594#true} is VALID [2022-02-20 19:59:06,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:06,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119594#true} {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1886#return; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {119594#true} havoc ~__retres1~0; {119594#true} is VALID [2022-02-20 19:59:06,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {119594#true} assume !(1 == ~p_dw_pc~0); {119594#true} is VALID [2022-02-20 19:59:06,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {119594#true} ~__retres1~0 := 0; {119594#true} is VALID [2022-02-20 19:59:06,992 INFO L290 TraceCheckUtils]: 3: Hoare triple {119594#true} #res := ~__retres1~0; {119594#true} is VALID [2022-02-20 19:59:06,992 INFO L290 TraceCheckUtils]: 4: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:06,992 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {119594#true} {119594#true} #1880#return; {119594#true} is VALID [2022-02-20 19:59:06,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:06,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {119594#true} havoc ~__retres1~1; {119594#true} is VALID [2022-02-20 19:59:06,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {119594#true} assume !(1 == ~c_dr_pc~0); {119594#true} is VALID [2022-02-20 19:59:06,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {119594#true} ~__retres1~1 := 0; {119594#true} is VALID [2022-02-20 19:59:06,995 INFO L290 TraceCheckUtils]: 3: Hoare triple {119594#true} #res := ~__retres1~1; {119594#true} is VALID [2022-02-20 19:59:06,995 INFO L290 TraceCheckUtils]: 4: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:06,995 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {119594#true} {119594#true} #1882#return; {119594#true} is VALID [2022-02-20 19:59:06,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {119638#(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; {119594#true} is VALID [2022-02-20 19:59:06,995 INFO L272 TraceCheckUtils]: 1: Hoare triple {119594#true} call #t~ret8 := is_do_write_p_triggered(); {119594#true} is VALID [2022-02-20 19:59:06,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {119594#true} havoc ~__retres1~0; {119594#true} is VALID [2022-02-20 19:59:06,995 INFO L290 TraceCheckUtils]: 3: Hoare triple {119594#true} assume !(1 == ~p_dw_pc~0); {119594#true} is VALID [2022-02-20 19:59:06,996 INFO L290 TraceCheckUtils]: 4: Hoare triple {119594#true} ~__retres1~0 := 0; {119594#true} is VALID [2022-02-20 19:59:06,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {119594#true} #res := ~__retres1~0; {119594#true} is VALID [2022-02-20 19:59:06,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:06,996 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {119594#true} {119594#true} #1880#return; {119594#true} is VALID [2022-02-20 19:59:06,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {119594#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {119594#true} is VALID [2022-02-20 19:59:06,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {119594#true} assume !(0 != ~tmp~1); {119594#true} is VALID [2022-02-20 19:59:06,996 INFO L272 TraceCheckUtils]: 10: Hoare triple {119594#true} call #t~ret9 := is_do_read_c_triggered(); {119594#true} is VALID [2022-02-20 19:59:06,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {119594#true} havoc ~__retres1~1; {119594#true} is VALID [2022-02-20 19:59:06,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {119594#true} assume !(1 == ~c_dr_pc~0); {119594#true} is VALID [2022-02-20 19:59:06,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {119594#true} ~__retres1~1 := 0; {119594#true} is VALID [2022-02-20 19:59:06,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {119594#true} #res := ~__retres1~1; {119594#true} is VALID [2022-02-20 19:59:06,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:06,997 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {119594#true} {119594#true} #1882#return; {119594#true} is VALID [2022-02-20 19:59:06,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {119594#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {119594#true} is VALID [2022-02-20 19:59:06,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {119594#true} assume !(0 != ~tmp___0~1); {119594#true} is VALID [2022-02-20 19:59:06,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:06,998 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {119594#true} {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1888#return; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:06,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:07,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {119637#(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); {119594#true} is VALID [2022-02-20 19:59:07,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {119594#true} assume !(1 == ~q_write_ev~0); {119594#true} is VALID [2022-02-20 19:59:07,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:07,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119594#true} {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1890#return; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:07,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {119594#true} havoc ~__retres1~2; {119594#true} is VALID [2022-02-20 19:59:07,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {119594#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {119594#true} is VALID [2022-02-20 19:59:07,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {119594#true} #res := ~__retres1~2; {119594#true} is VALID [2022-02-20 19:59:07,004 INFO L290 TraceCheckUtils]: 3: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:07,005 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {119594#true} {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1892#return; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {119594#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~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;~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;~t11_pc~0 := 0;~t12_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;~t11_st~0 := 0;~t12_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;~t11_i~0 := 0;~t12_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;~T11_E~0 := 2;~T12_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;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {119594#true} is VALID [2022-02-20 19:59:07,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {119594#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {119594#true} is VALID [2022-02-20 19:59:07,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {119594#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#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;~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; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,020 INFO L290 TraceCheckUtils]: 3: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {119636#(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 19:59:07,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {119636#(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); {119594#true} is VALID [2022-02-20 19:59:07,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:07,021 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {119594#true} {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1884#return; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,023 INFO L272 TraceCheckUtils]: 12: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {119637#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:07,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {119637#(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); {119594#true} is VALID [2022-02-20 19:59:07,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {119594#true} assume !(0 == ~q_write_ev~0); {119594#true} is VALID [2022-02-20 19:59:07,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:07,023 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {119594#true} {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1886#return; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,024 INFO L272 TraceCheckUtils]: 17: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {119638#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:59:07,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {119638#(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; {119594#true} is VALID [2022-02-20 19:59:07,024 INFO L272 TraceCheckUtils]: 19: Hoare triple {119594#true} call #t~ret8 := is_do_write_p_triggered(); {119594#true} is VALID [2022-02-20 19:59:07,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {119594#true} havoc ~__retres1~0; {119594#true} is VALID [2022-02-20 19:59:07,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {119594#true} assume !(1 == ~p_dw_pc~0); {119594#true} is VALID [2022-02-20 19:59:07,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {119594#true} ~__retres1~0 := 0; {119594#true} is VALID [2022-02-20 19:59:07,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {119594#true} #res := ~__retres1~0; {119594#true} is VALID [2022-02-20 19:59:07,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:07,025 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {119594#true} {119594#true} #1880#return; {119594#true} is VALID [2022-02-20 19:59:07,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {119594#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {119594#true} is VALID [2022-02-20 19:59:07,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {119594#true} assume !(0 != ~tmp~1); {119594#true} is VALID [2022-02-20 19:59:07,025 INFO L272 TraceCheckUtils]: 28: Hoare triple {119594#true} call #t~ret9 := is_do_read_c_triggered(); {119594#true} is VALID [2022-02-20 19:59:07,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {119594#true} havoc ~__retres1~1; {119594#true} is VALID [2022-02-20 19:59:07,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {119594#true} assume !(1 == ~c_dr_pc~0); {119594#true} is VALID [2022-02-20 19:59:07,025 INFO L290 TraceCheckUtils]: 31: Hoare triple {119594#true} ~__retres1~1 := 0; {119594#true} is VALID [2022-02-20 19:59:07,025 INFO L290 TraceCheckUtils]: 32: Hoare triple {119594#true} #res := ~__retres1~1; {119594#true} is VALID [2022-02-20 19:59:07,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:07,026 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {119594#true} {119594#true} #1882#return; {119594#true} is VALID [2022-02-20 19:59:07,026 INFO L290 TraceCheckUtils]: 35: Hoare triple {119594#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {119594#true} is VALID [2022-02-20 19:59:07,026 INFO L290 TraceCheckUtils]: 36: Hoare triple {119594#true} assume !(0 != ~tmp___0~1); {119594#true} is VALID [2022-02-20 19:59:07,026 INFO L290 TraceCheckUtils]: 37: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:07,026 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {119594#true} {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1888#return; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,027 INFO L272 TraceCheckUtils]: 39: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {119637#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:59:07,027 INFO L290 TraceCheckUtils]: 40: Hoare triple {119637#(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); {119594#true} is VALID [2022-02-20 19:59:07,027 INFO L290 TraceCheckUtils]: 41: Hoare triple {119594#true} assume !(1 == ~q_write_ev~0); {119594#true} is VALID [2022-02-20 19:59:07,027 INFO L290 TraceCheckUtils]: 42: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:07,027 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {119594#true} {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1890#return; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,028 INFO L290 TraceCheckUtils]: 44: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,028 INFO L290 TraceCheckUtils]: 45: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,028 INFO L290 TraceCheckUtils]: 46: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,028 INFO L272 TraceCheckUtils]: 47: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {119594#true} is VALID [2022-02-20 19:59:07,029 INFO L290 TraceCheckUtils]: 48: Hoare triple {119594#true} havoc ~__retres1~2; {119594#true} is VALID [2022-02-20 19:59:07,029 INFO L290 TraceCheckUtils]: 49: Hoare triple {119594#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {119594#true} is VALID [2022-02-20 19:59:07,029 INFO L290 TraceCheckUtils]: 50: Hoare triple {119594#true} #res := ~__retres1~2; {119594#true} is VALID [2022-02-20 19:59:07,029 INFO L290 TraceCheckUtils]: 51: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:07,029 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {119594#true} {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1892#return; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,030 INFO L290 TraceCheckUtils]: 53: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,030 INFO L290 TraceCheckUtils]: 54: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,030 INFO L290 TraceCheckUtils]: 55: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,031 INFO L290 TraceCheckUtils]: 56: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,031 INFO L290 TraceCheckUtils]: 57: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,031 INFO L290 TraceCheckUtils]: 58: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,032 INFO L290 TraceCheckUtils]: 59: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,032 INFO L290 TraceCheckUtils]: 60: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} 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; {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:07,032 INFO L290 TraceCheckUtils]: 61: Hoare triple {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:07,033 INFO L290 TraceCheckUtils]: 62: Hoare triple {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:07,033 INFO L290 TraceCheckUtils]: 63: Hoare triple {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:07,033 INFO L290 TraceCheckUtils]: 64: Hoare triple {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~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; {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:07,034 INFO L290 TraceCheckUtils]: 65: Hoare triple {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} 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; {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:07,034 INFO L290 TraceCheckUtils]: 66: Hoare triple {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:07,034 INFO L290 TraceCheckUtils]: 67: Hoare triple {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:07,035 INFO L290 TraceCheckUtils]: 68: Hoare triple {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:07,035 INFO L290 TraceCheckUtils]: 69: Hoare triple {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} 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; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:07,035 INFO L290 TraceCheckUtils]: 70: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume ~p_last_write~0 == ~c_last_read~0; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:07,036 INFO L290 TraceCheckUtils]: 71: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(~p_num_write~0 == ~c_num_read~0); {119595#false} is VALID [2022-02-20 19:59:07,036 INFO L272 TraceCheckUtils]: 72: Hoare triple {119595#false} call error1(); {119595#false} is VALID [2022-02-20 19:59:07,036 INFO L290 TraceCheckUtils]: 73: Hoare triple {119595#false} assume !false; {119595#false} is VALID [2022-02-20 19:59:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:07,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:07,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294642362] [2022-02-20 19:59:07,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294642362] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:59:07,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37720224] [2022-02-20 19:59:07,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:07,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:59:07,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:07,039 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 19:59:07,055 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 19:59:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:07,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:59:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:07,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:07,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {119594#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~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;~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;~t11_pc~0 := 0;~t12_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;~t11_st~0 := 0;~t12_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;~t11_i~0 := 0;~t12_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;~T11_E~0 := 2;~T12_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;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {119594#true} is VALID [2022-02-20 19:59:07,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {119594#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {119594#true} is VALID [2022-02-20 19:59:07,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {119594#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#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;~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; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,773 INFO L290 TraceCheckUtils]: 3: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_req_up~0); {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,774 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1884#return; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,776 INFO L272 TraceCheckUtils]: 12: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_read_ev~0); {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_write_ev~0); {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,777 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1886#return; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,778 INFO L272 TraceCheckUtils]: 17: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~tmp~1;havoc ~tmp___0~1; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,778 INFO L272 TraceCheckUtils]: 19: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret8 := is_do_write_p_triggered(); {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~0; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~p_dw_pc~0); {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~0 := 0; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~0; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,781 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1880#return; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp~1); {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,782 INFO L272 TraceCheckUtils]: 28: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret9 := is_do_read_c_triggered(); {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,782 INFO L290 TraceCheckUtils]: 29: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~1; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,782 INFO L290 TraceCheckUtils]: 30: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~c_dr_pc~0); {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,783 INFO L290 TraceCheckUtils]: 31: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~1 := 0; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,783 INFO L290 TraceCheckUtils]: 32: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~1; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,783 INFO L290 TraceCheckUtils]: 33: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,784 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1882#return; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,784 INFO L290 TraceCheckUtils]: 35: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,785 INFO L290 TraceCheckUtils]: 36: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp___0~1); {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,785 INFO L290 TraceCheckUtils]: 37: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,785 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1888#return; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,786 INFO L272 TraceCheckUtils]: 39: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,786 INFO L290 TraceCheckUtils]: 40: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_read_ev~0); {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,786 INFO L290 TraceCheckUtils]: 41: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_write_ev~0); {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,787 INFO L290 TraceCheckUtils]: 42: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,787 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1890#return; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,787 INFO L290 TraceCheckUtils]: 44: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,788 INFO L290 TraceCheckUtils]: 45: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,788 INFO L290 TraceCheckUtils]: 46: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,788 INFO L272 TraceCheckUtils]: 47: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,789 INFO L290 TraceCheckUtils]: 48: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,789 INFO L290 TraceCheckUtils]: 49: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,789 INFO L290 TraceCheckUtils]: 50: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,790 INFO L290 TraceCheckUtils]: 51: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,790 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1892#return; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,790 INFO L290 TraceCheckUtils]: 53: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,791 INFO L290 TraceCheckUtils]: 54: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,791 INFO L290 TraceCheckUtils]: 55: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,792 INFO L290 TraceCheckUtils]: 56: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~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; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,792 INFO L290 TraceCheckUtils]: 57: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,792 INFO L290 TraceCheckUtils]: 58: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,793 INFO L290 TraceCheckUtils]: 59: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:07,793 INFO L290 TraceCheckUtils]: 60: Hoare triple {119596#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} 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; {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:07,793 INFO L290 TraceCheckUtils]: 61: Hoare triple {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:07,794 INFO L290 TraceCheckUtils]: 62: Hoare triple {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:07,794 INFO L290 TraceCheckUtils]: 63: Hoare triple {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:07,794 INFO L290 TraceCheckUtils]: 64: Hoare triple {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~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; {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:07,795 INFO L290 TraceCheckUtils]: 65: Hoare triple {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} 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; {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:07,795 INFO L290 TraceCheckUtils]: 66: Hoare triple {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:07,796 INFO L290 TraceCheckUtils]: 67: Hoare triple {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:07,796 INFO L290 TraceCheckUtils]: 68: Hoare triple {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:07,796 INFO L290 TraceCheckUtils]: 69: Hoare triple {119634#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} 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; {119861#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:07,797 INFO L290 TraceCheckUtils]: 70: Hoare triple {119861#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume ~p_last_write~0 == ~c_last_read~0; {119861#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:07,797 INFO L290 TraceCheckUtils]: 71: Hoare triple {119861#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(~p_num_write~0 == ~c_num_read~0); {119595#false} is VALID [2022-02-20 19:59:07,797 INFO L272 TraceCheckUtils]: 72: Hoare triple {119595#false} call error1(); {119595#false} is VALID [2022-02-20 19:59:07,797 INFO L290 TraceCheckUtils]: 73: Hoare triple {119595#false} assume !false; {119595#false} is VALID [2022-02-20 19:59:07,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:07,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:59:08,184 INFO L290 TraceCheckUtils]: 73: Hoare triple {119595#false} assume !false; {119595#false} is VALID [2022-02-20 19:59:08,184 INFO L272 TraceCheckUtils]: 72: Hoare triple {119595#false} call error1(); {119595#false} is VALID [2022-02-20 19:59:08,185 INFO L290 TraceCheckUtils]: 71: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(~p_num_write~0 == ~c_num_read~0); {119595#false} is VALID [2022-02-20 19:59:08,185 INFO L290 TraceCheckUtils]: 70: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume ~p_last_write~0 == ~c_last_read~0; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,186 INFO L290 TraceCheckUtils]: 69: Hoare triple {119886#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} 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; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,186 INFO L290 TraceCheckUtils]: 68: Hoare triple {119886#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !(1 == ~q_free~0); {119886#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:08,187 INFO L290 TraceCheckUtils]: 67: Hoare triple {119886#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {119886#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:08,187 INFO L290 TraceCheckUtils]: 66: Hoare triple {119886#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_pc~0; {119886#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:08,187 INFO L290 TraceCheckUtils]: 65: Hoare triple {119886#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} 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; {119886#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:08,188 INFO L290 TraceCheckUtils]: 64: Hoare triple {119886#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} 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; {119886#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:08,188 INFO L290 TraceCheckUtils]: 63: Hoare triple {119886#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume { :end_inline_do_write_p } true; {119886#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:08,189 INFO L290 TraceCheckUtils]: 62: Hoare triple {119886#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {119886#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:08,189 INFO L290 TraceCheckUtils]: 61: Hoare triple {119886#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {119886#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:08,190 INFO L290 TraceCheckUtils]: 60: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {119886#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:59:08,190 INFO L290 TraceCheckUtils]: 59: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(0 == ~q_free~0); {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,190 INFO L290 TraceCheckUtils]: 58: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,191 INFO L290 TraceCheckUtils]: 57: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_pc~0; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,191 INFO L290 TraceCheckUtils]: 56: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,192 INFO L290 TraceCheckUtils]: 55: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,192 INFO L290 TraceCheckUtils]: 54: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 != eval1_~tmp___1~0#1; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,192 INFO L290 TraceCheckUtils]: 53: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,193 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {119594#true} {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1892#return; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,193 INFO L290 TraceCheckUtils]: 51: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:08,193 INFO L290 TraceCheckUtils]: 50: Hoare triple {119594#true} #res := ~__retres1~2; {119594#true} is VALID [2022-02-20 19:59:08,193 INFO L290 TraceCheckUtils]: 49: Hoare triple {119594#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {119594#true} is VALID [2022-02-20 19:59:08,193 INFO L290 TraceCheckUtils]: 48: Hoare triple {119594#true} havoc ~__retres1~2; {119594#true} is VALID [2022-02-20 19:59:08,193 INFO L272 TraceCheckUtils]: 47: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {119594#true} is VALID [2022-02-20 19:59:08,194 INFO L290 TraceCheckUtils]: 46: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,194 INFO L290 TraceCheckUtils]: 45: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} 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; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,195 INFO L290 TraceCheckUtils]: 44: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,195 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {119594#true} {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1890#return; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,195 INFO L290 TraceCheckUtils]: 42: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:08,195 INFO L290 TraceCheckUtils]: 41: Hoare triple {119594#true} assume !(1 == ~q_write_ev~0); {119594#true} is VALID [2022-02-20 19:59:08,195 INFO L290 TraceCheckUtils]: 40: Hoare triple {119594#true} assume !(1 == ~q_read_ev~0); {119594#true} is VALID [2022-02-20 19:59:08,195 INFO L272 TraceCheckUtils]: 39: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call reset_delta_events1(); {119594#true} is VALID [2022-02-20 19:59:08,196 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {119594#true} {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1888#return; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,196 INFO L290 TraceCheckUtils]: 37: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:08,196 INFO L290 TraceCheckUtils]: 36: Hoare triple {119594#true} assume !(0 != ~tmp___0~1); {119594#true} is VALID [2022-02-20 19:59:08,196 INFO L290 TraceCheckUtils]: 35: Hoare triple {119594#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {119594#true} is VALID [2022-02-20 19:59:08,196 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {119594#true} {119594#true} #1882#return; {119594#true} is VALID [2022-02-20 19:59:08,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:08,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {119594#true} #res := ~__retres1~1; {119594#true} is VALID [2022-02-20 19:59:08,197 INFO L290 TraceCheckUtils]: 31: Hoare triple {119594#true} ~__retres1~1 := 0; {119594#true} is VALID [2022-02-20 19:59:08,197 INFO L290 TraceCheckUtils]: 30: Hoare triple {119594#true} assume !(1 == ~c_dr_pc~0); {119594#true} is VALID [2022-02-20 19:59:08,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {119594#true} havoc ~__retres1~1; {119594#true} is VALID [2022-02-20 19:59:08,197 INFO L272 TraceCheckUtils]: 28: Hoare triple {119594#true} call #t~ret9 := is_do_read_c_triggered(); {119594#true} is VALID [2022-02-20 19:59:08,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {119594#true} assume !(0 != ~tmp~1); {119594#true} is VALID [2022-02-20 19:59:08,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {119594#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {119594#true} is VALID [2022-02-20 19:59:08,197 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {119594#true} {119594#true} #1880#return; {119594#true} is VALID [2022-02-20 19:59:08,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:08,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {119594#true} #res := ~__retres1~0; {119594#true} is VALID [2022-02-20 19:59:08,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {119594#true} ~__retres1~0 := 0; {119594#true} is VALID [2022-02-20 19:59:08,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {119594#true} assume !(1 == ~p_dw_pc~0); {119594#true} is VALID [2022-02-20 19:59:08,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {119594#true} havoc ~__retres1~0; {119594#true} is VALID [2022-02-20 19:59:08,198 INFO L272 TraceCheckUtils]: 19: Hoare triple {119594#true} call #t~ret8 := is_do_write_p_triggered(); {119594#true} is VALID [2022-02-20 19:59:08,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {119594#true} havoc ~tmp~1;havoc ~tmp___0~1; {119594#true} is VALID [2022-02-20 19:59:08,198 INFO L272 TraceCheckUtils]: 17: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call activate_threads1(); {119594#true} is VALID [2022-02-20 19:59:08,199 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {119594#true} {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1886#return; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:08,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {119594#true} assume !(0 == ~q_write_ev~0); {119594#true} is VALID [2022-02-20 19:59:08,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {119594#true} assume !(0 == ~q_read_ev~0); {119594#true} is VALID [2022-02-20 19:59:08,199 INFO L272 TraceCheckUtils]: 12: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call fire_delta_events1(); {119594#true} is VALID [2022-02-20 19:59:08,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_threads1 } true; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :begin_inline_init_threads1 } true; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,201 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {119594#true} {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1884#return; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {119594#true} assume true; {119594#true} is VALID [2022-02-20 19:59:08,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {119594#true} assume !(1 == ~q_req_up~0); {119594#true} is VALID [2022-02-20 19:59:08,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call update_channels1(); {119594#true} is VALID [2022-02-20 19:59:08,201 INFO L290 TraceCheckUtils]: 3: Hoare triple {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {119594#true} assume 0 != main_#t~nondet50#1;havoc main_#t~nondet50#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;~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; {119635#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:59:08,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {119594#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet50#1, main_#t~ret51#1, main_#t~ret52#1;assume -2147483648 <= main_#t~nondet50#1 && main_#t~nondet50#1 <= 2147483647; {119594#true} is VALID [2022-02-20 19:59:08,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {119594#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~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;~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;~t11_pc~0 := 0;~t12_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;~t11_st~0 := 0;~t12_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;~t11_i~0 := 0;~t12_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;~T11_E~0 := 2;~T12_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;~E_11~0 := 2;~E_12~0 := 2;~token~0 := 0;~local~0 := 0; {119594#true} is VALID [2022-02-20 19:59:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:59:08,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37720224] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:59:08,203 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:59:08,203 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-02-20 19:59:08,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915604490] [2022-02-20 19:59:08,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:59:08,204 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-02-20 19:59:08,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:08,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:59:08,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:08,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:08,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:08,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:08,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:08,306 INFO L87 Difference]: Start difference. First operand 4456 states and 5592 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19)