./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.14.cil.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.14.cil.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 a6e26dc8018dcf216dd711848cc7425da3593cca9604197466413681bb8c438e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:58:27,322 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:58:27,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:58:27,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:58:27,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:58:27,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:58:27,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:58:27,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:58:27,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:58:27,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:58:27,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:58:27,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:58:27,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:58:27,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:58:27,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:58:27,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:58:27,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:58:27,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:58:27,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:58:27,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:58:27,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:58:27,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:58:27,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:58:27,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:58:27,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:58:27,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:58:27,388 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:58:27,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:58:27,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:58:27,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:58:27,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:58:27,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:58:27,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:58:27,407 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:58:27,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:58:27,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:58:27,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:58:27,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:58:27,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:58:27,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:58:27,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:58:27,412 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:27,436 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:58:27,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:58:27,437 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:58:27,437 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:58:27,438 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:58:27,438 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:58:27,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:58:27,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:58:27,439 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:58:27,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:58:27,439 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:58:27,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:58:27,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:58:27,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:58:27,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:58:27,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:58:27,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:58:27,441 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:58:27,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:58:27,441 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:58:27,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:58:27,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:58:27,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:58:27,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:58:27,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:27,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:58:27,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:58:27,444 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:58:27,444 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:58:27,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:58:27,444 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:58:27,444 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:58:27,444 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:58:27,445 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 -> a6e26dc8018dcf216dd711848cc7425da3593cca9604197466413681bb8c438e [2022-02-20 19:58:27,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:58:27,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:58:27,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:58:27,619 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:58:27,619 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:58:27,620 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.14.cil.c [2022-02-20 19:58:27,683 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cedaf7794/43e513f8471e4c3198ac4cc1d7bc85c2/FLAGfd0470eef [2022-02-20 19:58:28,077 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:58:28,078 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.14.cil.c [2022-02-20 19:58:28,089 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cedaf7794/43e513f8471e4c3198ac4cc1d7bc85c2/FLAGfd0470eef [2022-02-20 19:58:28,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cedaf7794/43e513f8471e4c3198ac4cc1d7bc85c2 [2022-02-20 19:58:28,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:58:28,475 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:58:28,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:28,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:58:28,485 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:58:28,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:28" (1/1) ... [2022-02-20 19:58:28,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68cd85eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:28, skipping insertion in model container [2022-02-20 19:58:28,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:58:28" (1/1) ... [2022-02-20 19:58:28,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:58:28,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:58:28,639 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.14.cil.c[914,927] [2022-02-20 19:58:28,684 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.14.cil.c[7115,7128] [2022-02-20 19:58:28,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:28,753 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:58:28,761 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.14.cil.c[914,927] [2022-02-20 19:58:28,772 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.14.cil.c[7115,7128] [2022-02-20 19:58:28,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:58:28,853 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:58:28,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:28 WrapperNode [2022-02-20 19:58:28,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:58:28,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:28,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:58:28,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:58:28,861 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:28" (1/1) ... [2022-02-20 19:58:28,884 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:28" (1/1) ... [2022-02-20 19:58:28,949 INFO L137 Inliner]: procedures = 77, calls = 94, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 1043 [2022-02-20 19:58:28,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:58:28,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:58:28,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:58:28,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:58:28,964 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:28" (1/1) ... [2022-02-20 19:58:28,964 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:28" (1/1) ... [2022-02-20 19:58:28,967 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:28" (1/1) ... [2022-02-20 19:58:28,968 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:28" (1/1) ... [2022-02-20 19:58:28,987 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:28" (1/1) ... [2022-02-20 19:58:29,012 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:28" (1/1) ... [2022-02-20 19:58:29,014 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:28" (1/1) ... [2022-02-20 19:58:29,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:58:29,018 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:58:29,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:58:29,018 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:58:29,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:28" (1/1) ... [2022-02-20 19:58:29,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:58:29,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:29,073 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:29,091 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:29,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:58:29,101 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:58:29,101 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:58:29,101 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:58:29,101 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:58:29,102 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:58:29,102 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:58:29,103 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:58:29,103 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:58:29,103 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:58:29,104 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:58:29,104 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:58:29,104 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:58:29,104 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:58:29,104 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:58:29,104 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:58:29,104 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:58:29,105 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:58:29,105 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:58:29,105 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:58:29,105 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:58:29,105 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:58:29,105 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:58:29,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:58:29,106 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:58:29,106 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:58:29,106 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:58:29,106 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:58:29,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:58:29,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:58:29,106 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:58:29,107 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:58:29,107 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:58:29,107 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:58:29,210 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:58:29,212 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:58:29,919 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:58:29,935 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:58:29,935 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2022-02-20 19:58:29,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:29 BoogieIcfgContainer [2022-02-20 19:58:29,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:58:29,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:58:29,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:58:29,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:58:29,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:58:28" (1/3) ... [2022-02-20 19:58:29,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b30db37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:29, skipping insertion in model container [2022-02-20 19:58:29,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:58:28" (2/3) ... [2022-02-20 19:58:29,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b30db37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:58:29, skipping insertion in model container [2022-02-20 19:58:29,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:58:29" (3/3) ... [2022-02-20 19:58:29,944 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.14.cil.c [2022-02-20 19:58:29,947 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:58:29,947 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:58:29,989 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:58:29,993 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:29,993 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:58:30,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 489 states, 429 states have (on average 1.6433566433566433) internal successors, (705), 437 states have internal predecessors, (705), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2022-02-20 19:58:30,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:30,033 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:30,034 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:30,034 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:30,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:30,038 INFO L85 PathProgramCache]: Analyzing trace with hash 956122995, now seen corresponding path program 1 times [2022-02-20 19:58:30,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:30,049 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27185479] [2022-02-20 19:58:30,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:30,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {532#(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); {533#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:30,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {533#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {533#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:30,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {533#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {494#(= ~q_read_ev~0 2)} #1901#return; {494#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:30,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {534#(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; {535#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:30,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {535#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {535#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:30,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {535#(= |old(~q_read_ev~0)| 0)} assume true; {535#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:30,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {535#(= |old(~q_read_ev~0)| 0)} {494#(= ~q_read_ev~0 2)} #1903#return; {493#false} is VALID [2022-02-20 19:58:30,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {492#true} havoc ~__retres1~0; {492#true} is VALID [2022-02-20 19:58:30,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {492#true} assume 1 == ~p_dw_pc~0; {492#true} is VALID [2022-02-20 19:58:30,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {492#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {492#true} is VALID [2022-02-20 19:58:30,368 INFO L290 TraceCheckUtils]: 3: Hoare triple {492#true} #res := ~__retres1~0; {492#true} is VALID [2022-02-20 19:58:30,368 INFO L290 TraceCheckUtils]: 4: Hoare triple {492#true} assume true; {492#true} is VALID [2022-02-20 19:58:30,368 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {492#true} {492#true} #1897#return; {492#true} is VALID [2022-02-20 19:58:30,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {492#true} havoc ~__retres1~1; {492#true} is VALID [2022-02-20 19:58:30,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {492#true} assume 1 == ~c_dr_pc~0; {492#true} is VALID [2022-02-20 19:58:30,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {492#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {492#true} is VALID [2022-02-20 19:58:30,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {492#true} #res := ~__retres1~1; {492#true} is VALID [2022-02-20 19:58:30,372 INFO L290 TraceCheckUtils]: 4: Hoare triple {492#true} assume true; {492#true} is VALID [2022-02-20 19:58:30,372 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {492#true} {492#true} #1899#return; {492#true} is VALID [2022-02-20 19:58:30,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {536#(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; {492#true} is VALID [2022-02-20 19:58:30,373 INFO L272 TraceCheckUtils]: 1: Hoare triple {492#true} call #t~ret8 := is_do_write_p_triggered(); {492#true} is VALID [2022-02-20 19:58:30,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {492#true} havoc ~__retres1~0; {492#true} is VALID [2022-02-20 19:58:30,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {492#true} assume 1 == ~p_dw_pc~0; {492#true} is VALID [2022-02-20 19:58:30,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {492#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {492#true} is VALID [2022-02-20 19:58:30,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {492#true} #res := ~__retres1~0; {492#true} is VALID [2022-02-20 19:58:30,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {492#true} assume true; {492#true} is VALID [2022-02-20 19:58:30,374 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {492#true} {492#true} #1897#return; {492#true} is VALID [2022-02-20 19:58:30,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {492#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {492#true} is VALID [2022-02-20 19:58:30,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {492#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {492#true} is VALID [2022-02-20 19:58:30,374 INFO L272 TraceCheckUtils]: 10: Hoare triple {492#true} call #t~ret9 := is_do_read_c_triggered(); {492#true} is VALID [2022-02-20 19:58:30,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {492#true} havoc ~__retres1~1; {492#true} is VALID [2022-02-20 19:58:30,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {492#true} assume 1 == ~c_dr_pc~0; {492#true} is VALID [2022-02-20 19:58:30,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {492#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {492#true} is VALID [2022-02-20 19:58:30,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {492#true} #res := ~__retres1~1; {492#true} is VALID [2022-02-20 19:58:30,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {492#true} assume true; {492#true} is VALID [2022-02-20 19:58:30,376 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {492#true} {492#true} #1899#return; {492#true} is VALID [2022-02-20 19:58:30,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {492#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {492#true} is VALID [2022-02-20 19:58:30,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {492#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {492#true} is VALID [2022-02-20 19:58:30,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {492#true} assume true; {492#true} is VALID [2022-02-20 19:58:30,376 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {492#true} {493#false} #1905#return; {493#false} is VALID [2022-02-20 19:58:30,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {534#(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; {492#true} is VALID [2022-02-20 19:58:30,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {492#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {492#true} is VALID [2022-02-20 19:58:30,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {492#true} assume true; {492#true} is VALID [2022-02-20 19:58:30,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {492#true} {493#false} #1907#return; {493#false} is VALID [2022-02-20 19:58:30,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {492#true} havoc ~__retres1~2; {492#true} is VALID [2022-02-20 19:58:30,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {492#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {492#true} is VALID [2022-02-20 19:58:30,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {492#true} #res := ~__retres1~2; {492#true} is VALID [2022-02-20 19:58:30,386 INFO L290 TraceCheckUtils]: 3: Hoare triple {492#true} assume true; {492#true} is VALID [2022-02-20 19:58:30,386 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {492#true} {493#false} #1909#return; {493#false} is VALID [2022-02-20 19:58:30,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {492#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; {492#true} is VALID [2022-02-20 19:58:30,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {492#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {492#true} is VALID [2022-02-20 19:58:30,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {492#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {494#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:30,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {494#(= ~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; {494#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:30,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {494#(= ~q_read_ev~0 2)} call update_channels1(); {532#(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:30,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {532#(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); {533#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:30,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {533#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {533#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:58:30,390 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {533#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {494#(= ~q_read_ev~0 2)} #1901#return; {494#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:30,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {494#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {494#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:30,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {494#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {494#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:30,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {494#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {494#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:30,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {494#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {494#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:58:30,393 INFO L272 TraceCheckUtils]: 12: Hoare triple {494#(= ~q_read_ev~0 2)} call fire_delta_events1(); {534#(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:30,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#(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; {535#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:30,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {535#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {535#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:30,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {535#(= |old(~q_read_ev~0)| 0)} assume true; {535#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:58:30,394 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {535#(= |old(~q_read_ev~0)| 0)} {494#(= ~q_read_ev~0 2)} #1903#return; {493#false} is VALID [2022-02-20 19:58:30,394 INFO L272 TraceCheckUtils]: 17: Hoare triple {493#false} call activate_threads1(); {536#(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:30,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {536#(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; {492#true} is VALID [2022-02-20 19:58:30,395 INFO L272 TraceCheckUtils]: 19: Hoare triple {492#true} call #t~ret8 := is_do_write_p_triggered(); {492#true} is VALID [2022-02-20 19:58:30,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {492#true} havoc ~__retres1~0; {492#true} is VALID [2022-02-20 19:58:30,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {492#true} assume 1 == ~p_dw_pc~0; {492#true} is VALID [2022-02-20 19:58:30,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {492#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {492#true} is VALID [2022-02-20 19:58:30,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {492#true} #res := ~__retres1~0; {492#true} is VALID [2022-02-20 19:58:30,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {492#true} assume true; {492#true} is VALID [2022-02-20 19:58:30,396 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {492#true} {492#true} #1897#return; {492#true} is VALID [2022-02-20 19:58:30,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {492#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {492#true} is VALID [2022-02-20 19:58:30,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {492#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {492#true} is VALID [2022-02-20 19:58:30,396 INFO L272 TraceCheckUtils]: 28: Hoare triple {492#true} call #t~ret9 := is_do_read_c_triggered(); {492#true} is VALID [2022-02-20 19:58:30,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {492#true} havoc ~__retres1~1; {492#true} is VALID [2022-02-20 19:58:30,397 INFO L290 TraceCheckUtils]: 30: Hoare triple {492#true} assume 1 == ~c_dr_pc~0; {492#true} is VALID [2022-02-20 19:58:30,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {492#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {492#true} is VALID [2022-02-20 19:58:30,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {492#true} #res := ~__retres1~1; {492#true} is VALID [2022-02-20 19:58:30,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {492#true} assume true; {492#true} is VALID [2022-02-20 19:58:30,397 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {492#true} {492#true} #1899#return; {492#true} is VALID [2022-02-20 19:58:30,398 INFO L290 TraceCheckUtils]: 35: Hoare triple {492#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {492#true} is VALID [2022-02-20 19:58:30,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {492#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {492#true} is VALID [2022-02-20 19:58:30,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {492#true} assume true; {492#true} is VALID [2022-02-20 19:58:30,398 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {492#true} {493#false} #1905#return; {493#false} is VALID [2022-02-20 19:58:30,398 INFO L272 TraceCheckUtils]: 39: Hoare triple {493#false} call reset_delta_events1(); {534#(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:30,398 INFO L290 TraceCheckUtils]: 40: Hoare triple {534#(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; {492#true} is VALID [2022-02-20 19:58:30,399 INFO L290 TraceCheckUtils]: 41: Hoare triple {492#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {492#true} is VALID [2022-02-20 19:58:30,399 INFO L290 TraceCheckUtils]: 42: Hoare triple {492#true} assume true; {492#true} is VALID [2022-02-20 19:58:30,399 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {492#true} {493#false} #1907#return; {493#false} is VALID [2022-02-20 19:58:30,399 INFO L290 TraceCheckUtils]: 44: Hoare triple {493#false} assume !false; {493#false} is VALID [2022-02-20 19:58:30,399 INFO L290 TraceCheckUtils]: 45: Hoare triple {493#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; {493#false} is VALID [2022-02-20 19:58:30,400 INFO L290 TraceCheckUtils]: 46: Hoare triple {493#false} assume !false; {493#false} is VALID [2022-02-20 19:58:30,400 INFO L272 TraceCheckUtils]: 47: Hoare triple {493#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {492#true} is VALID [2022-02-20 19:58:30,400 INFO L290 TraceCheckUtils]: 48: Hoare triple {492#true} havoc ~__retres1~2; {492#true} is VALID [2022-02-20 19:58:30,400 INFO L290 TraceCheckUtils]: 49: Hoare triple {492#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {492#true} is VALID [2022-02-20 19:58:30,400 INFO L290 TraceCheckUtils]: 50: Hoare triple {492#true} #res := ~__retres1~2; {492#true} is VALID [2022-02-20 19:58:30,400 INFO L290 TraceCheckUtils]: 51: Hoare triple {492#true} assume true; {492#true} is VALID [2022-02-20 19:58:30,401 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {492#true} {493#false} #1909#return; {493#false} is VALID [2022-02-20 19:58:30,401 INFO L290 TraceCheckUtils]: 53: Hoare triple {493#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; {493#false} is VALID [2022-02-20 19:58:30,401 INFO L290 TraceCheckUtils]: 54: Hoare triple {493#false} assume 0 != eval1_~tmp___1~0#1; {493#false} is VALID [2022-02-20 19:58:30,401 INFO L290 TraceCheckUtils]: 55: Hoare triple {493#false} assume !(0 == ~p_dw_st~0); {493#false} is VALID [2022-02-20 19:58:30,401 INFO L290 TraceCheckUtils]: 56: Hoare triple {493#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; {493#false} is VALID [2022-02-20 19:58:30,401 INFO L290 TraceCheckUtils]: 57: Hoare triple {493#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; {493#false} is VALID [2022-02-20 19:58:30,402 INFO L290 TraceCheckUtils]: 58: Hoare triple {493#false} assume !(0 == ~c_dr_pc~0); {493#false} is VALID [2022-02-20 19:58:30,402 INFO L290 TraceCheckUtils]: 59: Hoare triple {493#false} assume 1 == ~c_dr_pc~0; {493#false} is VALID [2022-02-20 19:58:30,402 INFO L290 TraceCheckUtils]: 60: Hoare triple {493#false} do_read_c_~a~0#1 := ~a_t~0; {493#false} is VALID [2022-02-20 19:58:30,402 INFO L290 TraceCheckUtils]: 61: Hoare triple {493#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; {493#false} is VALID [2022-02-20 19:58:30,402 INFO L290 TraceCheckUtils]: 62: Hoare triple {493#false} assume !(~p_last_write~0 == ~c_last_read~0); {493#false} is VALID [2022-02-20 19:58:30,403 INFO L272 TraceCheckUtils]: 63: Hoare triple {493#false} call error1(); {493#false} is VALID [2022-02-20 19:58:30,403 INFO L290 TraceCheckUtils]: 64: Hoare triple {493#false} assume !false; {493#false} is VALID [2022-02-20 19:58:30,403 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:30,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:30,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27185479] [2022-02-20 19:58:30,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27185479] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:30,405 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:30,405 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:30,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925719215] [2022-02-20 19:58:30,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:30,410 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:30,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:30,414 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:30,459 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:30,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:30,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:30,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:30,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:30,478 INFO L87 Difference]: Start difference. First operand has 489 states, 429 states have (on average 1.6433566433566433) internal successors, (705), 437 states have internal predecessors, (705), 42 states have call successors, (42), 15 states have call predecessors, (42), 15 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) 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:33,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:33,911 INFO L93 Difference]: Finished difference Result 1084 states and 1736 transitions. [2022-02-20 19:58:33,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:58:33,912 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:33,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:33,913 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:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1736 transitions. [2022-02-20 19:58:33,952 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:33,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1736 transitions. [2022-02-20 19:58:33,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1736 transitions. [2022-02-20 19:58:35,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1736 edges. 1736 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:35,161 INFO L225 Difference]: With dead ends: 1084 [2022-02-20 19:58:35,161 INFO L226 Difference]: Without dead ends: 613 [2022-02-20 19:58:35,169 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:35,173 INFO L933 BasicCegarLoop]: 751 mSDtfsCounter, 1209 mSDsluCounter, 1737 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:35,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1214 Valid, 2488 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:58:35,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2022-02-20 19:58:35,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 574. [2022-02-20 19:58:35,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:35,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 613 states. Second operand has 574 states, 497 states have (on average 1.529175050301811) internal successors, (760), 504 states have internal predecessors, (760), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:58:35,244 INFO L74 IsIncluded]: Start isIncluded. First operand 613 states. Second operand has 574 states, 497 states have (on average 1.529175050301811) internal successors, (760), 504 states have internal predecessors, (760), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:58:35,246 INFO L87 Difference]: Start difference. First operand 613 states. Second operand has 574 states, 497 states have (on average 1.529175050301811) internal successors, (760), 504 states have internal predecessors, (760), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:58:35,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:35,270 INFO L93 Difference]: Finished difference Result 613 states and 921 transitions. [2022-02-20 19:58:35,271 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 921 transitions. [2022-02-20 19:58:35,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:35,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:35,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 574 states, 497 states have (on average 1.529175050301811) internal successors, (760), 504 states have internal predecessors, (760), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) Second operand 613 states. [2022-02-20 19:58:35,278 INFO L87 Difference]: Start difference. First operand has 574 states, 497 states have (on average 1.529175050301811) internal successors, (760), 504 states have internal predecessors, (760), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) Second operand 613 states. [2022-02-20 19:58:35,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:35,299 INFO L93 Difference]: Finished difference Result 613 states and 921 transitions. [2022-02-20 19:58:35,299 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 921 transitions. [2022-02-20 19:58:35,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:35,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:35,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:35,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:35,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 497 states have (on average 1.529175050301811) internal successors, (760), 504 states have internal predecessors, (760), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2022-02-20 19:58:35,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 867 transitions. [2022-02-20 19:58:35,325 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 867 transitions. Word has length 65 [2022-02-20 19:58:35,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:35,326 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 867 transitions. [2022-02-20 19:58:35,326 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:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 867 transitions. [2022-02-20 19:58:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:35,328 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:35,328 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:35,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:58:35,328 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:35,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:35,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1359908946, now seen corresponding path program 1 times [2022-02-20 19:58:35,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:35,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288330661] [2022-02-20 19:58:35,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:35,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:35,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:35,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {4020#(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); {4021#(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:35,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {4021#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {4021#(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:35,418 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4021#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3982#(= ~q_write_ev~0 ~q_read_ev~0)} #1901#return; {3982#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:35,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:35,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {4021#(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); {4022#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:35,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {4022#(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; {4023#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:35,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {4023#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {4023#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:35,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4023#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3982#(= ~q_write_ev~0 ~q_read_ev~0)} #1903#return; {3981#false} is VALID [2022-02-20 19:58:35,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:35,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:35,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {3980#true} havoc ~__retres1~0; {3980#true} is VALID [2022-02-20 19:58:35,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {3980#true} assume !(1 == ~p_dw_pc~0); {3980#true} is VALID [2022-02-20 19:58:35,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {3980#true} ~__retres1~0 := 0; {3980#true} is VALID [2022-02-20 19:58:35,472 INFO L290 TraceCheckUtils]: 3: Hoare triple {3980#true} #res := ~__retres1~0; {3980#true} is VALID [2022-02-20 19:58:35,472 INFO L290 TraceCheckUtils]: 4: Hoare triple {3980#true} assume true; {3980#true} is VALID [2022-02-20 19:58:35,472 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3980#true} {3980#true} #1897#return; {3980#true} is VALID [2022-02-20 19:58:35,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:35,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {3980#true} havoc ~__retres1~1; {3980#true} is VALID [2022-02-20 19:58:35,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {3980#true} assume 1 == ~c_dr_pc~0; {3980#true} is VALID [2022-02-20 19:58:35,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {3980#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3980#true} is VALID [2022-02-20 19:58:35,475 INFO L290 TraceCheckUtils]: 3: Hoare triple {3980#true} #res := ~__retres1~1; {3980#true} is VALID [2022-02-20 19:58:35,475 INFO L290 TraceCheckUtils]: 4: Hoare triple {3980#true} assume true; {3980#true} is VALID [2022-02-20 19:58:35,476 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3980#true} {3980#true} #1899#return; {3980#true} is VALID [2022-02-20 19:58:35,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {4024#(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; {3980#true} is VALID [2022-02-20 19:58:35,476 INFO L272 TraceCheckUtils]: 1: Hoare triple {3980#true} call #t~ret8 := is_do_write_p_triggered(); {3980#true} is VALID [2022-02-20 19:58:35,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {3980#true} havoc ~__retres1~0; {3980#true} is VALID [2022-02-20 19:58:35,476 INFO L290 TraceCheckUtils]: 3: Hoare triple {3980#true} assume !(1 == ~p_dw_pc~0); {3980#true} is VALID [2022-02-20 19:58:35,476 INFO L290 TraceCheckUtils]: 4: Hoare triple {3980#true} ~__retres1~0 := 0; {3980#true} is VALID [2022-02-20 19:58:35,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {3980#true} #res := ~__retres1~0; {3980#true} is VALID [2022-02-20 19:58:35,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {3980#true} assume true; {3980#true} is VALID [2022-02-20 19:58:35,477 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3980#true} {3980#true} #1897#return; {3980#true} is VALID [2022-02-20 19:58:35,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {3980#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3980#true} is VALID [2022-02-20 19:58:35,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {3980#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3980#true} is VALID [2022-02-20 19:58:35,477 INFO L272 TraceCheckUtils]: 10: Hoare triple {3980#true} call #t~ret9 := is_do_read_c_triggered(); {3980#true} is VALID [2022-02-20 19:58:35,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {3980#true} havoc ~__retres1~1; {3980#true} is VALID [2022-02-20 19:58:35,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {3980#true} assume 1 == ~c_dr_pc~0; {3980#true} is VALID [2022-02-20 19:58:35,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {3980#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3980#true} is VALID [2022-02-20 19:58:35,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {3980#true} #res := ~__retres1~1; {3980#true} is VALID [2022-02-20 19:58:35,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {3980#true} assume true; {3980#true} is VALID [2022-02-20 19:58:35,478 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3980#true} {3980#true} #1899#return; {3980#true} is VALID [2022-02-20 19:58:35,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {3980#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3980#true} is VALID [2022-02-20 19:58:35,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {3980#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3980#true} is VALID [2022-02-20 19:58:35,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {3980#true} assume true; {3980#true} is VALID [2022-02-20 19:58:35,479 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3980#true} {3981#false} #1905#return; {3981#false} is VALID [2022-02-20 19:58:35,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:35,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {4021#(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); {3980#true} is VALID [2022-02-20 19:58:35,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {3980#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3980#true} is VALID [2022-02-20 19:58:35,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {3980#true} assume true; {3980#true} is VALID [2022-02-20 19:58:35,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3980#true} {3981#false} #1907#return; {3981#false} is VALID [2022-02-20 19:58:35,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:35,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {3980#true} havoc ~__retres1~2; {3980#true} is VALID [2022-02-20 19:58:35,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {3980#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3980#true} is VALID [2022-02-20 19:58:35,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {3980#true} #res := ~__retres1~2; {3980#true} is VALID [2022-02-20 19:58:35,486 INFO L290 TraceCheckUtils]: 3: Hoare triple {3980#true} assume true; {3980#true} is VALID [2022-02-20 19:58:35,486 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3980#true} {3981#false} #1909#return; {3981#false} is VALID [2022-02-20 19:58:35,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {3980#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; {3980#true} is VALID [2022-02-20 19:58:35,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {3980#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {3980#true} is VALID [2022-02-20 19:58:35,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {3980#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {3982#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:35,487 INFO L290 TraceCheckUtils]: 3: Hoare triple {3982#(= ~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; {3982#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:35,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {3982#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {4020#(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:35,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {4020#(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); {4021#(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:35,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {4021#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {4021#(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:35,489 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4021#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3982#(= ~q_write_ev~0 ~q_read_ev~0)} #1901#return; {3982#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:35,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {3982#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {3982#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:35,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {3982#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3982#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:35,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {3982#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3982#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:35,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {3982#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {3982#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:35,490 INFO L272 TraceCheckUtils]: 12: Hoare triple {3982#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {4021#(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:35,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {4021#(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); {4022#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:35,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {4022#(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; {4023#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:35,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {4023#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {4023#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:35,492 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4023#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3982#(= ~q_write_ev~0 ~q_read_ev~0)} #1903#return; {3981#false} is VALID [2022-02-20 19:58:35,492 INFO L272 TraceCheckUtils]: 17: Hoare triple {3981#false} call activate_threads1(); {4024#(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:35,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {4024#(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; {3980#true} is VALID [2022-02-20 19:58:35,492 INFO L272 TraceCheckUtils]: 19: Hoare triple {3980#true} call #t~ret8 := is_do_write_p_triggered(); {3980#true} is VALID [2022-02-20 19:58:35,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {3980#true} havoc ~__retres1~0; {3980#true} is VALID [2022-02-20 19:58:35,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {3980#true} assume !(1 == ~p_dw_pc~0); {3980#true} is VALID [2022-02-20 19:58:35,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {3980#true} ~__retres1~0 := 0; {3980#true} is VALID [2022-02-20 19:58:35,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {3980#true} #res := ~__retres1~0; {3980#true} is VALID [2022-02-20 19:58:35,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {3980#true} assume true; {3980#true} is VALID [2022-02-20 19:58:35,493 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3980#true} {3980#true} #1897#return; {3980#true} is VALID [2022-02-20 19:58:35,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {3980#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3980#true} is VALID [2022-02-20 19:58:35,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {3980#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3980#true} is VALID [2022-02-20 19:58:35,494 INFO L272 TraceCheckUtils]: 28: Hoare triple {3980#true} call #t~ret9 := is_do_read_c_triggered(); {3980#true} is VALID [2022-02-20 19:58:35,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {3980#true} havoc ~__retres1~1; {3980#true} is VALID [2022-02-20 19:58:35,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {3980#true} assume 1 == ~c_dr_pc~0; {3980#true} is VALID [2022-02-20 19:58:35,494 INFO L290 TraceCheckUtils]: 31: Hoare triple {3980#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {3980#true} is VALID [2022-02-20 19:58:35,494 INFO L290 TraceCheckUtils]: 32: Hoare triple {3980#true} #res := ~__retres1~1; {3980#true} is VALID [2022-02-20 19:58:35,494 INFO L290 TraceCheckUtils]: 33: Hoare triple {3980#true} assume true; {3980#true} is VALID [2022-02-20 19:58:35,494 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3980#true} {3980#true} #1899#return; {3980#true} is VALID [2022-02-20 19:58:35,494 INFO L290 TraceCheckUtils]: 35: Hoare triple {3980#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3980#true} is VALID [2022-02-20 19:58:35,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {3980#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3980#true} is VALID [2022-02-20 19:58:35,495 INFO L290 TraceCheckUtils]: 37: Hoare triple {3980#true} assume true; {3980#true} is VALID [2022-02-20 19:58:35,495 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3980#true} {3981#false} #1905#return; {3981#false} is VALID [2022-02-20 19:58:35,495 INFO L272 TraceCheckUtils]: 39: Hoare triple {3981#false} call reset_delta_events1(); {4021#(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:35,495 INFO L290 TraceCheckUtils]: 40: Hoare triple {4021#(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); {3980#true} is VALID [2022-02-20 19:58:35,495 INFO L290 TraceCheckUtils]: 41: Hoare triple {3980#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3980#true} is VALID [2022-02-20 19:58:35,495 INFO L290 TraceCheckUtils]: 42: Hoare triple {3980#true} assume true; {3980#true} is VALID [2022-02-20 19:58:35,496 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3980#true} {3981#false} #1907#return; {3981#false} is VALID [2022-02-20 19:58:35,496 INFO L290 TraceCheckUtils]: 44: Hoare triple {3981#false} assume !false; {3981#false} is VALID [2022-02-20 19:58:35,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {3981#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; {3981#false} is VALID [2022-02-20 19:58:35,496 INFO L290 TraceCheckUtils]: 46: Hoare triple {3981#false} assume !false; {3981#false} is VALID [2022-02-20 19:58:35,496 INFO L272 TraceCheckUtils]: 47: Hoare triple {3981#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3980#true} is VALID [2022-02-20 19:58:35,496 INFO L290 TraceCheckUtils]: 48: Hoare triple {3980#true} havoc ~__retres1~2; {3980#true} is VALID [2022-02-20 19:58:35,496 INFO L290 TraceCheckUtils]: 49: Hoare triple {3980#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3980#true} is VALID [2022-02-20 19:58:35,497 INFO L290 TraceCheckUtils]: 50: Hoare triple {3980#true} #res := ~__retres1~2; {3980#true} is VALID [2022-02-20 19:58:35,497 INFO L290 TraceCheckUtils]: 51: Hoare triple {3980#true} assume true; {3980#true} is VALID [2022-02-20 19:58:35,497 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3980#true} {3981#false} #1909#return; {3981#false} is VALID [2022-02-20 19:58:35,497 INFO L290 TraceCheckUtils]: 53: Hoare triple {3981#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; {3981#false} is VALID [2022-02-20 19:58:35,497 INFO L290 TraceCheckUtils]: 54: Hoare triple {3981#false} assume 0 != eval1_~tmp___1~0#1; {3981#false} is VALID [2022-02-20 19:58:35,497 INFO L290 TraceCheckUtils]: 55: Hoare triple {3981#false} assume !(0 == ~p_dw_st~0); {3981#false} is VALID [2022-02-20 19:58:35,497 INFO L290 TraceCheckUtils]: 56: Hoare triple {3981#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; {3981#false} is VALID [2022-02-20 19:58:35,498 INFO L290 TraceCheckUtils]: 57: Hoare triple {3981#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; {3981#false} is VALID [2022-02-20 19:58:35,498 INFO L290 TraceCheckUtils]: 58: Hoare triple {3981#false} assume !(0 == ~c_dr_pc~0); {3981#false} is VALID [2022-02-20 19:58:35,498 INFO L290 TraceCheckUtils]: 59: Hoare triple {3981#false} assume 1 == ~c_dr_pc~0; {3981#false} is VALID [2022-02-20 19:58:35,498 INFO L290 TraceCheckUtils]: 60: Hoare triple {3981#false} do_read_c_~a~0#1 := ~a_t~0; {3981#false} is VALID [2022-02-20 19:58:35,498 INFO L290 TraceCheckUtils]: 61: Hoare triple {3981#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; {3981#false} is VALID [2022-02-20 19:58:35,498 INFO L290 TraceCheckUtils]: 62: Hoare triple {3981#false} assume !(~p_last_write~0 == ~c_last_read~0); {3981#false} is VALID [2022-02-20 19:58:35,498 INFO L272 TraceCheckUtils]: 63: Hoare triple {3981#false} call error1(); {3981#false} is VALID [2022-02-20 19:58:35,498 INFO L290 TraceCheckUtils]: 64: Hoare triple {3981#false} assume !false; {3981#false} is VALID [2022-02-20 19:58:35,499 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:35,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:35,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288330661] [2022-02-20 19:58:35,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288330661] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:35,499 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:35,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:35,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811614829] [2022-02-20 19:58:35,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:35,501 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:35,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:35,501 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:35,535 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:35,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:35,536 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:35,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:35,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:35,537 INFO L87 Difference]: Start difference. First operand 574 states and 867 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:38,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:38,548 INFO L93 Difference]: Finished difference Result 921 states and 1344 transitions. [2022-02-20 19:58:38,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:38,549 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:38,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:38,549 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:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1073 transitions. [2022-02-20 19:58:38,556 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:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1073 transitions. [2022-02-20 19:58:38,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1073 transitions. [2022-02-20 19:58:39,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1073 edges. 1073 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:39,375 INFO L225 Difference]: With dead ends: 921 [2022-02-20 19:58:39,376 INFO L226 Difference]: Without dead ends: 744 [2022-02-20 19:58:39,376 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:39,377 INFO L933 BasicCegarLoop]: 783 mSDtfsCounter, 1830 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1861 SdHoareTripleChecker+Valid, 2345 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:39,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1861 Valid, 2345 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:58:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-02-20 19:58:39,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 670. [2022-02-20 19:58:39,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:39,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 744 states. Second operand has 670 states, 573 states have (on average 1.5078534031413613) internal successors, (864), 582 states have internal predecessors, (864), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:58:39,397 INFO L74 IsIncluded]: Start isIncluded. First operand 744 states. Second operand has 670 states, 573 states have (on average 1.5078534031413613) internal successors, (864), 582 states have internal predecessors, (864), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:58:39,399 INFO L87 Difference]: Start difference. First operand 744 states. Second operand has 670 states, 573 states have (on average 1.5078534031413613) internal successors, (864), 582 states have internal predecessors, (864), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:58:39,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:39,420 INFO L93 Difference]: Finished difference Result 744 states and 1104 transitions. [2022-02-20 19:58:39,420 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1104 transitions. [2022-02-20 19:58:39,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:39,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:39,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 670 states, 573 states have (on average 1.5078534031413613) internal successors, (864), 582 states have internal predecessors, (864), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) Second operand 744 states. [2022-02-20 19:58:39,425 INFO L87 Difference]: Start difference. First operand has 670 states, 573 states have (on average 1.5078534031413613) internal successors, (864), 582 states have internal predecessors, (864), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) Second operand 744 states. [2022-02-20 19:58:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:39,446 INFO L93 Difference]: Finished difference Result 744 states and 1104 transitions. [2022-02-20 19:58:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1104 transitions. [2022-02-20 19:58:39,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:39,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:39,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:39,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:39,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 573 states have (on average 1.5078534031413613) internal successors, (864), 582 states have internal predecessors, (864), 64 states have call successors, (64), 29 states have call predecessors, (64), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2022-02-20 19:58:39,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1001 transitions. [2022-02-20 19:58:39,471 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1001 transitions. Word has length 65 [2022-02-20 19:58:39,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:39,471 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 1001 transitions. [2022-02-20 19:58:39,472 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:39,472 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1001 transitions. [2022-02-20 19:58:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:39,473 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:39,473 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:39,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:58:39,473 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:39,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:39,474 INFO L85 PathProgramCache]: Analyzing trace with hash -668677164, now seen corresponding path program 1 times [2022-02-20 19:58:39,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:39,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692499359] [2022-02-20 19:58:39,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:39,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {7702#(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); {7663#true} is VALID [2022-02-20 19:58:39,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {7663#true} assume true; {7663#true} is VALID [2022-02-20 19:58:39,512 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7663#true} {7663#true} #1901#return; {7663#true} is VALID [2022-02-20 19:58:39,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {7703#(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); {7663#true} is VALID [2022-02-20 19:58:39,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {7663#true} assume !(0 == ~q_write_ev~0); {7663#true} is VALID [2022-02-20 19:58:39,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {7663#true} assume true; {7663#true} is VALID [2022-02-20 19:58:39,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7663#true} {7663#true} #1903#return; {7663#true} is VALID [2022-02-20 19:58:39,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {7663#true} havoc ~__retres1~0; {7663#true} is VALID [2022-02-20 19:58:39,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {7663#true} assume !(1 == ~p_dw_pc~0); {7663#true} is VALID [2022-02-20 19:58:39,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {7663#true} ~__retres1~0 := 0; {7719#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:39,589 INFO L290 TraceCheckUtils]: 3: Hoare triple {7719#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7720#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:39,590 INFO L290 TraceCheckUtils]: 4: Hoare triple {7720#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7720#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:39,590 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7720#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7663#true} #1897#return; {7711#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:39,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {7663#true} havoc ~__retres1~1; {7663#true} is VALID [2022-02-20 19:58:39,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {7663#true} assume 1 == ~c_dr_pc~0; {7663#true} is VALID [2022-02-20 19:58:39,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {7663#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7663#true} is VALID [2022-02-20 19:58:39,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {7663#true} #res := ~__retres1~1; {7663#true} is VALID [2022-02-20 19:58:39,599 INFO L290 TraceCheckUtils]: 4: Hoare triple {7663#true} assume true; {7663#true} is VALID [2022-02-20 19:58:39,599 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7663#true} {7664#false} #1899#return; {7664#false} is VALID [2022-02-20 19:58:39,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {7704#(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; {7663#true} is VALID [2022-02-20 19:58:39,600 INFO L272 TraceCheckUtils]: 1: Hoare triple {7663#true} call #t~ret8 := is_do_write_p_triggered(); {7663#true} is VALID [2022-02-20 19:58:39,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {7663#true} havoc ~__retres1~0; {7663#true} is VALID [2022-02-20 19:58:39,600 INFO L290 TraceCheckUtils]: 3: Hoare triple {7663#true} assume !(1 == ~p_dw_pc~0); {7663#true} is VALID [2022-02-20 19:58:39,600 INFO L290 TraceCheckUtils]: 4: Hoare triple {7663#true} ~__retres1~0 := 0; {7719#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:39,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {7719#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7720#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:39,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {7720#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7720#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:39,602 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7720#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7663#true} #1897#return; {7711#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:39,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {7711#(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; {7712#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:39,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {7712#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7664#false} is VALID [2022-02-20 19:58:39,603 INFO L272 TraceCheckUtils]: 10: Hoare triple {7664#false} call #t~ret9 := is_do_read_c_triggered(); {7663#true} is VALID [2022-02-20 19:58:39,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {7663#true} havoc ~__retres1~1; {7663#true} is VALID [2022-02-20 19:58:39,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {7663#true} assume 1 == ~c_dr_pc~0; {7663#true} is VALID [2022-02-20 19:58:39,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {7663#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7663#true} is VALID [2022-02-20 19:58:39,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {7663#true} #res := ~__retres1~1; {7663#true} is VALID [2022-02-20 19:58:39,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {7663#true} assume true; {7663#true} is VALID [2022-02-20 19:58:39,603 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7663#true} {7664#false} #1899#return; {7664#false} is VALID [2022-02-20 19:58:39,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {7664#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7664#false} is VALID [2022-02-20 19:58:39,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {7664#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7664#false} is VALID [2022-02-20 19:58:39,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {7664#false} assume true; {7664#false} is VALID [2022-02-20 19:58:39,604 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7664#false} {7663#true} #1905#return; {7664#false} is VALID [2022-02-20 19:58:39,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {7703#(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); {7663#true} is VALID [2022-02-20 19:58:39,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {7663#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7663#true} is VALID [2022-02-20 19:58:39,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {7663#true} assume true; {7663#true} is VALID [2022-02-20 19:58:39,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7663#true} {7664#false} #1907#return; {7664#false} is VALID [2022-02-20 19:58:39,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:39,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {7663#true} havoc ~__retres1~2; {7663#true} is VALID [2022-02-20 19:58:39,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {7663#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7663#true} is VALID [2022-02-20 19:58:39,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {7663#true} #res := ~__retres1~2; {7663#true} is VALID [2022-02-20 19:58:39,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {7663#true} assume true; {7663#true} is VALID [2022-02-20 19:58:39,612 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7663#true} {7664#false} #1909#return; {7664#false} is VALID [2022-02-20 19:58:39,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {7663#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; {7663#true} is VALID [2022-02-20 19:58:39,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {7663#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {7663#true} is VALID [2022-02-20 19:58:39,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {7663#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {7663#true} is VALID [2022-02-20 19:58:39,613 INFO L290 TraceCheckUtils]: 3: Hoare triple {7663#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; {7663#true} is VALID [2022-02-20 19:58:39,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {7663#true} call update_channels1(); {7702#(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:39,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {7702#(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); {7663#true} is VALID [2022-02-20 19:58:39,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {7663#true} assume true; {7663#true} is VALID [2022-02-20 19:58:39,614 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7663#true} {7663#true} #1901#return; {7663#true} is VALID [2022-02-20 19:58:39,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {7663#true} assume { :begin_inline_init_threads1 } true; {7663#true} is VALID [2022-02-20 19:58:39,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {7663#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7663#true} is VALID [2022-02-20 19:58:39,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {7663#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7663#true} is VALID [2022-02-20 19:58:39,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {7663#true} assume { :end_inline_init_threads1 } true; {7663#true} is VALID [2022-02-20 19:58:39,615 INFO L272 TraceCheckUtils]: 12: Hoare triple {7663#true} call fire_delta_events1(); {7703#(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:39,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {7703#(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); {7663#true} is VALID [2022-02-20 19:58:39,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {7663#true} assume !(0 == ~q_write_ev~0); {7663#true} is VALID [2022-02-20 19:58:39,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {7663#true} assume true; {7663#true} is VALID [2022-02-20 19:58:39,615 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7663#true} {7663#true} #1903#return; {7663#true} is VALID [2022-02-20 19:58:39,615 INFO L272 TraceCheckUtils]: 17: Hoare triple {7663#true} call activate_threads1(); {7704#(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:39,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {7704#(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; {7663#true} is VALID [2022-02-20 19:58:39,616 INFO L272 TraceCheckUtils]: 19: Hoare triple {7663#true} call #t~ret8 := is_do_write_p_triggered(); {7663#true} is VALID [2022-02-20 19:58:39,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {7663#true} havoc ~__retres1~0; {7663#true} is VALID [2022-02-20 19:58:39,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {7663#true} assume !(1 == ~p_dw_pc~0); {7663#true} is VALID [2022-02-20 19:58:39,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {7663#true} ~__retres1~0 := 0; {7719#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:58:39,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {7719#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7720#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:39,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {7720#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7720#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:58:39,618 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7720#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7663#true} #1897#return; {7711#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:58:39,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {7711#(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; {7712#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:58:39,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {7712#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7664#false} is VALID [2022-02-20 19:58:39,619 INFO L272 TraceCheckUtils]: 28: Hoare triple {7664#false} call #t~ret9 := is_do_read_c_triggered(); {7663#true} is VALID [2022-02-20 19:58:39,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {7663#true} havoc ~__retres1~1; {7663#true} is VALID [2022-02-20 19:58:39,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {7663#true} assume 1 == ~c_dr_pc~0; {7663#true} is VALID [2022-02-20 19:58:39,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {7663#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {7663#true} is VALID [2022-02-20 19:58:39,619 INFO L290 TraceCheckUtils]: 32: Hoare triple {7663#true} #res := ~__retres1~1; {7663#true} is VALID [2022-02-20 19:58:39,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {7663#true} assume true; {7663#true} is VALID [2022-02-20 19:58:39,619 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7663#true} {7664#false} #1899#return; {7664#false} is VALID [2022-02-20 19:58:39,620 INFO L290 TraceCheckUtils]: 35: Hoare triple {7664#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7664#false} is VALID [2022-02-20 19:58:39,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {7664#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7664#false} is VALID [2022-02-20 19:58:39,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {7664#false} assume true; {7664#false} is VALID [2022-02-20 19:58:39,620 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7664#false} {7663#true} #1905#return; {7664#false} is VALID [2022-02-20 19:58:39,620 INFO L272 TraceCheckUtils]: 39: Hoare triple {7664#false} call reset_delta_events1(); {7703#(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:39,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {7703#(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); {7663#true} is VALID [2022-02-20 19:58:39,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {7663#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7663#true} is VALID [2022-02-20 19:58:39,620 INFO L290 TraceCheckUtils]: 42: Hoare triple {7663#true} assume true; {7663#true} is VALID [2022-02-20 19:58:39,621 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7663#true} {7664#false} #1907#return; {7664#false} is VALID [2022-02-20 19:58:39,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {7664#false} assume !false; {7664#false} is VALID [2022-02-20 19:58:39,621 INFO L290 TraceCheckUtils]: 45: Hoare triple {7664#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; {7664#false} is VALID [2022-02-20 19:58:39,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {7664#false} assume !false; {7664#false} is VALID [2022-02-20 19:58:39,621 INFO L272 TraceCheckUtils]: 47: Hoare triple {7664#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7663#true} is VALID [2022-02-20 19:58:39,621 INFO L290 TraceCheckUtils]: 48: Hoare triple {7663#true} havoc ~__retres1~2; {7663#true} is VALID [2022-02-20 19:58:39,621 INFO L290 TraceCheckUtils]: 49: Hoare triple {7663#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7663#true} is VALID [2022-02-20 19:58:39,622 INFO L290 TraceCheckUtils]: 50: Hoare triple {7663#true} #res := ~__retres1~2; {7663#true} is VALID [2022-02-20 19:58:39,622 INFO L290 TraceCheckUtils]: 51: Hoare triple {7663#true} assume true; {7663#true} is VALID [2022-02-20 19:58:39,622 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7663#true} {7664#false} #1909#return; {7664#false} is VALID [2022-02-20 19:58:39,622 INFO L290 TraceCheckUtils]: 53: Hoare triple {7664#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; {7664#false} is VALID [2022-02-20 19:58:39,622 INFO L290 TraceCheckUtils]: 54: Hoare triple {7664#false} assume 0 != eval1_~tmp___1~0#1; {7664#false} is VALID [2022-02-20 19:58:39,622 INFO L290 TraceCheckUtils]: 55: Hoare triple {7664#false} assume !(0 == ~p_dw_st~0); {7664#false} is VALID [2022-02-20 19:58:39,622 INFO L290 TraceCheckUtils]: 56: Hoare triple {7664#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; {7664#false} is VALID [2022-02-20 19:58:39,622 INFO L290 TraceCheckUtils]: 57: Hoare triple {7664#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; {7664#false} is VALID [2022-02-20 19:58:39,623 INFO L290 TraceCheckUtils]: 58: Hoare triple {7664#false} assume !(0 == ~c_dr_pc~0); {7664#false} is VALID [2022-02-20 19:58:39,623 INFO L290 TraceCheckUtils]: 59: Hoare triple {7664#false} assume 1 == ~c_dr_pc~0; {7664#false} is VALID [2022-02-20 19:58:39,623 INFO L290 TraceCheckUtils]: 60: Hoare triple {7664#false} do_read_c_~a~0#1 := ~a_t~0; {7664#false} is VALID [2022-02-20 19:58:39,623 INFO L290 TraceCheckUtils]: 61: Hoare triple {7664#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; {7664#false} is VALID [2022-02-20 19:58:39,623 INFO L290 TraceCheckUtils]: 62: Hoare triple {7664#false} assume !(~p_last_write~0 == ~c_last_read~0); {7664#false} is VALID [2022-02-20 19:58:39,623 INFO L272 TraceCheckUtils]: 63: Hoare triple {7664#false} call error1(); {7664#false} is VALID [2022-02-20 19:58:39,623 INFO L290 TraceCheckUtils]: 64: Hoare triple {7664#false} assume !false; {7664#false} is VALID [2022-02-20 19:58:39,624 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:39,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:39,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692499359] [2022-02-20 19:58:39,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692499359] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:39,624 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:39,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:39,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478799975] [2022-02-20 19:58:39,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:39,625 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:39,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:39,626 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:39,662 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:39,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:39,662 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:39,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:39,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:39,663 INFO L87 Difference]: Start difference. First operand 670 states and 1001 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:43,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:43,303 INFO L93 Difference]: Finished difference Result 971 states and 1415 transitions. [2022-02-20 19:58:43,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:43,304 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:43,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:43,305 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:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 891 transitions. [2022-02-20 19:58:43,311 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:43,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 891 transitions. [2022-02-20 19:58:43,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 891 transitions. [2022-02-20 19:58:43,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 891 edges. 891 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:43,937 INFO L225 Difference]: With dead ends: 971 [2022-02-20 19:58:43,938 INFO L226 Difference]: Without dead ends: 704 [2022-02-20 19:58:43,940 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:43,944 INFO L933 BasicCegarLoop]: 723 mSDtfsCounter, 652 mSDsluCounter, 2482 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 3205 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:43,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [653 Valid, 3205 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 19:58:43,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-02-20 19:58:43,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 675. [2022-02-20 19:58:43,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:43,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 704 states. Second operand has 675 states, 577 states have (on average 1.5008665511265165) internal successors, (866), 586 states have internal predecessors, (866), 64 states have call successors, (64), 29 states have call predecessors, (64), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2022-02-20 19:58:43,969 INFO L74 IsIncluded]: Start isIncluded. First operand 704 states. Second operand has 675 states, 577 states have (on average 1.5008665511265165) internal successors, (866), 586 states have internal predecessors, (866), 64 states have call successors, (64), 29 states have call predecessors, (64), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2022-02-20 19:58:43,970 INFO L87 Difference]: Start difference. First operand 704 states. Second operand has 675 states, 577 states have (on average 1.5008665511265165) internal successors, (866), 586 states have internal predecessors, (866), 64 states have call successors, (64), 29 states have call predecessors, (64), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2022-02-20 19:58:43,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:43,989 INFO L93 Difference]: Finished difference Result 704 states and 1045 transitions. [2022-02-20 19:58:43,989 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1045 transitions. [2022-02-20 19:58:43,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:43,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:43,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 675 states, 577 states have (on average 1.5008665511265165) internal successors, (866), 586 states have internal predecessors, (866), 64 states have call successors, (64), 29 states have call predecessors, (64), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) Second operand 704 states. [2022-02-20 19:58:43,993 INFO L87 Difference]: Start difference. First operand has 675 states, 577 states have (on average 1.5008665511265165) internal successors, (866), 586 states have internal predecessors, (866), 64 states have call successors, (64), 29 states have call predecessors, (64), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) Second operand 704 states. [2022-02-20 19:58:44,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:44,011 INFO L93 Difference]: Finished difference Result 704 states and 1045 transitions. [2022-02-20 19:58:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1045 transitions. [2022-02-20 19:58:44,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:44,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:44,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:44,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 577 states have (on average 1.5008665511265165) internal successors, (866), 586 states have internal predecessors, (866), 64 states have call successors, (64), 29 states have call predecessors, (64), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2022-02-20 19:58:44,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1004 transitions. [2022-02-20 19:58:44,073 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1004 transitions. Word has length 65 [2022-02-20 19:58:44,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:44,074 INFO L470 AbstractCegarLoop]: Abstraction has 675 states and 1004 transitions. [2022-02-20 19:58:44,074 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:44,074 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1004 transitions. [2022-02-20 19:58:44,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:44,075 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:44,075 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:44,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:58:44,076 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:44,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:44,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1698036462, now seen corresponding path program 1 times [2022-02-20 19:58:44,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:44,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151351830] [2022-02-20 19:58:44,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:44,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {11373#(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); {11374#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:44,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {11374#(not (= |old(~q_req_up~0)| 1))} assume true; {11374#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:44,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11374#(not (= |old(~q_req_up~0)| 1))} {11334#(= ~c_dr_pc~0 ~q_req_up~0)} #1901#return; {11338#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:44,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {11375#(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); {11331#true} is VALID [2022-02-20 19:58:44,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {11331#true} assume !(0 == ~q_write_ev~0); {11331#true} is VALID [2022-02-20 19:58:44,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-02-20 19:58:44,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11331#true} {11338#(not (= ~c_dr_pc~0 1))} #1903#return; {11338#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:44,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {11331#true} havoc ~__retres1~0; {11331#true} is VALID [2022-02-20 19:58:44,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {11331#true} assume !(1 == ~p_dw_pc~0); {11331#true} is VALID [2022-02-20 19:58:44,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {11331#true} ~__retres1~0 := 0; {11331#true} is VALID [2022-02-20 19:58:44,185 INFO L290 TraceCheckUtils]: 3: Hoare triple {11331#true} #res := ~__retres1~0; {11331#true} is VALID [2022-02-20 19:58:44,185 INFO L290 TraceCheckUtils]: 4: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-02-20 19:58:44,185 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11331#true} {11331#true} #1897#return; {11331#true} is VALID [2022-02-20 19:58:44,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:44,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {11331#true} havoc ~__retres1~1; {11331#true} is VALID [2022-02-20 19:58:44,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {11331#true} assume 1 == ~c_dr_pc~0; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,194 INFO L290 TraceCheckUtils]: 3: Hoare triple {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,195 INFO L290 TraceCheckUtils]: 4: Hoare triple {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,195 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} {11331#true} #1899#return; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {11376#(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; {11331#true} is VALID [2022-02-20 19:58:44,195 INFO L272 TraceCheckUtils]: 1: Hoare triple {11331#true} call #t~ret8 := is_do_write_p_triggered(); {11331#true} is VALID [2022-02-20 19:58:44,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {11331#true} havoc ~__retres1~0; {11331#true} is VALID [2022-02-20 19:58:44,195 INFO L290 TraceCheckUtils]: 3: Hoare triple {11331#true} assume !(1 == ~p_dw_pc~0); {11331#true} is VALID [2022-02-20 19:58:44,196 INFO L290 TraceCheckUtils]: 4: Hoare triple {11331#true} ~__retres1~0 := 0; {11331#true} is VALID [2022-02-20 19:58:44,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {11331#true} #res := ~__retres1~0; {11331#true} is VALID [2022-02-20 19:58:44,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-02-20 19:58:44,196 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11331#true} {11331#true} #1897#return; {11331#true} is VALID [2022-02-20 19:58:44,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {11331#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {11331#true} is VALID [2022-02-20 19:58:44,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {11331#true} assume !(0 != ~tmp~1); {11331#true} is VALID [2022-02-20 19:58:44,196 INFO L272 TraceCheckUtils]: 10: Hoare triple {11331#true} call #t~ret9 := is_do_read_c_triggered(); {11331#true} is VALID [2022-02-20 19:58:44,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {11331#true} havoc ~__retres1~1; {11331#true} is VALID [2022-02-20 19:58:44,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {11331#true} assume 1 == ~c_dr_pc~0; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,207 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} {11331#true} #1899#return; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,208 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} {11338#(not (= ~c_dr_pc~0 1))} #1905#return; {11332#false} is VALID [2022-02-20 19:58:44,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {11375#(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); {11331#true} is VALID [2022-02-20 19:58:44,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {11331#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {11331#true} is VALID [2022-02-20 19:58:44,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-02-20 19:58:44,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11331#true} {11332#false} #1907#return; {11332#false} is VALID [2022-02-20 19:58:44,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:44,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {11331#true} havoc ~__retres1~2; {11331#true} is VALID [2022-02-20 19:58:44,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {11331#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {11331#true} is VALID [2022-02-20 19:58:44,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {11331#true} #res := ~__retres1~2; {11331#true} is VALID [2022-02-20 19:58:44,217 INFO L290 TraceCheckUtils]: 3: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-02-20 19:58:44,217 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11331#true} {11332#false} #1909#return; {11332#false} is VALID [2022-02-20 19:58:44,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {11331#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; {11333#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:58:44,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {11333#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {11333#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:58:44,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {11333#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {11334#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:58:44,220 INFO L290 TraceCheckUtils]: 3: Hoare triple {11334#(= ~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; {11334#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:58:44,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {11334#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {11373#(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:44,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {11373#(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); {11374#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:44,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {11374#(not (= |old(~q_req_up~0)| 1))} assume true; {11374#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:58:44,224 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11374#(not (= |old(~q_req_up~0)| 1))} {11334#(= ~c_dr_pc~0 ~q_req_up~0)} #1901#return; {11338#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:44,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {11338#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {11338#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:44,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {11338#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {11338#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:44,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {11338#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {11338#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:44,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {11338#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {11338#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:44,225 INFO L272 TraceCheckUtils]: 12: Hoare triple {11338#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {11375#(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:44,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {11375#(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); {11331#true} is VALID [2022-02-20 19:58:44,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {11331#true} assume !(0 == ~q_write_ev~0); {11331#true} is VALID [2022-02-20 19:58:44,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-02-20 19:58:44,226 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11331#true} {11338#(not (= ~c_dr_pc~0 1))} #1903#return; {11338#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:58:44,227 INFO L272 TraceCheckUtils]: 17: Hoare triple {11338#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {11376#(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:44,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {11376#(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; {11331#true} is VALID [2022-02-20 19:58:44,227 INFO L272 TraceCheckUtils]: 19: Hoare triple {11331#true} call #t~ret8 := is_do_write_p_triggered(); {11331#true} is VALID [2022-02-20 19:58:44,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {11331#true} havoc ~__retres1~0; {11331#true} is VALID [2022-02-20 19:58:44,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {11331#true} assume !(1 == ~p_dw_pc~0); {11331#true} is VALID [2022-02-20 19:58:44,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {11331#true} ~__retres1~0 := 0; {11331#true} is VALID [2022-02-20 19:58:44,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {11331#true} #res := ~__retres1~0; {11331#true} is VALID [2022-02-20 19:58:44,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-02-20 19:58:44,227 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11331#true} {11331#true} #1897#return; {11331#true} is VALID [2022-02-20 19:58:44,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {11331#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {11331#true} is VALID [2022-02-20 19:58:44,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {11331#true} assume !(0 != ~tmp~1); {11331#true} is VALID [2022-02-20 19:58:44,228 INFO L272 TraceCheckUtils]: 28: Hoare triple {11331#true} call #t~ret9 := is_do_read_c_triggered(); {11331#true} is VALID [2022-02-20 19:58:44,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {11331#true} havoc ~__retres1~1; {11331#true} is VALID [2022-02-20 19:58:44,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {11331#true} assume 1 == ~c_dr_pc~0; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,229 INFO L290 TraceCheckUtils]: 31: Hoare triple {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,229 INFO L290 TraceCheckUtils]: 32: Hoare triple {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,229 INFO L290 TraceCheckUtils]: 33: Hoare triple {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,229 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} {11331#true} #1899#return; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,230 INFO L290 TraceCheckUtils]: 35: Hoare triple {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,230 INFO L290 TraceCheckUtils]: 36: Hoare triple {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,230 INFO L290 TraceCheckUtils]: 37: Hoare triple {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:58:44,231 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11389#(= (+ (- 1) ~c_dr_pc~0) 0)} {11338#(not (= ~c_dr_pc~0 1))} #1905#return; {11332#false} is VALID [2022-02-20 19:58:44,231 INFO L272 TraceCheckUtils]: 39: Hoare triple {11332#false} call reset_delta_events1(); {11375#(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:44,231 INFO L290 TraceCheckUtils]: 40: Hoare triple {11375#(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); {11331#true} is VALID [2022-02-20 19:58:44,231 INFO L290 TraceCheckUtils]: 41: Hoare triple {11331#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {11331#true} is VALID [2022-02-20 19:58:44,232 INFO L290 TraceCheckUtils]: 42: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-02-20 19:58:44,232 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {11331#true} {11332#false} #1907#return; {11332#false} is VALID [2022-02-20 19:58:44,232 INFO L290 TraceCheckUtils]: 44: Hoare triple {11332#false} assume !false; {11332#false} is VALID [2022-02-20 19:58:44,232 INFO L290 TraceCheckUtils]: 45: Hoare triple {11332#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; {11332#false} is VALID [2022-02-20 19:58:44,232 INFO L290 TraceCheckUtils]: 46: Hoare triple {11332#false} assume !false; {11332#false} is VALID [2022-02-20 19:58:44,232 INFO L272 TraceCheckUtils]: 47: Hoare triple {11332#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {11331#true} is VALID [2022-02-20 19:58:44,233 INFO L290 TraceCheckUtils]: 48: Hoare triple {11331#true} havoc ~__retres1~2; {11331#true} is VALID [2022-02-20 19:58:44,233 INFO L290 TraceCheckUtils]: 49: Hoare triple {11331#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {11331#true} is VALID [2022-02-20 19:58:44,233 INFO L290 TraceCheckUtils]: 50: Hoare triple {11331#true} #res := ~__retres1~2; {11331#true} is VALID [2022-02-20 19:58:44,233 INFO L290 TraceCheckUtils]: 51: Hoare triple {11331#true} assume true; {11331#true} is VALID [2022-02-20 19:58:44,233 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11331#true} {11332#false} #1909#return; {11332#false} is VALID [2022-02-20 19:58:44,233 INFO L290 TraceCheckUtils]: 53: Hoare triple {11332#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; {11332#false} is VALID [2022-02-20 19:58:44,233 INFO L290 TraceCheckUtils]: 54: Hoare triple {11332#false} assume 0 != eval1_~tmp___1~0#1; {11332#false} is VALID [2022-02-20 19:58:44,233 INFO L290 TraceCheckUtils]: 55: Hoare triple {11332#false} assume !(0 == ~p_dw_st~0); {11332#false} is VALID [2022-02-20 19:58:44,233 INFO L290 TraceCheckUtils]: 56: Hoare triple {11332#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; {11332#false} is VALID [2022-02-20 19:58:44,234 INFO L290 TraceCheckUtils]: 57: Hoare triple {11332#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; {11332#false} is VALID [2022-02-20 19:58:44,234 INFO L290 TraceCheckUtils]: 58: Hoare triple {11332#false} assume !(0 == ~c_dr_pc~0); {11332#false} is VALID [2022-02-20 19:58:44,234 INFO L290 TraceCheckUtils]: 59: Hoare triple {11332#false} assume 1 == ~c_dr_pc~0; {11332#false} is VALID [2022-02-20 19:58:44,234 INFO L290 TraceCheckUtils]: 60: Hoare triple {11332#false} do_read_c_~a~0#1 := ~a_t~0; {11332#false} is VALID [2022-02-20 19:58:44,234 INFO L290 TraceCheckUtils]: 61: Hoare triple {11332#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; {11332#false} is VALID [2022-02-20 19:58:44,234 INFO L290 TraceCheckUtils]: 62: Hoare triple {11332#false} assume !(~p_last_write~0 == ~c_last_read~0); {11332#false} is VALID [2022-02-20 19:58:44,234 INFO L272 TraceCheckUtils]: 63: Hoare triple {11332#false} call error1(); {11332#false} is VALID [2022-02-20 19:58:44,234 INFO L290 TraceCheckUtils]: 64: Hoare triple {11332#false} assume !false; {11332#false} is VALID [2022-02-20 19:58:44,235 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:44,235 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:44,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151351830] [2022-02-20 19:58:44,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151351830] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:44,235 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:44,235 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:58:44,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615344157] [2022-02-20 19:58:44,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:44,237 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:44,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:44,238 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:44,276 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:44,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:58:44,277 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:44,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:58:44,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:58:44,278 INFO L87 Difference]: Start difference. First operand 675 states and 1004 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:49,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:49,526 INFO L93 Difference]: Finished difference Result 1997 states and 2800 transitions. [2022-02-20 19:58:49,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:58:49,527 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:49,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:49,527 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:49,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1409 transitions. [2022-02-20 19:58:49,536 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:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1409 transitions. [2022-02-20 19:58:49,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1409 transitions. [2022-02-20 19:58:50,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1409 edges. 1409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:50,566 INFO L225 Difference]: With dead ends: 1997 [2022-02-20 19:58:50,567 INFO L226 Difference]: Without dead ends: 1707 [2022-02-20 19:58:50,568 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:50,568 INFO L933 BasicCegarLoop]: 825 mSDtfsCounter, 3622 mSDsluCounter, 2174 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 634 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3636 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 2342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 634 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:50,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3636 Valid, 2999 Invalid, 2342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [634 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-02-20 19:58:50,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-02-20 19:58:50,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2022-02-20 19:58:50,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:50,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1707 states. Second operand has 1576 states, 1292 states have (on average 1.3970588235294117) internal successors, (1805), 1316 states have internal predecessors, (1805), 152 states have call successors, (152), 112 states have call predecessors, (152), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2022-02-20 19:58:50,641 INFO L74 IsIncluded]: Start isIncluded. First operand 1707 states. Second operand has 1576 states, 1292 states have (on average 1.3970588235294117) internal successors, (1805), 1316 states have internal predecessors, (1805), 152 states have call successors, (152), 112 states have call predecessors, (152), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2022-02-20 19:58:50,643 INFO L87 Difference]: Start difference. First operand 1707 states. Second operand has 1576 states, 1292 states have (on average 1.3970588235294117) internal successors, (1805), 1316 states have internal predecessors, (1805), 152 states have call successors, (152), 112 states have call predecessors, (152), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2022-02-20 19:58:50,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:50,735 INFO L93 Difference]: Finished difference Result 1707 states and 2294 transitions. [2022-02-20 19:58:50,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2294 transitions. [2022-02-20 19:58:50,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:50,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:50,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 1576 states, 1292 states have (on average 1.3970588235294117) internal successors, (1805), 1316 states have internal predecessors, (1805), 152 states have call successors, (152), 112 states have call predecessors, (152), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) Second operand 1707 states. [2022-02-20 19:58:50,745 INFO L87 Difference]: Start difference. First operand has 1576 states, 1292 states have (on average 1.3970588235294117) internal successors, (1805), 1316 states have internal predecessors, (1805), 152 states have call successors, (152), 112 states have call predecessors, (152), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) Second operand 1707 states. [2022-02-20 19:58:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:50,846 INFO L93 Difference]: Finished difference Result 1707 states and 2294 transitions. [2022-02-20 19:58:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2294 transitions. [2022-02-20 19:58:50,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:50,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:50,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:50,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:50,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1292 states have (on average 1.3970588235294117) internal successors, (1805), 1316 states have internal predecessors, (1805), 152 states have call successors, (152), 112 states have call predecessors, (152), 130 states have return successors, (188), 150 states have call predecessors, (188), 148 states have call successors, (188) [2022-02-20 19:58:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2145 transitions. [2022-02-20 19:58:50,971 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2145 transitions. Word has length 65 [2022-02-20 19:58:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:50,972 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 2145 transitions. [2022-02-20 19:58:50,972 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:50,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2145 transitions. [2022-02-20 19:58:50,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:50,974 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:50,974 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:50,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:58:50,974 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:50,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:50,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2104827032, now seen corresponding path program 1 times [2022-02-20 19:58:50,975 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:50,975 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004887430] [2022-02-20 19:58:50,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:50,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {19692#(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); {19653#true} is VALID [2022-02-20 19:58:51,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {19653#true} assume true; {19653#true} is VALID [2022-02-20 19:58:51,009 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19653#true} {19653#true} #1901#return; {19653#true} is VALID [2022-02-20 19:58:51,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {19693#(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); {19653#true} is VALID [2022-02-20 19:58:51,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {19653#true} assume !(0 == ~q_write_ev~0); {19653#true} is VALID [2022-02-20 19:58:51,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {19653#true} assume true; {19653#true} is VALID [2022-02-20 19:58:51,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19653#true} {19653#true} #1903#return; {19653#true} is VALID [2022-02-20 19:58:51,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {19653#true} havoc ~__retres1~0; {19653#true} is VALID [2022-02-20 19:58:51,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {19653#true} assume !(1 == ~p_dw_pc~0); {19653#true} is VALID [2022-02-20 19:58:51,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {19653#true} ~__retres1~0 := 0; {19653#true} is VALID [2022-02-20 19:58:51,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {19653#true} #res := ~__retres1~0; {19653#true} is VALID [2022-02-20 19:58:51,056 INFO L290 TraceCheckUtils]: 4: Hoare triple {19653#true} assume true; {19653#true} is VALID [2022-02-20 19:58:51,056 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19653#true} {19653#true} #1897#return; {19653#true} is VALID [2022-02-20 19:58:51,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {19653#true} havoc ~__retres1~1; {19653#true} is VALID [2022-02-20 19:58:51,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {19653#true} assume !(1 == ~c_dr_pc~0); {19653#true} is VALID [2022-02-20 19:58:51,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {19653#true} ~__retres1~1 := 0; {19709#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:51,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {19709#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19710#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:51,103 INFO L290 TraceCheckUtils]: 4: Hoare triple {19710#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19710#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:51,103 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19710#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19653#true} #1899#return; {19707#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:51,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {19694#(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; {19653#true} is VALID [2022-02-20 19:58:51,103 INFO L272 TraceCheckUtils]: 1: Hoare triple {19653#true} call #t~ret8 := is_do_write_p_triggered(); {19653#true} is VALID [2022-02-20 19:58:51,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {19653#true} havoc ~__retres1~0; {19653#true} is VALID [2022-02-20 19:58:51,104 INFO L290 TraceCheckUtils]: 3: Hoare triple {19653#true} assume !(1 == ~p_dw_pc~0); {19653#true} is VALID [2022-02-20 19:58:51,104 INFO L290 TraceCheckUtils]: 4: Hoare triple {19653#true} ~__retres1~0 := 0; {19653#true} is VALID [2022-02-20 19:58:51,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {19653#true} #res := ~__retres1~0; {19653#true} is VALID [2022-02-20 19:58:51,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {19653#true} assume true; {19653#true} is VALID [2022-02-20 19:58:51,104 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19653#true} {19653#true} #1897#return; {19653#true} is VALID [2022-02-20 19:58:51,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {19653#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {19653#true} is VALID [2022-02-20 19:58:51,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {19653#true} assume !(0 != ~tmp~1); {19653#true} is VALID [2022-02-20 19:58:51,104 INFO L272 TraceCheckUtils]: 10: Hoare triple {19653#true} call #t~ret9 := is_do_read_c_triggered(); {19653#true} is VALID [2022-02-20 19:58:51,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {19653#true} havoc ~__retres1~1; {19653#true} is VALID [2022-02-20 19:58:51,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {19653#true} assume !(1 == ~c_dr_pc~0); {19653#true} is VALID [2022-02-20 19:58:51,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {19653#true} ~__retres1~1 := 0; {19709#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:51,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {19709#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19710#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:51,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {19710#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19710#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:51,106 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19710#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19653#true} #1899#return; {19707#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:51,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {19707#(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; {19708#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:51,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {19708#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {19654#false} is VALID [2022-02-20 19:58:51,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {19654#false} assume true; {19654#false} is VALID [2022-02-20 19:58:51,107 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {19654#false} {19653#true} #1905#return; {19654#false} is VALID [2022-02-20 19:58:51,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {19693#(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); {19653#true} is VALID [2022-02-20 19:58:51,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {19653#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {19653#true} is VALID [2022-02-20 19:58:51,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {19653#true} assume true; {19653#true} is VALID [2022-02-20 19:58:51,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19653#true} {19654#false} #1907#return; {19654#false} is VALID [2022-02-20 19:58:51,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:51,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {19653#true} havoc ~__retres1~2; {19653#true} is VALID [2022-02-20 19:58:51,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {19653#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {19653#true} is VALID [2022-02-20 19:58:51,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {19653#true} #res := ~__retres1~2; {19653#true} is VALID [2022-02-20 19:58:51,117 INFO L290 TraceCheckUtils]: 3: Hoare triple {19653#true} assume true; {19653#true} is VALID [2022-02-20 19:58:51,118 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19653#true} {19654#false} #1909#return; {19654#false} is VALID [2022-02-20 19:58:51,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {19653#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; {19653#true} is VALID [2022-02-20 19:58:51,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {19653#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {19653#true} is VALID [2022-02-20 19:58:51,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {19653#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {19653#true} is VALID [2022-02-20 19:58:51,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {19653#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; {19653#true} is VALID [2022-02-20 19:58:51,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {19653#true} call update_channels1(); {19692#(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,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {19692#(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); {19653#true} is VALID [2022-02-20 19:58:51,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {19653#true} assume true; {19653#true} is VALID [2022-02-20 19:58:51,119 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19653#true} {19653#true} #1901#return; {19653#true} is VALID [2022-02-20 19:58:51,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {19653#true} assume { :begin_inline_init_threads1 } true; {19653#true} is VALID [2022-02-20 19:58:51,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {19653#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {19653#true} is VALID [2022-02-20 19:58:51,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {19653#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {19653#true} is VALID [2022-02-20 19:58:51,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {19653#true} assume { :end_inline_init_threads1 } true; {19653#true} is VALID [2022-02-20 19:58:51,120 INFO L272 TraceCheckUtils]: 12: Hoare triple {19653#true} call fire_delta_events1(); {19693#(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,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {19693#(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); {19653#true} is VALID [2022-02-20 19:58:51,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {19653#true} assume !(0 == ~q_write_ev~0); {19653#true} is VALID [2022-02-20 19:58:51,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {19653#true} assume true; {19653#true} is VALID [2022-02-20 19:58:51,120 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19653#true} {19653#true} #1903#return; {19653#true} is VALID [2022-02-20 19:58:51,120 INFO L272 TraceCheckUtils]: 17: Hoare triple {19653#true} call activate_threads1(); {19694#(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,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {19694#(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; {19653#true} is VALID [2022-02-20 19:58:51,121 INFO L272 TraceCheckUtils]: 19: Hoare triple {19653#true} call #t~ret8 := is_do_write_p_triggered(); {19653#true} is VALID [2022-02-20 19:58:51,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {19653#true} havoc ~__retres1~0; {19653#true} is VALID [2022-02-20 19:58:51,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {19653#true} assume !(1 == ~p_dw_pc~0); {19653#true} is VALID [2022-02-20 19:58:51,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {19653#true} ~__retres1~0 := 0; {19653#true} is VALID [2022-02-20 19:58:51,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {19653#true} #res := ~__retres1~0; {19653#true} is VALID [2022-02-20 19:58:51,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {19653#true} assume true; {19653#true} is VALID [2022-02-20 19:58:51,121 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {19653#true} {19653#true} #1897#return; {19653#true} is VALID [2022-02-20 19:58:51,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {19653#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {19653#true} is VALID [2022-02-20 19:58:51,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {19653#true} assume !(0 != ~tmp~1); {19653#true} is VALID [2022-02-20 19:58:51,122 INFO L272 TraceCheckUtils]: 28: Hoare triple {19653#true} call #t~ret9 := is_do_read_c_triggered(); {19653#true} is VALID [2022-02-20 19:58:51,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {19653#true} havoc ~__retres1~1; {19653#true} is VALID [2022-02-20 19:58:51,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {19653#true} assume !(1 == ~c_dr_pc~0); {19653#true} is VALID [2022-02-20 19:58:51,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {19653#true} ~__retres1~1 := 0; {19709#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:51,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {19709#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {19710#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:51,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {19710#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {19710#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:51,123 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {19710#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {19653#true} #1899#return; {19707#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:51,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {19707#(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; {19708#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:51,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {19708#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {19654#false} is VALID [2022-02-20 19:58:51,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {19654#false} assume true; {19654#false} is VALID [2022-02-20 19:58:51,124 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {19654#false} {19653#true} #1905#return; {19654#false} is VALID [2022-02-20 19:58:51,124 INFO L272 TraceCheckUtils]: 39: Hoare triple {19654#false} call reset_delta_events1(); {19693#(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,124 INFO L290 TraceCheckUtils]: 40: Hoare triple {19693#(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); {19653#true} is VALID [2022-02-20 19:58:51,124 INFO L290 TraceCheckUtils]: 41: Hoare triple {19653#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {19653#true} is VALID [2022-02-20 19:58:51,125 INFO L290 TraceCheckUtils]: 42: Hoare triple {19653#true} assume true; {19653#true} is VALID [2022-02-20 19:58:51,125 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {19653#true} {19654#false} #1907#return; {19654#false} is VALID [2022-02-20 19:58:51,125 INFO L290 TraceCheckUtils]: 44: Hoare triple {19654#false} assume !false; {19654#false} is VALID [2022-02-20 19:58:51,125 INFO L290 TraceCheckUtils]: 45: Hoare triple {19654#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; {19654#false} is VALID [2022-02-20 19:58:51,125 INFO L290 TraceCheckUtils]: 46: Hoare triple {19654#false} assume !false; {19654#false} is VALID [2022-02-20 19:58:51,125 INFO L272 TraceCheckUtils]: 47: Hoare triple {19654#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {19653#true} is VALID [2022-02-20 19:58:51,125 INFO L290 TraceCheckUtils]: 48: Hoare triple {19653#true} havoc ~__retres1~2; {19653#true} is VALID [2022-02-20 19:58:51,125 INFO L290 TraceCheckUtils]: 49: Hoare triple {19653#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {19653#true} is VALID [2022-02-20 19:58:51,125 INFO L290 TraceCheckUtils]: 50: Hoare triple {19653#true} #res := ~__retres1~2; {19653#true} is VALID [2022-02-20 19:58:51,126 INFO L290 TraceCheckUtils]: 51: Hoare triple {19653#true} assume true; {19653#true} is VALID [2022-02-20 19:58:51,126 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19653#true} {19654#false} #1909#return; {19654#false} is VALID [2022-02-20 19:58:51,126 INFO L290 TraceCheckUtils]: 53: Hoare triple {19654#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; {19654#false} is VALID [2022-02-20 19:58:51,126 INFO L290 TraceCheckUtils]: 54: Hoare triple {19654#false} assume 0 != eval1_~tmp___1~0#1; {19654#false} is VALID [2022-02-20 19:58:51,126 INFO L290 TraceCheckUtils]: 55: Hoare triple {19654#false} assume !(0 == ~p_dw_st~0); {19654#false} is VALID [2022-02-20 19:58:51,126 INFO L290 TraceCheckUtils]: 56: Hoare triple {19654#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; {19654#false} is VALID [2022-02-20 19:58:51,126 INFO L290 TraceCheckUtils]: 57: Hoare triple {19654#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; {19654#false} is VALID [2022-02-20 19:58:51,126 INFO L290 TraceCheckUtils]: 58: Hoare triple {19654#false} assume 0 == ~c_dr_pc~0; {19654#false} is VALID [2022-02-20 19:58:51,126 INFO L290 TraceCheckUtils]: 59: Hoare triple {19654#false} assume !false; {19654#false} is VALID [2022-02-20 19:58:51,126 INFO L290 TraceCheckUtils]: 60: Hoare triple {19654#false} assume !(1 == ~q_free~0); {19654#false} is VALID [2022-02-20 19:58:51,127 INFO L290 TraceCheckUtils]: 61: Hoare triple {19654#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; {19654#false} is VALID [2022-02-20 19:58:51,127 INFO L290 TraceCheckUtils]: 62: Hoare triple {19654#false} assume !(~p_last_write~0 == ~c_last_read~0); {19654#false} is VALID [2022-02-20 19:58:51,127 INFO L272 TraceCheckUtils]: 63: Hoare triple {19654#false} call error1(); {19654#false} is VALID [2022-02-20 19:58:51,127 INFO L290 TraceCheckUtils]: 64: Hoare triple {19654#false} assume !false; {19654#false} is VALID [2022-02-20 19:58:51,127 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,127 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:51,127 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004887430] [2022-02-20 19:58:51,127 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004887430] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:51,128 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:51,128 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:51,128 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140285115] [2022-02-20 19:58:51,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:51,129 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:51,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:51,129 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:51,162 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:51,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:51,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:51,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:51,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:51,163 INFO L87 Difference]: Start difference. First operand 1576 states and 2145 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:54,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:54,438 INFO L93 Difference]: Finished difference Result 2867 states and 3818 transitions. [2022-02-20 19:58:54,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:54,439 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:54,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:54,439 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:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 890 transitions. [2022-02-20 19:58:54,444 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:54,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 890 transitions. [2022-02-20 19:58:54,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 890 transitions. [2022-02-20 19:58:55,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 890 edges. 890 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:55,173 INFO L225 Difference]: With dead ends: 2867 [2022-02-20 19:58:55,173 INFO L226 Difference]: Without dead ends: 1682 [2022-02-20 19:58:55,175 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:55,175 INFO L933 BasicCegarLoop]: 718 mSDtfsCounter, 972 mSDsluCounter, 2151 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 2869 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:55,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [974 Valid, 2869 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:58:55,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2022-02-20 19:58:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1606. [2022-02-20 19:58:55,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:55,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1682 states. Second operand has 1606 states, 1316 states have (on average 1.3837386018237081) internal successors, (1821), 1340 states have internal predecessors, (1821), 152 states have call successors, (152), 112 states have call predecessors, (152), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2022-02-20 19:58:55,265 INFO L74 IsIncluded]: Start isIncluded. First operand 1682 states. Second operand has 1606 states, 1316 states have (on average 1.3837386018237081) internal successors, (1821), 1340 states have internal predecessors, (1821), 152 states have call successors, (152), 112 states have call predecessors, (152), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2022-02-20 19:58:55,266 INFO L87 Difference]: Start difference. First operand 1682 states. Second operand has 1606 states, 1316 states have (on average 1.3837386018237081) internal successors, (1821), 1340 states have internal predecessors, (1821), 152 states have call successors, (152), 112 states have call predecessors, (152), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2022-02-20 19:58:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:55,358 INFO L93 Difference]: Finished difference Result 1682 states and 2258 transitions. [2022-02-20 19:58:55,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2258 transitions. [2022-02-20 19:58:55,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:55,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:55,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 1606 states, 1316 states have (on average 1.3837386018237081) internal successors, (1821), 1340 states have internal predecessors, (1821), 152 states have call successors, (152), 112 states have call predecessors, (152), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) Second operand 1682 states. [2022-02-20 19:58:55,365 INFO L87 Difference]: Start difference. First operand has 1606 states, 1316 states have (on average 1.3837386018237081) internal successors, (1821), 1340 states have internal predecessors, (1821), 152 states have call successors, (152), 112 states have call predecessors, (152), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) Second operand 1682 states. [2022-02-20 19:58:55,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:55,458 INFO L93 Difference]: Finished difference Result 1682 states and 2258 transitions. [2022-02-20 19:58:55,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2258 transitions. [2022-02-20 19:58:55,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:55,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:55,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:55,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:55,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1316 states have (on average 1.3837386018237081) internal successors, (1821), 1340 states have internal predecessors, (1821), 152 states have call successors, (152), 112 states have call predecessors, (152), 136 states have return successors, (194), 156 states have call predecessors, (194), 148 states have call successors, (194) [2022-02-20 19:58:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2167 transitions. [2022-02-20 19:58:55,582 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2167 transitions. Word has length 65 [2022-02-20 19:58:55,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:55,583 INFO L470 AbstractCegarLoop]: Abstraction has 1606 states and 2167 transitions. [2022-02-20 19:58:55,583 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:55,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2167 transitions. [2022-02-20 19:58:55,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:55,584 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:55,584 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:55,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:58:55,584 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:55,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:55,585 INFO L85 PathProgramCache]: Analyzing trace with hash -718623638, now seen corresponding path program 1 times [2022-02-20 19:58:55,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:55,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560718806] [2022-02-20 19:58:55,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:55,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {29120#(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); {29121#(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:55,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {29121#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29121#(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:55,624 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29121#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29082#(= ~q_write_ev~0 ~q_read_ev~0)} #1901#return; {29082#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:55,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {29121#(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); {29121#(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:55,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {29121#(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); {29121#(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:55,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {29121#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29121#(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:55,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29121#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29082#(= ~q_write_ev~0 ~q_read_ev~0)} #1903#return; {29082#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:55,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {29080#true} havoc ~__retres1~0; {29080#true} is VALID [2022-02-20 19:58:55,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {29080#true} assume !(1 == ~p_dw_pc~0); {29080#true} is VALID [2022-02-20 19:58:55,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {29080#true} ~__retres1~0 := 0; {29080#true} is VALID [2022-02-20 19:58:55,641 INFO L290 TraceCheckUtils]: 3: Hoare triple {29080#true} #res := ~__retres1~0; {29080#true} is VALID [2022-02-20 19:58:55,641 INFO L290 TraceCheckUtils]: 4: Hoare triple {29080#true} assume true; {29080#true} is VALID [2022-02-20 19:58:55,641 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {29080#true} {29080#true} #1897#return; {29080#true} is VALID [2022-02-20 19:58:55,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {29080#true} havoc ~__retres1~1; {29080#true} is VALID [2022-02-20 19:58:55,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {29080#true} assume !(1 == ~c_dr_pc~0); {29080#true} is VALID [2022-02-20 19:58:55,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {29080#true} ~__retres1~1 := 0; {29080#true} is VALID [2022-02-20 19:58:55,643 INFO L290 TraceCheckUtils]: 3: Hoare triple {29080#true} #res := ~__retres1~1; {29080#true} is VALID [2022-02-20 19:58:55,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {29080#true} assume true; {29080#true} is VALID [2022-02-20 19:58:55,643 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {29080#true} {29080#true} #1899#return; {29080#true} is VALID [2022-02-20 19:58:55,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {29122#(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; {29080#true} is VALID [2022-02-20 19:58:55,644 INFO L272 TraceCheckUtils]: 1: Hoare triple {29080#true} call #t~ret8 := is_do_write_p_triggered(); {29080#true} is VALID [2022-02-20 19:58:55,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {29080#true} havoc ~__retres1~0; {29080#true} is VALID [2022-02-20 19:58:55,644 INFO L290 TraceCheckUtils]: 3: Hoare triple {29080#true} assume !(1 == ~p_dw_pc~0); {29080#true} is VALID [2022-02-20 19:58:55,644 INFO L290 TraceCheckUtils]: 4: Hoare triple {29080#true} ~__retres1~0 := 0; {29080#true} is VALID [2022-02-20 19:58:55,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {29080#true} #res := ~__retres1~0; {29080#true} is VALID [2022-02-20 19:58:55,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {29080#true} assume true; {29080#true} is VALID [2022-02-20 19:58:55,644 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29080#true} {29080#true} #1897#return; {29080#true} is VALID [2022-02-20 19:58:55,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {29080#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {29080#true} is VALID [2022-02-20 19:58:55,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {29080#true} assume !(0 != ~tmp~1); {29080#true} is VALID [2022-02-20 19:58:55,645 INFO L272 TraceCheckUtils]: 10: Hoare triple {29080#true} call #t~ret9 := is_do_read_c_triggered(); {29080#true} is VALID [2022-02-20 19:58:55,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {29080#true} havoc ~__retres1~1; {29080#true} is VALID [2022-02-20 19:58:55,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {29080#true} assume !(1 == ~c_dr_pc~0); {29080#true} is VALID [2022-02-20 19:58:55,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {29080#true} ~__retres1~1 := 0; {29080#true} is VALID [2022-02-20 19:58:55,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {29080#true} #res := ~__retres1~1; {29080#true} is VALID [2022-02-20 19:58:55,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {29080#true} assume true; {29080#true} is VALID [2022-02-20 19:58:55,645 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {29080#true} {29080#true} #1899#return; {29080#true} is VALID [2022-02-20 19:58:55,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {29080#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {29080#true} is VALID [2022-02-20 19:58:55,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {29080#true} assume !(0 != ~tmp___0~1); {29080#true} is VALID [2022-02-20 19:58:55,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {29080#true} assume true; {29080#true} is VALID [2022-02-20 19:58:55,646 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {29080#true} {29082#(= ~q_write_ev~0 ~q_read_ev~0)} #1905#return; {29082#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:55,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {29121#(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); {29135#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:55,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {29135#(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; {29136#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:55,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {29136#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {29136#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:55,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29136#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {29082#(= ~q_write_ev~0 ~q_read_ev~0)} #1907#return; {29081#false} is VALID [2022-02-20 19:58:55,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:55,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {29080#true} havoc ~__retres1~2; {29080#true} is VALID [2022-02-20 19:58:55,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {29080#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {29080#true} is VALID [2022-02-20 19:58:55,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {29080#true} #res := ~__retres1~2; {29080#true} is VALID [2022-02-20 19:58:55,662 INFO L290 TraceCheckUtils]: 3: Hoare triple {29080#true} assume true; {29080#true} is VALID [2022-02-20 19:58:55,663 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {29080#true} {29081#false} #1909#return; {29081#false} is VALID [2022-02-20 19:58:55,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {29080#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; {29080#true} is VALID [2022-02-20 19:58:55,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {29080#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {29080#true} is VALID [2022-02-20 19:58:55,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {29080#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {29082#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:55,663 INFO L290 TraceCheckUtils]: 3: Hoare triple {29082#(= ~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; {29082#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:55,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {29082#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {29120#(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:55,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {29120#(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); {29121#(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:55,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {29121#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29121#(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:55,666 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29121#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29082#(= ~q_write_ev~0 ~q_read_ev~0)} #1901#return; {29082#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:55,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {29082#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {29082#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:55,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {29082#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {29082#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:55,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {29082#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {29082#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:55,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {29082#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {29082#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:55,667 INFO L272 TraceCheckUtils]: 12: Hoare triple {29082#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {29121#(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:55,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {29121#(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); {29121#(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:55,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {29121#(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); {29121#(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:55,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {29121#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {29121#(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:55,668 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {29121#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {29082#(= ~q_write_ev~0 ~q_read_ev~0)} #1903#return; {29082#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:55,669 INFO L272 TraceCheckUtils]: 17: Hoare triple {29082#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {29122#(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:55,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {29122#(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; {29080#true} is VALID [2022-02-20 19:58:55,669 INFO L272 TraceCheckUtils]: 19: Hoare triple {29080#true} call #t~ret8 := is_do_write_p_triggered(); {29080#true} is VALID [2022-02-20 19:58:55,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {29080#true} havoc ~__retres1~0; {29080#true} is VALID [2022-02-20 19:58:55,669 INFO L290 TraceCheckUtils]: 21: Hoare triple {29080#true} assume !(1 == ~p_dw_pc~0); {29080#true} is VALID [2022-02-20 19:58:55,669 INFO L290 TraceCheckUtils]: 22: Hoare triple {29080#true} ~__retres1~0 := 0; {29080#true} is VALID [2022-02-20 19:58:55,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {29080#true} #res := ~__retres1~0; {29080#true} is VALID [2022-02-20 19:58:55,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {29080#true} assume true; {29080#true} is VALID [2022-02-20 19:58:55,670 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29080#true} {29080#true} #1897#return; {29080#true} is VALID [2022-02-20 19:58:55,670 INFO L290 TraceCheckUtils]: 26: Hoare triple {29080#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {29080#true} is VALID [2022-02-20 19:58:55,670 INFO L290 TraceCheckUtils]: 27: Hoare triple {29080#true} assume !(0 != ~tmp~1); {29080#true} is VALID [2022-02-20 19:58:55,670 INFO L272 TraceCheckUtils]: 28: Hoare triple {29080#true} call #t~ret9 := is_do_read_c_triggered(); {29080#true} is VALID [2022-02-20 19:58:55,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {29080#true} havoc ~__retres1~1; {29080#true} is VALID [2022-02-20 19:58:55,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {29080#true} assume !(1 == ~c_dr_pc~0); {29080#true} is VALID [2022-02-20 19:58:55,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {29080#true} ~__retres1~1 := 0; {29080#true} is VALID [2022-02-20 19:58:55,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {29080#true} #res := ~__retres1~1; {29080#true} is VALID [2022-02-20 19:58:55,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {29080#true} assume true; {29080#true} is VALID [2022-02-20 19:58:55,671 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {29080#true} {29080#true} #1899#return; {29080#true} is VALID [2022-02-20 19:58:55,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {29080#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {29080#true} is VALID [2022-02-20 19:58:55,671 INFO L290 TraceCheckUtils]: 36: Hoare triple {29080#true} assume !(0 != ~tmp___0~1); {29080#true} is VALID [2022-02-20 19:58:55,671 INFO L290 TraceCheckUtils]: 37: Hoare triple {29080#true} assume true; {29080#true} is VALID [2022-02-20 19:58:55,671 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {29080#true} {29082#(= ~q_write_ev~0 ~q_read_ev~0)} #1905#return; {29082#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:55,672 INFO L272 TraceCheckUtils]: 39: Hoare triple {29082#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {29121#(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:55,672 INFO L290 TraceCheckUtils]: 40: Hoare triple {29121#(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); {29135#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:55,672 INFO L290 TraceCheckUtils]: 41: Hoare triple {29135#(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; {29136#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:55,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {29136#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {29136#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:55,673 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {29136#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {29082#(= ~q_write_ev~0 ~q_read_ev~0)} #1907#return; {29081#false} is VALID [2022-02-20 19:58:55,673 INFO L290 TraceCheckUtils]: 44: Hoare triple {29081#false} assume !false; {29081#false} is VALID [2022-02-20 19:58:55,673 INFO L290 TraceCheckUtils]: 45: Hoare triple {29081#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; {29081#false} is VALID [2022-02-20 19:58:55,673 INFO L290 TraceCheckUtils]: 46: Hoare triple {29081#false} assume !false; {29081#false} is VALID [2022-02-20 19:58:55,673 INFO L272 TraceCheckUtils]: 47: Hoare triple {29081#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {29080#true} is VALID [2022-02-20 19:58:55,673 INFO L290 TraceCheckUtils]: 48: Hoare triple {29080#true} havoc ~__retres1~2; {29080#true} is VALID [2022-02-20 19:58:55,673 INFO L290 TraceCheckUtils]: 49: Hoare triple {29080#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {29080#true} is VALID [2022-02-20 19:58:55,673 INFO L290 TraceCheckUtils]: 50: Hoare triple {29080#true} #res := ~__retres1~2; {29080#true} is VALID [2022-02-20 19:58:55,674 INFO L290 TraceCheckUtils]: 51: Hoare triple {29080#true} assume true; {29080#true} is VALID [2022-02-20 19:58:55,674 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {29080#true} {29081#false} #1909#return; {29081#false} is VALID [2022-02-20 19:58:55,674 INFO L290 TraceCheckUtils]: 53: Hoare triple {29081#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; {29081#false} is VALID [2022-02-20 19:58:55,674 INFO L290 TraceCheckUtils]: 54: Hoare triple {29081#false} assume 0 != eval1_~tmp___1~0#1; {29081#false} is VALID [2022-02-20 19:58:55,674 INFO L290 TraceCheckUtils]: 55: Hoare triple {29081#false} assume !(0 == ~p_dw_st~0); {29081#false} is VALID [2022-02-20 19:58:55,674 INFO L290 TraceCheckUtils]: 56: Hoare triple {29081#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; {29081#false} is VALID [2022-02-20 19:58:55,674 INFO L290 TraceCheckUtils]: 57: Hoare triple {29081#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; {29081#false} is VALID [2022-02-20 19:58:55,674 INFO L290 TraceCheckUtils]: 58: Hoare triple {29081#false} assume 0 == ~c_dr_pc~0; {29081#false} is VALID [2022-02-20 19:58:55,674 INFO L290 TraceCheckUtils]: 59: Hoare triple {29081#false} assume !false; {29081#false} is VALID [2022-02-20 19:58:55,675 INFO L290 TraceCheckUtils]: 60: Hoare triple {29081#false} assume !(1 == ~q_free~0); {29081#false} is VALID [2022-02-20 19:58:55,675 INFO L290 TraceCheckUtils]: 61: Hoare triple {29081#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; {29081#false} is VALID [2022-02-20 19:58:55,675 INFO L290 TraceCheckUtils]: 62: Hoare triple {29081#false} assume !(~p_last_write~0 == ~c_last_read~0); {29081#false} is VALID [2022-02-20 19:58:55,675 INFO L272 TraceCheckUtils]: 63: Hoare triple {29081#false} call error1(); {29081#false} is VALID [2022-02-20 19:58:55,675 INFO L290 TraceCheckUtils]: 64: Hoare triple {29081#false} assume !false; {29081#false} is VALID [2022-02-20 19:58:55,675 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:55,675 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:55,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560718806] [2022-02-20 19:58:55,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560718806] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:55,676 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:55,676 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:55,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998106680] [2022-02-20 19:58:55,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:55,676 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:55,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:55,677 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:55,706 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:55,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:55,707 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:55,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:55,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:55,708 INFO L87 Difference]: Start difference. First operand 1606 states and 2167 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:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:58,640 INFO L93 Difference]: Finished difference Result 2861 states and 3714 transitions. [2022-02-20 19:58:58,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:58,641 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:58,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:58,641 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:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1048 transitions. [2022-02-20 19:58:58,663 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:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1048 transitions. [2022-02-20 19:58:58,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 1048 transitions. [2022-02-20 19:58:59,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1048 edges. 1048 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:59,602 INFO L225 Difference]: With dead ends: 2861 [2022-02-20 19:58:59,602 INFO L226 Difference]: Without dead ends: 1869 [2022-02-20 19:58:59,604 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:59,608 INFO L933 BasicCegarLoop]: 727 mSDtfsCounter, 1789 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1818 SdHoareTripleChecker+Valid, 2128 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:59,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1818 Valid, 2128 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 19:58:59,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2022-02-20 19:58:59,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1548. [2022-02-20 19:58:59,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:59,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1869 states. Second operand has 1548 states, 1274 states have (on average 1.3814756671899528) internal successors, (1760), 1293 states have internal predecessors, (1760), 146 states have call successors, (146), 107 states have call predecessors, (146), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2022-02-20 19:58:59,768 INFO L74 IsIncluded]: Start isIncluded. First operand 1869 states. Second operand has 1548 states, 1274 states have (on average 1.3814756671899528) internal successors, (1760), 1293 states have internal predecessors, (1760), 146 states have call successors, (146), 107 states have call predecessors, (146), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2022-02-20 19:58:59,770 INFO L87 Difference]: Start difference. First operand 1869 states. Second operand has 1548 states, 1274 states have (on average 1.3814756671899528) internal successors, (1760), 1293 states have internal predecessors, (1760), 146 states have call successors, (146), 107 states have call predecessors, (146), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2022-02-20 19:58:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:59,882 INFO L93 Difference]: Finished difference Result 1869 states and 2429 transitions. [2022-02-20 19:58:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2429 transitions. [2022-02-20 19:58:59,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:59,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:59,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 1548 states, 1274 states have (on average 1.3814756671899528) internal successors, (1760), 1293 states have internal predecessors, (1760), 146 states have call successors, (146), 107 states have call predecessors, (146), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) Second operand 1869 states. [2022-02-20 19:58:59,911 INFO L87 Difference]: Start difference. First operand has 1548 states, 1274 states have (on average 1.3814756671899528) internal successors, (1760), 1293 states have internal predecessors, (1760), 146 states have call successors, (146), 107 states have call predecessors, (146), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) Second operand 1869 states. [2022-02-20 19:59:00,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:00,112 INFO L93 Difference]: Finished difference Result 1869 states and 2429 transitions. [2022-02-20 19:59:00,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2429 transitions. [2022-02-20 19:59:00,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:00,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:00,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:00,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:00,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1274 states have (on average 1.3814756671899528) internal successors, (1760), 1293 states have internal predecessors, (1760), 146 states have call successors, (146), 107 states have call predecessors, (146), 126 states have return successors, (179), 149 states have call predecessors, (179), 142 states have call successors, (179) [2022-02-20 19:59:00,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2085 transitions. [2022-02-20 19:59:00,253 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2085 transitions. Word has length 65 [2022-02-20 19:59:00,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:00,254 INFO L470 AbstractCegarLoop]: Abstraction has 1548 states and 2085 transitions. [2022-02-20 19:59:00,254 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:59:00,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2085 transitions. [2022-02-20 19:59:00,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:59:00,267 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:00,267 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:59:00,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:59:00,273 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:00,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:00,273 INFO L85 PathProgramCache]: Analyzing trace with hash -852637144, now seen corresponding path program 1 times [2022-02-20 19:59:00,274 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:00,274 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864269416] [2022-02-20 19:59:00,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:00,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {38804#(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); {38764#true} is VALID [2022-02-20 19:59:00,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {38764#true} assume true; {38764#true} is VALID [2022-02-20 19:59:00,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38764#true} {38764#true} #1901#return; {38764#true} is VALID [2022-02-20 19:59:00,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {38805#(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); {38764#true} is VALID [2022-02-20 19:59:00,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {38764#true} assume !(0 == ~q_write_ev~0); {38764#true} is VALID [2022-02-20 19:59:00,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {38764#true} assume true; {38764#true} is VALID [2022-02-20 19:59:00,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38764#true} {38769#(= ~p_dw_st~0 0)} #1903#return; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {38764#true} havoc ~__retres1~0; {38764#true} is VALID [2022-02-20 19:59:00,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {38764#true} assume !(1 == ~p_dw_pc~0); {38764#true} is VALID [2022-02-20 19:59:00,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {38764#true} ~__retres1~0 := 0; {38764#true} is VALID [2022-02-20 19:59:00,361 INFO L290 TraceCheckUtils]: 3: Hoare triple {38764#true} #res := ~__retres1~0; {38764#true} is VALID [2022-02-20 19:59:00,361 INFO L290 TraceCheckUtils]: 4: Hoare triple {38764#true} assume true; {38764#true} is VALID [2022-02-20 19:59:00,362 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {38764#true} {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1897#return; {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:00,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {38764#true} havoc ~__retres1~1; {38764#true} is VALID [2022-02-20 19:59:00,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {38764#true} assume !(1 == ~c_dr_pc~0); {38764#true} is VALID [2022-02-20 19:59:00,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {38764#true} ~__retres1~1 := 0; {38764#true} is VALID [2022-02-20 19:59:00,366 INFO L290 TraceCheckUtils]: 3: Hoare triple {38764#true} #res := ~__retres1~1; {38764#true} is VALID [2022-02-20 19:59:00,366 INFO L290 TraceCheckUtils]: 4: Hoare triple {38764#true} assume true; {38764#true} is VALID [2022-02-20 19:59:00,366 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {38764#true} {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1899#return; {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:00,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {38806#(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; {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:00,367 INFO L272 TraceCheckUtils]: 1: Hoare triple {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {38764#true} is VALID [2022-02-20 19:59:00,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {38764#true} havoc ~__retres1~0; {38764#true} is VALID [2022-02-20 19:59:00,367 INFO L290 TraceCheckUtils]: 3: Hoare triple {38764#true} assume !(1 == ~p_dw_pc~0); {38764#true} is VALID [2022-02-20 19:59:00,367 INFO L290 TraceCheckUtils]: 4: Hoare triple {38764#true} ~__retres1~0 := 0; {38764#true} is VALID [2022-02-20 19:59:00,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {38764#true} #res := ~__retres1~0; {38764#true} is VALID [2022-02-20 19:59:00,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {38764#true} assume true; {38764#true} is VALID [2022-02-20 19:59:00,368 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {38764#true} {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1897#return; {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:00,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:00,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:00,368 INFO L272 TraceCheckUtils]: 10: Hoare triple {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {38764#true} is VALID [2022-02-20 19:59:00,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {38764#true} havoc ~__retres1~1; {38764#true} is VALID [2022-02-20 19:59:00,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {38764#true} assume !(1 == ~c_dr_pc~0); {38764#true} is VALID [2022-02-20 19:59:00,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {38764#true} ~__retres1~1 := 0; {38764#true} is VALID [2022-02-20 19:59:00,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {38764#true} #res := ~__retres1~1; {38764#true} is VALID [2022-02-20 19:59:00,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {38764#true} assume true; {38764#true} is VALID [2022-02-20 19:59:00,369 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38764#true} {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1899#return; {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:00,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:00,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:00,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:00,371 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {38769#(= ~p_dw_st~0 0)} #1905#return; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {38805#(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); {38764#true} is VALID [2022-02-20 19:59:00,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {38764#true} assume !(1 == ~q_write_ev~0); {38764#true} is VALID [2022-02-20 19:59:00,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {38764#true} assume true; {38764#true} is VALID [2022-02-20 19:59:00,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38764#true} {38769#(= ~p_dw_st~0 0)} #1907#return; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:00,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {38764#true} havoc ~__retres1~2; {38764#true} is VALID [2022-02-20 19:59:00,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {38764#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {38769#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {38769#(= ~p_dw_st~0 0)} assume true; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,386 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {38769#(= ~p_dw_st~0 0)} {38769#(= ~p_dw_st~0 0)} #1909#return; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {38764#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; {38764#true} is VALID [2022-02-20 19:59:00,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {38764#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {38764#true} is VALID [2022-02-20 19:59:00,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {38764#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {38764#true} is VALID [2022-02-20 19:59:00,386 INFO L290 TraceCheckUtils]: 3: Hoare triple {38764#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; {38764#true} is VALID [2022-02-20 19:59:00,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {38764#true} call update_channels1(); {38804#(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:00,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {38804#(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); {38764#true} is VALID [2022-02-20 19:59:00,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {38764#true} assume true; {38764#true} is VALID [2022-02-20 19:59:00,387 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {38764#true} {38764#true} #1901#return; {38764#true} is VALID [2022-02-20 19:59:00,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {38764#true} assume { :begin_inline_init_threads1 } true; {38764#true} is VALID [2022-02-20 19:59:00,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {38764#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {38769#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {38769#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,388 INFO L272 TraceCheckUtils]: 12: Hoare triple {38769#(= ~p_dw_st~0 0)} call fire_delta_events1(); {38805#(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:00,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {38805#(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); {38764#true} is VALID [2022-02-20 19:59:00,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {38764#true} assume !(0 == ~q_write_ev~0); {38764#true} is VALID [2022-02-20 19:59:00,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {38764#true} assume true; {38764#true} is VALID [2022-02-20 19:59:00,389 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38764#true} {38769#(= ~p_dw_st~0 0)} #1903#return; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,389 INFO L272 TraceCheckUtils]: 17: Hoare triple {38769#(= ~p_dw_st~0 0)} call activate_threads1(); {38806#(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:00,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {38806#(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; {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:00,390 INFO L272 TraceCheckUtils]: 19: Hoare triple {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {38764#true} is VALID [2022-02-20 19:59:00,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {38764#true} havoc ~__retres1~0; {38764#true} is VALID [2022-02-20 19:59:00,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {38764#true} assume !(1 == ~p_dw_pc~0); {38764#true} is VALID [2022-02-20 19:59:00,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {38764#true} ~__retres1~0 := 0; {38764#true} is VALID [2022-02-20 19:59:00,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {38764#true} #res := ~__retres1~0; {38764#true} is VALID [2022-02-20 19:59:00,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {38764#true} assume true; {38764#true} is VALID [2022-02-20 19:59:00,391 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {38764#true} {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1897#return; {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:00,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:00,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:00,391 INFO L272 TraceCheckUtils]: 28: Hoare triple {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {38764#true} is VALID [2022-02-20 19:59:00,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {38764#true} havoc ~__retres1~1; {38764#true} is VALID [2022-02-20 19:59:00,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {38764#true} assume !(1 == ~c_dr_pc~0); {38764#true} is VALID [2022-02-20 19:59:00,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {38764#true} ~__retres1~1 := 0; {38764#true} is VALID [2022-02-20 19:59:00,392 INFO L290 TraceCheckUtils]: 32: Hoare triple {38764#true} #res := ~__retres1~1; {38764#true} is VALID [2022-02-20 19:59:00,392 INFO L290 TraceCheckUtils]: 33: Hoare triple {38764#true} assume true; {38764#true} is VALID [2022-02-20 19:59:00,392 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {38764#true} {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1899#return; {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:00,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:00,393 INFO L290 TraceCheckUtils]: 36: Hoare triple {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:00,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:59:00,394 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {38807#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {38769#(= ~p_dw_st~0 0)} #1905#return; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,394 INFO L272 TraceCheckUtils]: 39: Hoare triple {38769#(= ~p_dw_st~0 0)} call reset_delta_events1(); {38805#(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:00,395 INFO L290 TraceCheckUtils]: 40: Hoare triple {38805#(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); {38764#true} is VALID [2022-02-20 19:59:00,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {38764#true} assume !(1 == ~q_write_ev~0); {38764#true} is VALID [2022-02-20 19:59:00,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {38764#true} assume true; {38764#true} is VALID [2022-02-20 19:59:00,395 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {38764#true} {38769#(= ~p_dw_st~0 0)} #1907#return; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,395 INFO L290 TraceCheckUtils]: 44: Hoare triple {38769#(= ~p_dw_st~0 0)} assume !false; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {38769#(= ~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; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {38769#(= ~p_dw_st~0 0)} assume !false; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,396 INFO L272 TraceCheckUtils]: 47: Hoare triple {38769#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {38764#true} is VALID [2022-02-20 19:59:00,396 INFO L290 TraceCheckUtils]: 48: Hoare triple {38764#true} havoc ~__retres1~2; {38764#true} is VALID [2022-02-20 19:59:00,396 INFO L290 TraceCheckUtils]: 49: Hoare triple {38764#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,397 INFO L290 TraceCheckUtils]: 50: Hoare triple {38769#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,397 INFO L290 TraceCheckUtils]: 51: Hoare triple {38769#(= ~p_dw_st~0 0)} assume true; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,397 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {38769#(= ~p_dw_st~0 0)} {38769#(= ~p_dw_st~0 0)} #1909#return; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,397 INFO L290 TraceCheckUtils]: 53: Hoare triple {38769#(= ~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; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,398 INFO L290 TraceCheckUtils]: 54: Hoare triple {38769#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {38769#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:59:00,398 INFO L290 TraceCheckUtils]: 55: Hoare triple {38769#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {38765#false} is VALID [2022-02-20 19:59:00,398 INFO L290 TraceCheckUtils]: 56: Hoare triple {38765#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; {38765#false} is VALID [2022-02-20 19:59:00,398 INFO L290 TraceCheckUtils]: 57: Hoare triple {38765#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; {38765#false} is VALID [2022-02-20 19:59:00,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {38765#false} assume 0 == ~c_dr_pc~0; {38765#false} is VALID [2022-02-20 19:59:00,398 INFO L290 TraceCheckUtils]: 59: Hoare triple {38765#false} assume !false; {38765#false} is VALID [2022-02-20 19:59:00,399 INFO L290 TraceCheckUtils]: 60: Hoare triple {38765#false} assume !(1 == ~q_free~0); {38765#false} is VALID [2022-02-20 19:59:00,399 INFO L290 TraceCheckUtils]: 61: Hoare triple {38765#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; {38765#false} is VALID [2022-02-20 19:59:00,399 INFO L290 TraceCheckUtils]: 62: Hoare triple {38765#false} assume !(~p_last_write~0 == ~c_last_read~0); {38765#false} is VALID [2022-02-20 19:59:00,399 INFO L272 TraceCheckUtils]: 63: Hoare triple {38765#false} call error1(); {38765#false} is VALID [2022-02-20 19:59:00,399 INFO L290 TraceCheckUtils]: 64: Hoare triple {38765#false} assume !false; {38765#false} is VALID [2022-02-20 19:59:00,399 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:59:00,399 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:00,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864269416] [2022-02-20 19:59:00,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864269416] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:00,400 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:00,400 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:00,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307521266] [2022-02-20 19:59:00,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:00,401 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:59:00,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:00,401 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:59:00,438 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:59:00,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:00,439 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:00,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:00,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:00,439 INFO L87 Difference]: Start difference. First operand 1548 states and 2085 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:59:02,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:02,861 INFO L93 Difference]: Finished difference Result 3887 states and 5046 transitions. [2022-02-20 19:59:02,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:59:02,862 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:59:02,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:02,862 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:59:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1008 transitions. [2022-02-20 19:59:02,867 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:59:02,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1008 transitions. [2022-02-20 19:59:02,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 1008 transitions. [2022-02-20 19:59:03,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1008 edges. 1008 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:03,871 INFO L225 Difference]: With dead ends: 3887 [2022-02-20 19:59:03,872 INFO L226 Difference]: Without dead ends: 2731 [2022-02-20 19:59:03,873 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:59:03,874 INFO L933 BasicCegarLoop]: 700 mSDtfsCounter, 1768 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:03,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1801 Valid, 1754 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:59:03,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2731 states. [2022-02-20 19:59:04,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2731 to 2611. [2022-02-20 19:59:04,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:04,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2731 states. Second operand has 2611 states, 2094 states have (on average 1.3142311365807067) internal successors, (2752), 2130 states have internal predecessors, (2752), 265 states have call successors, (265), 206 states have call predecessors, (265), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) [2022-02-20 19:59:04,009 INFO L74 IsIncluded]: Start isIncluded. First operand 2731 states. Second operand has 2611 states, 2094 states have (on average 1.3142311365807067) internal successors, (2752), 2130 states have internal predecessors, (2752), 265 states have call successors, (265), 206 states have call predecessors, (265), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) [2022-02-20 19:59:04,011 INFO L87 Difference]: Start difference. First operand 2731 states. Second operand has 2611 states, 2094 states have (on average 1.3142311365807067) internal successors, (2752), 2130 states have internal predecessors, (2752), 265 states have call successors, (265), 206 states have call predecessors, (265), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) [2022-02-20 19:59:04,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:04,208 INFO L93 Difference]: Finished difference Result 2731 states and 3520 transitions. [2022-02-20 19:59:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 3520 transitions. [2022-02-20 19:59:04,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:04,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:04,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 2611 states, 2094 states have (on average 1.3142311365807067) internal successors, (2752), 2130 states have internal predecessors, (2752), 265 states have call successors, (265), 206 states have call predecessors, (265), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) Second operand 2731 states. [2022-02-20 19:59:04,216 INFO L87 Difference]: Start difference. First operand has 2611 states, 2094 states have (on average 1.3142311365807067) internal successors, (2752), 2130 states have internal predecessors, (2752), 265 states have call successors, (265), 206 states have call predecessors, (265), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) Second operand 2731 states. [2022-02-20 19:59:04,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:04,417 INFO L93 Difference]: Finished difference Result 2731 states and 3520 transitions. [2022-02-20 19:59:04,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 3520 transitions. [2022-02-20 19:59:04,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:04,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:04,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:04,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2611 states, 2094 states have (on average 1.3142311365807067) internal successors, (2752), 2130 states have internal predecessors, (2752), 265 states have call successors, (265), 206 states have call predecessors, (265), 250 states have return successors, (370), 277 states have call predecessors, (370), 261 states have call successors, (370) [2022-02-20 19:59:04,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 3387 transitions. [2022-02-20 19:59:04,709 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 3387 transitions. Word has length 65 [2022-02-20 19:59:04,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:04,710 INFO L470 AbstractCegarLoop]: Abstraction has 2611 states and 3387 transitions. [2022-02-20 19:59:04,710 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:59:04,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3387 transitions. [2022-02-20 19:59:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:59:04,711 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:04,711 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:59:04,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:59:04,711 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:04,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:04,711 INFO L85 PathProgramCache]: Analyzing trace with hash 20568174, now seen corresponding path program 1 times [2022-02-20 19:59:04,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:04,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35424657] [2022-02-20 19:59:04,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:04,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:04,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:04,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {53054#(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); {53014#true} is VALID [2022-02-20 19:59:04,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {53014#true} assume true; {53014#true} is VALID [2022-02-20 19:59:04,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53014#true} {53016#(= ~q_free~0 1)} #1901#return; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:04,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {53055#(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); {53014#true} is VALID [2022-02-20 19:59:04,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {53014#true} assume !(0 == ~q_write_ev~0); {53014#true} is VALID [2022-02-20 19:59:04,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {53014#true} assume true; {53014#true} is VALID [2022-02-20 19:59:04,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53014#true} {53016#(= ~q_free~0 1)} #1903#return; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:04,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:04,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {53014#true} havoc ~__retres1~0; {53014#true} is VALID [2022-02-20 19:59:04,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {53014#true} assume !(1 == ~p_dw_pc~0); {53014#true} is VALID [2022-02-20 19:59:04,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {53014#true} ~__retres1~0 := 0; {53014#true} is VALID [2022-02-20 19:59:04,771 INFO L290 TraceCheckUtils]: 3: Hoare triple {53014#true} #res := ~__retres1~0; {53014#true} is VALID [2022-02-20 19:59:04,771 INFO L290 TraceCheckUtils]: 4: Hoare triple {53014#true} assume true; {53014#true} is VALID [2022-02-20 19:59:04,771 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {53014#true} {53014#true} #1897#return; {53014#true} is VALID [2022-02-20 19:59:04,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:04,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {53014#true} havoc ~__retres1~1; {53014#true} is VALID [2022-02-20 19:59:04,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {53014#true} assume !(1 == ~c_dr_pc~0); {53014#true} is VALID [2022-02-20 19:59:04,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {53014#true} ~__retres1~1 := 0; {53014#true} is VALID [2022-02-20 19:59:04,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {53014#true} #res := ~__retres1~1; {53014#true} is VALID [2022-02-20 19:59:04,777 INFO L290 TraceCheckUtils]: 4: Hoare triple {53014#true} assume true; {53014#true} is VALID [2022-02-20 19:59:04,777 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {53014#true} {53014#true} #1899#return; {53014#true} is VALID [2022-02-20 19:59:04,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {53056#(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; {53014#true} is VALID [2022-02-20 19:59:04,777 INFO L272 TraceCheckUtils]: 1: Hoare triple {53014#true} call #t~ret8 := is_do_write_p_triggered(); {53014#true} is VALID [2022-02-20 19:59:04,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {53014#true} havoc ~__retres1~0; {53014#true} is VALID [2022-02-20 19:59:04,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {53014#true} assume !(1 == ~p_dw_pc~0); {53014#true} is VALID [2022-02-20 19:59:04,777 INFO L290 TraceCheckUtils]: 4: Hoare triple {53014#true} ~__retres1~0 := 0; {53014#true} is VALID [2022-02-20 19:59:04,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {53014#true} #res := ~__retres1~0; {53014#true} is VALID [2022-02-20 19:59:04,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {53014#true} assume true; {53014#true} is VALID [2022-02-20 19:59:04,778 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {53014#true} {53014#true} #1897#return; {53014#true} is VALID [2022-02-20 19:59:04,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {53014#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {53014#true} is VALID [2022-02-20 19:59:04,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {53014#true} assume !(0 != ~tmp~1); {53014#true} is VALID [2022-02-20 19:59:04,778 INFO L272 TraceCheckUtils]: 10: Hoare triple {53014#true} call #t~ret9 := is_do_read_c_triggered(); {53014#true} is VALID [2022-02-20 19:59:04,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {53014#true} havoc ~__retres1~1; {53014#true} is VALID [2022-02-20 19:59:04,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {53014#true} assume !(1 == ~c_dr_pc~0); {53014#true} is VALID [2022-02-20 19:59:04,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {53014#true} ~__retres1~1 := 0; {53014#true} is VALID [2022-02-20 19:59:04,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {53014#true} #res := ~__retres1~1; {53014#true} is VALID [2022-02-20 19:59:04,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {53014#true} assume true; {53014#true} is VALID [2022-02-20 19:59:04,779 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {53014#true} {53014#true} #1899#return; {53014#true} is VALID [2022-02-20 19:59:04,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {53014#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {53014#true} is VALID [2022-02-20 19:59:04,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {53014#true} assume !(0 != ~tmp___0~1); {53014#true} is VALID [2022-02-20 19:59:04,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {53014#true} assume true; {53014#true} is VALID [2022-02-20 19:59:04,779 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {53014#true} {53016#(= ~q_free~0 1)} #1905#return; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:04,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {53055#(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); {53014#true} is VALID [2022-02-20 19:59:04,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {53014#true} assume !(1 == ~q_write_ev~0); {53014#true} is VALID [2022-02-20 19:59:04,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {53014#true} assume true; {53014#true} is VALID [2022-02-20 19:59:04,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53014#true} {53016#(= ~q_free~0 1)} #1907#return; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:04,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {53014#true} havoc ~__retres1~2; {53014#true} is VALID [2022-02-20 19:59:04,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {53014#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {53014#true} is VALID [2022-02-20 19:59:04,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {53014#true} #res := ~__retres1~2; {53014#true} is VALID [2022-02-20 19:59:04,790 INFO L290 TraceCheckUtils]: 3: Hoare triple {53014#true} assume true; {53014#true} is VALID [2022-02-20 19:59:04,791 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {53014#true} {53016#(= ~q_free~0 1)} #1909#return; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {53014#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; {53014#true} is VALID [2022-02-20 19:59:04,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {53014#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {53014#true} is VALID [2022-02-20 19:59:04,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {53014#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,791 INFO L290 TraceCheckUtils]: 3: Hoare triple {53016#(= ~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; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {53016#(= ~q_free~0 1)} call update_channels1(); {53054#(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:04,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {53054#(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); {53014#true} is VALID [2022-02-20 19:59:04,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {53014#true} assume true; {53014#true} is VALID [2022-02-20 19:59:04,792 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {53014#true} {53016#(= ~q_free~0 1)} #1901#return; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {53016#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {53016#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {53016#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {53016#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,794 INFO L272 TraceCheckUtils]: 12: Hoare triple {53016#(= ~q_free~0 1)} call fire_delta_events1(); {53055#(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:04,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {53055#(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); {53014#true} is VALID [2022-02-20 19:59:04,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {53014#true} assume !(0 == ~q_write_ev~0); {53014#true} is VALID [2022-02-20 19:59:04,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {53014#true} assume true; {53014#true} is VALID [2022-02-20 19:59:04,795 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {53014#true} {53016#(= ~q_free~0 1)} #1903#return; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,795 INFO L272 TraceCheckUtils]: 17: Hoare triple {53016#(= ~q_free~0 1)} call activate_threads1(); {53056#(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:04,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {53056#(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; {53014#true} is VALID [2022-02-20 19:59:04,795 INFO L272 TraceCheckUtils]: 19: Hoare triple {53014#true} call #t~ret8 := is_do_write_p_triggered(); {53014#true} is VALID [2022-02-20 19:59:04,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {53014#true} havoc ~__retres1~0; {53014#true} is VALID [2022-02-20 19:59:04,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {53014#true} assume !(1 == ~p_dw_pc~0); {53014#true} is VALID [2022-02-20 19:59:04,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {53014#true} ~__retres1~0 := 0; {53014#true} is VALID [2022-02-20 19:59:04,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {53014#true} #res := ~__retres1~0; {53014#true} is VALID [2022-02-20 19:59:04,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {53014#true} assume true; {53014#true} is VALID [2022-02-20 19:59:04,796 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {53014#true} {53014#true} #1897#return; {53014#true} is VALID [2022-02-20 19:59:04,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {53014#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {53014#true} is VALID [2022-02-20 19:59:04,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {53014#true} assume !(0 != ~tmp~1); {53014#true} is VALID [2022-02-20 19:59:04,796 INFO L272 TraceCheckUtils]: 28: Hoare triple {53014#true} call #t~ret9 := is_do_read_c_triggered(); {53014#true} is VALID [2022-02-20 19:59:04,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {53014#true} havoc ~__retres1~1; {53014#true} is VALID [2022-02-20 19:59:04,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {53014#true} assume !(1 == ~c_dr_pc~0); {53014#true} is VALID [2022-02-20 19:59:04,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {53014#true} ~__retres1~1 := 0; {53014#true} is VALID [2022-02-20 19:59:04,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {53014#true} #res := ~__retres1~1; {53014#true} is VALID [2022-02-20 19:59:04,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {53014#true} assume true; {53014#true} is VALID [2022-02-20 19:59:04,797 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {53014#true} {53014#true} #1899#return; {53014#true} is VALID [2022-02-20 19:59:04,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {53014#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {53014#true} is VALID [2022-02-20 19:59:04,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {53014#true} assume !(0 != ~tmp___0~1); {53014#true} is VALID [2022-02-20 19:59:04,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {53014#true} assume true; {53014#true} is VALID [2022-02-20 19:59:04,797 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {53014#true} {53016#(= ~q_free~0 1)} #1905#return; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,798 INFO L272 TraceCheckUtils]: 39: Hoare triple {53016#(= ~q_free~0 1)} call reset_delta_events1(); {53055#(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:04,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {53055#(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); {53014#true} is VALID [2022-02-20 19:59:04,798 INFO L290 TraceCheckUtils]: 41: Hoare triple {53014#true} assume !(1 == ~q_write_ev~0); {53014#true} is VALID [2022-02-20 19:59:04,798 INFO L290 TraceCheckUtils]: 42: Hoare triple {53014#true} assume true; {53014#true} is VALID [2022-02-20 19:59:04,798 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {53014#true} {53016#(= ~q_free~0 1)} #1907#return; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,799 INFO L290 TraceCheckUtils]: 44: Hoare triple {53016#(= ~q_free~0 1)} assume !false; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,799 INFO L290 TraceCheckUtils]: 45: Hoare triple {53016#(= ~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; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,799 INFO L290 TraceCheckUtils]: 46: Hoare triple {53016#(= ~q_free~0 1)} assume !false; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,799 INFO L272 TraceCheckUtils]: 47: Hoare triple {53016#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {53014#true} is VALID [2022-02-20 19:59:04,799 INFO L290 TraceCheckUtils]: 48: Hoare triple {53014#true} havoc ~__retres1~2; {53014#true} is VALID [2022-02-20 19:59:04,800 INFO L290 TraceCheckUtils]: 49: Hoare triple {53014#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {53014#true} is VALID [2022-02-20 19:59:04,800 INFO L290 TraceCheckUtils]: 50: Hoare triple {53014#true} #res := ~__retres1~2; {53014#true} is VALID [2022-02-20 19:59:04,800 INFO L290 TraceCheckUtils]: 51: Hoare triple {53014#true} assume true; {53014#true} is VALID [2022-02-20 19:59:04,800 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {53014#true} {53016#(= ~q_free~0 1)} #1909#return; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,800 INFO L290 TraceCheckUtils]: 53: Hoare triple {53016#(= ~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; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,801 INFO L290 TraceCheckUtils]: 54: Hoare triple {53016#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,801 INFO L290 TraceCheckUtils]: 55: Hoare triple {53016#(= ~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; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,801 INFO L290 TraceCheckUtils]: 56: Hoare triple {53016#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,802 INFO L290 TraceCheckUtils]: 57: Hoare triple {53016#(= ~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; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,802 INFO L290 TraceCheckUtils]: 58: Hoare triple {53016#(= ~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; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,802 INFO L290 TraceCheckUtils]: 59: Hoare triple {53016#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,802 INFO L290 TraceCheckUtils]: 60: Hoare triple {53016#(= ~q_free~0 1)} assume !false; {53016#(= ~q_free~0 1)} is VALID [2022-02-20 19:59:04,803 INFO L290 TraceCheckUtils]: 61: Hoare triple {53016#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {53015#false} is VALID [2022-02-20 19:59:04,803 INFO L290 TraceCheckUtils]: 62: Hoare triple {53015#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; {53015#false} is VALID [2022-02-20 19:59:04,803 INFO L290 TraceCheckUtils]: 63: Hoare triple {53015#false} assume !(~p_last_write~0 == ~c_last_read~0); {53015#false} is VALID [2022-02-20 19:59:04,803 INFO L272 TraceCheckUtils]: 64: Hoare triple {53015#false} call error1(); {53015#false} is VALID [2022-02-20 19:59:04,803 INFO L290 TraceCheckUtils]: 65: Hoare triple {53015#false} assume !false; {53015#false} is VALID [2022-02-20 19:59:04,803 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:59:04,803 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:04,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35424657] [2022-02-20 19:59:04,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35424657] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:04,804 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:04,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:04,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192293779] [2022-02-20 19:59:04,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:04,805 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:59:04,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:04,805 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:59:04,842 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:59:04,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:04,842 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:04,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:04,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:04,843 INFO L87 Difference]: Start difference. First operand 2611 states and 3387 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:59:08,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:08,240 INFO L93 Difference]: Finished difference Result 5927 states and 7532 transitions. [2022-02-20 19:59:08,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:59:08,240 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:59:08,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:08,242 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:59:08,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 998 transitions. [2022-02-20 19:59:08,246 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:59:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 998 transitions. [2022-02-20 19:59:08,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 998 transitions. [2022-02-20 19:59:08,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 998 edges. 998 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:09,537 INFO L225 Difference]: With dead ends: 5927 [2022-02-20 19:59:09,539 INFO L226 Difference]: Without dead ends: 3713 [2022-02-20 19:59:09,542 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:59:09,542 INFO L933 BasicCegarLoop]: 729 mSDtfsCounter, 828 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 2066 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:09,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [837 Valid, 2066 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:59:09,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3713 states. [2022-02-20 19:59:09,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3713 to 3445. [2022-02-20 19:59:09,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:09,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3713 states. Second operand has 3445 states, 2742 states have (on average 1.2935813274981764) internal successors, (3547), 2783 states have internal predecessors, (3547), 357 states have call successors, (357), 286 states have call predecessors, (357), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) [2022-02-20 19:59:09,744 INFO L74 IsIncluded]: Start isIncluded. First operand 3713 states. Second operand has 3445 states, 2742 states have (on average 1.2935813274981764) internal successors, (3547), 2783 states have internal predecessors, (3547), 357 states have call successors, (357), 286 states have call predecessors, (357), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) [2022-02-20 19:59:09,747 INFO L87 Difference]: Start difference. First operand 3713 states. Second operand has 3445 states, 2742 states have (on average 1.2935813274981764) internal successors, (3547), 2783 states have internal predecessors, (3547), 357 states have call successors, (357), 286 states have call predecessors, (357), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) [2022-02-20 19:59:10,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:10,156 INFO L93 Difference]: Finished difference Result 3713 states and 4700 transitions. [2022-02-20 19:59:10,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 4700 transitions. [2022-02-20 19:59:10,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:10,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:10,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 3445 states, 2742 states have (on average 1.2935813274981764) internal successors, (3547), 2783 states have internal predecessors, (3547), 357 states have call successors, (357), 286 states have call predecessors, (357), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) Second operand 3713 states. [2022-02-20 19:59:10,168 INFO L87 Difference]: Start difference. First operand has 3445 states, 2742 states have (on average 1.2935813274981764) internal successors, (3547), 2783 states have internal predecessors, (3547), 357 states have call successors, (357), 286 states have call predecessors, (357), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) Second operand 3713 states. [2022-02-20 19:59:10,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:10,561 INFO L93 Difference]: Finished difference Result 3713 states and 4700 transitions. [2022-02-20 19:59:10,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 4700 transitions. [2022-02-20 19:59:10,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:10,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:10,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:10,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3445 states, 2742 states have (on average 1.2935813274981764) internal successors, (3547), 2783 states have internal predecessors, (3547), 357 states have call successors, (357), 286 states have call predecessors, (357), 344 states have return successors, (484), 378 states have call predecessors, (484), 353 states have call successors, (484) [2022-02-20 19:59:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 4388 transitions. [2022-02-20 19:59:11,062 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 4388 transitions. Word has length 66 [2022-02-20 19:59:11,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:11,063 INFO L470 AbstractCegarLoop]: Abstraction has 3445 states and 4388 transitions. [2022-02-20 19:59:11,063 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:59:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 4388 transitions. [2022-02-20 19:59:11,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:59:11,065 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:11,065 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:59:11,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:59:11,065 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:11,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:11,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1226736109, now seen corresponding path program 1 times [2022-02-20 19:59:11,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:11,066 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905931410] [2022-02-20 19:59:11,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:11,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:11,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:11,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {73115#(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); {73075#true} is VALID [2022-02-20 19:59:11,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {73075#true} assume true; {73075#true} is VALID [2022-02-20 19:59:11,099 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73075#true} {73077#(= ~p_dw_pc~0 0)} #1901#return; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:11,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {73116#(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); {73075#true} is VALID [2022-02-20 19:59:11,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {73075#true} assume !(0 == ~q_write_ev~0); {73075#true} is VALID [2022-02-20 19:59:11,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {73075#true} assume true; {73075#true} is VALID [2022-02-20 19:59:11,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73075#true} {73077#(= ~p_dw_pc~0 0)} #1903#return; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:11,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:11,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {73075#true} havoc ~__retres1~0; {73075#true} is VALID [2022-02-20 19:59:11,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {73075#true} assume !(1 == ~p_dw_pc~0); {73075#true} is VALID [2022-02-20 19:59:11,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {73075#true} ~__retres1~0 := 0; {73075#true} is VALID [2022-02-20 19:59:11,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {73075#true} #res := ~__retres1~0; {73075#true} is VALID [2022-02-20 19:59:11,119 INFO L290 TraceCheckUtils]: 4: Hoare triple {73075#true} assume true; {73075#true} is VALID [2022-02-20 19:59:11,119 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {73075#true} {73075#true} #1897#return; {73075#true} is VALID [2022-02-20 19:59:11,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:11,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {73075#true} havoc ~__retres1~1; {73075#true} is VALID [2022-02-20 19:59:11,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {73075#true} assume !(1 == ~c_dr_pc~0); {73075#true} is VALID [2022-02-20 19:59:11,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {73075#true} ~__retres1~1 := 0; {73075#true} is VALID [2022-02-20 19:59:11,121 INFO L290 TraceCheckUtils]: 3: Hoare triple {73075#true} #res := ~__retres1~1; {73075#true} is VALID [2022-02-20 19:59:11,121 INFO L290 TraceCheckUtils]: 4: Hoare triple {73075#true} assume true; {73075#true} is VALID [2022-02-20 19:59:11,121 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {73075#true} {73075#true} #1899#return; {73075#true} is VALID [2022-02-20 19:59:11,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {73117#(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; {73075#true} is VALID [2022-02-20 19:59:11,121 INFO L272 TraceCheckUtils]: 1: Hoare triple {73075#true} call #t~ret8 := is_do_write_p_triggered(); {73075#true} is VALID [2022-02-20 19:59:11,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {73075#true} havoc ~__retres1~0; {73075#true} is VALID [2022-02-20 19:59:11,121 INFO L290 TraceCheckUtils]: 3: Hoare triple {73075#true} assume !(1 == ~p_dw_pc~0); {73075#true} is VALID [2022-02-20 19:59:11,122 INFO L290 TraceCheckUtils]: 4: Hoare triple {73075#true} ~__retres1~0 := 0; {73075#true} is VALID [2022-02-20 19:59:11,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {73075#true} #res := ~__retres1~0; {73075#true} is VALID [2022-02-20 19:59:11,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {73075#true} assume true; {73075#true} is VALID [2022-02-20 19:59:11,122 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {73075#true} {73075#true} #1897#return; {73075#true} is VALID [2022-02-20 19:59:11,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {73075#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {73075#true} is VALID [2022-02-20 19:59:11,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {73075#true} assume !(0 != ~tmp~1); {73075#true} is VALID [2022-02-20 19:59:11,122 INFO L272 TraceCheckUtils]: 10: Hoare triple {73075#true} call #t~ret9 := is_do_read_c_triggered(); {73075#true} is VALID [2022-02-20 19:59:11,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {73075#true} havoc ~__retres1~1; {73075#true} is VALID [2022-02-20 19:59:11,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {73075#true} assume !(1 == ~c_dr_pc~0); {73075#true} is VALID [2022-02-20 19:59:11,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {73075#true} ~__retres1~1 := 0; {73075#true} is VALID [2022-02-20 19:59:11,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {73075#true} #res := ~__retres1~1; {73075#true} is VALID [2022-02-20 19:59:11,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {73075#true} assume true; {73075#true} is VALID [2022-02-20 19:59:11,123 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {73075#true} {73075#true} #1899#return; {73075#true} is VALID [2022-02-20 19:59:11,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {73075#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {73075#true} is VALID [2022-02-20 19:59:11,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {73075#true} assume !(0 != ~tmp___0~1); {73075#true} is VALID [2022-02-20 19:59:11,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {73075#true} assume true; {73075#true} is VALID [2022-02-20 19:59:11,123 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {73075#true} {73077#(= ~p_dw_pc~0 0)} #1905#return; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:11,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {73116#(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); {73075#true} is VALID [2022-02-20 19:59:11,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {73075#true} assume !(1 == ~q_write_ev~0); {73075#true} is VALID [2022-02-20 19:59:11,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {73075#true} assume true; {73075#true} is VALID [2022-02-20 19:59:11,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73075#true} {73077#(= ~p_dw_pc~0 0)} #1907#return; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:11,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {73075#true} havoc ~__retres1~2; {73075#true} is VALID [2022-02-20 19:59:11,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {73075#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {73075#true} is VALID [2022-02-20 19:59:11,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {73075#true} #res := ~__retres1~2; {73075#true} is VALID [2022-02-20 19:59:11,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {73075#true} assume true; {73075#true} is VALID [2022-02-20 19:59:11,129 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {73075#true} {73077#(= ~p_dw_pc~0 0)} #1909#return; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {73075#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; {73075#true} is VALID [2022-02-20 19:59:11,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {73075#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {73075#true} is VALID [2022-02-20 19:59:11,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {73075#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {73077#(= ~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; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {73077#(= ~p_dw_pc~0 0)} call update_channels1(); {73115#(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:11,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {73115#(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); {73075#true} is VALID [2022-02-20 19:59:11,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {73075#true} assume true; {73075#true} is VALID [2022-02-20 19:59:11,131 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {73075#true} {73077#(= ~p_dw_pc~0 0)} #1901#return; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {73077#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {73077#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {73077#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {73077#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,133 INFO L272 TraceCheckUtils]: 12: Hoare triple {73077#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {73116#(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:11,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {73116#(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); {73075#true} is VALID [2022-02-20 19:59:11,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {73075#true} assume !(0 == ~q_write_ev~0); {73075#true} is VALID [2022-02-20 19:59:11,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {73075#true} assume true; {73075#true} is VALID [2022-02-20 19:59:11,133 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {73075#true} {73077#(= ~p_dw_pc~0 0)} #1903#return; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,134 INFO L272 TraceCheckUtils]: 17: Hoare triple {73077#(= ~p_dw_pc~0 0)} call activate_threads1(); {73117#(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:11,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {73117#(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; {73075#true} is VALID [2022-02-20 19:59:11,134 INFO L272 TraceCheckUtils]: 19: Hoare triple {73075#true} call #t~ret8 := is_do_write_p_triggered(); {73075#true} is VALID [2022-02-20 19:59:11,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {73075#true} havoc ~__retres1~0; {73075#true} is VALID [2022-02-20 19:59:11,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {73075#true} assume !(1 == ~p_dw_pc~0); {73075#true} is VALID [2022-02-20 19:59:11,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {73075#true} ~__retres1~0 := 0; {73075#true} is VALID [2022-02-20 19:59:11,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {73075#true} #res := ~__retres1~0; {73075#true} is VALID [2022-02-20 19:59:11,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {73075#true} assume true; {73075#true} is VALID [2022-02-20 19:59:11,135 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {73075#true} {73075#true} #1897#return; {73075#true} is VALID [2022-02-20 19:59:11,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {73075#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {73075#true} is VALID [2022-02-20 19:59:11,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {73075#true} assume !(0 != ~tmp~1); {73075#true} is VALID [2022-02-20 19:59:11,135 INFO L272 TraceCheckUtils]: 28: Hoare triple {73075#true} call #t~ret9 := is_do_read_c_triggered(); {73075#true} is VALID [2022-02-20 19:59:11,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {73075#true} havoc ~__retres1~1; {73075#true} is VALID [2022-02-20 19:59:11,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {73075#true} assume !(1 == ~c_dr_pc~0); {73075#true} is VALID [2022-02-20 19:59:11,135 INFO L290 TraceCheckUtils]: 31: Hoare triple {73075#true} ~__retres1~1 := 0; {73075#true} is VALID [2022-02-20 19:59:11,135 INFO L290 TraceCheckUtils]: 32: Hoare triple {73075#true} #res := ~__retres1~1; {73075#true} is VALID [2022-02-20 19:59:11,135 INFO L290 TraceCheckUtils]: 33: Hoare triple {73075#true} assume true; {73075#true} is VALID [2022-02-20 19:59:11,136 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {73075#true} {73075#true} #1899#return; {73075#true} is VALID [2022-02-20 19:59:11,136 INFO L290 TraceCheckUtils]: 35: Hoare triple {73075#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {73075#true} is VALID [2022-02-20 19:59:11,136 INFO L290 TraceCheckUtils]: 36: Hoare triple {73075#true} assume !(0 != ~tmp___0~1); {73075#true} is VALID [2022-02-20 19:59:11,136 INFO L290 TraceCheckUtils]: 37: Hoare triple {73075#true} assume true; {73075#true} is VALID [2022-02-20 19:59:11,136 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {73075#true} {73077#(= ~p_dw_pc~0 0)} #1905#return; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,137 INFO L272 TraceCheckUtils]: 39: Hoare triple {73077#(= ~p_dw_pc~0 0)} call reset_delta_events1(); {73116#(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:11,137 INFO L290 TraceCheckUtils]: 40: Hoare triple {73116#(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); {73075#true} is VALID [2022-02-20 19:59:11,137 INFO L290 TraceCheckUtils]: 41: Hoare triple {73075#true} assume !(1 == ~q_write_ev~0); {73075#true} is VALID [2022-02-20 19:59:11,137 INFO L290 TraceCheckUtils]: 42: Hoare triple {73075#true} assume true; {73075#true} is VALID [2022-02-20 19:59:11,137 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {73075#true} {73077#(= ~p_dw_pc~0 0)} #1907#return; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,138 INFO L290 TraceCheckUtils]: 44: Hoare triple {73077#(= ~p_dw_pc~0 0)} assume !false; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,138 INFO L290 TraceCheckUtils]: 45: Hoare triple {73077#(= ~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; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,138 INFO L290 TraceCheckUtils]: 46: Hoare triple {73077#(= ~p_dw_pc~0 0)} assume !false; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,138 INFO L272 TraceCheckUtils]: 47: Hoare triple {73077#(= ~p_dw_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {73075#true} is VALID [2022-02-20 19:59:11,138 INFO L290 TraceCheckUtils]: 48: Hoare triple {73075#true} havoc ~__retres1~2; {73075#true} is VALID [2022-02-20 19:59:11,138 INFO L290 TraceCheckUtils]: 49: Hoare triple {73075#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {73075#true} is VALID [2022-02-20 19:59:11,139 INFO L290 TraceCheckUtils]: 50: Hoare triple {73075#true} #res := ~__retres1~2; {73075#true} is VALID [2022-02-20 19:59:11,139 INFO L290 TraceCheckUtils]: 51: Hoare triple {73075#true} assume true; {73075#true} is VALID [2022-02-20 19:59:11,139 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {73075#true} {73077#(= ~p_dw_pc~0 0)} #1909#return; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,139 INFO L290 TraceCheckUtils]: 53: Hoare triple {73077#(= ~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; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,140 INFO L290 TraceCheckUtils]: 54: Hoare triple {73077#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,140 INFO L290 TraceCheckUtils]: 55: Hoare triple {73077#(= ~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; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,140 INFO L290 TraceCheckUtils]: 56: Hoare triple {73077#(= ~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; {73077#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:59:11,141 INFO L290 TraceCheckUtils]: 57: Hoare triple {73077#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {73076#false} is VALID [2022-02-20 19:59:11,141 INFO L290 TraceCheckUtils]: 58: Hoare triple {73076#false} assume 1 == ~p_dw_pc~0; {73076#false} is VALID [2022-02-20 19:59:11,141 INFO L290 TraceCheckUtils]: 59: Hoare triple {73076#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; {73076#false} is VALID [2022-02-20 19:59:11,141 INFO L290 TraceCheckUtils]: 60: Hoare triple {73076#false} assume !false; {73076#false} is VALID [2022-02-20 19:59:11,141 INFO L290 TraceCheckUtils]: 61: Hoare triple {73076#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {73076#false} is VALID [2022-02-20 19:59:11,141 INFO L290 TraceCheckUtils]: 62: Hoare triple {73076#false} assume { :end_inline_do_write_p } true; {73076#false} is VALID [2022-02-20 19:59:11,141 INFO L290 TraceCheckUtils]: 63: Hoare triple {73076#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; {73076#false} is VALID [2022-02-20 19:59:11,141 INFO L290 TraceCheckUtils]: 64: Hoare triple {73076#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; {73076#false} is VALID [2022-02-20 19:59:11,141 INFO L290 TraceCheckUtils]: 65: Hoare triple {73076#false} assume 0 == ~c_dr_pc~0; {73076#false} is VALID [2022-02-20 19:59:11,142 INFO L290 TraceCheckUtils]: 66: Hoare triple {73076#false} assume !false; {73076#false} is VALID [2022-02-20 19:59:11,142 INFO L290 TraceCheckUtils]: 67: Hoare triple {73076#false} assume !(1 == ~q_free~0); {73076#false} is VALID [2022-02-20 19:59:11,142 INFO L290 TraceCheckUtils]: 68: Hoare triple {73076#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; {73076#false} is VALID [2022-02-20 19:59:11,142 INFO L290 TraceCheckUtils]: 69: Hoare triple {73076#false} assume !(~p_last_write~0 == ~c_last_read~0); {73076#false} is VALID [2022-02-20 19:59:11,142 INFO L272 TraceCheckUtils]: 70: Hoare triple {73076#false} call error1(); {73076#false} is VALID [2022-02-20 19:59:11,142 INFO L290 TraceCheckUtils]: 71: Hoare triple {73076#false} assume !false; {73076#false} is VALID [2022-02-20 19:59:11,142 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:59:11,142 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:11,142 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905931410] [2022-02-20 19:59:11,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905931410] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:11,143 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:11,143 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:59:11,143 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985472565] [2022-02-20 19:59:11,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:11,144 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:59:11,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:11,144 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:59:11,188 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:59:11,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:59:11,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:11,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:59:11,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:59:11,188 INFO L87 Difference]: Start difference. First operand 3445 states and 4388 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:59:15,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:15,090 INFO L93 Difference]: Finished difference Result 7317 states and 9162 transitions. [2022-02-20 19:59:15,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:59:15,090 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:59:15,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:15,090 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:59:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 995 transitions. [2022-02-20 19:59:15,095 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:59:15,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 995 transitions. [2022-02-20 19:59:15,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 995 transitions. [2022-02-20 19:59:15,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 995 edges. 995 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:16,315 INFO L225 Difference]: With dead ends: 7317 [2022-02-20 19:59:16,315 INFO L226 Difference]: Without dead ends: 4267 [2022-02-20 19:59:16,319 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:59:16,319 INFO L933 BasicCegarLoop]: 746 mSDtfsCounter, 1733 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:16,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1767 Valid, 1472 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:59:16,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2022-02-20 19:59:16,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 3999. [2022-02-20 19:59:16,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:16,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4267 states. Second operand has 3999 states, 3182 states have (on average 1.2844123192960402) internal successors, (4087), 3227 states have internal predecessors, (4087), 413 states have call successors, (413), 336 states have call predecessors, (413), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) [2022-02-20 19:59:16,521 INFO L74 IsIncluded]: Start isIncluded. First operand 4267 states. Second operand has 3999 states, 3182 states have (on average 1.2844123192960402) internal successors, (4087), 3227 states have internal predecessors, (4087), 413 states have call successors, (413), 336 states have call predecessors, (413), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) [2022-02-20 19:59:16,525 INFO L87 Difference]: Start difference. First operand 4267 states. Second operand has 3999 states, 3182 states have (on average 1.2844123192960402) internal successors, (4087), 3227 states have internal predecessors, (4087), 413 states have call successors, (413), 336 states have call predecessors, (413), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) [2022-02-20 19:59:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:17,045 INFO L93 Difference]: Finished difference Result 4267 states and 5366 transitions. [2022-02-20 19:59:17,045 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 5366 transitions. [2022-02-20 19:59:17,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:17,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:17,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 3999 states, 3182 states have (on average 1.2844123192960402) internal successors, (4087), 3227 states have internal predecessors, (4087), 413 states have call successors, (413), 336 states have call predecessors, (413), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) Second operand 4267 states. [2022-02-20 19:59:17,058 INFO L87 Difference]: Start difference. First operand has 3999 states, 3182 states have (on average 1.2844123192960402) internal successors, (4087), 3227 states have internal predecessors, (4087), 413 states have call successors, (413), 336 states have call predecessors, (413), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) Second operand 4267 states. [2022-02-20 19:59:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:17,550 INFO L93 Difference]: Finished difference Result 4267 states and 5366 transitions. [2022-02-20 19:59:17,550 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 5366 transitions. [2022-02-20 19:59:17,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:17,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:17,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:17,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:17,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3999 states, 3182 states have (on average 1.2844123192960402) internal successors, (4087), 3227 states have internal predecessors, (4087), 413 states have call successors, (413), 336 states have call predecessors, (413), 402 states have return successors, (557), 438 states have call predecessors, (557), 409 states have call successors, (557) [2022-02-20 19:59:18,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3999 states to 3999 states and 5057 transitions. [2022-02-20 19:59:18,220 INFO L78 Accepts]: Start accepts. Automaton has 3999 states and 5057 transitions. Word has length 72 [2022-02-20 19:59:18,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:18,221 INFO L470 AbstractCegarLoop]: Abstraction has 3999 states and 5057 transitions. [2022-02-20 19:59:18,221 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:59:18,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3999 states and 5057 transitions. [2022-02-20 19:59:18,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:59:18,222 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:18,222 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:59:18,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:59:18,222 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:18,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:18,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1142832314, now seen corresponding path program 1 times [2022-02-20 19:59:18,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:18,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590643424] [2022-02-20 19:59:18,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:18,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {96907#(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); {96866#true} is VALID [2022-02-20 19:59:18,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {96866#true} assume true; {96866#true} is VALID [2022-02-20 19:59:18,269 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96866#true} {96866#true} #1901#return; {96866#true} is VALID [2022-02-20 19:59:18,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {96908#(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); {96866#true} is VALID [2022-02-20 19:59:18,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {96866#true} assume !(0 == ~q_write_ev~0); {96866#true} is VALID [2022-02-20 19:59:18,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {96866#true} assume true; {96866#true} is VALID [2022-02-20 19:59:18,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96866#true} {96866#true} #1903#return; {96866#true} is VALID [2022-02-20 19:59:18,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {96866#true} havoc ~__retres1~0; {96866#true} is VALID [2022-02-20 19:59:18,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {96866#true} assume !(1 == ~p_dw_pc~0); {96866#true} is VALID [2022-02-20 19:59:18,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {96866#true} ~__retres1~0 := 0; {96866#true} is VALID [2022-02-20 19:59:18,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {96866#true} #res := ~__retres1~0; {96866#true} is VALID [2022-02-20 19:59:18,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {96866#true} assume true; {96866#true} is VALID [2022-02-20 19:59:18,290 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {96866#true} {96866#true} #1897#return; {96866#true} is VALID [2022-02-20 19:59:18,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {96866#true} havoc ~__retres1~1; {96866#true} is VALID [2022-02-20 19:59:18,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {96866#true} assume !(1 == ~c_dr_pc~0); {96866#true} is VALID [2022-02-20 19:59:18,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {96866#true} ~__retres1~1 := 0; {96866#true} is VALID [2022-02-20 19:59:18,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {96866#true} #res := ~__retres1~1; {96866#true} is VALID [2022-02-20 19:59:18,293 INFO L290 TraceCheckUtils]: 4: Hoare triple {96866#true} assume true; {96866#true} is VALID [2022-02-20 19:59:18,293 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {96866#true} {96866#true} #1899#return; {96866#true} is VALID [2022-02-20 19:59:18,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {96909#(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; {96866#true} is VALID [2022-02-20 19:59:18,293 INFO L272 TraceCheckUtils]: 1: Hoare triple {96866#true} call #t~ret8 := is_do_write_p_triggered(); {96866#true} is VALID [2022-02-20 19:59:18,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {96866#true} havoc ~__retres1~0; {96866#true} is VALID [2022-02-20 19:59:18,294 INFO L290 TraceCheckUtils]: 3: Hoare triple {96866#true} assume !(1 == ~p_dw_pc~0); {96866#true} is VALID [2022-02-20 19:59:18,294 INFO L290 TraceCheckUtils]: 4: Hoare triple {96866#true} ~__retres1~0 := 0; {96866#true} is VALID [2022-02-20 19:59:18,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {96866#true} #res := ~__retres1~0; {96866#true} is VALID [2022-02-20 19:59:18,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {96866#true} assume true; {96866#true} is VALID [2022-02-20 19:59:18,294 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {96866#true} {96866#true} #1897#return; {96866#true} is VALID [2022-02-20 19:59:18,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {96866#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {96866#true} is VALID [2022-02-20 19:59:18,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {96866#true} assume !(0 != ~tmp~1); {96866#true} is VALID [2022-02-20 19:59:18,294 INFO L272 TraceCheckUtils]: 10: Hoare triple {96866#true} call #t~ret9 := is_do_read_c_triggered(); {96866#true} is VALID [2022-02-20 19:59:18,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {96866#true} havoc ~__retres1~1; {96866#true} is VALID [2022-02-20 19:59:18,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {96866#true} assume !(1 == ~c_dr_pc~0); {96866#true} is VALID [2022-02-20 19:59:18,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {96866#true} ~__retres1~1 := 0; {96866#true} is VALID [2022-02-20 19:59:18,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {96866#true} #res := ~__retres1~1; {96866#true} is VALID [2022-02-20 19:59:18,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {96866#true} assume true; {96866#true} is VALID [2022-02-20 19:59:18,295 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {96866#true} {96866#true} #1899#return; {96866#true} is VALID [2022-02-20 19:59:18,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {96866#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {96866#true} is VALID [2022-02-20 19:59:18,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {96866#true} assume !(0 != ~tmp___0~1); {96866#true} is VALID [2022-02-20 19:59:18,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {96866#true} assume true; {96866#true} is VALID [2022-02-20 19:59:18,295 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {96866#true} {96866#true} #1905#return; {96866#true} is VALID [2022-02-20 19:59:18,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {96908#(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); {96866#true} is VALID [2022-02-20 19:59:18,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {96866#true} assume !(1 == ~q_write_ev~0); {96866#true} is VALID [2022-02-20 19:59:18,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {96866#true} assume true; {96866#true} is VALID [2022-02-20 19:59:18,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96866#true} {96866#true} #1907#return; {96866#true} is VALID [2022-02-20 19:59:18,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:18,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {96866#true} havoc ~__retres1~2; {96866#true} is VALID [2022-02-20 19:59:18,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {96866#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {96866#true} is VALID [2022-02-20 19:59:18,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {96866#true} #res := ~__retres1~2; {96866#true} is VALID [2022-02-20 19:59:18,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {96866#true} assume true; {96866#true} is VALID [2022-02-20 19:59:18,304 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {96866#true} {96866#true} #1909#return; {96866#true} is VALID [2022-02-20 19:59:18,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {96866#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; {96866#true} is VALID [2022-02-20 19:59:18,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {96866#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {96866#true} is VALID [2022-02-20 19:59:18,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {96866#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {96866#true} is VALID [2022-02-20 19:59:18,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {96866#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; {96866#true} is VALID [2022-02-20 19:59:18,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {96866#true} call update_channels1(); {96907#(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:18,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {96907#(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); {96866#true} is VALID [2022-02-20 19:59:18,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {96866#true} assume true; {96866#true} is VALID [2022-02-20 19:59:18,305 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {96866#true} {96866#true} #1901#return; {96866#true} is VALID [2022-02-20 19:59:18,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {96866#true} assume { :begin_inline_init_threads1 } true; {96866#true} is VALID [2022-02-20 19:59:18,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {96866#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {96866#true} is VALID [2022-02-20 19:59:18,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {96866#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {96866#true} is VALID [2022-02-20 19:59:18,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {96866#true} assume { :end_inline_init_threads1 } true; {96866#true} is VALID [2022-02-20 19:59:18,306 INFO L272 TraceCheckUtils]: 12: Hoare triple {96866#true} call fire_delta_events1(); {96908#(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:18,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {96908#(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); {96866#true} is VALID [2022-02-20 19:59:18,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {96866#true} assume !(0 == ~q_write_ev~0); {96866#true} is VALID [2022-02-20 19:59:18,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {96866#true} assume true; {96866#true} is VALID [2022-02-20 19:59:18,306 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {96866#true} {96866#true} #1903#return; {96866#true} is VALID [2022-02-20 19:59:18,307 INFO L272 TraceCheckUtils]: 17: Hoare triple {96866#true} call activate_threads1(); {96909#(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:18,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {96909#(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; {96866#true} is VALID [2022-02-20 19:59:18,307 INFO L272 TraceCheckUtils]: 19: Hoare triple {96866#true} call #t~ret8 := is_do_write_p_triggered(); {96866#true} is VALID [2022-02-20 19:59:18,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {96866#true} havoc ~__retres1~0; {96866#true} is VALID [2022-02-20 19:59:18,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {96866#true} assume !(1 == ~p_dw_pc~0); {96866#true} is VALID [2022-02-20 19:59:18,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {96866#true} ~__retres1~0 := 0; {96866#true} is VALID [2022-02-20 19:59:18,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {96866#true} #res := ~__retres1~0; {96866#true} is VALID [2022-02-20 19:59:18,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {96866#true} assume true; {96866#true} is VALID [2022-02-20 19:59:18,308 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {96866#true} {96866#true} #1897#return; {96866#true} is VALID [2022-02-20 19:59:18,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {96866#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {96866#true} is VALID [2022-02-20 19:59:18,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {96866#true} assume !(0 != ~tmp~1); {96866#true} is VALID [2022-02-20 19:59:18,308 INFO L272 TraceCheckUtils]: 28: Hoare triple {96866#true} call #t~ret9 := is_do_read_c_triggered(); {96866#true} is VALID [2022-02-20 19:59:18,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {96866#true} havoc ~__retres1~1; {96866#true} is VALID [2022-02-20 19:59:18,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {96866#true} assume !(1 == ~c_dr_pc~0); {96866#true} is VALID [2022-02-20 19:59:18,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {96866#true} ~__retres1~1 := 0; {96866#true} is VALID [2022-02-20 19:59:18,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {96866#true} #res := ~__retres1~1; {96866#true} is VALID [2022-02-20 19:59:18,309 INFO L290 TraceCheckUtils]: 33: Hoare triple {96866#true} assume true; {96866#true} is VALID [2022-02-20 19:59:18,309 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {96866#true} {96866#true} #1899#return; {96866#true} is VALID [2022-02-20 19:59:18,309 INFO L290 TraceCheckUtils]: 35: Hoare triple {96866#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {96866#true} is VALID [2022-02-20 19:59:18,309 INFO L290 TraceCheckUtils]: 36: Hoare triple {96866#true} assume !(0 != ~tmp___0~1); {96866#true} is VALID [2022-02-20 19:59:18,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {96866#true} assume true; {96866#true} is VALID [2022-02-20 19:59:18,309 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {96866#true} {96866#true} #1905#return; {96866#true} is VALID [2022-02-20 19:59:18,309 INFO L272 TraceCheckUtils]: 39: Hoare triple {96866#true} call reset_delta_events1(); {96908#(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:18,310 INFO L290 TraceCheckUtils]: 40: Hoare triple {96908#(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); {96866#true} is VALID [2022-02-20 19:59:18,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {96866#true} assume !(1 == ~q_write_ev~0); {96866#true} is VALID [2022-02-20 19:59:18,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {96866#true} assume true; {96866#true} is VALID [2022-02-20 19:59:18,310 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {96866#true} {96866#true} #1907#return; {96866#true} is VALID [2022-02-20 19:59:18,310 INFO L290 TraceCheckUtils]: 44: Hoare triple {96866#true} assume !false; {96866#true} is VALID [2022-02-20 19:59:18,310 INFO L290 TraceCheckUtils]: 45: Hoare triple {96866#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; {96866#true} is VALID [2022-02-20 19:59:18,310 INFO L290 TraceCheckUtils]: 46: Hoare triple {96866#true} assume !false; {96866#true} is VALID [2022-02-20 19:59:18,310 INFO L272 TraceCheckUtils]: 47: Hoare triple {96866#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {96866#true} is VALID [2022-02-20 19:59:18,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {96866#true} havoc ~__retres1~2; {96866#true} is VALID [2022-02-20 19:59:18,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {96866#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {96866#true} is VALID [2022-02-20 19:59:18,311 INFO L290 TraceCheckUtils]: 50: Hoare triple {96866#true} #res := ~__retres1~2; {96866#true} is VALID [2022-02-20 19:59:18,311 INFO L290 TraceCheckUtils]: 51: Hoare triple {96866#true} assume true; {96866#true} is VALID [2022-02-20 19:59:18,311 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {96866#true} {96866#true} #1909#return; {96866#true} is VALID [2022-02-20 19:59:18,311 INFO L290 TraceCheckUtils]: 53: Hoare triple {96866#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; {96866#true} is VALID [2022-02-20 19:59:18,311 INFO L290 TraceCheckUtils]: 54: Hoare triple {96866#true} assume 0 != eval1_~tmp___1~0#1; {96866#true} is VALID [2022-02-20 19:59:18,311 INFO L290 TraceCheckUtils]: 55: Hoare triple {96866#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; {96866#true} is VALID [2022-02-20 19:59:18,311 INFO L290 TraceCheckUtils]: 56: Hoare triple {96866#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; {96866#true} is VALID [2022-02-20 19:59:18,311 INFO L290 TraceCheckUtils]: 57: Hoare triple {96866#true} assume 0 == ~p_dw_pc~0; {96866#true} is VALID [2022-02-20 19:59:18,311 INFO L290 TraceCheckUtils]: 58: Hoare triple {96866#true} assume !false; {96866#true} is VALID [2022-02-20 19:59:18,312 INFO L290 TraceCheckUtils]: 59: Hoare triple {96866#true} assume !(0 == ~q_free~0); {96866#true} is VALID [2022-02-20 19:59:18,312 INFO L290 TraceCheckUtils]: 60: Hoare triple {96866#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; {96905#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:18,312 INFO L290 TraceCheckUtils]: 61: Hoare triple {96905#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {96905#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:18,313 INFO L290 TraceCheckUtils]: 62: Hoare triple {96905#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {96905#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:18,313 INFO L290 TraceCheckUtils]: 63: Hoare triple {96905#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {96905#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:18,313 INFO L290 TraceCheckUtils]: 64: Hoare triple {96905#(= ~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; {96905#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:18,314 INFO L290 TraceCheckUtils]: 65: Hoare triple {96905#(= ~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; {96905#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:18,314 INFO L290 TraceCheckUtils]: 66: Hoare triple {96905#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {96905#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:18,314 INFO L290 TraceCheckUtils]: 67: Hoare triple {96905#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {96905#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:18,315 INFO L290 TraceCheckUtils]: 68: Hoare triple {96905#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {96905#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:59:18,315 INFO L290 TraceCheckUtils]: 69: Hoare triple {96905#(= ~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; {96906#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:59:18,315 INFO L290 TraceCheckUtils]: 70: Hoare triple {96906#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {96867#false} is VALID [2022-02-20 19:59:18,315 INFO L272 TraceCheckUtils]: 71: Hoare triple {96867#false} call error1(); {96867#false} is VALID [2022-02-20 19:59:18,315 INFO L290 TraceCheckUtils]: 72: Hoare triple {96867#false} assume !false; {96867#false} is VALID [2022-02-20 19:59:18,316 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:59:18,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:18,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590643424] [2022-02-20 19:59:18,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590643424] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:59:18,316 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:59:18,317 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:59:18,317 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646166354] [2022-02-20 19:59:18,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:59:18,317 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:18,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:18,318 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:59:18,361 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:59:18,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:59:18,361 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:18,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:59:18,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:59:18,362 INFO L87 Difference]: Start difference. First operand 3999 states and 5057 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:21,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:21,242 INFO L93 Difference]: Finished difference Result 5085 states and 6352 transitions. [2022-02-20 19:59:21,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:59:21,242 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:21,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:59:21,242 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:21,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 878 transitions. [2022-02-20 19:59:21,247 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:21,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 878 transitions. [2022-02-20 19:59:21,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 878 transitions. [2022-02-20 19:59:21,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 878 edges. 878 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:59:22,673 INFO L225 Difference]: With dead ends: 5085 [2022-02-20 19:59:22,673 INFO L226 Difference]: Without dead ends: 5082 [2022-02-20 19:59:22,674 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:22,675 INFO L933 BasicCegarLoop]: 741 mSDtfsCounter, 2076 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2086 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:59:22,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2086 Valid, 1789 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:59:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5082 states. [2022-02-20 19:59:22,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5082 to 4461. [2022-02-20 19:59:22,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:59:23,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5082 states. Second operand has 4461 states, 3537 states have (on average 1.2731128074639526) internal successors, (4503), 3585 states have internal predecessors, (4503), 463 states have call successors, (463), 380 states have call predecessors, (463), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) [2022-02-20 19:59:23,004 INFO L74 IsIncluded]: Start isIncluded. First operand 5082 states. Second operand has 4461 states, 3537 states have (on average 1.2731128074639526) internal successors, (4503), 3585 states have internal predecessors, (4503), 463 states have call successors, (463), 380 states have call predecessors, (463), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) [2022-02-20 19:59:23,008 INFO L87 Difference]: Start difference. First operand 5082 states. Second operand has 4461 states, 3537 states have (on average 1.2731128074639526) internal successors, (4503), 3585 states have internal predecessors, (4503), 463 states have call successors, (463), 380 states have call predecessors, (463), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) [2022-02-20 19:59:23,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:23,897 INFO L93 Difference]: Finished difference Result 5082 states and 6332 transitions. [2022-02-20 19:59:23,898 INFO L276 IsEmpty]: Start isEmpty. Operand 5082 states and 6332 transitions. [2022-02-20 19:59:23,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:23,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:23,914 INFO L74 IsIncluded]: Start isIncluded. First operand has 4461 states, 3537 states have (on average 1.2731128074639526) internal successors, (4503), 3585 states have internal predecessors, (4503), 463 states have call successors, (463), 380 states have call predecessors, (463), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) Second operand 5082 states. [2022-02-20 19:59:23,917 INFO L87 Difference]: Start difference. First operand has 4461 states, 3537 states have (on average 1.2731128074639526) internal successors, (4503), 3585 states have internal predecessors, (4503), 463 states have call successors, (463), 380 states have call predecessors, (463), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) Second operand 5082 states. [2022-02-20 19:59:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:59:24,624 INFO L93 Difference]: Finished difference Result 5082 states and 6332 transitions. [2022-02-20 19:59:24,624 INFO L276 IsEmpty]: Start isEmpty. Operand 5082 states and 6332 transitions. [2022-02-20 19:59:24,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:59:24,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:59:24,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:59:24,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:59:24,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4461 states, 3537 states have (on average 1.2731128074639526) internal successors, (4503), 3585 states have internal predecessors, (4503), 463 states have call successors, (463), 380 states have call predecessors, (463), 459 states have return successors, (634), 498 states have call predecessors, (634), 460 states have call successors, (634) [2022-02-20 19:59:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4461 states to 4461 states and 5600 transitions. [2022-02-20 19:59:25,567 INFO L78 Accepts]: Start accepts. Automaton has 4461 states and 5600 transitions. Word has length 73 [2022-02-20 19:59:25,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:59:25,568 INFO L470 AbstractCegarLoop]: Abstraction has 4461 states and 5600 transitions. [2022-02-20 19:59:25,568 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:25,568 INFO L276 IsEmpty]: Start isEmpty. Operand 4461 states and 5600 transitions. [2022-02-20 19:59:25,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 19:59:25,569 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:59:25,569 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:25,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:59:25,569 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:59:25,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:59:25,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1069513385, now seen corresponding path program 1 times [2022-02-20 19:59:25,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:59:25,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523617156] [2022-02-20 19:59:25,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:25,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:59:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:59:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {119910#(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); {119868#true} is VALID [2022-02-20 19:59:25,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:25,652 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {119868#true} {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1901#return; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:59:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {119911#(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); {119868#true} is VALID [2022-02-20 19:59:25,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {119868#true} assume !(0 == ~q_write_ev~0); {119868#true} is VALID [2022-02-20 19:59:25,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:25,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119868#true} {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1903#return; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:59:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:59:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {119868#true} havoc ~__retres1~0; {119868#true} is VALID [2022-02-20 19:59:25,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {119868#true} assume !(1 == ~p_dw_pc~0); {119868#true} is VALID [2022-02-20 19:59:25,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {119868#true} ~__retres1~0 := 0; {119868#true} is VALID [2022-02-20 19:59:25,686 INFO L290 TraceCheckUtils]: 3: Hoare triple {119868#true} #res := ~__retres1~0; {119868#true} is VALID [2022-02-20 19:59:25,687 INFO L290 TraceCheckUtils]: 4: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:25,687 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {119868#true} {119868#true} #1897#return; {119868#true} is VALID [2022-02-20 19:59:25,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:59:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {119868#true} havoc ~__retres1~1; {119868#true} is VALID [2022-02-20 19:59:25,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {119868#true} assume !(1 == ~c_dr_pc~0); {119868#true} is VALID [2022-02-20 19:59:25,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {119868#true} ~__retres1~1 := 0; {119868#true} is VALID [2022-02-20 19:59:25,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {119868#true} #res := ~__retres1~1; {119868#true} is VALID [2022-02-20 19:59:25,690 INFO L290 TraceCheckUtils]: 4: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:25,690 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {119868#true} {119868#true} #1899#return; {119868#true} is VALID [2022-02-20 19:59:25,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {119912#(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; {119868#true} is VALID [2022-02-20 19:59:25,691 INFO L272 TraceCheckUtils]: 1: Hoare triple {119868#true} call #t~ret8 := is_do_write_p_triggered(); {119868#true} is VALID [2022-02-20 19:59:25,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {119868#true} havoc ~__retres1~0; {119868#true} is VALID [2022-02-20 19:59:25,691 INFO L290 TraceCheckUtils]: 3: Hoare triple {119868#true} assume !(1 == ~p_dw_pc~0); {119868#true} is VALID [2022-02-20 19:59:25,691 INFO L290 TraceCheckUtils]: 4: Hoare triple {119868#true} ~__retres1~0 := 0; {119868#true} is VALID [2022-02-20 19:59:25,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {119868#true} #res := ~__retres1~0; {119868#true} is VALID [2022-02-20 19:59:25,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:25,692 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {119868#true} {119868#true} #1897#return; {119868#true} is VALID [2022-02-20 19:59:25,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {119868#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {119868#true} is VALID [2022-02-20 19:59:25,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {119868#true} assume !(0 != ~tmp~1); {119868#true} is VALID [2022-02-20 19:59:25,692 INFO L272 TraceCheckUtils]: 10: Hoare triple {119868#true} call #t~ret9 := is_do_read_c_triggered(); {119868#true} is VALID [2022-02-20 19:59:25,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {119868#true} havoc ~__retres1~1; {119868#true} is VALID [2022-02-20 19:59:25,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {119868#true} assume !(1 == ~c_dr_pc~0); {119868#true} is VALID [2022-02-20 19:59:25,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {119868#true} ~__retres1~1 := 0; {119868#true} is VALID [2022-02-20 19:59:25,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {119868#true} #res := ~__retres1~1; {119868#true} is VALID [2022-02-20 19:59:25,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:25,693 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {119868#true} {119868#true} #1899#return; {119868#true} is VALID [2022-02-20 19:59:25,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {119868#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {119868#true} is VALID [2022-02-20 19:59:25,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {119868#true} assume !(0 != ~tmp___0~1); {119868#true} is VALID [2022-02-20 19:59:25,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:25,694 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {119868#true} {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1905#return; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:59:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {119911#(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); {119868#true} is VALID [2022-02-20 19:59:25,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {119868#true} assume !(1 == ~q_write_ev~0); {119868#true} is VALID [2022-02-20 19:59:25,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:25,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119868#true} {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1907#return; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:59:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {119868#true} havoc ~__retres1~2; {119868#true} is VALID [2022-02-20 19:59:25,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {119868#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {119868#true} is VALID [2022-02-20 19:59:25,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {119868#true} #res := ~__retres1~2; {119868#true} is VALID [2022-02-20 19:59:25,701 INFO L290 TraceCheckUtils]: 3: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:25,705 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {119868#true} {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1909#return; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {119868#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; {119868#true} is VALID [2022-02-20 19:59:25,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {119868#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {119868#true} is VALID [2022-02-20 19:59:25,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {119868#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,706 INFO L290 TraceCheckUtils]: 3: Hoare triple {119870#(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; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {119910#(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:25,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {119910#(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); {119868#true} is VALID [2022-02-20 19:59:25,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:25,708 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {119868#true} {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1901#return; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,710 INFO L272 TraceCheckUtils]: 12: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {119911#(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:25,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {119911#(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); {119868#true} is VALID [2022-02-20 19:59:25,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {119868#true} assume !(0 == ~q_write_ev~0); {119868#true} is VALID [2022-02-20 19:59:25,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:25,711 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {119868#true} {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1903#return; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,711 INFO L272 TraceCheckUtils]: 17: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {119912#(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:25,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {119912#(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; {119868#true} is VALID [2022-02-20 19:59:25,711 INFO L272 TraceCheckUtils]: 19: Hoare triple {119868#true} call #t~ret8 := is_do_write_p_triggered(); {119868#true} is VALID [2022-02-20 19:59:25,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {119868#true} havoc ~__retres1~0; {119868#true} is VALID [2022-02-20 19:59:25,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {119868#true} assume !(1 == ~p_dw_pc~0); {119868#true} is VALID [2022-02-20 19:59:25,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {119868#true} ~__retres1~0 := 0; {119868#true} is VALID [2022-02-20 19:59:25,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {119868#true} #res := ~__retres1~0; {119868#true} is VALID [2022-02-20 19:59:25,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:25,712 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {119868#true} {119868#true} #1897#return; {119868#true} is VALID [2022-02-20 19:59:25,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {119868#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {119868#true} is VALID [2022-02-20 19:59:25,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {119868#true} assume !(0 != ~tmp~1); {119868#true} is VALID [2022-02-20 19:59:25,713 INFO L272 TraceCheckUtils]: 28: Hoare triple {119868#true} call #t~ret9 := is_do_read_c_triggered(); {119868#true} is VALID [2022-02-20 19:59:25,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {119868#true} havoc ~__retres1~1; {119868#true} is VALID [2022-02-20 19:59:25,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {119868#true} assume !(1 == ~c_dr_pc~0); {119868#true} is VALID [2022-02-20 19:59:25,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {119868#true} ~__retres1~1 := 0; {119868#true} is VALID [2022-02-20 19:59:25,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {119868#true} #res := ~__retres1~1; {119868#true} is VALID [2022-02-20 19:59:25,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:25,713 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {119868#true} {119868#true} #1899#return; {119868#true} is VALID [2022-02-20 19:59:25,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {119868#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {119868#true} is VALID [2022-02-20 19:59:25,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {119868#true} assume !(0 != ~tmp___0~1); {119868#true} is VALID [2022-02-20 19:59:25,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:25,714 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {119868#true} {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1905#return; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,715 INFO L272 TraceCheckUtils]: 39: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {119911#(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:25,715 INFO L290 TraceCheckUtils]: 40: Hoare triple {119911#(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); {119868#true} is VALID [2022-02-20 19:59:25,715 INFO L290 TraceCheckUtils]: 41: Hoare triple {119868#true} assume !(1 == ~q_write_ev~0); {119868#true} is VALID [2022-02-20 19:59:25,715 INFO L290 TraceCheckUtils]: 42: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:25,716 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {119868#true} {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1907#return; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,716 INFO L290 TraceCheckUtils]: 44: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,716 INFO L290 TraceCheckUtils]: 45: Hoare triple {119870#(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; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,717 INFO L290 TraceCheckUtils]: 46: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,717 INFO L272 TraceCheckUtils]: 47: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {119868#true} is VALID [2022-02-20 19:59:25,717 INFO L290 TraceCheckUtils]: 48: Hoare triple {119868#true} havoc ~__retres1~2; {119868#true} is VALID [2022-02-20 19:59:25,717 INFO L290 TraceCheckUtils]: 49: Hoare triple {119868#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {119868#true} is VALID [2022-02-20 19:59:25,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {119868#true} #res := ~__retres1~2; {119868#true} is VALID [2022-02-20 19:59:25,718 INFO L290 TraceCheckUtils]: 51: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:25,718 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {119868#true} {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1909#return; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,718 INFO L290 TraceCheckUtils]: 53: Hoare triple {119870#(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; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,719 INFO L290 TraceCheckUtils]: 54: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,719 INFO L290 TraceCheckUtils]: 55: Hoare triple {119870#(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; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,720 INFO L290 TraceCheckUtils]: 56: Hoare triple {119870#(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; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,720 INFO L290 TraceCheckUtils]: 57: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,721 INFO L290 TraceCheckUtils]: 58: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,721 INFO L290 TraceCheckUtils]: 59: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:25,721 INFO L290 TraceCheckUtils]: 60: Hoare triple {119870#(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; {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:25,722 INFO L290 TraceCheckUtils]: 61: Hoare triple {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:25,722 INFO L290 TraceCheckUtils]: 62: Hoare triple {119908#(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; {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:25,723 INFO L290 TraceCheckUtils]: 63: Hoare triple {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:25,723 INFO L290 TraceCheckUtils]: 64: Hoare triple {119908#(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; {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:25,724 INFO L290 TraceCheckUtils]: 65: Hoare triple {119908#(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; {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:25,724 INFO L290 TraceCheckUtils]: 66: Hoare triple {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:25,724 INFO L290 TraceCheckUtils]: 67: Hoare triple {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:25,725 INFO L290 TraceCheckUtils]: 68: Hoare triple {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:25,725 INFO L290 TraceCheckUtils]: 69: Hoare triple {119908#(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; {119909#(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:25,726 INFO L290 TraceCheckUtils]: 70: Hoare triple {119909#(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; {119909#(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:25,726 INFO L290 TraceCheckUtils]: 71: Hoare triple {119909#(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); {119869#false} is VALID [2022-02-20 19:59:25,726 INFO L272 TraceCheckUtils]: 72: Hoare triple {119869#false} call error1(); {119869#false} is VALID [2022-02-20 19:59:25,727 INFO L290 TraceCheckUtils]: 73: Hoare triple {119869#false} assume !false; {119869#false} is VALID [2022-02-20 19:59:25,727 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:25,727 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:59:25,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523617156] [2022-02-20 19:59:25,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523617156] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:59:25,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417701530] [2022-02-20 19:59:25,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:59:25,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:59:25,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:59:25,730 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:25,733 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:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:59:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:59:25,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:59:26,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {119868#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; {119868#true} is VALID [2022-02-20 19:59:26,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {119868#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {119868#true} is VALID [2022-02-20 19:59:26,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {119868#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,435 INFO L290 TraceCheckUtils]: 3: Hoare triple {119870#(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; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_req_up~0); {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,437 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1901#return; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,438 INFO L272 TraceCheckUtils]: 12: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_read_ev~0); {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_write_ev~0); {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,439 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1903#return; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,440 INFO L272 TraceCheckUtils]: 17: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~tmp~1;havoc ~tmp___0~1; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,440 INFO L272 TraceCheckUtils]: 19: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret8 := is_do_write_p_triggered(); {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~0; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~p_dw_pc~0); {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~0 := 0; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~0; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,443 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1897#return; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {119870#(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; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp~1); {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,444 INFO L272 TraceCheckUtils]: 28: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret9 := is_do_read_c_triggered(); {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~1; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,444 INFO L290 TraceCheckUtils]: 30: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~c_dr_pc~0); {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~1 := 0; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~1; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,446 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1899#return; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {119870#(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; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,446 INFO L290 TraceCheckUtils]: 36: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp___0~1); {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,447 INFO L290 TraceCheckUtils]: 37: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,447 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1905#return; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,447 INFO L272 TraceCheckUtils]: 39: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,448 INFO L290 TraceCheckUtils]: 40: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_read_ev~0); {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,448 INFO L290 TraceCheckUtils]: 41: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_write_ev~0); {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,448 INFO L290 TraceCheckUtils]: 42: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,448 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1907#return; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,449 INFO L290 TraceCheckUtils]: 44: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,449 INFO L290 TraceCheckUtils]: 45: Hoare triple {119870#(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; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,449 INFO L290 TraceCheckUtils]: 46: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,450 INFO L272 TraceCheckUtils]: 47: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,451 INFO L290 TraceCheckUtils]: 50: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,451 INFO L290 TraceCheckUtils]: 51: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,451 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1909#return; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,452 INFO L290 TraceCheckUtils]: 53: Hoare triple {119870#(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; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,452 INFO L290 TraceCheckUtils]: 54: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,452 INFO L290 TraceCheckUtils]: 55: Hoare triple {119870#(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; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,453 INFO L290 TraceCheckUtils]: 56: Hoare triple {119870#(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; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,453 INFO L290 TraceCheckUtils]: 57: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,453 INFO L290 TraceCheckUtils]: 58: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,454 INFO L290 TraceCheckUtils]: 59: Hoare triple {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {119870#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:59:26,454 INFO L290 TraceCheckUtils]: 60: Hoare triple {119870#(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; {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:26,454 INFO L290 TraceCheckUtils]: 61: Hoare triple {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:26,455 INFO L290 TraceCheckUtils]: 62: Hoare triple {119908#(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; {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:26,455 INFO L290 TraceCheckUtils]: 63: Hoare triple {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:26,455 INFO L290 TraceCheckUtils]: 64: Hoare triple {119908#(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; {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:26,456 INFO L290 TraceCheckUtils]: 65: Hoare triple {119908#(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; {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:26,456 INFO L290 TraceCheckUtils]: 66: Hoare triple {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:26,456 INFO L290 TraceCheckUtils]: 67: Hoare triple {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:26,457 INFO L290 TraceCheckUtils]: 68: Hoare triple {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {119908#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:26,457 INFO L290 TraceCheckUtils]: 69: Hoare triple {119908#(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; {120135#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:26,457 INFO L290 TraceCheckUtils]: 70: Hoare triple {120135#(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; {120135#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:59:26,458 INFO L290 TraceCheckUtils]: 71: Hoare triple {120135#(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); {119869#false} is VALID [2022-02-20 19:59:26,458 INFO L272 TraceCheckUtils]: 72: Hoare triple {119869#false} call error1(); {119869#false} is VALID [2022-02-20 19:59:26,458 INFO L290 TraceCheckUtils]: 73: Hoare triple {119869#false} assume !false; {119869#false} is VALID [2022-02-20 19:59:26,458 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:26,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:59:26,775 INFO L290 TraceCheckUtils]: 73: Hoare triple {119869#false} assume !false; {119869#false} is VALID [2022-02-20 19:59:26,775 INFO L272 TraceCheckUtils]: 72: Hoare triple {119869#false} call error1(); {119869#false} is VALID [2022-02-20 19:59:26,776 INFO L290 TraceCheckUtils]: 71: Hoare triple {119909#(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); {119869#false} is VALID [2022-02-20 19:59:26,776 INFO L290 TraceCheckUtils]: 70: Hoare triple {119909#(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; {119909#(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:26,777 INFO L290 TraceCheckUtils]: 69: Hoare triple {120160#(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; {119909#(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:26,777 INFO L290 TraceCheckUtils]: 68: Hoare triple {120160#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !(1 == ~q_free~0); {120160#(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:26,777 INFO L290 TraceCheckUtils]: 67: Hoare triple {120160#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {120160#(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:26,778 INFO L290 TraceCheckUtils]: 66: Hoare triple {120160#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_pc~0; {120160#(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:26,778 INFO L290 TraceCheckUtils]: 65: Hoare triple {120160#(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; {120160#(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:26,778 INFO L290 TraceCheckUtils]: 64: Hoare triple {120160#(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; {120160#(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:26,779 INFO L290 TraceCheckUtils]: 63: Hoare triple {120160#(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; {120160#(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:26,779 INFO L290 TraceCheckUtils]: 62: Hoare triple {120160#(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; {120160#(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:26,779 INFO L290 TraceCheckUtils]: 61: Hoare triple {120160#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {120160#(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:26,780 INFO L290 TraceCheckUtils]: 60: Hoare triple {119909#(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; {120160#(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:26,780 INFO L290 TraceCheckUtils]: 59: Hoare triple {119909#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(0 == ~q_free~0); {119909#(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:26,780 INFO L290 TraceCheckUtils]: 58: Hoare triple {119909#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {119909#(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:26,781 INFO L290 TraceCheckUtils]: 57: Hoare triple {119909#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_pc~0; {119909#(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:26,781 INFO L290 TraceCheckUtils]: 56: Hoare triple {119909#(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; {119909#(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:26,781 INFO L290 TraceCheckUtils]: 55: Hoare triple {119909#(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; {119909#(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:26,782 INFO L290 TraceCheckUtils]: 54: Hoare triple {119909#(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; {119909#(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:26,782 INFO L290 TraceCheckUtils]: 53: Hoare triple {119909#(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; {119909#(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:26,783 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {119868#true} {119909#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1909#return; {119909#(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:26,783 INFO L290 TraceCheckUtils]: 51: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:26,783 INFO L290 TraceCheckUtils]: 50: Hoare triple {119868#true} #res := ~__retres1~2; {119868#true} is VALID [2022-02-20 19:59:26,783 INFO L290 TraceCheckUtils]: 49: Hoare triple {119868#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {119868#true} is VALID [2022-02-20 19:59:26,783 INFO L290 TraceCheckUtils]: 48: Hoare triple {119868#true} havoc ~__retres1~2; {119868#true} is VALID [2022-02-20 19:59:26,783 INFO L272 TraceCheckUtils]: 47: Hoare triple {119909#(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(); {119868#true} is VALID [2022-02-20 19:59:26,784 INFO L290 TraceCheckUtils]: 46: Hoare triple {119909#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {119909#(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:26,784 INFO L290 TraceCheckUtils]: 45: Hoare triple {119909#(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; {119909#(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:26,784 INFO L290 TraceCheckUtils]: 44: Hoare triple {119909#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {119909#(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:26,785 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {119868#true} {119909#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1907#return; {119909#(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:26,785 INFO L290 TraceCheckUtils]: 42: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:26,785 INFO L290 TraceCheckUtils]: 41: Hoare triple {119868#true} assume !(1 == ~q_write_ev~0); {119868#true} is VALID [2022-02-20 19:59:26,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {119868#true} assume !(1 == ~q_read_ev~0); {119868#true} is VALID [2022-02-20 19:59:26,785 INFO L272 TraceCheckUtils]: 39: Hoare triple {119909#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call reset_delta_events1(); {119868#true} is VALID [2022-02-20 19:59:26,785 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {119868#true} {119909#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1905#return; {119909#(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:26,785 INFO L290 TraceCheckUtils]: 37: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:26,785 INFO L290 TraceCheckUtils]: 36: Hoare triple {119868#true} assume !(0 != ~tmp___0~1); {119868#true} is VALID [2022-02-20 19:59:26,786 INFO L290 TraceCheckUtils]: 35: Hoare triple {119868#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {119868#true} is VALID [2022-02-20 19:59:26,786 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {119868#true} {119868#true} #1899#return; {119868#true} is VALID [2022-02-20 19:59:26,786 INFO L290 TraceCheckUtils]: 33: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:26,786 INFO L290 TraceCheckUtils]: 32: Hoare triple {119868#true} #res := ~__retres1~1; {119868#true} is VALID [2022-02-20 19:59:26,786 INFO L290 TraceCheckUtils]: 31: Hoare triple {119868#true} ~__retres1~1 := 0; {119868#true} is VALID [2022-02-20 19:59:26,786 INFO L290 TraceCheckUtils]: 30: Hoare triple {119868#true} assume !(1 == ~c_dr_pc~0); {119868#true} is VALID [2022-02-20 19:59:26,786 INFO L290 TraceCheckUtils]: 29: Hoare triple {119868#true} havoc ~__retres1~1; {119868#true} is VALID [2022-02-20 19:59:26,786 INFO L272 TraceCheckUtils]: 28: Hoare triple {119868#true} call #t~ret9 := is_do_read_c_triggered(); {119868#true} is VALID [2022-02-20 19:59:26,786 INFO L290 TraceCheckUtils]: 27: Hoare triple {119868#true} assume !(0 != ~tmp~1); {119868#true} is VALID [2022-02-20 19:59:26,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {119868#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {119868#true} is VALID [2022-02-20 19:59:26,787 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {119868#true} {119868#true} #1897#return; {119868#true} is VALID [2022-02-20 19:59:26,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:26,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {119868#true} #res := ~__retres1~0; {119868#true} is VALID [2022-02-20 19:59:26,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {119868#true} ~__retres1~0 := 0; {119868#true} is VALID [2022-02-20 19:59:26,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {119868#true} assume !(1 == ~p_dw_pc~0); {119868#true} is VALID [2022-02-20 19:59:26,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {119868#true} havoc ~__retres1~0; {119868#true} is VALID [2022-02-20 19:59:26,787 INFO L272 TraceCheckUtils]: 19: Hoare triple {119868#true} call #t~ret8 := is_do_write_p_triggered(); {119868#true} is VALID [2022-02-20 19:59:26,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {119868#true} havoc ~tmp~1;havoc ~tmp___0~1; {119868#true} is VALID [2022-02-20 19:59:26,787 INFO L272 TraceCheckUtils]: 17: Hoare triple {119909#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call activate_threads1(); {119868#true} is VALID [2022-02-20 19:59:26,788 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {119868#true} {119909#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1903#return; {119909#(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:26,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:26,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {119868#true} assume !(0 == ~q_write_ev~0); {119868#true} is VALID [2022-02-20 19:59:26,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {119868#true} assume !(0 == ~q_read_ev~0); {119868#true} is VALID [2022-02-20 19:59:26,788 INFO L272 TraceCheckUtils]: 12: Hoare triple {119909#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call fire_delta_events1(); {119868#true} is VALID [2022-02-20 19:59:26,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {119909#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_threads1 } true; {119909#(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:26,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {119909#(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; {119909#(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:26,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {119909#(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; {119909#(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:26,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {119909#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :begin_inline_init_threads1 } true; {119909#(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:26,790 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {119868#true} {119909#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1901#return; {119909#(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:26,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {119868#true} assume true; {119868#true} is VALID [2022-02-20 19:59:26,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {119868#true} assume !(1 == ~q_req_up~0); {119868#true} is VALID [2022-02-20 19:59:26,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {119909#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call update_channels1(); {119868#true} is VALID [2022-02-20 19:59:26,790 INFO L290 TraceCheckUtils]: 3: Hoare triple {119909#(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; {119909#(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:26,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {119868#true} assume 0 != main_#t~nondet51#1;havoc main_#t~nondet51#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; {119909#(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:26,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {119868#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet51#1, main_#t~ret52#1, main_#t~ret53#1;assume -2147483648 <= main_#t~nondet51#1 && main_#t~nondet51#1 <= 2147483647; {119868#true} is VALID [2022-02-20 19:59:26,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {119868#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; {119868#true} is VALID [2022-02-20 19:59:26,791 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:26,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417701530] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:59:26,792 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:59:26,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-02-20 19:59:26,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81765995] [2022-02-20 19:59:26,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:59:26,793 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:26,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:59:26,794 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:26,885 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:26,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:59:26,885 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:59:26,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:59:26,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:59:26,886 INFO L87 Difference]: Start difference. First operand 4461 states and 5600 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)