./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dbdff9d5cdb7ffcae57151b3d045900600728670d8aad942a459f8d05b6221fb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:57:47,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:57:47,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:57:47,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:57:47,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:57:47,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:57:47,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:57:47,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:57:47,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:57:47,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:57:47,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:57:47,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:57:47,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:57:47,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:57:47,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:57:47,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:57:47,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:57:47,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:57:47,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:57:47,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:57:47,615 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:57:47,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:57:47,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:57:47,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:57:47,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:57:47,623 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:57:47,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:57:47,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:57:47,625 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:57:47,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:57:47,626 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:57:47,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:57:47,627 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:57:47,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:57:47,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:57:47,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:57:47,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:57:47,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:57:47,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:57:47,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:57:47,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:57:47,632 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:57:47,650 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:57:47,655 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:57:47,655 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:57:47,655 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:57:47,656 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:57:47,656 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:57:47,657 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:57:47,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:57:47,657 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:57:47,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:57:47,658 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:57:47,658 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:57:47,658 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:57:47,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:57:47,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:57:47,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:57:47,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:57:47,659 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:57:47,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:57:47,659 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:57:47,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:57:47,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:57:47,659 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:57:47,660 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:57:47,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:57:47,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:57:47,660 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:57:47,660 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:57:47,660 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:57:47,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:57:47,662 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:57:47,662 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:57:47,662 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:57:47,662 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 -> dbdff9d5cdb7ffcae57151b3d045900600728670d8aad942a459f8d05b6221fb [2022-02-20 19:57:47,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:57:47,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:57:47,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:57:47,838 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:57:47,838 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:57:47,839 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.10.cil-2.c [2022-02-20 19:57:47,884 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a08e31a60/dfbb73c5749744039864f541c6571541/FLAGa3cf9ce09 [2022-02-20 19:57:48,254 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:57:48,254 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-2.c [2022-02-20 19:57:48,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a08e31a60/dfbb73c5749744039864f541c6571541/FLAGa3cf9ce09 [2022-02-20 19:57:48,271 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a08e31a60/dfbb73c5749744039864f541c6571541 [2022-02-20 19:57:48,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:57:48,274 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:57:48,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:57:48,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:57:48,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:57:48,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:57:48" (1/1) ... [2022-02-20 19:57:48,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1154bfac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:48, skipping insertion in model container [2022-02-20 19:57:48,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:57:48" (1/1) ... [2022-02-20 19:57:48,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:57:48,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:57:48,452 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.10.cil-2.c[914,927] [2022-02-20 19:57:48,509 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.10.cil-2.c[7115,7128] [2022-02-20 19:57:48,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:57:48,594 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:57:48,601 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.10.cil-2.c[914,927] [2022-02-20 19:57:48,612 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.10.cil-2.c[7115,7128] [2022-02-20 19:57:48,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:57:48,689 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:57:48,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:48 WrapperNode [2022-02-20 19:57:48,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:57:48,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:57:48,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:57:48,691 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:57:48,695 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:57:48" (1/1) ... [2022-02-20 19:57:48,713 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:57:48" (1/1) ... [2022-02-20 19:57:48,779 INFO L137 Inliner]: procedures = 73, calls = 87, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 924 [2022-02-20 19:57:48,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:57:48,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:57:48,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:57:48,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:57:48,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:48" (1/1) ... [2022-02-20 19:57:48,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:48" (1/1) ... [2022-02-20 19:57:48,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:48" (1/1) ... [2022-02-20 19:57:48,798 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:48" (1/1) ... [2022-02-20 19:57:48,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:48" (1/1) ... [2022-02-20 19:57:48,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:48" (1/1) ... [2022-02-20 19:57:48,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:48" (1/1) ... [2022-02-20 19:57:48,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:57:48,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:57:48,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:57:48,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:57:48,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:48" (1/1) ... [2022-02-20 19:57:48,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:57:48,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:57:48,862 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:57:48,874 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:57:48,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:57:48,895 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:57:48,895 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:57:48,895 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:57:48,895 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:57:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:57:48,898 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:57:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:57:48,898 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:57:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:57:48,898 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:57:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:57:48,898 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:57:48,898 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:57:48,899 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:57:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:57:48,899 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:57:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:57:48,899 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:57:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:57:48,899 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:57:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:57:48,899 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:57:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:57:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:57:48,899 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:57:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:57:48,899 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:57:48,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:57:48,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:57:48,900 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:57:48,900 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:57:48,984 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:57:48,985 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:57:49,621 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:57:49,635 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:57:49,635 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-02-20 19:57:49,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:57:49 BoogieIcfgContainer [2022-02-20 19:57:49,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:57:49,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:57:49,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:57:49,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:57:49,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:57:48" (1/3) ... [2022-02-20 19:57:49,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f56549e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:57:49, skipping insertion in model container [2022-02-20 19:57:49,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:48" (2/3) ... [2022-02-20 19:57:49,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f56549e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:57:49, skipping insertion in model container [2022-02-20 19:57:49,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:57:49" (3/3) ... [2022-02-20 19:57:49,642 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.10.cil-2.c [2022-02-20 19:57:49,648 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:57:49,648 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:57:49,690 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:57:49,695 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:57:49,695 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:57:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 433 states, 378 states have (on average 1.6322751322751323) internal successors, (617), 384 states have internal predecessors, (617), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-02-20 19:57:49,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:49,741 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:49,742 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:57:49,742 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:49,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:49,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1844920847, now seen corresponding path program 1 times [2022-02-20 19:57:49,753 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:49,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613587781] [2022-02-20 19:57:49,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:49,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:49,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:49,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {476#(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); {477#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:49,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {477#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:49,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {477#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {438#(= ~q_read_ev~0 2)} #1660#return; {438#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:49,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:49,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {478#(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; {479#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:49,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {479#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {479#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:49,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {479#(= |old(~q_read_ev~0)| 0)} assume true; {479#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:49,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {479#(= |old(~q_read_ev~0)| 0)} {438#(= ~q_read_ev~0 2)} #1662#return; {437#false} is VALID [2022-02-20 19:57:50,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:50,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:50,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {436#true} havoc ~__retres1~0; {436#true} is VALID [2022-02-20 19:57:50,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {436#true} assume !(1 == ~p_dw_pc~0); {436#true} is VALID [2022-02-20 19:57:50,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {436#true} ~__retres1~0 := 0; {436#true} is VALID [2022-02-20 19:57:50,024 INFO L290 TraceCheckUtils]: 3: Hoare triple {436#true} #res := ~__retres1~0; {436#true} is VALID [2022-02-20 19:57:50,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {436#true} assume true; {436#true} is VALID [2022-02-20 19:57:50,024 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {436#true} {436#true} #1656#return; {436#true} is VALID [2022-02-20 19:57:50,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:50,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {436#true} havoc ~__retres1~1; {436#true} is VALID [2022-02-20 19:57:50,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {436#true} assume !(1 == ~c_dr_pc~0); {436#true} is VALID [2022-02-20 19:57:50,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {436#true} ~__retres1~1 := 0; {436#true} is VALID [2022-02-20 19:57:50,032 INFO L290 TraceCheckUtils]: 3: Hoare triple {436#true} #res := ~__retres1~1; {436#true} is VALID [2022-02-20 19:57:50,032 INFO L290 TraceCheckUtils]: 4: Hoare triple {436#true} assume true; {436#true} is VALID [2022-02-20 19:57:50,032 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {436#true} {436#true} #1658#return; {436#true} is VALID [2022-02-20 19:57:50,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {480#(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; {436#true} is VALID [2022-02-20 19:57:50,033 INFO L272 TraceCheckUtils]: 1: Hoare triple {436#true} call #t~ret8 := is_do_write_p_triggered(); {436#true} is VALID [2022-02-20 19:57:50,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {436#true} havoc ~__retres1~0; {436#true} is VALID [2022-02-20 19:57:50,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {436#true} assume !(1 == ~p_dw_pc~0); {436#true} is VALID [2022-02-20 19:57:50,033 INFO L290 TraceCheckUtils]: 4: Hoare triple {436#true} ~__retres1~0 := 0; {436#true} is VALID [2022-02-20 19:57:50,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {436#true} #res := ~__retres1~0; {436#true} is VALID [2022-02-20 19:57:50,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {436#true} assume true; {436#true} is VALID [2022-02-20 19:57:50,035 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {436#true} {436#true} #1656#return; {436#true} is VALID [2022-02-20 19:57:50,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {436#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {436#true} is VALID [2022-02-20 19:57:50,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {436#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {436#true} is VALID [2022-02-20 19:57:50,035 INFO L272 TraceCheckUtils]: 10: Hoare triple {436#true} call #t~ret9 := is_do_read_c_triggered(); {436#true} is VALID [2022-02-20 19:57:50,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {436#true} havoc ~__retres1~1; {436#true} is VALID [2022-02-20 19:57:50,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {436#true} assume !(1 == ~c_dr_pc~0); {436#true} is VALID [2022-02-20 19:57:50,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {436#true} ~__retres1~1 := 0; {436#true} is VALID [2022-02-20 19:57:50,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {436#true} #res := ~__retres1~1; {436#true} is VALID [2022-02-20 19:57:50,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {436#true} assume true; {436#true} is VALID [2022-02-20 19:57:50,036 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {436#true} {436#true} #1658#return; {436#true} is VALID [2022-02-20 19:57:50,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {436#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {436#true} is VALID [2022-02-20 19:57:50,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {436#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {436#true} is VALID [2022-02-20 19:57:50,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {436#true} assume true; {436#true} is VALID [2022-02-20 19:57:50,037 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {436#true} {437#false} #1664#return; {437#false} is VALID [2022-02-20 19:57:50,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:50,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {478#(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; {436#true} is VALID [2022-02-20 19:57:50,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {436#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {436#true} is VALID [2022-02-20 19:57:50,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {436#true} assume true; {436#true} is VALID [2022-02-20 19:57:50,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {436#true} {437#false} #1666#return; {437#false} is VALID [2022-02-20 19:57:50,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:50,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {436#true} havoc ~__retres1~2; {436#true} is VALID [2022-02-20 19:57:50,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {436#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {436#true} is VALID [2022-02-20 19:57:50,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {436#true} #res := ~__retres1~2; {436#true} is VALID [2022-02-20 19:57:50,062 INFO L290 TraceCheckUtils]: 3: Hoare triple {436#true} assume true; {436#true} is VALID [2022-02-20 19:57:50,062 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {436#true} {437#false} #1668#return; {437#false} is VALID [2022-02-20 19:57:50,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {436#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {436#true} is VALID [2022-02-20 19:57:50,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {436#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {436#true} is VALID [2022-02-20 19:57:50,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {436#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#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; {438#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:50,064 INFO L290 TraceCheckUtils]: 3: Hoare triple {438#(= ~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; {438#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:50,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {438#(= ~q_read_ev~0 2)} call update_channels1(); {476#(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:57:50,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {476#(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); {477#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:50,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {477#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {477#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:50,066 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {477#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {438#(= ~q_read_ev~0 2)} #1660#return; {438#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:50,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {438#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {438#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:50,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {438#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {438#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:50,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {438#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {438#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:50,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {438#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {438#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:50,069 INFO L272 TraceCheckUtils]: 12: Hoare triple {438#(= ~q_read_ev~0 2)} call fire_delta_events1(); {478#(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:57:50,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {478#(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; {479#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:50,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {479#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {479#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:50,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {479#(= |old(~q_read_ev~0)| 0)} assume true; {479#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:50,071 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {479#(= |old(~q_read_ev~0)| 0)} {438#(= ~q_read_ev~0 2)} #1662#return; {437#false} is VALID [2022-02-20 19:57:50,071 INFO L272 TraceCheckUtils]: 17: Hoare triple {437#false} call activate_threads1(); {480#(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:57:50,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {480#(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; {436#true} is VALID [2022-02-20 19:57:50,071 INFO L272 TraceCheckUtils]: 19: Hoare triple {436#true} call #t~ret8 := is_do_write_p_triggered(); {436#true} is VALID [2022-02-20 19:57:50,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {436#true} havoc ~__retres1~0; {436#true} is VALID [2022-02-20 19:57:50,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {436#true} assume !(1 == ~p_dw_pc~0); {436#true} is VALID [2022-02-20 19:57:50,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {436#true} ~__retres1~0 := 0; {436#true} is VALID [2022-02-20 19:57:50,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {436#true} #res := ~__retres1~0; {436#true} is VALID [2022-02-20 19:57:50,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {436#true} assume true; {436#true} is VALID [2022-02-20 19:57:50,072 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {436#true} {436#true} #1656#return; {436#true} is VALID [2022-02-20 19:57:50,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {436#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {436#true} is VALID [2022-02-20 19:57:50,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {436#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {436#true} is VALID [2022-02-20 19:57:50,072 INFO L272 TraceCheckUtils]: 28: Hoare triple {436#true} call #t~ret9 := is_do_read_c_triggered(); {436#true} is VALID [2022-02-20 19:57:50,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {436#true} havoc ~__retres1~1; {436#true} is VALID [2022-02-20 19:57:50,072 INFO L290 TraceCheckUtils]: 30: Hoare triple {436#true} assume !(1 == ~c_dr_pc~0); {436#true} is VALID [2022-02-20 19:57:50,073 INFO L290 TraceCheckUtils]: 31: Hoare triple {436#true} ~__retres1~1 := 0; {436#true} is VALID [2022-02-20 19:57:50,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {436#true} #res := ~__retres1~1; {436#true} is VALID [2022-02-20 19:57:50,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {436#true} assume true; {436#true} is VALID [2022-02-20 19:57:50,073 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {436#true} {436#true} #1658#return; {436#true} is VALID [2022-02-20 19:57:50,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {436#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {436#true} is VALID [2022-02-20 19:57:50,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {436#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {436#true} is VALID [2022-02-20 19:57:50,073 INFO L290 TraceCheckUtils]: 37: Hoare triple {436#true} assume true; {436#true} is VALID [2022-02-20 19:57:50,073 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {436#true} {437#false} #1664#return; {437#false} is VALID [2022-02-20 19:57:50,073 INFO L272 TraceCheckUtils]: 39: Hoare triple {437#false} call reset_delta_events1(); {478#(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:57:50,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {478#(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; {436#true} is VALID [2022-02-20 19:57:50,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {436#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {436#true} is VALID [2022-02-20 19:57:50,074 INFO L290 TraceCheckUtils]: 42: Hoare triple {436#true} assume true; {436#true} is VALID [2022-02-20 19:57:50,074 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {436#true} {437#false} #1666#return; {437#false} is VALID [2022-02-20 19:57:50,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {437#false} assume !false; {437#false} is VALID [2022-02-20 19:57:50,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {437#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; {437#false} is VALID [2022-02-20 19:57:50,074 INFO L290 TraceCheckUtils]: 46: Hoare triple {437#false} assume !false; {437#false} is VALID [2022-02-20 19:57:50,074 INFO L272 TraceCheckUtils]: 47: Hoare triple {437#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {436#true} is VALID [2022-02-20 19:57:50,074 INFO L290 TraceCheckUtils]: 48: Hoare triple {436#true} havoc ~__retres1~2; {436#true} is VALID [2022-02-20 19:57:50,075 INFO L290 TraceCheckUtils]: 49: Hoare triple {436#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {436#true} is VALID [2022-02-20 19:57:50,075 INFO L290 TraceCheckUtils]: 50: Hoare triple {436#true} #res := ~__retres1~2; {436#true} is VALID [2022-02-20 19:57:50,075 INFO L290 TraceCheckUtils]: 51: Hoare triple {436#true} assume true; {436#true} is VALID [2022-02-20 19:57:50,075 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {436#true} {437#false} #1668#return; {437#false} is VALID [2022-02-20 19:57:50,075 INFO L290 TraceCheckUtils]: 53: Hoare triple {437#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; {437#false} is VALID [2022-02-20 19:57:50,075 INFO L290 TraceCheckUtils]: 54: Hoare triple {437#false} assume 0 != eval1_~tmp___1~0#1; {437#false} is VALID [2022-02-20 19:57:50,075 INFO L290 TraceCheckUtils]: 55: Hoare triple {437#false} assume !(0 == ~p_dw_st~0); {437#false} is VALID [2022-02-20 19:57:50,075 INFO L290 TraceCheckUtils]: 56: Hoare triple {437#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; {437#false} is VALID [2022-02-20 19:57:50,076 INFO L290 TraceCheckUtils]: 57: Hoare triple {437#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; {437#false} is VALID [2022-02-20 19:57:50,076 INFO L290 TraceCheckUtils]: 58: Hoare triple {437#false} assume 0 == ~c_dr_pc~0; {437#false} is VALID [2022-02-20 19:57:50,076 INFO L290 TraceCheckUtils]: 59: Hoare triple {437#false} assume !false; {437#false} is VALID [2022-02-20 19:57:50,076 INFO L290 TraceCheckUtils]: 60: Hoare triple {437#false} assume !(1 == ~q_free~0); {437#false} is VALID [2022-02-20 19:57:50,076 INFO L290 TraceCheckUtils]: 61: Hoare triple {437#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; {437#false} is VALID [2022-02-20 19:57:50,076 INFO L290 TraceCheckUtils]: 62: Hoare triple {437#false} assume !(~p_last_write~0 == ~c_last_read~0); {437#false} is VALID [2022-02-20 19:57:50,076 INFO L272 TraceCheckUtils]: 63: Hoare triple {437#false} call error1(); {437#false} is VALID [2022-02-20 19:57:50,076 INFO L290 TraceCheckUtils]: 64: Hoare triple {437#false} assume !false; {437#false} is VALID [2022-02-20 19:57:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:50,077 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:50,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613587781] [2022-02-20 19:57:50,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613587781] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:50,078 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:50,078 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:50,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939598454] [2022-02-20 19:57:50,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:50,083 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:57:50,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:50,086 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:57:50,135 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:57:50,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:50,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:50,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:50,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:50,164 INFO L87 Difference]: Start difference. First operand has 433 states, 378 states have (on average 1.6322751322751323) internal successors, (617), 384 states have internal predecessors, (617), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) 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:57:53,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:53,205 INFO L93 Difference]: Finished difference Result 975 states and 1548 transitions. [2022-02-20 19:57:53,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:57:53,206 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:57:53,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:53,207 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:57:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1548 transitions. [2022-02-20 19:57:53,242 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:57:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1548 transitions. [2022-02-20 19:57:53,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1548 transitions. [2022-02-20 19:57:54,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1548 edges. 1548 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:54,309 INFO L225 Difference]: With dead ends: 975 [2022-02-20 19:57:54,309 INFO L226 Difference]: Without dead ends: 558 [2022-02-20 19:57:54,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:57:54,315 INFO L933 BasicCegarLoop]: 661 mSDtfsCounter, 1392 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:54,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1397 Valid, 1880 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:57:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-02-20 19:57:54,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 519. [2022-02-20 19:57:54,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:54,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 558 states. Second operand has 519 states, 446 states have (on average 1.515695067264574) internal successors, (676), 452 states have internal predecessors, (676), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:57:54,381 INFO L74 IsIncluded]: Start isIncluded. First operand 558 states. Second operand has 519 states, 446 states have (on average 1.515695067264574) internal successors, (676), 452 states have internal predecessors, (676), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:57:54,382 INFO L87 Difference]: Start difference. First operand 558 states. Second operand has 519 states, 446 states have (on average 1.515695067264574) internal successors, (676), 452 states have internal predecessors, (676), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:57:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:54,403 INFO L93 Difference]: Finished difference Result 558 states and 831 transitions. [2022-02-20 19:57:54,404 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 831 transitions. [2022-02-20 19:57:54,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:54,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:54,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 519 states, 446 states have (on average 1.515695067264574) internal successors, (676), 452 states have internal predecessors, (676), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) Second operand 558 states. [2022-02-20 19:57:54,410 INFO L87 Difference]: Start difference. First operand has 519 states, 446 states have (on average 1.515695067264574) internal successors, (676), 452 states have internal predecessors, (676), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) Second operand 558 states. [2022-02-20 19:57:54,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:54,431 INFO L93 Difference]: Finished difference Result 558 states and 831 transitions. [2022-02-20 19:57:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 831 transitions. [2022-02-20 19:57:54,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:54,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:54,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:54,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:54,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 446 states have (on average 1.515695067264574) internal successors, (676), 452 states have internal predecessors, (676), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:57:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 777 transitions. [2022-02-20 19:57:54,457 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 777 transitions. Word has length 65 [2022-02-20 19:57:54,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:54,458 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 777 transitions. [2022-02-20 19:57:54,458 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:57:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 777 transitions. [2022-02-20 19:57:54,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:54,460 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:54,460 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:57:54,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:57:54,460 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:54,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:54,461 INFO L85 PathProgramCache]: Analyzing trace with hash -166032207, now seen corresponding path program 1 times [2022-02-20 19:57:54,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:54,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499761009] [2022-02-20 19:57:54,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:54,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:54,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:54,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {3646#(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); {3647#(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:57:54,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {3647#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3647#(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:57:54,535 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3647#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3608#(= ~q_write_ev~0 ~q_read_ev~0)} #1660#return; {3608#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:54,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:54,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {3647#(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); {3648#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:54,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {3648#(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; {3649#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:54,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {3649#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3649#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:54,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3649#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3608#(= ~q_write_ev~0 ~q_read_ev~0)} #1662#return; {3607#false} is VALID [2022-02-20 19:57:54,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:54,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:54,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {3606#true} havoc ~__retres1~0; {3606#true} is VALID [2022-02-20 19:57:54,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {3606#true} assume !(1 == ~p_dw_pc~0); {3606#true} is VALID [2022-02-20 19:57:54,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {3606#true} ~__retres1~0 := 0; {3606#true} is VALID [2022-02-20 19:57:54,598 INFO L290 TraceCheckUtils]: 3: Hoare triple {3606#true} #res := ~__retres1~0; {3606#true} is VALID [2022-02-20 19:57:54,598 INFO L290 TraceCheckUtils]: 4: Hoare triple {3606#true} assume true; {3606#true} is VALID [2022-02-20 19:57:54,598 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3606#true} {3606#true} #1656#return; {3606#true} is VALID [2022-02-20 19:57:54,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:54,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {3606#true} havoc ~__retres1~1; {3606#true} is VALID [2022-02-20 19:57:54,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {3606#true} assume !(1 == ~c_dr_pc~0); {3606#true} is VALID [2022-02-20 19:57:54,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {3606#true} ~__retres1~1 := 0; {3606#true} is VALID [2022-02-20 19:57:54,604 INFO L290 TraceCheckUtils]: 3: Hoare triple {3606#true} #res := ~__retres1~1; {3606#true} is VALID [2022-02-20 19:57:54,604 INFO L290 TraceCheckUtils]: 4: Hoare triple {3606#true} assume true; {3606#true} is VALID [2022-02-20 19:57:54,604 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3606#true} {3606#true} #1658#return; {3606#true} is VALID [2022-02-20 19:57:54,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {3650#(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; {3606#true} is VALID [2022-02-20 19:57:54,604 INFO L272 TraceCheckUtils]: 1: Hoare triple {3606#true} call #t~ret8 := is_do_write_p_triggered(); {3606#true} is VALID [2022-02-20 19:57:54,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {3606#true} havoc ~__retres1~0; {3606#true} is VALID [2022-02-20 19:57:54,605 INFO L290 TraceCheckUtils]: 3: Hoare triple {3606#true} assume !(1 == ~p_dw_pc~0); {3606#true} is VALID [2022-02-20 19:57:54,605 INFO L290 TraceCheckUtils]: 4: Hoare triple {3606#true} ~__retres1~0 := 0; {3606#true} is VALID [2022-02-20 19:57:54,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {3606#true} #res := ~__retres1~0; {3606#true} is VALID [2022-02-20 19:57:54,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {3606#true} assume true; {3606#true} is VALID [2022-02-20 19:57:54,605 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3606#true} {3606#true} #1656#return; {3606#true} is VALID [2022-02-20 19:57:54,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {3606#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3606#true} is VALID [2022-02-20 19:57:54,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {3606#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3606#true} is VALID [2022-02-20 19:57:54,606 INFO L272 TraceCheckUtils]: 10: Hoare triple {3606#true} call #t~ret9 := is_do_read_c_triggered(); {3606#true} is VALID [2022-02-20 19:57:54,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {3606#true} havoc ~__retres1~1; {3606#true} is VALID [2022-02-20 19:57:54,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {3606#true} assume !(1 == ~c_dr_pc~0); {3606#true} is VALID [2022-02-20 19:57:54,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {3606#true} ~__retres1~1 := 0; {3606#true} is VALID [2022-02-20 19:57:54,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {3606#true} #res := ~__retres1~1; {3606#true} is VALID [2022-02-20 19:57:54,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {3606#true} assume true; {3606#true} is VALID [2022-02-20 19:57:54,606 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3606#true} {3606#true} #1658#return; {3606#true} is VALID [2022-02-20 19:57:54,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {3606#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3606#true} is VALID [2022-02-20 19:57:54,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {3606#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3606#true} is VALID [2022-02-20 19:57:54,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {3606#true} assume true; {3606#true} is VALID [2022-02-20 19:57:54,607 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3606#true} {3607#false} #1664#return; {3607#false} is VALID [2022-02-20 19:57:54,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:54,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {3647#(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); {3606#true} is VALID [2022-02-20 19:57:54,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {3606#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3606#true} is VALID [2022-02-20 19:57:54,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {3606#true} assume true; {3606#true} is VALID [2022-02-20 19:57:54,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3606#true} {3607#false} #1666#return; {3607#false} is VALID [2022-02-20 19:57:54,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:54,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {3606#true} havoc ~__retres1~2; {3606#true} is VALID [2022-02-20 19:57:54,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {3606#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3606#true} is VALID [2022-02-20 19:57:54,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {3606#true} #res := ~__retres1~2; {3606#true} is VALID [2022-02-20 19:57:54,619 INFO L290 TraceCheckUtils]: 3: Hoare triple {3606#true} assume true; {3606#true} is VALID [2022-02-20 19:57:54,619 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3606#true} {3607#false} #1668#return; {3607#false} is VALID [2022-02-20 19:57:54,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {3606#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {3606#true} is VALID [2022-02-20 19:57:54,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {3606#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {3606#true} is VALID [2022-02-20 19:57:54,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {3606#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#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; {3608#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:54,620 INFO L290 TraceCheckUtils]: 3: Hoare triple {3608#(= ~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; {3608#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:54,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {3608#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {3646#(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:57:54,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {3646#(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); {3647#(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:57:54,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {3647#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3647#(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:57:54,622 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3647#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3608#(= ~q_write_ev~0 ~q_read_ev~0)} #1660#return; {3608#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:54,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {3608#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {3608#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:54,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {3608#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3608#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:54,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {3608#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3608#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:54,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {3608#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {3608#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:54,624 INFO L272 TraceCheckUtils]: 12: Hoare triple {3608#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {3647#(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:57:54,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {3647#(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); {3648#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:54,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {3648#(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; {3649#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:54,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {3649#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3649#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:54,625 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3649#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3608#(= ~q_write_ev~0 ~q_read_ev~0)} #1662#return; {3607#false} is VALID [2022-02-20 19:57:54,625 INFO L272 TraceCheckUtils]: 17: Hoare triple {3607#false} call activate_threads1(); {3650#(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:57:54,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {3650#(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; {3606#true} is VALID [2022-02-20 19:57:54,626 INFO L272 TraceCheckUtils]: 19: Hoare triple {3606#true} call #t~ret8 := is_do_write_p_triggered(); {3606#true} is VALID [2022-02-20 19:57:54,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {3606#true} havoc ~__retres1~0; {3606#true} is VALID [2022-02-20 19:57:54,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {3606#true} assume !(1 == ~p_dw_pc~0); {3606#true} is VALID [2022-02-20 19:57:54,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {3606#true} ~__retres1~0 := 0; {3606#true} is VALID [2022-02-20 19:57:54,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {3606#true} #res := ~__retres1~0; {3606#true} is VALID [2022-02-20 19:57:54,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {3606#true} assume true; {3606#true} is VALID [2022-02-20 19:57:54,626 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3606#true} {3606#true} #1656#return; {3606#true} is VALID [2022-02-20 19:57:54,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {3606#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3606#true} is VALID [2022-02-20 19:57:54,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {3606#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3606#true} is VALID [2022-02-20 19:57:54,627 INFO L272 TraceCheckUtils]: 28: Hoare triple {3606#true} call #t~ret9 := is_do_read_c_triggered(); {3606#true} is VALID [2022-02-20 19:57:54,627 INFO L290 TraceCheckUtils]: 29: Hoare triple {3606#true} havoc ~__retres1~1; {3606#true} is VALID [2022-02-20 19:57:54,627 INFO L290 TraceCheckUtils]: 30: Hoare triple {3606#true} assume !(1 == ~c_dr_pc~0); {3606#true} is VALID [2022-02-20 19:57:54,627 INFO L290 TraceCheckUtils]: 31: Hoare triple {3606#true} ~__retres1~1 := 0; {3606#true} is VALID [2022-02-20 19:57:54,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {3606#true} #res := ~__retres1~1; {3606#true} is VALID [2022-02-20 19:57:54,628 INFO L290 TraceCheckUtils]: 33: Hoare triple {3606#true} assume true; {3606#true} is VALID [2022-02-20 19:57:54,628 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3606#true} {3606#true} #1658#return; {3606#true} is VALID [2022-02-20 19:57:54,630 INFO L290 TraceCheckUtils]: 35: Hoare triple {3606#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3606#true} is VALID [2022-02-20 19:57:54,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {3606#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3606#true} is VALID [2022-02-20 19:57:54,631 INFO L290 TraceCheckUtils]: 37: Hoare triple {3606#true} assume true; {3606#true} is VALID [2022-02-20 19:57:54,631 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3606#true} {3607#false} #1664#return; {3607#false} is VALID [2022-02-20 19:57:54,631 INFO L272 TraceCheckUtils]: 39: Hoare triple {3607#false} call reset_delta_events1(); {3647#(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:57:54,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {3647#(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); {3606#true} is VALID [2022-02-20 19:57:54,632 INFO L290 TraceCheckUtils]: 41: Hoare triple {3606#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3606#true} is VALID [2022-02-20 19:57:54,633 INFO L290 TraceCheckUtils]: 42: Hoare triple {3606#true} assume true; {3606#true} is VALID [2022-02-20 19:57:54,633 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3606#true} {3607#false} #1666#return; {3607#false} is VALID [2022-02-20 19:57:54,633 INFO L290 TraceCheckUtils]: 44: Hoare triple {3607#false} assume !false; {3607#false} is VALID [2022-02-20 19:57:54,633 INFO L290 TraceCheckUtils]: 45: Hoare triple {3607#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; {3607#false} is VALID [2022-02-20 19:57:54,633 INFO L290 TraceCheckUtils]: 46: Hoare triple {3607#false} assume !false; {3607#false} is VALID [2022-02-20 19:57:54,633 INFO L272 TraceCheckUtils]: 47: Hoare triple {3607#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3606#true} is VALID [2022-02-20 19:57:54,633 INFO L290 TraceCheckUtils]: 48: Hoare triple {3606#true} havoc ~__retres1~2; {3606#true} is VALID [2022-02-20 19:57:54,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {3606#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3606#true} is VALID [2022-02-20 19:57:54,634 INFO L290 TraceCheckUtils]: 50: Hoare triple {3606#true} #res := ~__retres1~2; {3606#true} is VALID [2022-02-20 19:57:54,634 INFO L290 TraceCheckUtils]: 51: Hoare triple {3606#true} assume true; {3606#true} is VALID [2022-02-20 19:57:54,634 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3606#true} {3607#false} #1668#return; {3607#false} is VALID [2022-02-20 19:57:54,634 INFO L290 TraceCheckUtils]: 53: Hoare triple {3607#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; {3607#false} is VALID [2022-02-20 19:57:54,634 INFO L290 TraceCheckUtils]: 54: Hoare triple {3607#false} assume 0 != eval1_~tmp___1~0#1; {3607#false} is VALID [2022-02-20 19:57:54,634 INFO L290 TraceCheckUtils]: 55: Hoare triple {3607#false} assume !(0 == ~p_dw_st~0); {3607#false} is VALID [2022-02-20 19:57:54,635 INFO L290 TraceCheckUtils]: 56: Hoare triple {3607#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; {3607#false} is VALID [2022-02-20 19:57:54,635 INFO L290 TraceCheckUtils]: 57: Hoare triple {3607#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; {3607#false} is VALID [2022-02-20 19:57:54,645 INFO L290 TraceCheckUtils]: 58: Hoare triple {3607#false} assume 0 == ~c_dr_pc~0; {3607#false} is VALID [2022-02-20 19:57:54,645 INFO L290 TraceCheckUtils]: 59: Hoare triple {3607#false} assume !false; {3607#false} is VALID [2022-02-20 19:57:54,645 INFO L290 TraceCheckUtils]: 60: Hoare triple {3607#false} assume !(1 == ~q_free~0); {3607#false} is VALID [2022-02-20 19:57:54,646 INFO L290 TraceCheckUtils]: 61: Hoare triple {3607#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; {3607#false} is VALID [2022-02-20 19:57:54,646 INFO L290 TraceCheckUtils]: 62: Hoare triple {3607#false} assume !(~p_last_write~0 == ~c_last_read~0); {3607#false} is VALID [2022-02-20 19:57:54,646 INFO L272 TraceCheckUtils]: 63: Hoare triple {3607#false} call error1(); {3607#false} is VALID [2022-02-20 19:57:54,646 INFO L290 TraceCheckUtils]: 64: Hoare triple {3607#false} assume !false; {3607#false} is VALID [2022-02-20 19:57:54,646 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:57:54,647 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:54,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499761009] [2022-02-20 19:57:54,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499761009] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:54,647 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:54,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:54,647 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602585946] [2022-02-20 19:57:54,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:54,648 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:57:54,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:54,649 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:57:54,683 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:57:54,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:54,683 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:54,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:54,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:54,684 INFO L87 Difference]: Start difference. First operand 519 states and 777 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:57:57,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:57,918 INFO L93 Difference]: Finished difference Result 866 states and 1254 transitions. [2022-02-20 19:57:57,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:57:57,918 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:57:57,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:57,919 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:57:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 983 transitions. [2022-02-20 19:57:57,927 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:57:57,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 983 transitions. [2022-02-20 19:57:57,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 983 transitions. [2022-02-20 19:57:58,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 983 edges. 983 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:58,640 INFO L225 Difference]: With dead ends: 866 [2022-02-20 19:57:58,640 INFO L226 Difference]: Without dead ends: 689 [2022-02-20 19:57:58,644 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:57:58,645 INFO L933 BasicCegarLoop]: 707 mSDtfsCounter, 1538 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 2097 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:58,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1566 Valid, 2097 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:57:58,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2022-02-20 19:57:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 615. [2022-02-20 19:57:58,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:58,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 689 states. Second operand has 615 states, 522 states have (on average 1.4942528735632183) internal successors, (780), 530 states have internal predecessors, (780), 60 states have call successors, (60), 28 states have call predecessors, (60), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) [2022-02-20 19:57:58,679 INFO L74 IsIncluded]: Start isIncluded. First operand 689 states. Second operand has 615 states, 522 states have (on average 1.4942528735632183) internal successors, (780), 530 states have internal predecessors, (780), 60 states have call successors, (60), 28 states have call predecessors, (60), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) [2022-02-20 19:57:58,680 INFO L87 Difference]: Start difference. First operand 689 states. Second operand has 615 states, 522 states have (on average 1.4942528735632183) internal successors, (780), 530 states have internal predecessors, (780), 60 states have call successors, (60), 28 states have call predecessors, (60), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) [2022-02-20 19:57:58,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:58,700 INFO L93 Difference]: Finished difference Result 689 states and 1014 transitions. [2022-02-20 19:57:58,700 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1014 transitions. [2022-02-20 19:57:58,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:58,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:58,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 615 states, 522 states have (on average 1.4942528735632183) internal successors, (780), 530 states have internal predecessors, (780), 60 states have call successors, (60), 28 states have call predecessors, (60), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) Second operand 689 states. [2022-02-20 19:57:58,704 INFO L87 Difference]: Start difference. First operand has 615 states, 522 states have (on average 1.4942528735632183) internal successors, (780), 530 states have internal predecessors, (780), 60 states have call successors, (60), 28 states have call predecessors, (60), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) Second operand 689 states. [2022-02-20 19:57:58,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:58,724 INFO L93 Difference]: Finished difference Result 689 states and 1014 transitions. [2022-02-20 19:57:58,724 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1014 transitions. [2022-02-20 19:57:58,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:58,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:58,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:58,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 522 states have (on average 1.4942528735632183) internal successors, (780), 530 states have internal predecessors, (780), 60 states have call successors, (60), 28 states have call predecessors, (60), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) [2022-02-20 19:57:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 911 transitions. [2022-02-20 19:57:58,746 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 911 transitions. Word has length 65 [2022-02-20 19:57:58,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:58,748 INFO L470 AbstractCegarLoop]: Abstraction has 615 states and 911 transitions. [2022-02-20 19:57:58,748 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:57:58,748 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 911 transitions. [2022-02-20 19:57:58,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:58,749 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:58,749 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:57:58,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:57:58,749 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:58,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:58,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2100348979, now seen corresponding path program 1 times [2022-02-20 19:57:58,750 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:58,750 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065729982] [2022-02-20 19:57:58,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:58,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:58,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:58,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {7078#(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); {7039#true} is VALID [2022-02-20 19:57:58,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 19:57:58,800 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7039#true} {7039#true} #1660#return; {7039#true} is VALID [2022-02-20 19:57:58,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:58,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {7079#(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); {7039#true} is VALID [2022-02-20 19:57:58,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {7039#true} assume !(0 == ~q_write_ev~0); {7039#true} is VALID [2022-02-20 19:57:58,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 19:57:58,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7039#true} {7039#true} #1662#return; {7039#true} is VALID [2022-02-20 19:57:58,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:58,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:58,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {7039#true} havoc ~__retres1~0; {7039#true} is VALID [2022-02-20 19:57:58,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {7039#true} assume !(1 == ~p_dw_pc~0); {7039#true} is VALID [2022-02-20 19:57:58,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {7039#true} ~__retres1~0 := 0; {7095#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:58,877 INFO L290 TraceCheckUtils]: 3: Hoare triple {7095#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7096#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:58,877 INFO L290 TraceCheckUtils]: 4: Hoare triple {7096#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7096#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:58,877 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7096#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7039#true} #1656#return; {7087#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:58,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:58,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {7039#true} havoc ~__retres1~1; {7039#true} is VALID [2022-02-20 19:57:58,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {7039#true} assume !(1 == ~c_dr_pc~0); {7039#true} is VALID [2022-02-20 19:57:58,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {7039#true} ~__retres1~1 := 0; {7039#true} is VALID [2022-02-20 19:57:58,881 INFO L290 TraceCheckUtils]: 3: Hoare triple {7039#true} #res := ~__retres1~1; {7039#true} is VALID [2022-02-20 19:57:58,882 INFO L290 TraceCheckUtils]: 4: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 19:57:58,882 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7039#true} {7040#false} #1658#return; {7040#false} is VALID [2022-02-20 19:57:58,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {7080#(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; {7039#true} is VALID [2022-02-20 19:57:58,882 INFO L272 TraceCheckUtils]: 1: Hoare triple {7039#true} call #t~ret8 := is_do_write_p_triggered(); {7039#true} is VALID [2022-02-20 19:57:58,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {7039#true} havoc ~__retres1~0; {7039#true} is VALID [2022-02-20 19:57:58,882 INFO L290 TraceCheckUtils]: 3: Hoare triple {7039#true} assume !(1 == ~p_dw_pc~0); {7039#true} is VALID [2022-02-20 19:57:58,886 INFO L290 TraceCheckUtils]: 4: Hoare triple {7039#true} ~__retres1~0 := 0; {7095#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:58,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {7095#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7096#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:58,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {7096#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7096#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:58,887 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7096#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7039#true} #1656#return; {7087#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:58,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {7087#(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; {7088#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:58,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {7088#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7040#false} is VALID [2022-02-20 19:57:58,888 INFO L272 TraceCheckUtils]: 10: Hoare triple {7040#false} call #t~ret9 := is_do_read_c_triggered(); {7039#true} is VALID [2022-02-20 19:57:58,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {7039#true} havoc ~__retres1~1; {7039#true} is VALID [2022-02-20 19:57:58,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {7039#true} assume !(1 == ~c_dr_pc~0); {7039#true} is VALID [2022-02-20 19:57:58,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {7039#true} ~__retres1~1 := 0; {7039#true} is VALID [2022-02-20 19:57:58,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {7039#true} #res := ~__retres1~1; {7039#true} is VALID [2022-02-20 19:57:58,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 19:57:58,889 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7039#true} {7040#false} #1658#return; {7040#false} is VALID [2022-02-20 19:57:58,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {7040#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7040#false} is VALID [2022-02-20 19:57:58,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {7040#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7040#false} is VALID [2022-02-20 19:57:58,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {7040#false} assume true; {7040#false} is VALID [2022-02-20 19:57:58,890 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7040#false} {7039#true} #1664#return; {7040#false} is VALID [2022-02-20 19:57:58,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:58,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {7079#(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); {7039#true} is VALID [2022-02-20 19:57:58,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {7039#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7039#true} is VALID [2022-02-20 19:57:58,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 19:57:58,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7039#true} {7040#false} #1666#return; {7040#false} is VALID [2022-02-20 19:57:58,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:58,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {7039#true} havoc ~__retres1~2; {7039#true} is VALID [2022-02-20 19:57:58,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {7039#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7039#true} is VALID [2022-02-20 19:57:58,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {7039#true} #res := ~__retres1~2; {7039#true} is VALID [2022-02-20 19:57:58,896 INFO L290 TraceCheckUtils]: 3: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 19:57:58,896 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7039#true} {7040#false} #1668#return; {7040#false} is VALID [2022-02-20 19:57:58,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {7039#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {7039#true} is VALID [2022-02-20 19:57:58,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {7039#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {7039#true} is VALID [2022-02-20 19:57:58,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {7039#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#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; {7039#true} is VALID [2022-02-20 19:57:58,897 INFO L290 TraceCheckUtils]: 3: Hoare triple {7039#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; {7039#true} is VALID [2022-02-20 19:57:58,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {7039#true} call update_channels1(); {7078#(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:57:58,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {7078#(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); {7039#true} is VALID [2022-02-20 19:57:58,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 19:57:58,898 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7039#true} {7039#true} #1660#return; {7039#true} is VALID [2022-02-20 19:57:58,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {7039#true} assume { :begin_inline_init_threads1 } true; {7039#true} is VALID [2022-02-20 19:57:58,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {7039#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7039#true} is VALID [2022-02-20 19:57:58,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {7039#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7039#true} is VALID [2022-02-20 19:57:58,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {7039#true} assume { :end_inline_init_threads1 } true; {7039#true} is VALID [2022-02-20 19:57:58,899 INFO L272 TraceCheckUtils]: 12: Hoare triple {7039#true} call fire_delta_events1(); {7079#(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:57:58,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {7079#(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); {7039#true} is VALID [2022-02-20 19:57:58,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {7039#true} assume !(0 == ~q_write_ev~0); {7039#true} is VALID [2022-02-20 19:57:58,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 19:57:58,899 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7039#true} {7039#true} #1662#return; {7039#true} is VALID [2022-02-20 19:57:58,900 INFO L272 TraceCheckUtils]: 17: Hoare triple {7039#true} call activate_threads1(); {7080#(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:57:58,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {7080#(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; {7039#true} is VALID [2022-02-20 19:57:58,900 INFO L272 TraceCheckUtils]: 19: Hoare triple {7039#true} call #t~ret8 := is_do_write_p_triggered(); {7039#true} is VALID [2022-02-20 19:57:58,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {7039#true} havoc ~__retres1~0; {7039#true} is VALID [2022-02-20 19:57:58,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {7039#true} assume !(1 == ~p_dw_pc~0); {7039#true} is VALID [2022-02-20 19:57:58,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {7039#true} ~__retres1~0 := 0; {7095#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:58,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {7095#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7096#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:58,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {7096#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7096#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:58,902 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7096#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7039#true} #1656#return; {7087#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:58,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {7087#(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; {7088#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:58,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {7088#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7040#false} is VALID [2022-02-20 19:57:58,903 INFO L272 TraceCheckUtils]: 28: Hoare triple {7040#false} call #t~ret9 := is_do_read_c_triggered(); {7039#true} is VALID [2022-02-20 19:57:58,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {7039#true} havoc ~__retres1~1; {7039#true} is VALID [2022-02-20 19:57:58,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {7039#true} assume !(1 == ~c_dr_pc~0); {7039#true} is VALID [2022-02-20 19:57:58,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {7039#true} ~__retres1~1 := 0; {7039#true} is VALID [2022-02-20 19:57:58,903 INFO L290 TraceCheckUtils]: 32: Hoare triple {7039#true} #res := ~__retres1~1; {7039#true} is VALID [2022-02-20 19:57:58,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 19:57:58,903 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7039#true} {7040#false} #1658#return; {7040#false} is VALID [2022-02-20 19:57:58,904 INFO L290 TraceCheckUtils]: 35: Hoare triple {7040#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7040#false} is VALID [2022-02-20 19:57:58,904 INFO L290 TraceCheckUtils]: 36: Hoare triple {7040#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7040#false} is VALID [2022-02-20 19:57:58,904 INFO L290 TraceCheckUtils]: 37: Hoare triple {7040#false} assume true; {7040#false} is VALID [2022-02-20 19:57:58,904 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7040#false} {7039#true} #1664#return; {7040#false} is VALID [2022-02-20 19:57:58,904 INFO L272 TraceCheckUtils]: 39: Hoare triple {7040#false} call reset_delta_events1(); {7079#(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:57:58,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {7079#(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); {7039#true} is VALID [2022-02-20 19:57:58,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {7039#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7039#true} is VALID [2022-02-20 19:57:58,904 INFO L290 TraceCheckUtils]: 42: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 19:57:58,905 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7039#true} {7040#false} #1666#return; {7040#false} is VALID [2022-02-20 19:57:58,905 INFO L290 TraceCheckUtils]: 44: Hoare triple {7040#false} assume !false; {7040#false} is VALID [2022-02-20 19:57:58,905 INFO L290 TraceCheckUtils]: 45: Hoare triple {7040#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; {7040#false} is VALID [2022-02-20 19:57:58,905 INFO L290 TraceCheckUtils]: 46: Hoare triple {7040#false} assume !false; {7040#false} is VALID [2022-02-20 19:57:58,905 INFO L272 TraceCheckUtils]: 47: Hoare triple {7040#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7039#true} is VALID [2022-02-20 19:57:58,905 INFO L290 TraceCheckUtils]: 48: Hoare triple {7039#true} havoc ~__retres1~2; {7039#true} is VALID [2022-02-20 19:57:58,905 INFO L290 TraceCheckUtils]: 49: Hoare triple {7039#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7039#true} is VALID [2022-02-20 19:57:58,905 INFO L290 TraceCheckUtils]: 50: Hoare triple {7039#true} #res := ~__retres1~2; {7039#true} is VALID [2022-02-20 19:57:58,906 INFO L290 TraceCheckUtils]: 51: Hoare triple {7039#true} assume true; {7039#true} is VALID [2022-02-20 19:57:58,906 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7039#true} {7040#false} #1668#return; {7040#false} is VALID [2022-02-20 19:57:58,906 INFO L290 TraceCheckUtils]: 53: Hoare triple {7040#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; {7040#false} is VALID [2022-02-20 19:57:58,906 INFO L290 TraceCheckUtils]: 54: Hoare triple {7040#false} assume 0 != eval1_~tmp___1~0#1; {7040#false} is VALID [2022-02-20 19:57:58,906 INFO L290 TraceCheckUtils]: 55: Hoare triple {7040#false} assume !(0 == ~p_dw_st~0); {7040#false} is VALID [2022-02-20 19:57:58,906 INFO L290 TraceCheckUtils]: 56: Hoare triple {7040#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; {7040#false} is VALID [2022-02-20 19:57:58,906 INFO L290 TraceCheckUtils]: 57: Hoare triple {7040#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; {7040#false} is VALID [2022-02-20 19:57:58,906 INFO L290 TraceCheckUtils]: 58: Hoare triple {7040#false} assume 0 == ~c_dr_pc~0; {7040#false} is VALID [2022-02-20 19:57:58,907 INFO L290 TraceCheckUtils]: 59: Hoare triple {7040#false} assume !false; {7040#false} is VALID [2022-02-20 19:57:58,907 INFO L290 TraceCheckUtils]: 60: Hoare triple {7040#false} assume !(1 == ~q_free~0); {7040#false} is VALID [2022-02-20 19:57:58,907 INFO L290 TraceCheckUtils]: 61: Hoare triple {7040#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; {7040#false} is VALID [2022-02-20 19:57:58,907 INFO L290 TraceCheckUtils]: 62: Hoare triple {7040#false} assume !(~p_last_write~0 == ~c_last_read~0); {7040#false} is VALID [2022-02-20 19:57:58,907 INFO L272 TraceCheckUtils]: 63: Hoare triple {7040#false} call error1(); {7040#false} is VALID [2022-02-20 19:57:58,907 INFO L290 TraceCheckUtils]: 64: Hoare triple {7040#false} assume !false; {7040#false} is VALID [2022-02-20 19:57:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:58,908 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:58,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065729982] [2022-02-20 19:57:58,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065729982] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:58,908 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:58,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:58,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425365431] [2022-02-20 19:57:58,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:58,909 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:57:58,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:58,909 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:57:58,944 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:57:58,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:58,944 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:58,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:58,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:58,945 INFO L87 Difference]: Start difference. First operand 615 states and 911 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:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:02,153 INFO L93 Difference]: Finished difference Result 916 states and 1325 transitions. [2022-02-20 19:58:02,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:02,153 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:02,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:02,154 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:02,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 801 transitions. [2022-02-20 19:58:02,166 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:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 801 transitions. [2022-02-20 19:58:02,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 801 transitions. [2022-02-20 19:58:02,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 801 edges. 801 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:02,715 INFO L225 Difference]: With dead ends: 916 [2022-02-20 19:58:02,715 INFO L226 Difference]: Without dead ends: 649 [2022-02-20 19:58:02,716 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:02,716 INFO L933 BasicCegarLoop]: 633 mSDtfsCounter, 570 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 2798 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:02,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [571 Valid, 2798 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:58:02,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2022-02-20 19:58:02,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 620. [2022-02-20 19:58:02,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:02,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 649 states. Second operand has 620 states, 526 states have (on average 1.4866920152091254) internal successors, (782), 534 states have internal predecessors, (782), 60 states have call successors, (60), 28 states have call predecessors, (60), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) [2022-02-20 19:58:02,738 INFO L74 IsIncluded]: Start isIncluded. First operand 649 states. Second operand has 620 states, 526 states have (on average 1.4866920152091254) internal successors, (782), 534 states have internal predecessors, (782), 60 states have call successors, (60), 28 states have call predecessors, (60), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) [2022-02-20 19:58:02,739 INFO L87 Difference]: Start difference. First operand 649 states. Second operand has 620 states, 526 states have (on average 1.4866920152091254) internal successors, (782), 534 states have internal predecessors, (782), 60 states have call successors, (60), 28 states have call predecessors, (60), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) [2022-02-20 19:58:02,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:02,757 INFO L93 Difference]: Finished difference Result 649 states and 955 transitions. [2022-02-20 19:58:02,757 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 955 transitions. [2022-02-20 19:58:02,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:02,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:02,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 620 states, 526 states have (on average 1.4866920152091254) internal successors, (782), 534 states have internal predecessors, (782), 60 states have call successors, (60), 28 states have call predecessors, (60), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) Second operand 649 states. [2022-02-20 19:58:02,761 INFO L87 Difference]: Start difference. First operand has 620 states, 526 states have (on average 1.4866920152091254) internal successors, (782), 534 states have internal predecessors, (782), 60 states have call successors, (60), 28 states have call predecessors, (60), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) Second operand 649 states. [2022-02-20 19:58:02,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:02,777 INFO L93 Difference]: Finished difference Result 649 states and 955 transitions. [2022-02-20 19:58:02,777 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 955 transitions. [2022-02-20 19:58:02,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:02,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:02,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:02,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:02,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 526 states have (on average 1.4866920152091254) internal successors, (782), 534 states have internal predecessors, (782), 60 states have call successors, (60), 28 states have call predecessors, (60), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) [2022-02-20 19:58:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 914 transitions. [2022-02-20 19:58:02,798 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 914 transitions. Word has length 65 [2022-02-20 19:58:02,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:02,799 INFO L470 AbstractCegarLoop]: Abstraction has 620 states and 914 transitions. [2022-02-20 19:58:02,799 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:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 914 transitions. [2022-02-20 19:58:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:02,800 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:02,800 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:02,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:58:02,800 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:02,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:02,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1070989681, now seen corresponding path program 1 times [2022-02-20 19:58:02,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:02,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171846014] [2022-02-20 19:58:02,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:02,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {10496#(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); {10457#true} is VALID [2022-02-20 19:58:02,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {10457#true} assume true; {10457#true} is VALID [2022-02-20 19:58:02,840 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10457#true} {10457#true} #1660#return; {10457#true} is VALID [2022-02-20 19:58:02,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {10497#(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); {10457#true} is VALID [2022-02-20 19:58:02,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {10457#true} assume !(0 == ~q_write_ev~0); {10457#true} is VALID [2022-02-20 19:58:02,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {10457#true} assume true; {10457#true} is VALID [2022-02-20 19:58:02,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10457#true} {10457#true} #1662#return; {10457#true} is VALID [2022-02-20 19:58:02,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {10457#true} havoc ~__retres1~0; {10457#true} is VALID [2022-02-20 19:58:02,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {10457#true} assume !(1 == ~p_dw_pc~0); {10457#true} is VALID [2022-02-20 19:58:02,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {10457#true} ~__retres1~0 := 0; {10457#true} is VALID [2022-02-20 19:58:02,913 INFO L290 TraceCheckUtils]: 3: Hoare triple {10457#true} #res := ~__retres1~0; {10457#true} is VALID [2022-02-20 19:58:02,913 INFO L290 TraceCheckUtils]: 4: Hoare triple {10457#true} assume true; {10457#true} is VALID [2022-02-20 19:58:02,913 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10457#true} {10457#true} #1656#return; {10457#true} is VALID [2022-02-20 19:58:02,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {10457#true} havoc ~__retres1~1; {10457#true} is VALID [2022-02-20 19:58:02,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {10457#true} assume !(1 == ~c_dr_pc~0); {10457#true} is VALID [2022-02-20 19:58:02,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {10457#true} ~__retres1~1 := 0; {10513#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:02,960 INFO L290 TraceCheckUtils]: 3: Hoare triple {10513#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10514#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:02,960 INFO L290 TraceCheckUtils]: 4: Hoare triple {10514#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10514#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:02,961 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10514#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10457#true} #1658#return; {10511#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:02,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {10498#(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; {10457#true} is VALID [2022-02-20 19:58:02,961 INFO L272 TraceCheckUtils]: 1: Hoare triple {10457#true} call #t~ret8 := is_do_write_p_triggered(); {10457#true} is VALID [2022-02-20 19:58:02,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {10457#true} havoc ~__retres1~0; {10457#true} is VALID [2022-02-20 19:58:02,961 INFO L290 TraceCheckUtils]: 3: Hoare triple {10457#true} assume !(1 == ~p_dw_pc~0); {10457#true} is VALID [2022-02-20 19:58:02,961 INFO L290 TraceCheckUtils]: 4: Hoare triple {10457#true} ~__retres1~0 := 0; {10457#true} is VALID [2022-02-20 19:58:02,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {10457#true} #res := ~__retres1~0; {10457#true} is VALID [2022-02-20 19:58:02,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {10457#true} assume true; {10457#true} is VALID [2022-02-20 19:58:02,962 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10457#true} {10457#true} #1656#return; {10457#true} is VALID [2022-02-20 19:58:02,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {10457#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10457#true} is VALID [2022-02-20 19:58:02,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {10457#true} assume !(0 != ~tmp~1); {10457#true} is VALID [2022-02-20 19:58:02,962 INFO L272 TraceCheckUtils]: 10: Hoare triple {10457#true} call #t~ret9 := is_do_read_c_triggered(); {10457#true} is VALID [2022-02-20 19:58:02,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {10457#true} havoc ~__retres1~1; {10457#true} is VALID [2022-02-20 19:58:02,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {10457#true} assume !(1 == ~c_dr_pc~0); {10457#true} is VALID [2022-02-20 19:58:02,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {10457#true} ~__retres1~1 := 0; {10513#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:02,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {10513#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10514#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:02,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {10514#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10514#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:02,969 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10514#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10457#true} #1658#return; {10511#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:02,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {10511#(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; {10512#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:02,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {10512#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10458#false} is VALID [2022-02-20 19:58:02,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {10458#false} assume true; {10458#false} is VALID [2022-02-20 19:58:02,971 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10458#false} {10457#true} #1664#return; {10458#false} is VALID [2022-02-20 19:58:02,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {10497#(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); {10457#true} is VALID [2022-02-20 19:58:02,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {10457#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10457#true} is VALID [2022-02-20 19:58:02,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {10457#true} assume true; {10457#true} is VALID [2022-02-20 19:58:02,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10457#true} {10458#false} #1666#return; {10458#false} is VALID [2022-02-20 19:58:02,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {10457#true} havoc ~__retres1~2; {10457#true} is VALID [2022-02-20 19:58:02,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {10457#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10457#true} is VALID [2022-02-20 19:58:02,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {10457#true} #res := ~__retres1~2; {10457#true} is VALID [2022-02-20 19:58:02,978 INFO L290 TraceCheckUtils]: 3: Hoare triple {10457#true} assume true; {10457#true} is VALID [2022-02-20 19:58:02,979 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10457#true} {10458#false} #1668#return; {10458#false} is VALID [2022-02-20 19:58:02,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {10457#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {10457#true} is VALID [2022-02-20 19:58:02,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {10457#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {10457#true} is VALID [2022-02-20 19:58:02,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {10457#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#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; {10457#true} is VALID [2022-02-20 19:58:02,979 INFO L290 TraceCheckUtils]: 3: Hoare triple {10457#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; {10457#true} is VALID [2022-02-20 19:58:02,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {10457#true} call update_channels1(); {10496#(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:02,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {10496#(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); {10457#true} is VALID [2022-02-20 19:58:02,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {10457#true} assume true; {10457#true} is VALID [2022-02-20 19:58:02,980 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10457#true} {10457#true} #1660#return; {10457#true} is VALID [2022-02-20 19:58:02,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {10457#true} assume { :begin_inline_init_threads1 } true; {10457#true} is VALID [2022-02-20 19:58:02,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {10457#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10457#true} is VALID [2022-02-20 19:58:02,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {10457#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10457#true} is VALID [2022-02-20 19:58:02,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {10457#true} assume { :end_inline_init_threads1 } true; {10457#true} is VALID [2022-02-20 19:58:02,981 INFO L272 TraceCheckUtils]: 12: Hoare triple {10457#true} call fire_delta_events1(); {10497#(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:02,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {10497#(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); {10457#true} is VALID [2022-02-20 19:58:02,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {10457#true} assume !(0 == ~q_write_ev~0); {10457#true} is VALID [2022-02-20 19:58:02,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {10457#true} assume true; {10457#true} is VALID [2022-02-20 19:58:02,981 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10457#true} {10457#true} #1662#return; {10457#true} is VALID [2022-02-20 19:58:02,981 INFO L272 TraceCheckUtils]: 17: Hoare triple {10457#true} call activate_threads1(); {10498#(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:02,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {10498#(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; {10457#true} is VALID [2022-02-20 19:58:02,982 INFO L272 TraceCheckUtils]: 19: Hoare triple {10457#true} call #t~ret8 := is_do_write_p_triggered(); {10457#true} is VALID [2022-02-20 19:58:02,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {10457#true} havoc ~__retres1~0; {10457#true} is VALID [2022-02-20 19:58:02,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {10457#true} assume !(1 == ~p_dw_pc~0); {10457#true} is VALID [2022-02-20 19:58:02,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {10457#true} ~__retres1~0 := 0; {10457#true} is VALID [2022-02-20 19:58:02,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {10457#true} #res := ~__retres1~0; {10457#true} is VALID [2022-02-20 19:58:02,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {10457#true} assume true; {10457#true} is VALID [2022-02-20 19:58:02,982 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10457#true} {10457#true} #1656#return; {10457#true} is VALID [2022-02-20 19:58:02,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {10457#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10457#true} is VALID [2022-02-20 19:58:02,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {10457#true} assume !(0 != ~tmp~1); {10457#true} is VALID [2022-02-20 19:58:02,983 INFO L272 TraceCheckUtils]: 28: Hoare triple {10457#true} call #t~ret9 := is_do_read_c_triggered(); {10457#true} is VALID [2022-02-20 19:58:02,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {10457#true} havoc ~__retres1~1; {10457#true} is VALID [2022-02-20 19:58:02,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {10457#true} assume !(1 == ~c_dr_pc~0); {10457#true} is VALID [2022-02-20 19:58:02,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {10457#true} ~__retres1~1 := 0; {10513#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:58:02,983 INFO L290 TraceCheckUtils]: 32: Hoare triple {10513#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10514#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:02,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {10514#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10514#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:58:02,984 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10514#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10457#true} #1658#return; {10511#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:58:02,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {10511#(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; {10512#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:58:02,985 INFO L290 TraceCheckUtils]: 36: Hoare triple {10512#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10458#false} is VALID [2022-02-20 19:58:02,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {10458#false} assume true; {10458#false} is VALID [2022-02-20 19:58:02,985 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10458#false} {10457#true} #1664#return; {10458#false} is VALID [2022-02-20 19:58:02,985 INFO L272 TraceCheckUtils]: 39: Hoare triple {10458#false} call reset_delta_events1(); {10497#(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:02,985 INFO L290 TraceCheckUtils]: 40: Hoare triple {10497#(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); {10457#true} is VALID [2022-02-20 19:58:02,986 INFO L290 TraceCheckUtils]: 41: Hoare triple {10457#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10457#true} is VALID [2022-02-20 19:58:02,986 INFO L290 TraceCheckUtils]: 42: Hoare triple {10457#true} assume true; {10457#true} is VALID [2022-02-20 19:58:02,986 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10457#true} {10458#false} #1666#return; {10458#false} is VALID [2022-02-20 19:58:02,987 INFO L290 TraceCheckUtils]: 44: Hoare triple {10458#false} assume !false; {10458#false} is VALID [2022-02-20 19:58:02,987 INFO L290 TraceCheckUtils]: 45: Hoare triple {10458#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; {10458#false} is VALID [2022-02-20 19:58:02,987 INFO L290 TraceCheckUtils]: 46: Hoare triple {10458#false} assume !false; {10458#false} is VALID [2022-02-20 19:58:02,987 INFO L272 TraceCheckUtils]: 47: Hoare triple {10458#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10457#true} is VALID [2022-02-20 19:58:02,987 INFO L290 TraceCheckUtils]: 48: Hoare triple {10457#true} havoc ~__retres1~2; {10457#true} is VALID [2022-02-20 19:58:02,987 INFO L290 TraceCheckUtils]: 49: Hoare triple {10457#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10457#true} is VALID [2022-02-20 19:58:02,987 INFO L290 TraceCheckUtils]: 50: Hoare triple {10457#true} #res := ~__retres1~2; {10457#true} is VALID [2022-02-20 19:58:02,987 INFO L290 TraceCheckUtils]: 51: Hoare triple {10457#true} assume true; {10457#true} is VALID [2022-02-20 19:58:02,987 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10457#true} {10458#false} #1668#return; {10458#false} is VALID [2022-02-20 19:58:02,988 INFO L290 TraceCheckUtils]: 53: Hoare triple {10458#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; {10458#false} is VALID [2022-02-20 19:58:02,988 INFO L290 TraceCheckUtils]: 54: Hoare triple {10458#false} assume 0 != eval1_~tmp___1~0#1; {10458#false} is VALID [2022-02-20 19:58:02,988 INFO L290 TraceCheckUtils]: 55: Hoare triple {10458#false} assume !(0 == ~p_dw_st~0); {10458#false} is VALID [2022-02-20 19:58:02,988 INFO L290 TraceCheckUtils]: 56: Hoare triple {10458#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; {10458#false} is VALID [2022-02-20 19:58:02,988 INFO L290 TraceCheckUtils]: 57: Hoare triple {10458#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; {10458#false} is VALID [2022-02-20 19:58:02,988 INFO L290 TraceCheckUtils]: 58: Hoare triple {10458#false} assume 0 == ~c_dr_pc~0; {10458#false} is VALID [2022-02-20 19:58:02,988 INFO L290 TraceCheckUtils]: 59: Hoare triple {10458#false} assume !false; {10458#false} is VALID [2022-02-20 19:58:02,988 INFO L290 TraceCheckUtils]: 60: Hoare triple {10458#false} assume !(1 == ~q_free~0); {10458#false} is VALID [2022-02-20 19:58:02,988 INFO L290 TraceCheckUtils]: 61: Hoare triple {10458#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; {10458#false} is VALID [2022-02-20 19:58:02,988 INFO L290 TraceCheckUtils]: 62: Hoare triple {10458#false} assume !(~p_last_write~0 == ~c_last_read~0); {10458#false} is VALID [2022-02-20 19:58:02,989 INFO L272 TraceCheckUtils]: 63: Hoare triple {10458#false} call error1(); {10458#false} is VALID [2022-02-20 19:58:02,989 INFO L290 TraceCheckUtils]: 64: Hoare triple {10458#false} assume !false; {10458#false} is VALID [2022-02-20 19:58:02,990 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:02,990 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:02,990 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171846014] [2022-02-20 19:58:02,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171846014] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:02,990 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:02,990 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:58:02,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763206937] [2022-02-20 19:58:02,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:02,992 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:02,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:02,993 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:03,022 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:03,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:58:03,022 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:03,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:58:03,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:58:03,023 INFO L87 Difference]: Start difference. First operand 620 states and 914 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:06,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:06,068 INFO L93 Difference]: Finished difference Result 938 states and 1347 transitions. [2022-02-20 19:58:06,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:06,068 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:06,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:06,069 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:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 805 transitions. [2022-02-20 19:58:06,073 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:06,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 805 transitions. [2022-02-20 19:58:06,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 805 transitions. [2022-02-20 19:58:06,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 805 edges. 805 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:06,617 INFO L225 Difference]: With dead ends: 938 [2022-02-20 19:58:06,618 INFO L226 Difference]: Without dead ends: 666 [2022-02-20 19:58:06,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:58:06,625 INFO L933 BasicCegarLoop]: 631 mSDtfsCounter, 849 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 2508 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:06,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [851 Valid, 2508 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:58:06,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-02-20 19:58:06,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 635. [2022-02-20 19:58:06,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:06,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 666 states. Second operand has 635 states, 538 states have (on average 1.4758364312267658) internal successors, (794), 546 states have internal predecessors, (794), 60 states have call successors, (60), 28 states have call predecessors, (60), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) [2022-02-20 19:58:06,653 INFO L74 IsIncluded]: Start isIncluded. First operand 666 states. Second operand has 635 states, 538 states have (on average 1.4758364312267658) internal successors, (794), 546 states have internal predecessors, (794), 60 states have call successors, (60), 28 states have call predecessors, (60), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) [2022-02-20 19:58:06,654 INFO L87 Difference]: Start difference. First operand 666 states. Second operand has 635 states, 538 states have (on average 1.4758364312267658) internal successors, (794), 546 states have internal predecessors, (794), 60 states have call successors, (60), 28 states have call predecessors, (60), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) [2022-02-20 19:58:06,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:06,679 INFO L93 Difference]: Finished difference Result 666 states and 973 transitions. [2022-02-20 19:58:06,679 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 973 transitions. [2022-02-20 19:58:06,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:06,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:06,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 635 states, 538 states have (on average 1.4758364312267658) internal successors, (794), 546 states have internal predecessors, (794), 60 states have call successors, (60), 28 states have call predecessors, (60), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) Second operand 666 states. [2022-02-20 19:58:06,683 INFO L87 Difference]: Start difference. First operand has 635 states, 538 states have (on average 1.4758364312267658) internal successors, (794), 546 states have internal predecessors, (794), 60 states have call successors, (60), 28 states have call predecessors, (60), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) Second operand 666 states. [2022-02-20 19:58:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:06,700 INFO L93 Difference]: Finished difference Result 666 states and 973 transitions. [2022-02-20 19:58:06,700 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 973 transitions. [2022-02-20 19:58:06,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:06,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:06,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:06,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:06,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 538 states have (on average 1.4758364312267658) internal successors, (794), 546 states have internal predecessors, (794), 60 states have call successors, (60), 28 states have call predecessors, (60), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) [2022-02-20 19:58:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 929 transitions. [2022-02-20 19:58:06,721 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 929 transitions. Word has length 65 [2022-02-20 19:58:06,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:06,722 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 929 transitions. [2022-02-20 19:58:06,722 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:06,722 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 929 transitions. [2022-02-20 19:58:06,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:06,723 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:06,723 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:06,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:58:06,723 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:06,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:06,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1837774221, now seen corresponding path program 1 times [2022-02-20 19:58:06,724 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:06,724 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206918844] [2022-02-20 19:58:06,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:06,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {13995#(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); {13996#(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:06,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {13996#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13996#(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:06,774 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13996#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13957#(= ~q_write_ev~0 ~q_read_ev~0)} #1660#return; {13957#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:06,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {13996#(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); {13996#(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:06,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {13996#(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); {13996#(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:06,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {13996#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13996#(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:06,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13996#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13957#(= ~q_write_ev~0 ~q_read_ev~0)} #1662#return; {13957#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:06,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {13955#true} havoc ~__retres1~0; {13955#true} is VALID [2022-02-20 19:58:06,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {13955#true} assume !(1 == ~p_dw_pc~0); {13955#true} is VALID [2022-02-20 19:58:06,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {13955#true} ~__retres1~0 := 0; {13955#true} is VALID [2022-02-20 19:58:06,802 INFO L290 TraceCheckUtils]: 3: Hoare triple {13955#true} #res := ~__retres1~0; {13955#true} is VALID [2022-02-20 19:58:06,802 INFO L290 TraceCheckUtils]: 4: Hoare triple {13955#true} assume true; {13955#true} is VALID [2022-02-20 19:58:06,802 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13955#true} {13955#true} #1656#return; {13955#true} is VALID [2022-02-20 19:58:06,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {13955#true} havoc ~__retres1~1; {13955#true} is VALID [2022-02-20 19:58:06,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {13955#true} assume !(1 == ~c_dr_pc~0); {13955#true} is VALID [2022-02-20 19:58:06,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {13955#true} ~__retres1~1 := 0; {13955#true} is VALID [2022-02-20 19:58:06,804 INFO L290 TraceCheckUtils]: 3: Hoare triple {13955#true} #res := ~__retres1~1; {13955#true} is VALID [2022-02-20 19:58:06,804 INFO L290 TraceCheckUtils]: 4: Hoare triple {13955#true} assume true; {13955#true} is VALID [2022-02-20 19:58:06,804 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13955#true} {13955#true} #1658#return; {13955#true} is VALID [2022-02-20 19:58:06,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {13997#(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; {13955#true} is VALID [2022-02-20 19:58:06,805 INFO L272 TraceCheckUtils]: 1: Hoare triple {13955#true} call #t~ret8 := is_do_write_p_triggered(); {13955#true} is VALID [2022-02-20 19:58:06,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {13955#true} havoc ~__retres1~0; {13955#true} is VALID [2022-02-20 19:58:06,805 INFO L290 TraceCheckUtils]: 3: Hoare triple {13955#true} assume !(1 == ~p_dw_pc~0); {13955#true} is VALID [2022-02-20 19:58:06,805 INFO L290 TraceCheckUtils]: 4: Hoare triple {13955#true} ~__retres1~0 := 0; {13955#true} is VALID [2022-02-20 19:58:06,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {13955#true} #res := ~__retres1~0; {13955#true} is VALID [2022-02-20 19:58:06,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {13955#true} assume true; {13955#true} is VALID [2022-02-20 19:58:06,805 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13955#true} {13955#true} #1656#return; {13955#true} is VALID [2022-02-20 19:58:06,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {13955#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13955#true} is VALID [2022-02-20 19:58:06,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {13955#true} assume !(0 != ~tmp~1); {13955#true} is VALID [2022-02-20 19:58:06,805 INFO L272 TraceCheckUtils]: 10: Hoare triple {13955#true} call #t~ret9 := is_do_read_c_triggered(); {13955#true} is VALID [2022-02-20 19:58:06,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {13955#true} havoc ~__retres1~1; {13955#true} is VALID [2022-02-20 19:58:06,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {13955#true} assume !(1 == ~c_dr_pc~0); {13955#true} is VALID [2022-02-20 19:58:06,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {13955#true} ~__retres1~1 := 0; {13955#true} is VALID [2022-02-20 19:58:06,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {13955#true} #res := ~__retres1~1; {13955#true} is VALID [2022-02-20 19:58:06,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {13955#true} assume true; {13955#true} is VALID [2022-02-20 19:58:06,806 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13955#true} {13955#true} #1658#return; {13955#true} is VALID [2022-02-20 19:58:06,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {13955#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13955#true} is VALID [2022-02-20 19:58:06,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {13955#true} assume !(0 != ~tmp___0~1); {13955#true} is VALID [2022-02-20 19:58:06,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {13955#true} assume true; {13955#true} is VALID [2022-02-20 19:58:06,807 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13955#true} {13957#(= ~q_write_ev~0 ~q_read_ev~0)} #1664#return; {13957#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:06,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {13996#(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); {14010#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:06,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {14010#(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; {14011#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:06,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {14011#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {14011#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:06,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14011#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {13957#(= ~q_write_ev~0 ~q_read_ev~0)} #1666#return; {13956#false} is VALID [2022-02-20 19:58:06,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:06,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {13955#true} havoc ~__retres1~2; {13955#true} is VALID [2022-02-20 19:58:06,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {13955#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13955#true} is VALID [2022-02-20 19:58:06,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {13955#true} #res := ~__retres1~2; {13955#true} is VALID [2022-02-20 19:58:06,829 INFO L290 TraceCheckUtils]: 3: Hoare triple {13955#true} assume true; {13955#true} is VALID [2022-02-20 19:58:06,829 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13955#true} {13956#false} #1668#return; {13956#false} is VALID [2022-02-20 19:58:06,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {13955#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {13955#true} is VALID [2022-02-20 19:58:06,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {13955#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {13955#true} is VALID [2022-02-20 19:58:06,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {13955#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#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; {13957#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:06,830 INFO L290 TraceCheckUtils]: 3: Hoare triple {13957#(= ~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; {13957#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:06,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {13957#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {13995#(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:06,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {13995#(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); {13996#(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:06,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {13996#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13996#(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:06,831 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13996#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13957#(= ~q_write_ev~0 ~q_read_ev~0)} #1660#return; {13957#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:06,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {13957#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {13957#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:06,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {13957#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {13957#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:06,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {13957#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {13957#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:06,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {13957#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {13957#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:06,832 INFO L272 TraceCheckUtils]: 12: Hoare triple {13957#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {13996#(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:06,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {13996#(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); {13996#(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:06,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {13996#(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); {13996#(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:06,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {13996#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13996#(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:06,834 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13996#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13957#(= ~q_write_ev~0 ~q_read_ev~0)} #1662#return; {13957#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:06,834 INFO L272 TraceCheckUtils]: 17: Hoare triple {13957#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {13997#(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:06,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {13997#(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; {13955#true} is VALID [2022-02-20 19:58:06,834 INFO L272 TraceCheckUtils]: 19: Hoare triple {13955#true} call #t~ret8 := is_do_write_p_triggered(); {13955#true} is VALID [2022-02-20 19:58:06,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {13955#true} havoc ~__retres1~0; {13955#true} is VALID [2022-02-20 19:58:06,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {13955#true} assume !(1 == ~p_dw_pc~0); {13955#true} is VALID [2022-02-20 19:58:06,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {13955#true} ~__retres1~0 := 0; {13955#true} is VALID [2022-02-20 19:58:06,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {13955#true} #res := ~__retres1~0; {13955#true} is VALID [2022-02-20 19:58:06,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {13955#true} assume true; {13955#true} is VALID [2022-02-20 19:58:06,835 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13955#true} {13955#true} #1656#return; {13955#true} is VALID [2022-02-20 19:58:06,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {13955#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13955#true} is VALID [2022-02-20 19:58:06,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {13955#true} assume !(0 != ~tmp~1); {13955#true} is VALID [2022-02-20 19:58:06,835 INFO L272 TraceCheckUtils]: 28: Hoare triple {13955#true} call #t~ret9 := is_do_read_c_triggered(); {13955#true} is VALID [2022-02-20 19:58:06,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {13955#true} havoc ~__retres1~1; {13955#true} is VALID [2022-02-20 19:58:06,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {13955#true} assume !(1 == ~c_dr_pc~0); {13955#true} is VALID [2022-02-20 19:58:06,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {13955#true} ~__retres1~1 := 0; {13955#true} is VALID [2022-02-20 19:58:06,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {13955#true} #res := ~__retres1~1; {13955#true} is VALID [2022-02-20 19:58:06,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {13955#true} assume true; {13955#true} is VALID [2022-02-20 19:58:06,836 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13955#true} {13955#true} #1658#return; {13955#true} is VALID [2022-02-20 19:58:06,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {13955#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13955#true} is VALID [2022-02-20 19:58:06,836 INFO L290 TraceCheckUtils]: 36: Hoare triple {13955#true} assume !(0 != ~tmp___0~1); {13955#true} is VALID [2022-02-20 19:58:06,836 INFO L290 TraceCheckUtils]: 37: Hoare triple {13955#true} assume true; {13955#true} is VALID [2022-02-20 19:58:06,837 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13955#true} {13957#(= ~q_write_ev~0 ~q_read_ev~0)} #1664#return; {13957#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:06,837 INFO L272 TraceCheckUtils]: 39: Hoare triple {13957#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {13996#(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:06,837 INFO L290 TraceCheckUtils]: 40: Hoare triple {13996#(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); {14010#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:06,837 INFO L290 TraceCheckUtils]: 41: Hoare triple {14010#(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; {14011#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:06,838 INFO L290 TraceCheckUtils]: 42: Hoare triple {14011#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {14011#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:06,838 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {14011#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {13957#(= ~q_write_ev~0 ~q_read_ev~0)} #1666#return; {13956#false} is VALID [2022-02-20 19:58:06,838 INFO L290 TraceCheckUtils]: 44: Hoare triple {13956#false} assume !false; {13956#false} is VALID [2022-02-20 19:58:06,838 INFO L290 TraceCheckUtils]: 45: Hoare triple {13956#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; {13956#false} is VALID [2022-02-20 19:58:06,838 INFO L290 TraceCheckUtils]: 46: Hoare triple {13956#false} assume !false; {13956#false} is VALID [2022-02-20 19:58:06,838 INFO L272 TraceCheckUtils]: 47: Hoare triple {13956#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {13955#true} is VALID [2022-02-20 19:58:06,839 INFO L290 TraceCheckUtils]: 48: Hoare triple {13955#true} havoc ~__retres1~2; {13955#true} is VALID [2022-02-20 19:58:06,839 INFO L290 TraceCheckUtils]: 49: Hoare triple {13955#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13955#true} is VALID [2022-02-20 19:58:06,839 INFO L290 TraceCheckUtils]: 50: Hoare triple {13955#true} #res := ~__retres1~2; {13955#true} is VALID [2022-02-20 19:58:06,839 INFO L290 TraceCheckUtils]: 51: Hoare triple {13955#true} assume true; {13955#true} is VALID [2022-02-20 19:58:06,839 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13955#true} {13956#false} #1668#return; {13956#false} is VALID [2022-02-20 19:58:06,839 INFO L290 TraceCheckUtils]: 53: Hoare triple {13956#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; {13956#false} is VALID [2022-02-20 19:58:06,839 INFO L290 TraceCheckUtils]: 54: Hoare triple {13956#false} assume 0 != eval1_~tmp___1~0#1; {13956#false} is VALID [2022-02-20 19:58:06,839 INFO L290 TraceCheckUtils]: 55: Hoare triple {13956#false} assume !(0 == ~p_dw_st~0); {13956#false} is VALID [2022-02-20 19:58:06,839 INFO L290 TraceCheckUtils]: 56: Hoare triple {13956#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; {13956#false} is VALID [2022-02-20 19:58:06,839 INFO L290 TraceCheckUtils]: 57: Hoare triple {13956#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; {13956#false} is VALID [2022-02-20 19:58:06,840 INFO L290 TraceCheckUtils]: 58: Hoare triple {13956#false} assume 0 == ~c_dr_pc~0; {13956#false} is VALID [2022-02-20 19:58:06,840 INFO L290 TraceCheckUtils]: 59: Hoare triple {13956#false} assume !false; {13956#false} is VALID [2022-02-20 19:58:06,840 INFO L290 TraceCheckUtils]: 60: Hoare triple {13956#false} assume !(1 == ~q_free~0); {13956#false} is VALID [2022-02-20 19:58:06,840 INFO L290 TraceCheckUtils]: 61: Hoare triple {13956#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; {13956#false} is VALID [2022-02-20 19:58:06,840 INFO L290 TraceCheckUtils]: 62: Hoare triple {13956#false} assume !(~p_last_write~0 == ~c_last_read~0); {13956#false} is VALID [2022-02-20 19:58:06,840 INFO L272 TraceCheckUtils]: 63: Hoare triple {13956#false} call error1(); {13956#false} is VALID [2022-02-20 19:58:06,840 INFO L290 TraceCheckUtils]: 64: Hoare triple {13956#false} assume !false; {13956#false} is VALID [2022-02-20 19:58:06,841 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:06,841 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:06,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206918844] [2022-02-20 19:58:06,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206918844] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:06,841 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:06,841 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:06,842 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728774332] [2022-02-20 19:58:06,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:06,842 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:06,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:06,842 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:06,874 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:06,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:06,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:06,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:06,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:06,875 INFO L87 Difference]: Start difference. First operand 635 states and 929 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:09,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:09,706 INFO L93 Difference]: Finished difference Result 1027 states and 1440 transitions. [2022-02-20 19:58:09,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:09,706 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:09,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:09,707 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:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 984 transitions. [2022-02-20 19:58:09,713 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:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 984 transitions. [2022-02-20 19:58:09,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 984 transitions. [2022-02-20 19:58:10,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 984 edges. 984 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:10,387 INFO L225 Difference]: With dead ends: 1027 [2022-02-20 19:58:10,388 INFO L226 Difference]: Without dead ends: 742 [2022-02-20 19:58:10,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:58:10,389 INFO L933 BasicCegarLoop]: 655 mSDtfsCounter, 1572 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1600 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:10,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1600 Valid, 1901 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:58:10,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2022-02-20 19:58:10,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 647. [2022-02-20 19:58:10,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:10,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 742 states. Second operand has 647 states, 548 states have (on average 1.467153284671533) internal successors, (804), 556 states have internal predecessors, (804), 61 states have call successors, (61), 29 states have call predecessors, (61), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) [2022-02-20 19:58:10,418 INFO L74 IsIncluded]: Start isIncluded. First operand 742 states. Second operand has 647 states, 548 states have (on average 1.467153284671533) internal successors, (804), 556 states have internal predecessors, (804), 61 states have call successors, (61), 29 states have call predecessors, (61), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) [2022-02-20 19:58:10,419 INFO L87 Difference]: Start difference. First operand 742 states. Second operand has 647 states, 548 states have (on average 1.467153284671533) internal successors, (804), 556 states have internal predecessors, (804), 61 states have call successors, (61), 29 states have call predecessors, (61), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) [2022-02-20 19:58:10,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:10,439 INFO L93 Difference]: Finished difference Result 742 states and 1060 transitions. [2022-02-20 19:58:10,439 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1060 transitions. [2022-02-20 19:58:10,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:10,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:10,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 647 states, 548 states have (on average 1.467153284671533) internal successors, (804), 556 states have internal predecessors, (804), 61 states have call successors, (61), 29 states have call predecessors, (61), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) Second operand 742 states. [2022-02-20 19:58:10,443 INFO L87 Difference]: Start difference. First operand has 647 states, 548 states have (on average 1.467153284671533) internal successors, (804), 556 states have internal predecessors, (804), 61 states have call successors, (61), 29 states have call predecessors, (61), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) Second operand 742 states. [2022-02-20 19:58:10,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:10,463 INFO L93 Difference]: Finished difference Result 742 states and 1060 transitions. [2022-02-20 19:58:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1060 transitions. [2022-02-20 19:58:10,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:10,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:10,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:10,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 548 states have (on average 1.467153284671533) internal successors, (804), 556 states have internal predecessors, (804), 61 states have call successors, (61), 29 states have call predecessors, (61), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) [2022-02-20 19:58:10,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 939 transitions. [2022-02-20 19:58:10,495 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 939 transitions. Word has length 65 [2022-02-20 19:58:10,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:10,495 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 939 transitions. [2022-02-20 19:58:10,496 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:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 939 transitions. [2022-02-20 19:58:10,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:10,498 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:10,498 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:10,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:58:10,499 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:10,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:10,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1971787727, now seen corresponding path program 1 times [2022-02-20 19:58:10,499 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:10,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93807856] [2022-02-20 19:58:10,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:10,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {17778#(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); {17738#true} is VALID [2022-02-20 19:58:10,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {17738#true} assume true; {17738#true} is VALID [2022-02-20 19:58:10,548 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17738#true} {17738#true} #1660#return; {17738#true} is VALID [2022-02-20 19:58:10,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {17779#(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); {17738#true} is VALID [2022-02-20 19:58:10,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {17738#true} assume !(0 == ~q_write_ev~0); {17738#true} is VALID [2022-02-20 19:58:10,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {17738#true} assume true; {17738#true} is VALID [2022-02-20 19:58:10,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17738#true} {17743#(= ~p_dw_st~0 0)} #1662#return; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {17738#true} havoc ~__retres1~0; {17738#true} is VALID [2022-02-20 19:58:10,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {17738#true} assume !(1 == ~p_dw_pc~0); {17738#true} is VALID [2022-02-20 19:58:10,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {17738#true} ~__retres1~0 := 0; {17738#true} is VALID [2022-02-20 19:58:10,571 INFO L290 TraceCheckUtils]: 3: Hoare triple {17738#true} #res := ~__retres1~0; {17738#true} is VALID [2022-02-20 19:58:10,571 INFO L290 TraceCheckUtils]: 4: Hoare triple {17738#true} assume true; {17738#true} is VALID [2022-02-20 19:58:10,571 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {17738#true} {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1656#return; {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {17738#true} havoc ~__retres1~1; {17738#true} is VALID [2022-02-20 19:58:10,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {17738#true} assume !(1 == ~c_dr_pc~0); {17738#true} is VALID [2022-02-20 19:58:10,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {17738#true} ~__retres1~1 := 0; {17738#true} is VALID [2022-02-20 19:58:10,575 INFO L290 TraceCheckUtils]: 3: Hoare triple {17738#true} #res := ~__retres1~1; {17738#true} is VALID [2022-02-20 19:58:10,575 INFO L290 TraceCheckUtils]: 4: Hoare triple {17738#true} assume true; {17738#true} is VALID [2022-02-20 19:58:10,575 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {17738#true} {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1658#return; {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {17780#(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; {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,576 INFO L272 TraceCheckUtils]: 1: Hoare triple {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {17738#true} is VALID [2022-02-20 19:58:10,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {17738#true} havoc ~__retres1~0; {17738#true} is VALID [2022-02-20 19:58:10,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {17738#true} assume !(1 == ~p_dw_pc~0); {17738#true} is VALID [2022-02-20 19:58:10,576 INFO L290 TraceCheckUtils]: 4: Hoare triple {17738#true} ~__retres1~0 := 0; {17738#true} is VALID [2022-02-20 19:58:10,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {17738#true} #res := ~__retres1~0; {17738#true} is VALID [2022-02-20 19:58:10,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {17738#true} assume true; {17738#true} is VALID [2022-02-20 19:58:10,576 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17738#true} {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1656#return; {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,577 INFO L272 TraceCheckUtils]: 10: Hoare triple {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {17738#true} is VALID [2022-02-20 19:58:10,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {17738#true} havoc ~__retres1~1; {17738#true} is VALID [2022-02-20 19:58:10,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {17738#true} assume !(1 == ~c_dr_pc~0); {17738#true} is VALID [2022-02-20 19:58:10,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {17738#true} ~__retres1~1 := 0; {17738#true} is VALID [2022-02-20 19:58:10,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {17738#true} #res := ~__retres1~1; {17738#true} is VALID [2022-02-20 19:58:10,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {17738#true} assume true; {17738#true} is VALID [2022-02-20 19:58:10,578 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17738#true} {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1658#return; {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,579 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {17743#(= ~p_dw_st~0 0)} #1664#return; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {17779#(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); {17738#true} is VALID [2022-02-20 19:58:10,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {17738#true} assume !(1 == ~q_write_ev~0); {17738#true} is VALID [2022-02-20 19:58:10,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {17738#true} assume true; {17738#true} is VALID [2022-02-20 19:58:10,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17738#true} {17743#(= ~p_dw_st~0 0)} #1666#return; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {17738#true} havoc ~__retres1~2; {17738#true} is VALID [2022-02-20 19:58:10,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {17738#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {17743#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,588 INFO L290 TraceCheckUtils]: 3: Hoare triple {17743#(= ~p_dw_st~0 0)} assume true; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,588 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17743#(= ~p_dw_st~0 0)} {17743#(= ~p_dw_st~0 0)} #1668#return; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {17738#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {17738#true} is VALID [2022-02-20 19:58:10,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {17738#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {17738#true} is VALID [2022-02-20 19:58:10,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {17738#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#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; {17738#true} is VALID [2022-02-20 19:58:10,589 INFO L290 TraceCheckUtils]: 3: Hoare triple {17738#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; {17738#true} is VALID [2022-02-20 19:58:10,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {17738#true} call update_channels1(); {17778#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:10,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {17778#(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); {17738#true} is VALID [2022-02-20 19:58:10,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {17738#true} assume true; {17738#true} is VALID [2022-02-20 19:58:10,589 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17738#true} {17738#true} #1660#return; {17738#true} is VALID [2022-02-20 19:58:10,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {17738#true} assume { :begin_inline_init_threads1 } true; {17738#true} is VALID [2022-02-20 19:58:10,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {17738#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {17743#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {17743#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,591 INFO L272 TraceCheckUtils]: 12: Hoare triple {17743#(= ~p_dw_st~0 0)} call fire_delta_events1(); {17779#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:10,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {17779#(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); {17738#true} is VALID [2022-02-20 19:58:10,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {17738#true} assume !(0 == ~q_write_ev~0); {17738#true} is VALID [2022-02-20 19:58:10,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {17738#true} assume true; {17738#true} is VALID [2022-02-20 19:58:10,591 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17738#true} {17743#(= ~p_dw_st~0 0)} #1662#return; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,592 INFO L272 TraceCheckUtils]: 17: Hoare triple {17743#(= ~p_dw_st~0 0)} call activate_threads1(); {17780#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:10,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {17780#(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; {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,592 INFO L272 TraceCheckUtils]: 19: Hoare triple {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {17738#true} is VALID [2022-02-20 19:58:10,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {17738#true} havoc ~__retres1~0; {17738#true} is VALID [2022-02-20 19:58:10,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {17738#true} assume !(1 == ~p_dw_pc~0); {17738#true} is VALID [2022-02-20 19:58:10,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {17738#true} ~__retres1~0 := 0; {17738#true} is VALID [2022-02-20 19:58:10,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {17738#true} #res := ~__retres1~0; {17738#true} is VALID [2022-02-20 19:58:10,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {17738#true} assume true; {17738#true} is VALID [2022-02-20 19:58:10,593 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {17738#true} {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1656#return; {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,594 INFO L272 TraceCheckUtils]: 28: Hoare triple {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {17738#true} is VALID [2022-02-20 19:58:10,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {17738#true} havoc ~__retres1~1; {17738#true} is VALID [2022-02-20 19:58:10,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {17738#true} assume !(1 == ~c_dr_pc~0); {17738#true} is VALID [2022-02-20 19:58:10,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {17738#true} ~__retres1~1 := 0; {17738#true} is VALID [2022-02-20 19:58:10,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {17738#true} #res := ~__retres1~1; {17738#true} is VALID [2022-02-20 19:58:10,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {17738#true} assume true; {17738#true} is VALID [2022-02-20 19:58:10,595 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17738#true} {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1658#return; {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,595 INFO L290 TraceCheckUtils]: 36: Hoare triple {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,595 INFO L290 TraceCheckUtils]: 37: Hoare triple {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:10,596 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {17781#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {17743#(= ~p_dw_st~0 0)} #1664#return; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,596 INFO L272 TraceCheckUtils]: 39: Hoare triple {17743#(= ~p_dw_st~0 0)} call reset_delta_events1(); {17779#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:10,596 INFO L290 TraceCheckUtils]: 40: Hoare triple {17779#(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); {17738#true} is VALID [2022-02-20 19:58:10,596 INFO L290 TraceCheckUtils]: 41: Hoare triple {17738#true} assume !(1 == ~q_write_ev~0); {17738#true} is VALID [2022-02-20 19:58:10,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {17738#true} assume true; {17738#true} is VALID [2022-02-20 19:58:10,597 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {17738#true} {17743#(= ~p_dw_st~0 0)} #1666#return; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,597 INFO L290 TraceCheckUtils]: 44: Hoare triple {17743#(= ~p_dw_st~0 0)} assume !false; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,597 INFO L290 TraceCheckUtils]: 45: Hoare triple {17743#(= ~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; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,598 INFO L290 TraceCheckUtils]: 46: Hoare triple {17743#(= ~p_dw_st~0 0)} assume !false; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,598 INFO L272 TraceCheckUtils]: 47: Hoare triple {17743#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {17738#true} is VALID [2022-02-20 19:58:10,598 INFO L290 TraceCheckUtils]: 48: Hoare triple {17738#true} havoc ~__retres1~2; {17738#true} is VALID [2022-02-20 19:58:10,598 INFO L290 TraceCheckUtils]: 49: Hoare triple {17738#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,598 INFO L290 TraceCheckUtils]: 50: Hoare triple {17743#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,599 INFO L290 TraceCheckUtils]: 51: Hoare triple {17743#(= ~p_dw_st~0 0)} assume true; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,599 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17743#(= ~p_dw_st~0 0)} {17743#(= ~p_dw_st~0 0)} #1668#return; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,599 INFO L290 TraceCheckUtils]: 53: Hoare triple {17743#(= ~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; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,600 INFO L290 TraceCheckUtils]: 54: Hoare triple {17743#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {17743#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:10,600 INFO L290 TraceCheckUtils]: 55: Hoare triple {17743#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {17739#false} is VALID [2022-02-20 19:58:10,600 INFO L290 TraceCheckUtils]: 56: Hoare triple {17739#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; {17739#false} is VALID [2022-02-20 19:58:10,600 INFO L290 TraceCheckUtils]: 57: Hoare triple {17739#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; {17739#false} is VALID [2022-02-20 19:58:10,600 INFO L290 TraceCheckUtils]: 58: Hoare triple {17739#false} assume 0 == ~c_dr_pc~0; {17739#false} is VALID [2022-02-20 19:58:10,600 INFO L290 TraceCheckUtils]: 59: Hoare triple {17739#false} assume !false; {17739#false} is VALID [2022-02-20 19:58:10,600 INFO L290 TraceCheckUtils]: 60: Hoare triple {17739#false} assume !(1 == ~q_free~0); {17739#false} is VALID [2022-02-20 19:58:10,600 INFO L290 TraceCheckUtils]: 61: Hoare triple {17739#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; {17739#false} is VALID [2022-02-20 19:58:10,601 INFO L290 TraceCheckUtils]: 62: Hoare triple {17739#false} assume !(~p_last_write~0 == ~c_last_read~0); {17739#false} is VALID [2022-02-20 19:58:10,601 INFO L272 TraceCheckUtils]: 63: Hoare triple {17739#false} call error1(); {17739#false} is VALID [2022-02-20 19:58:10,601 INFO L290 TraceCheckUtils]: 64: Hoare triple {17739#false} assume !false; {17739#false} is VALID [2022-02-20 19:58:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:10,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:10,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93807856] [2022-02-20 19:58:10,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93807856] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:10,601 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:10,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:10,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790098138] [2022-02-20 19:58:10,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:10,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:10,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:10,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:10,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:10,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:10,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:10,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:10,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:10,636 INFO L87 Difference]: Start difference. First operand 647 states and 939 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:12,292 INFO L93 Difference]: Finished difference Result 1289 states and 1786 transitions. [2022-02-20 19:58:12,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:12,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:12,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 927 transitions. [2022-02-20 19:58:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 927 transitions. [2022-02-20 19:58:12,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 927 transitions. [2022-02-20 19:58:12,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 927 edges. 927 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:12,929 INFO L225 Difference]: With dead ends: 1289 [2022-02-20 19:58:12,930 INFO L226 Difference]: Without dead ends: 993 [2022-02-20 19:58:12,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:58:12,931 INFO L933 BasicCegarLoop]: 613 mSDtfsCounter, 1557 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:12,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1588 Valid, 1527 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:58:12,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2022-02-20 19:58:12,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 937. [2022-02-20 19:58:12,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:12,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 993 states. Second operand has 937 states, 772 states have (on average 1.4132124352331605) internal successors, (1091), 787 states have internal predecessors, (1091), 96 states have call successors, (96), 51 states have call predecessors, (96), 67 states have return successors, (131), 105 states have call predecessors, (131), 94 states have call successors, (131) [2022-02-20 19:58:12,973 INFO L74 IsIncluded]: Start isIncluded. First operand 993 states. Second operand has 937 states, 772 states have (on average 1.4132124352331605) internal successors, (1091), 787 states have internal predecessors, (1091), 96 states have call successors, (96), 51 states have call predecessors, (96), 67 states have return successors, (131), 105 states have call predecessors, (131), 94 states have call successors, (131) [2022-02-20 19:58:12,975 INFO L87 Difference]: Start difference. First operand 993 states. Second operand has 937 states, 772 states have (on average 1.4132124352331605) internal successors, (1091), 787 states have internal predecessors, (1091), 96 states have call successors, (96), 51 states have call predecessors, (96), 67 states have return successors, (131), 105 states have call predecessors, (131), 94 states have call successors, (131) [2022-02-20 19:58:13,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:13,015 INFO L93 Difference]: Finished difference Result 993 states and 1392 transitions. [2022-02-20 19:58:13,015 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1392 transitions. [2022-02-20 19:58:13,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:13,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:13,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 937 states, 772 states have (on average 1.4132124352331605) internal successors, (1091), 787 states have internal predecessors, (1091), 96 states have call successors, (96), 51 states have call predecessors, (96), 67 states have return successors, (131), 105 states have call predecessors, (131), 94 states have call successors, (131) Second operand 993 states. [2022-02-20 19:58:13,027 INFO L87 Difference]: Start difference. First operand has 937 states, 772 states have (on average 1.4132124352331605) internal successors, (1091), 787 states have internal predecessors, (1091), 96 states have call successors, (96), 51 states have call predecessors, (96), 67 states have return successors, (131), 105 states have call predecessors, (131), 94 states have call successors, (131) Second operand 993 states. [2022-02-20 19:58:13,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:13,067 INFO L93 Difference]: Finished difference Result 993 states and 1392 transitions. [2022-02-20 19:58:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1392 transitions. [2022-02-20 19:58:13,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:13,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:13,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:13,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 772 states have (on average 1.4132124352331605) internal successors, (1091), 787 states have internal predecessors, (1091), 96 states have call successors, (96), 51 states have call predecessors, (96), 67 states have return successors, (131), 105 states have call predecessors, (131), 94 states have call successors, (131) [2022-02-20 19:58:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1318 transitions. [2022-02-20 19:58:13,110 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1318 transitions. Word has length 65 [2022-02-20 19:58:13,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:13,110 INFO L470 AbstractCegarLoop]: Abstraction has 937 states and 1318 transitions. [2022-02-20 19:58:13,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1318 transitions. [2022-02-20 19:58:13,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:58:13,112 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:13,112 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:13,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:58:13,112 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:13,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:13,113 INFO L85 PathProgramCache]: Analyzing trace with hash -313198551, now seen corresponding path program 1 times [2022-02-20 19:58:13,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:13,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181519975] [2022-02-20 19:58:13,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:13,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {22807#(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); {22767#true} is VALID [2022-02-20 19:58:13,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {22767#true} assume true; {22767#true} is VALID [2022-02-20 19:58:13,142 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22767#true} {22769#(= ~q_free~0 1)} #1660#return; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {22808#(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); {22767#true} is VALID [2022-02-20 19:58:13,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {22767#true} assume !(0 == ~q_write_ev~0); {22767#true} is VALID [2022-02-20 19:58:13,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {22767#true} assume true; {22767#true} is VALID [2022-02-20 19:58:13,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22767#true} {22769#(= ~q_free~0 1)} #1662#return; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {22767#true} havoc ~__retres1~0; {22767#true} is VALID [2022-02-20 19:58:13,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {22767#true} assume !(1 == ~p_dw_pc~0); {22767#true} is VALID [2022-02-20 19:58:13,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {22767#true} ~__retres1~0 := 0; {22767#true} is VALID [2022-02-20 19:58:13,160 INFO L290 TraceCheckUtils]: 3: Hoare triple {22767#true} #res := ~__retres1~0; {22767#true} is VALID [2022-02-20 19:58:13,160 INFO L290 TraceCheckUtils]: 4: Hoare triple {22767#true} assume true; {22767#true} is VALID [2022-02-20 19:58:13,160 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22767#true} {22767#true} #1656#return; {22767#true} is VALID [2022-02-20 19:58:13,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {22767#true} havoc ~__retres1~1; {22767#true} is VALID [2022-02-20 19:58:13,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {22767#true} assume !(1 == ~c_dr_pc~0); {22767#true} is VALID [2022-02-20 19:58:13,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {22767#true} ~__retres1~1 := 0; {22767#true} is VALID [2022-02-20 19:58:13,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {22767#true} #res := ~__retres1~1; {22767#true} is VALID [2022-02-20 19:58:13,163 INFO L290 TraceCheckUtils]: 4: Hoare triple {22767#true} assume true; {22767#true} is VALID [2022-02-20 19:58:13,163 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22767#true} {22767#true} #1658#return; {22767#true} is VALID [2022-02-20 19:58:13,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {22809#(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; {22767#true} is VALID [2022-02-20 19:58:13,163 INFO L272 TraceCheckUtils]: 1: Hoare triple {22767#true} call #t~ret8 := is_do_write_p_triggered(); {22767#true} is VALID [2022-02-20 19:58:13,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {22767#true} havoc ~__retres1~0; {22767#true} is VALID [2022-02-20 19:58:13,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {22767#true} assume !(1 == ~p_dw_pc~0); {22767#true} is VALID [2022-02-20 19:58:13,164 INFO L290 TraceCheckUtils]: 4: Hoare triple {22767#true} ~__retres1~0 := 0; {22767#true} is VALID [2022-02-20 19:58:13,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {22767#true} #res := ~__retres1~0; {22767#true} is VALID [2022-02-20 19:58:13,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {22767#true} assume true; {22767#true} is VALID [2022-02-20 19:58:13,164 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22767#true} {22767#true} #1656#return; {22767#true} is VALID [2022-02-20 19:58:13,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {22767#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22767#true} is VALID [2022-02-20 19:58:13,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {22767#true} assume !(0 != ~tmp~1); {22767#true} is VALID [2022-02-20 19:58:13,164 INFO L272 TraceCheckUtils]: 10: Hoare triple {22767#true} call #t~ret9 := is_do_read_c_triggered(); {22767#true} is VALID [2022-02-20 19:58:13,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {22767#true} havoc ~__retres1~1; {22767#true} is VALID [2022-02-20 19:58:13,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {22767#true} assume !(1 == ~c_dr_pc~0); {22767#true} is VALID [2022-02-20 19:58:13,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {22767#true} ~__retres1~1 := 0; {22767#true} is VALID [2022-02-20 19:58:13,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {22767#true} #res := ~__retres1~1; {22767#true} is VALID [2022-02-20 19:58:13,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {22767#true} assume true; {22767#true} is VALID [2022-02-20 19:58:13,165 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22767#true} {22767#true} #1658#return; {22767#true} is VALID [2022-02-20 19:58:13,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {22767#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22767#true} is VALID [2022-02-20 19:58:13,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {22767#true} assume !(0 != ~tmp___0~1); {22767#true} is VALID [2022-02-20 19:58:13,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {22767#true} assume true; {22767#true} is VALID [2022-02-20 19:58:13,175 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {22767#true} {22769#(= ~q_free~0 1)} #1664#return; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {22808#(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); {22767#true} is VALID [2022-02-20 19:58:13,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {22767#true} assume !(1 == ~q_write_ev~0); {22767#true} is VALID [2022-02-20 19:58:13,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {22767#true} assume true; {22767#true} is VALID [2022-02-20 19:58:13,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22767#true} {22769#(= ~q_free~0 1)} #1666#return; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:13,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {22767#true} havoc ~__retres1~2; {22767#true} is VALID [2022-02-20 19:58:13,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {22767#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22767#true} is VALID [2022-02-20 19:58:13,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {22767#true} #res := ~__retres1~2; {22767#true} is VALID [2022-02-20 19:58:13,181 INFO L290 TraceCheckUtils]: 3: Hoare triple {22767#true} assume true; {22767#true} is VALID [2022-02-20 19:58:13,181 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22767#true} {22769#(= ~q_free~0 1)} #1668#return; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {22767#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {22767#true} is VALID [2022-02-20 19:58:13,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {22767#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {22767#true} is VALID [2022-02-20 19:58:13,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {22767#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#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; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {22769#(= ~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; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {22769#(= ~q_free~0 1)} call update_channels1(); {22807#(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:13,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {22807#(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); {22767#true} is VALID [2022-02-20 19:58:13,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {22767#true} assume true; {22767#true} is VALID [2022-02-20 19:58:13,183 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22767#true} {22769#(= ~q_free~0 1)} #1660#return; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {22769#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {22769#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {22769#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {22769#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,185 INFO L272 TraceCheckUtils]: 12: Hoare triple {22769#(= ~q_free~0 1)} call fire_delta_events1(); {22808#(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:13,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {22808#(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); {22767#true} is VALID [2022-02-20 19:58:13,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {22767#true} assume !(0 == ~q_write_ev~0); {22767#true} is VALID [2022-02-20 19:58:13,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {22767#true} assume true; {22767#true} is VALID [2022-02-20 19:58:13,186 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22767#true} {22769#(= ~q_free~0 1)} #1662#return; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,186 INFO L272 TraceCheckUtils]: 17: Hoare triple {22769#(= ~q_free~0 1)} call activate_threads1(); {22809#(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:13,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {22809#(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; {22767#true} is VALID [2022-02-20 19:58:13,186 INFO L272 TraceCheckUtils]: 19: Hoare triple {22767#true} call #t~ret8 := is_do_write_p_triggered(); {22767#true} is VALID [2022-02-20 19:58:13,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {22767#true} havoc ~__retres1~0; {22767#true} is VALID [2022-02-20 19:58:13,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {22767#true} assume !(1 == ~p_dw_pc~0); {22767#true} is VALID [2022-02-20 19:58:13,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {22767#true} ~__retres1~0 := 0; {22767#true} is VALID [2022-02-20 19:58:13,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {22767#true} #res := ~__retres1~0; {22767#true} is VALID [2022-02-20 19:58:13,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {22767#true} assume true; {22767#true} is VALID [2022-02-20 19:58:13,187 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22767#true} {22767#true} #1656#return; {22767#true} is VALID [2022-02-20 19:58:13,187 INFO L290 TraceCheckUtils]: 26: Hoare triple {22767#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22767#true} is VALID [2022-02-20 19:58:13,187 INFO L290 TraceCheckUtils]: 27: Hoare triple {22767#true} assume !(0 != ~tmp~1); {22767#true} is VALID [2022-02-20 19:58:13,187 INFO L272 TraceCheckUtils]: 28: Hoare triple {22767#true} call #t~ret9 := is_do_read_c_triggered(); {22767#true} is VALID [2022-02-20 19:58:13,188 INFO L290 TraceCheckUtils]: 29: Hoare triple {22767#true} havoc ~__retres1~1; {22767#true} is VALID [2022-02-20 19:58:13,188 INFO L290 TraceCheckUtils]: 30: Hoare triple {22767#true} assume !(1 == ~c_dr_pc~0); {22767#true} is VALID [2022-02-20 19:58:13,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {22767#true} ~__retres1~1 := 0; {22767#true} is VALID [2022-02-20 19:58:13,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {22767#true} #res := ~__retres1~1; {22767#true} is VALID [2022-02-20 19:58:13,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {22767#true} assume true; {22767#true} is VALID [2022-02-20 19:58:13,189 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {22767#true} {22767#true} #1658#return; {22767#true} is VALID [2022-02-20 19:58:13,189 INFO L290 TraceCheckUtils]: 35: Hoare triple {22767#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22767#true} is VALID [2022-02-20 19:58:13,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {22767#true} assume !(0 != ~tmp___0~1); {22767#true} is VALID [2022-02-20 19:58:13,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {22767#true} assume true; {22767#true} is VALID [2022-02-20 19:58:13,189 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22767#true} {22769#(= ~q_free~0 1)} #1664#return; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,190 INFO L272 TraceCheckUtils]: 39: Hoare triple {22769#(= ~q_free~0 1)} call reset_delta_events1(); {22808#(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:13,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {22808#(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); {22767#true} is VALID [2022-02-20 19:58:13,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {22767#true} assume !(1 == ~q_write_ev~0); {22767#true} is VALID [2022-02-20 19:58:13,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {22767#true} assume true; {22767#true} is VALID [2022-02-20 19:58:13,190 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {22767#true} {22769#(= ~q_free~0 1)} #1666#return; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {22769#(= ~q_free~0 1)} assume !false; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {22769#(= ~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; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,191 INFO L290 TraceCheckUtils]: 46: Hoare triple {22769#(= ~q_free~0 1)} assume !false; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,191 INFO L272 TraceCheckUtils]: 47: Hoare triple {22769#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {22767#true} is VALID [2022-02-20 19:58:13,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {22767#true} havoc ~__retres1~2; {22767#true} is VALID [2022-02-20 19:58:13,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {22767#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22767#true} is VALID [2022-02-20 19:58:13,191 INFO L290 TraceCheckUtils]: 50: Hoare triple {22767#true} #res := ~__retres1~2; {22767#true} is VALID [2022-02-20 19:58:13,192 INFO L290 TraceCheckUtils]: 51: Hoare triple {22767#true} assume true; {22767#true} is VALID [2022-02-20 19:58:13,192 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {22767#true} {22769#(= ~q_free~0 1)} #1668#return; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,192 INFO L290 TraceCheckUtils]: 53: Hoare triple {22769#(= ~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; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,192 INFO L290 TraceCheckUtils]: 54: Hoare triple {22769#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,193 INFO L290 TraceCheckUtils]: 55: Hoare triple {22769#(= ~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; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,193 INFO L290 TraceCheckUtils]: 56: Hoare triple {22769#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,193 INFO L290 TraceCheckUtils]: 57: Hoare triple {22769#(= ~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; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,194 INFO L290 TraceCheckUtils]: 58: Hoare triple {22769#(= ~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; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,194 INFO L290 TraceCheckUtils]: 59: Hoare triple {22769#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,194 INFO L290 TraceCheckUtils]: 60: Hoare triple {22769#(= ~q_free~0 1)} assume !false; {22769#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:13,194 INFO L290 TraceCheckUtils]: 61: Hoare triple {22769#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {22768#false} is VALID [2022-02-20 19:58:13,194 INFO L290 TraceCheckUtils]: 62: Hoare triple {22768#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; {22768#false} is VALID [2022-02-20 19:58:13,195 INFO L290 TraceCheckUtils]: 63: Hoare triple {22768#false} assume !(~p_last_write~0 == ~c_last_read~0); {22768#false} is VALID [2022-02-20 19:58:13,195 INFO L272 TraceCheckUtils]: 64: Hoare triple {22768#false} call error1(); {22768#false} is VALID [2022-02-20 19:58:13,195 INFO L290 TraceCheckUtils]: 65: Hoare triple {22768#false} assume !false; {22768#false} is VALID [2022-02-20 19:58:13,195 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:13,195 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:13,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181519975] [2022-02-20 19:58:13,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181519975] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:13,195 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:13,196 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:13,196 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153799960] [2022-02-20 19:58:13,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:13,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:13,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:13,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:13,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:13,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:13,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:13,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:13,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:13,235 INFO L87 Difference]: Start difference. First operand 937 states and 1318 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:15,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:15,000 INFO L93 Difference]: Finished difference Result 2140 states and 2889 transitions. [2022-02-20 19:58:15,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:15,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:15,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:15,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:15,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 925 transitions. [2022-02-20 19:58:15,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 925 transitions. [2022-02-20 19:58:15,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 925 transitions. [2022-02-20 19:58:15,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 925 edges. 925 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:15,689 INFO L225 Difference]: With dead ends: 2140 [2022-02-20 19:58:15,689 INFO L226 Difference]: Without dead ends: 1533 [2022-02-20 19:58:15,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:58:15,691 INFO L933 BasicCegarLoop]: 634 mSDtfsCounter, 750 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:15,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [758 Valid, 1787 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:58:15,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2022-02-20 19:58:15,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1418. [2022-02-20 19:58:15,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:15,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1533 states. Second operand has 1418 states, 1151 states have (on average 1.3657688966116421) internal successors, (1572), 1169 states have internal predecessors, (1572), 141 states have call successors, (141), 95 states have call predecessors, (141), 124 states have return successors, (203), 160 states have call predecessors, (203), 139 states have call successors, (203) [2022-02-20 19:58:15,759 INFO L74 IsIncluded]: Start isIncluded. First operand 1533 states. Second operand has 1418 states, 1151 states have (on average 1.3657688966116421) internal successors, (1572), 1169 states have internal predecessors, (1572), 141 states have call successors, (141), 95 states have call predecessors, (141), 124 states have return successors, (203), 160 states have call predecessors, (203), 139 states have call successors, (203) [2022-02-20 19:58:15,761 INFO L87 Difference]: Start difference. First operand 1533 states. Second operand has 1418 states, 1151 states have (on average 1.3657688966116421) internal successors, (1572), 1169 states have internal predecessors, (1572), 141 states have call successors, (141), 95 states have call predecessors, (141), 124 states have return successors, (203), 160 states have call predecessors, (203), 139 states have call successors, (203) [2022-02-20 19:58:15,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:15,834 INFO L93 Difference]: Finished difference Result 1533 states and 2051 transitions. [2022-02-20 19:58:15,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2051 transitions. [2022-02-20 19:58:15,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:15,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:15,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 1418 states, 1151 states have (on average 1.3657688966116421) internal successors, (1572), 1169 states have internal predecessors, (1572), 141 states have call successors, (141), 95 states have call predecessors, (141), 124 states have return successors, (203), 160 states have call predecessors, (203), 139 states have call successors, (203) Second operand 1533 states. [2022-02-20 19:58:15,841 INFO L87 Difference]: Start difference. First operand has 1418 states, 1151 states have (on average 1.3657688966116421) internal successors, (1572), 1169 states have internal predecessors, (1572), 141 states have call successors, (141), 95 states have call predecessors, (141), 124 states have return successors, (203), 160 states have call predecessors, (203), 139 states have call successors, (203) Second operand 1533 states. [2022-02-20 19:58:15,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:15,903 INFO L93 Difference]: Finished difference Result 1533 states and 2051 transitions. [2022-02-20 19:58:15,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2051 transitions. [2022-02-20 19:58:15,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:15,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:15,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:15,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1151 states have (on average 1.3657688966116421) internal successors, (1572), 1169 states have internal predecessors, (1572), 141 states have call successors, (141), 95 states have call predecessors, (141), 124 states have return successors, (203), 160 states have call predecessors, (203), 139 states have call successors, (203) [2022-02-20 19:58:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1916 transitions. [2022-02-20 19:58:15,992 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 1916 transitions. Word has length 66 [2022-02-20 19:58:15,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:15,993 INFO L470 AbstractCegarLoop]: Abstraction has 1418 states and 1916 transitions. [2022-02-20 19:58:15,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:15,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1916 transitions. [2022-02-20 19:58:15,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:58:15,996 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:15,996 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:15,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:58:15,997 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:15,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:15,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1145041108, now seen corresponding path program 1 times [2022-02-20 19:58:15,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:15,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721800971] [2022-02-20 19:58:15,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:15,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:16,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:16,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {30677#(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); {30637#true} is VALID [2022-02-20 19:58:16,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {30637#true} assume true; {30637#true} is VALID [2022-02-20 19:58:16,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30637#true} {30639#(= ~c_dr_pc~0 0)} #1660#return; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:16,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {30678#(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); {30637#true} is VALID [2022-02-20 19:58:16,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {30637#true} assume !(0 == ~q_write_ev~0); {30637#true} is VALID [2022-02-20 19:58:16,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {30637#true} assume true; {30637#true} is VALID [2022-02-20 19:58:16,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30637#true} {30639#(= ~c_dr_pc~0 0)} #1662#return; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:16,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:16,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {30637#true} havoc ~__retres1~0; {30637#true} is VALID [2022-02-20 19:58:16,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {30637#true} assume !(1 == ~p_dw_pc~0); {30637#true} is VALID [2022-02-20 19:58:16,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {30637#true} ~__retres1~0 := 0; {30637#true} is VALID [2022-02-20 19:58:16,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {30637#true} #res := ~__retres1~0; {30637#true} is VALID [2022-02-20 19:58:16,056 INFO L290 TraceCheckUtils]: 4: Hoare triple {30637#true} assume true; {30637#true} is VALID [2022-02-20 19:58:16,057 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {30637#true} {30637#true} #1656#return; {30637#true} is VALID [2022-02-20 19:58:16,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:16,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {30637#true} havoc ~__retres1~1; {30637#true} is VALID [2022-02-20 19:58:16,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {30637#true} assume !(1 == ~c_dr_pc~0); {30637#true} is VALID [2022-02-20 19:58:16,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {30637#true} ~__retres1~1 := 0; {30637#true} is VALID [2022-02-20 19:58:16,072 INFO L290 TraceCheckUtils]: 3: Hoare triple {30637#true} #res := ~__retres1~1; {30637#true} is VALID [2022-02-20 19:58:16,072 INFO L290 TraceCheckUtils]: 4: Hoare triple {30637#true} assume true; {30637#true} is VALID [2022-02-20 19:58:16,072 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {30637#true} {30637#true} #1658#return; {30637#true} is VALID [2022-02-20 19:58:16,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {30679#(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; {30637#true} is VALID [2022-02-20 19:58:16,073 INFO L272 TraceCheckUtils]: 1: Hoare triple {30637#true} call #t~ret8 := is_do_write_p_triggered(); {30637#true} is VALID [2022-02-20 19:58:16,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {30637#true} havoc ~__retres1~0; {30637#true} is VALID [2022-02-20 19:58:16,073 INFO L290 TraceCheckUtils]: 3: Hoare triple {30637#true} assume !(1 == ~p_dw_pc~0); {30637#true} is VALID [2022-02-20 19:58:16,073 INFO L290 TraceCheckUtils]: 4: Hoare triple {30637#true} ~__retres1~0 := 0; {30637#true} is VALID [2022-02-20 19:58:16,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {30637#true} #res := ~__retres1~0; {30637#true} is VALID [2022-02-20 19:58:16,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {30637#true} assume true; {30637#true} is VALID [2022-02-20 19:58:16,073 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30637#true} {30637#true} #1656#return; {30637#true} is VALID [2022-02-20 19:58:16,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {30637#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30637#true} is VALID [2022-02-20 19:58:16,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {30637#true} assume !(0 != ~tmp~1); {30637#true} is VALID [2022-02-20 19:58:16,074 INFO L272 TraceCheckUtils]: 10: Hoare triple {30637#true} call #t~ret9 := is_do_read_c_triggered(); {30637#true} is VALID [2022-02-20 19:58:16,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {30637#true} havoc ~__retres1~1; {30637#true} is VALID [2022-02-20 19:58:16,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {30637#true} assume !(1 == ~c_dr_pc~0); {30637#true} is VALID [2022-02-20 19:58:16,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {30637#true} ~__retres1~1 := 0; {30637#true} is VALID [2022-02-20 19:58:16,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {30637#true} #res := ~__retres1~1; {30637#true} is VALID [2022-02-20 19:58:16,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {30637#true} assume true; {30637#true} is VALID [2022-02-20 19:58:16,074 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30637#true} {30637#true} #1658#return; {30637#true} is VALID [2022-02-20 19:58:16,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {30637#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30637#true} is VALID [2022-02-20 19:58:16,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {30637#true} assume !(0 != ~tmp___0~1); {30637#true} is VALID [2022-02-20 19:58:16,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {30637#true} assume true; {30637#true} is VALID [2022-02-20 19:58:16,075 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {30637#true} {30639#(= ~c_dr_pc~0 0)} #1664#return; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:16,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {30678#(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); {30637#true} is VALID [2022-02-20 19:58:16,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {30637#true} assume !(1 == ~q_write_ev~0); {30637#true} is VALID [2022-02-20 19:58:16,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {30637#true} assume true; {30637#true} is VALID [2022-02-20 19:58:16,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30637#true} {30639#(= ~c_dr_pc~0 0)} #1666#return; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:16,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {30637#true} havoc ~__retres1~2; {30637#true} is VALID [2022-02-20 19:58:16,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {30637#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30637#true} is VALID [2022-02-20 19:58:16,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {30637#true} #res := ~__retres1~2; {30637#true} is VALID [2022-02-20 19:58:16,083 INFO L290 TraceCheckUtils]: 3: Hoare triple {30637#true} assume true; {30637#true} is VALID [2022-02-20 19:58:16,083 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {30637#true} {30639#(= ~c_dr_pc~0 0)} #1668#return; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {30637#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {30637#true} is VALID [2022-02-20 19:58:16,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {30637#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {30637#true} is VALID [2022-02-20 19:58:16,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {30637#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#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; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {30639#(= ~c_dr_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; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {30639#(= ~c_dr_pc~0 0)} call update_channels1(); {30677#(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:16,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {30677#(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); {30637#true} is VALID [2022-02-20 19:58:16,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {30637#true} assume true; {30637#true} is VALID [2022-02-20 19:58:16,085 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30637#true} {30639#(= ~c_dr_pc~0 0)} #1660#return; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {30639#(= ~c_dr_pc~0 0)} assume { :begin_inline_init_threads1 } true; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {30639#(= ~c_dr_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {30639#(= ~c_dr_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {30639#(= ~c_dr_pc~0 0)} assume { :end_inline_init_threads1 } true; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,086 INFO L272 TraceCheckUtils]: 12: Hoare triple {30639#(= ~c_dr_pc~0 0)} call fire_delta_events1(); {30678#(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:16,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {30678#(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); {30637#true} is VALID [2022-02-20 19:58:16,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {30637#true} assume !(0 == ~q_write_ev~0); {30637#true} is VALID [2022-02-20 19:58:16,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {30637#true} assume true; {30637#true} is VALID [2022-02-20 19:58:16,087 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30637#true} {30639#(= ~c_dr_pc~0 0)} #1662#return; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,087 INFO L272 TraceCheckUtils]: 17: Hoare triple {30639#(= ~c_dr_pc~0 0)} call activate_threads1(); {30679#(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:16,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {30679#(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; {30637#true} is VALID [2022-02-20 19:58:16,087 INFO L272 TraceCheckUtils]: 19: Hoare triple {30637#true} call #t~ret8 := is_do_write_p_triggered(); {30637#true} is VALID [2022-02-20 19:58:16,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {30637#true} havoc ~__retres1~0; {30637#true} is VALID [2022-02-20 19:58:16,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {30637#true} assume !(1 == ~p_dw_pc~0); {30637#true} is VALID [2022-02-20 19:58:16,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {30637#true} ~__retres1~0 := 0; {30637#true} is VALID [2022-02-20 19:58:16,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {30637#true} #res := ~__retres1~0; {30637#true} is VALID [2022-02-20 19:58:16,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {30637#true} assume true; {30637#true} is VALID [2022-02-20 19:58:16,088 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {30637#true} {30637#true} #1656#return; {30637#true} is VALID [2022-02-20 19:58:16,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {30637#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30637#true} is VALID [2022-02-20 19:58:16,088 INFO L290 TraceCheckUtils]: 27: Hoare triple {30637#true} assume !(0 != ~tmp~1); {30637#true} is VALID [2022-02-20 19:58:16,088 INFO L272 TraceCheckUtils]: 28: Hoare triple {30637#true} call #t~ret9 := is_do_read_c_triggered(); {30637#true} is VALID [2022-02-20 19:58:16,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {30637#true} havoc ~__retres1~1; {30637#true} is VALID [2022-02-20 19:58:16,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {30637#true} assume !(1 == ~c_dr_pc~0); {30637#true} is VALID [2022-02-20 19:58:16,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {30637#true} ~__retres1~1 := 0; {30637#true} is VALID [2022-02-20 19:58:16,089 INFO L290 TraceCheckUtils]: 32: Hoare triple {30637#true} #res := ~__retres1~1; {30637#true} is VALID [2022-02-20 19:58:16,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {30637#true} assume true; {30637#true} is VALID [2022-02-20 19:58:16,089 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {30637#true} {30637#true} #1658#return; {30637#true} is VALID [2022-02-20 19:58:16,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {30637#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30637#true} is VALID [2022-02-20 19:58:16,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {30637#true} assume !(0 != ~tmp___0~1); {30637#true} is VALID [2022-02-20 19:58:16,089 INFO L290 TraceCheckUtils]: 37: Hoare triple {30637#true} assume true; {30637#true} is VALID [2022-02-20 19:58:16,089 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {30637#true} {30639#(= ~c_dr_pc~0 0)} #1664#return; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,090 INFO L272 TraceCheckUtils]: 39: Hoare triple {30639#(= ~c_dr_pc~0 0)} call reset_delta_events1(); {30678#(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:16,090 INFO L290 TraceCheckUtils]: 40: Hoare triple {30678#(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); {30637#true} is VALID [2022-02-20 19:58:16,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {30637#true} assume !(1 == ~q_write_ev~0); {30637#true} is VALID [2022-02-20 19:58:16,090 INFO L290 TraceCheckUtils]: 42: Hoare triple {30637#true} assume true; {30637#true} is VALID [2022-02-20 19:58:16,090 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {30637#true} {30639#(= ~c_dr_pc~0 0)} #1666#return; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,091 INFO L290 TraceCheckUtils]: 44: Hoare triple {30639#(= ~c_dr_pc~0 0)} assume !false; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {30639#(= ~c_dr_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; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,091 INFO L290 TraceCheckUtils]: 46: Hoare triple {30639#(= ~c_dr_pc~0 0)} assume !false; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,091 INFO L272 TraceCheckUtils]: 47: Hoare triple {30639#(= ~c_dr_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {30637#true} is VALID [2022-02-20 19:58:16,091 INFO L290 TraceCheckUtils]: 48: Hoare triple {30637#true} havoc ~__retres1~2; {30637#true} is VALID [2022-02-20 19:58:16,091 INFO L290 TraceCheckUtils]: 49: Hoare triple {30637#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30637#true} is VALID [2022-02-20 19:58:16,092 INFO L290 TraceCheckUtils]: 50: Hoare triple {30637#true} #res := ~__retres1~2; {30637#true} is VALID [2022-02-20 19:58:16,092 INFO L290 TraceCheckUtils]: 51: Hoare triple {30637#true} assume true; {30637#true} is VALID [2022-02-20 19:58:16,092 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {30637#true} {30639#(= ~c_dr_pc~0 0)} #1668#return; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {30639#(= ~c_dr_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; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,092 INFO L290 TraceCheckUtils]: 54: Hoare triple {30639#(= ~c_dr_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,093 INFO L290 TraceCheckUtils]: 55: Hoare triple {30639#(= ~c_dr_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; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,093 INFO L290 TraceCheckUtils]: 56: Hoare triple {30639#(= ~c_dr_pc~0 0)} assume !(0 != eval1_~tmp~2#1); {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,093 INFO L290 TraceCheckUtils]: 57: Hoare triple {30639#(= ~c_dr_pc~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; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,093 INFO L290 TraceCheckUtils]: 58: Hoare triple {30639#(= ~c_dr_pc~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; {30639#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:16,094 INFO L290 TraceCheckUtils]: 59: Hoare triple {30639#(= ~c_dr_pc~0 0)} assume !(0 == ~c_dr_pc~0); {30638#false} is VALID [2022-02-20 19:58:16,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {30638#false} assume 1 == ~c_dr_pc~0; {30638#false} is VALID [2022-02-20 19:58:16,094 INFO L290 TraceCheckUtils]: 61: Hoare triple {30638#false} do_read_c_~a~0#1 := ~a_t~0; {30638#false} is VALID [2022-02-20 19:58:16,094 INFO L290 TraceCheckUtils]: 62: Hoare triple {30638#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; {30638#false} is VALID [2022-02-20 19:58:16,094 INFO L290 TraceCheckUtils]: 63: Hoare triple {30638#false} assume !(~p_last_write~0 == ~c_last_read~0); {30638#false} is VALID [2022-02-20 19:58:16,094 INFO L272 TraceCheckUtils]: 64: Hoare triple {30638#false} call error1(); {30638#false} is VALID [2022-02-20 19:58:16,094 INFO L290 TraceCheckUtils]: 65: Hoare triple {30638#false} assume !false; {30638#false} is VALID [2022-02-20 19:58:16,095 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:16,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:16,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721800971] [2022-02-20 19:58:16,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721800971] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:16,095 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:16,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:16,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253509866] [2022-02-20 19:58:16,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:16,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:16,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:16,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:16,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:16,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:16,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:16,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:16,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:16,128 INFO L87 Difference]: Start difference. First operand 1418 states and 1916 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:18,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:18,113 INFO L93 Difference]: Finished difference Result 3606 states and 4722 transitions. [2022-02-20 19:58:18,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:18,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:18,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:18,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:18,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 923 transitions. [2022-02-20 19:58:18,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:18,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 923 transitions. [2022-02-20 19:58:18,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 923 transitions. [2022-02-20 19:58:18,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 923 edges. 923 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:18,996 INFO L225 Difference]: With dead ends: 3606 [2022-02-20 19:58:18,996 INFO L226 Difference]: Without dead ends: 2538 [2022-02-20 19:58:18,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-02-20 19:58:18,998 INFO L933 BasicCegarLoop]: 635 mSDtfsCounter, 1558 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:18,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1589 Valid, 1251 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:58:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-02-20 19:58:19,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2280. [2022-02-20 19:58:19,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:19,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2538 states. Second operand has 2280 states, 1817 states have (on average 1.3203082003302147) internal successors, (2399), 1845 states have internal predecessors, (2399), 239 states have call successors, (239), 179 states have call predecessors, (239), 222 states have return successors, (339), 262 states have call predecessors, (339), 237 states have call successors, (339) [2022-02-20 19:58:19,130 INFO L74 IsIncluded]: Start isIncluded. First operand 2538 states. Second operand has 2280 states, 1817 states have (on average 1.3203082003302147) internal successors, (2399), 1845 states have internal predecessors, (2399), 239 states have call successors, (239), 179 states have call predecessors, (239), 222 states have return successors, (339), 262 states have call predecessors, (339), 237 states have call successors, (339) [2022-02-20 19:58:19,134 INFO L87 Difference]: Start difference. First operand 2538 states. Second operand has 2280 states, 1817 states have (on average 1.3203082003302147) internal successors, (2399), 1845 states have internal predecessors, (2399), 239 states have call successors, (239), 179 states have call predecessors, (239), 222 states have return successors, (339), 262 states have call predecessors, (339), 237 states have call successors, (339) [2022-02-20 19:58:19,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:19,303 INFO L93 Difference]: Finished difference Result 2538 states and 3277 transitions. [2022-02-20 19:58:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3277 transitions. [2022-02-20 19:58:19,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:19,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:19,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 2280 states, 1817 states have (on average 1.3203082003302147) internal successors, (2399), 1845 states have internal predecessors, (2399), 239 states have call successors, (239), 179 states have call predecessors, (239), 222 states have return successors, (339), 262 states have call predecessors, (339), 237 states have call successors, (339) Second operand 2538 states. [2022-02-20 19:58:19,313 INFO L87 Difference]: Start difference. First operand has 2280 states, 1817 states have (on average 1.3203082003302147) internal successors, (2399), 1845 states have internal predecessors, (2399), 239 states have call successors, (239), 179 states have call predecessors, (239), 222 states have return successors, (339), 262 states have call predecessors, (339), 237 states have call successors, (339) Second operand 2538 states. [2022-02-20 19:58:19,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:19,483 INFO L93 Difference]: Finished difference Result 2538 states and 3277 transitions. [2022-02-20 19:58:19,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3277 transitions. [2022-02-20 19:58:19,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:19,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:19,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:19,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2280 states, 1817 states have (on average 1.3203082003302147) internal successors, (2399), 1845 states have internal predecessors, (2399), 239 states have call successors, (239), 179 states have call predecessors, (239), 222 states have return successors, (339), 262 states have call predecessors, (339), 237 states have call successors, (339) [2022-02-20 19:58:19,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 2977 transitions. [2022-02-20 19:58:19,690 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 2977 transitions. Word has length 66 [2022-02-20 19:58:19,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:19,691 INFO L470 AbstractCegarLoop]: Abstraction has 2280 states and 2977 transitions. [2022-02-20 19:58:19,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:19,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 2977 transitions. [2022-02-20 19:58:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:58:19,692 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:19,692 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:19,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:58:19,693 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:19,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:19,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1831794968, now seen corresponding path program 1 times [2022-02-20 19:58:19,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:19,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320528195] [2022-02-20 19:58:19,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:19,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {43666#(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); {43626#true} is VALID [2022-02-20 19:58:19,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {43626#true} assume true; {43626#true} is VALID [2022-02-20 19:58:19,744 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43626#true} {43628#(= ~p_dw_pc~0 0)} #1660#return; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {43667#(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); {43626#true} is VALID [2022-02-20 19:58:19,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {43626#true} assume !(0 == ~q_write_ev~0); {43626#true} is VALID [2022-02-20 19:58:19,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {43626#true} assume true; {43626#true} is VALID [2022-02-20 19:58:19,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43626#true} {43628#(= ~p_dw_pc~0 0)} #1662#return; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {43626#true} havoc ~__retres1~0; {43626#true} is VALID [2022-02-20 19:58:19,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {43626#true} assume !(1 == ~p_dw_pc~0); {43626#true} is VALID [2022-02-20 19:58:19,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {43626#true} ~__retres1~0 := 0; {43626#true} is VALID [2022-02-20 19:58:19,762 INFO L290 TraceCheckUtils]: 3: Hoare triple {43626#true} #res := ~__retres1~0; {43626#true} is VALID [2022-02-20 19:58:19,762 INFO L290 TraceCheckUtils]: 4: Hoare triple {43626#true} assume true; {43626#true} is VALID [2022-02-20 19:58:19,763 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {43626#true} {43626#true} #1656#return; {43626#true} is VALID [2022-02-20 19:58:19,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {43626#true} havoc ~__retres1~1; {43626#true} is VALID [2022-02-20 19:58:19,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {43626#true} assume !(1 == ~c_dr_pc~0); {43626#true} is VALID [2022-02-20 19:58:19,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {43626#true} ~__retres1~1 := 0; {43626#true} is VALID [2022-02-20 19:58:19,765 INFO L290 TraceCheckUtils]: 3: Hoare triple {43626#true} #res := ~__retres1~1; {43626#true} is VALID [2022-02-20 19:58:19,765 INFO L290 TraceCheckUtils]: 4: Hoare triple {43626#true} assume true; {43626#true} is VALID [2022-02-20 19:58:19,765 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {43626#true} {43626#true} #1658#return; {43626#true} is VALID [2022-02-20 19:58:19,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {43668#(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; {43626#true} is VALID [2022-02-20 19:58:19,765 INFO L272 TraceCheckUtils]: 1: Hoare triple {43626#true} call #t~ret8 := is_do_write_p_triggered(); {43626#true} is VALID [2022-02-20 19:58:19,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {43626#true} havoc ~__retres1~0; {43626#true} is VALID [2022-02-20 19:58:19,765 INFO L290 TraceCheckUtils]: 3: Hoare triple {43626#true} assume !(1 == ~p_dw_pc~0); {43626#true} is VALID [2022-02-20 19:58:19,765 INFO L290 TraceCheckUtils]: 4: Hoare triple {43626#true} ~__retres1~0 := 0; {43626#true} is VALID [2022-02-20 19:58:19,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {43626#true} #res := ~__retres1~0; {43626#true} is VALID [2022-02-20 19:58:19,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {43626#true} assume true; {43626#true} is VALID [2022-02-20 19:58:19,766 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {43626#true} {43626#true} #1656#return; {43626#true} is VALID [2022-02-20 19:58:19,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {43626#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {43626#true} is VALID [2022-02-20 19:58:19,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {43626#true} assume !(0 != ~tmp~1); {43626#true} is VALID [2022-02-20 19:58:19,766 INFO L272 TraceCheckUtils]: 10: Hoare triple {43626#true} call #t~ret9 := is_do_read_c_triggered(); {43626#true} is VALID [2022-02-20 19:58:19,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {43626#true} havoc ~__retres1~1; {43626#true} is VALID [2022-02-20 19:58:19,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {43626#true} assume !(1 == ~c_dr_pc~0); {43626#true} is VALID [2022-02-20 19:58:19,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {43626#true} ~__retres1~1 := 0; {43626#true} is VALID [2022-02-20 19:58:19,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {43626#true} #res := ~__retres1~1; {43626#true} is VALID [2022-02-20 19:58:19,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {43626#true} assume true; {43626#true} is VALID [2022-02-20 19:58:19,767 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {43626#true} {43626#true} #1658#return; {43626#true} is VALID [2022-02-20 19:58:19,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {43626#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {43626#true} is VALID [2022-02-20 19:58:19,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {43626#true} assume !(0 != ~tmp___0~1); {43626#true} is VALID [2022-02-20 19:58:19,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {43626#true} assume true; {43626#true} is VALID [2022-02-20 19:58:19,767 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {43626#true} {43628#(= ~p_dw_pc~0 0)} #1664#return; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {43667#(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); {43626#true} is VALID [2022-02-20 19:58:19,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {43626#true} assume !(1 == ~q_write_ev~0); {43626#true} is VALID [2022-02-20 19:58:19,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {43626#true} assume true; {43626#true} is VALID [2022-02-20 19:58:19,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43626#true} {43628#(= ~p_dw_pc~0 0)} #1666#return; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {43626#true} havoc ~__retres1~2; {43626#true} is VALID [2022-02-20 19:58:19,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {43626#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {43626#true} is VALID [2022-02-20 19:58:19,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {43626#true} #res := ~__retres1~2; {43626#true} is VALID [2022-02-20 19:58:19,773 INFO L290 TraceCheckUtils]: 3: Hoare triple {43626#true} assume true; {43626#true} is VALID [2022-02-20 19:58:19,774 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {43626#true} {43628#(= ~p_dw_pc~0 0)} #1668#return; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {43626#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {43626#true} is VALID [2022-02-20 19:58:19,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {43626#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {43626#true} is VALID [2022-02-20 19:58:19,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {43626#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#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; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,774 INFO L290 TraceCheckUtils]: 3: Hoare triple {43628#(= ~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; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {43628#(= ~p_dw_pc~0 0)} call update_channels1(); {43666#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:19,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {43666#(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); {43626#true} is VALID [2022-02-20 19:58:19,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {43626#true} assume true; {43626#true} is VALID [2022-02-20 19:58:19,775 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {43626#true} {43628#(= ~p_dw_pc~0 0)} #1660#return; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {43628#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {43628#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {43628#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {43628#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,777 INFO L272 TraceCheckUtils]: 12: Hoare triple {43628#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {43667#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:19,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {43667#(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); {43626#true} is VALID [2022-02-20 19:58:19,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {43626#true} assume !(0 == ~q_write_ev~0); {43626#true} is VALID [2022-02-20 19:58:19,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {43626#true} assume true; {43626#true} is VALID [2022-02-20 19:58:19,803 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {43626#true} {43628#(= ~p_dw_pc~0 0)} #1662#return; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,803 INFO L272 TraceCheckUtils]: 17: Hoare triple {43628#(= ~p_dw_pc~0 0)} call activate_threads1(); {43668#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:19,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {43668#(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; {43626#true} is VALID [2022-02-20 19:58:19,803 INFO L272 TraceCheckUtils]: 19: Hoare triple {43626#true} call #t~ret8 := is_do_write_p_triggered(); {43626#true} is VALID [2022-02-20 19:58:19,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {43626#true} havoc ~__retres1~0; {43626#true} is VALID [2022-02-20 19:58:19,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {43626#true} assume !(1 == ~p_dw_pc~0); {43626#true} is VALID [2022-02-20 19:58:19,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {43626#true} ~__retres1~0 := 0; {43626#true} is VALID [2022-02-20 19:58:19,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {43626#true} #res := ~__retres1~0; {43626#true} is VALID [2022-02-20 19:58:19,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {43626#true} assume true; {43626#true} is VALID [2022-02-20 19:58:19,804 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {43626#true} {43626#true} #1656#return; {43626#true} is VALID [2022-02-20 19:58:19,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {43626#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {43626#true} is VALID [2022-02-20 19:58:19,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {43626#true} assume !(0 != ~tmp~1); {43626#true} is VALID [2022-02-20 19:58:19,804 INFO L272 TraceCheckUtils]: 28: Hoare triple {43626#true} call #t~ret9 := is_do_read_c_triggered(); {43626#true} is VALID [2022-02-20 19:58:19,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {43626#true} havoc ~__retres1~1; {43626#true} is VALID [2022-02-20 19:58:19,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {43626#true} assume !(1 == ~c_dr_pc~0); {43626#true} is VALID [2022-02-20 19:58:19,804 INFO L290 TraceCheckUtils]: 31: Hoare triple {43626#true} ~__retres1~1 := 0; {43626#true} is VALID [2022-02-20 19:58:19,804 INFO L290 TraceCheckUtils]: 32: Hoare triple {43626#true} #res := ~__retres1~1; {43626#true} is VALID [2022-02-20 19:58:19,804 INFO L290 TraceCheckUtils]: 33: Hoare triple {43626#true} assume true; {43626#true} is VALID [2022-02-20 19:58:19,804 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {43626#true} {43626#true} #1658#return; {43626#true} is VALID [2022-02-20 19:58:19,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {43626#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {43626#true} is VALID [2022-02-20 19:58:19,804 INFO L290 TraceCheckUtils]: 36: Hoare triple {43626#true} assume !(0 != ~tmp___0~1); {43626#true} is VALID [2022-02-20 19:58:19,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {43626#true} assume true; {43626#true} is VALID [2022-02-20 19:58:19,804 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {43626#true} {43628#(= ~p_dw_pc~0 0)} #1664#return; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,805 INFO L272 TraceCheckUtils]: 39: Hoare triple {43628#(= ~p_dw_pc~0 0)} call reset_delta_events1(); {43667#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:19,805 INFO L290 TraceCheckUtils]: 40: Hoare triple {43667#(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); {43626#true} is VALID [2022-02-20 19:58:19,805 INFO L290 TraceCheckUtils]: 41: Hoare triple {43626#true} assume !(1 == ~q_write_ev~0); {43626#true} is VALID [2022-02-20 19:58:19,805 INFO L290 TraceCheckUtils]: 42: Hoare triple {43626#true} assume true; {43626#true} is VALID [2022-02-20 19:58:19,805 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {43626#true} {43628#(= ~p_dw_pc~0 0)} #1666#return; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,805 INFO L290 TraceCheckUtils]: 44: Hoare triple {43628#(= ~p_dw_pc~0 0)} assume !false; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,806 INFO L290 TraceCheckUtils]: 45: Hoare triple {43628#(= ~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; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,806 INFO L290 TraceCheckUtils]: 46: Hoare triple {43628#(= ~p_dw_pc~0 0)} assume !false; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,806 INFO L272 TraceCheckUtils]: 47: Hoare triple {43628#(= ~p_dw_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {43626#true} is VALID [2022-02-20 19:58:19,806 INFO L290 TraceCheckUtils]: 48: Hoare triple {43626#true} havoc ~__retres1~2; {43626#true} is VALID [2022-02-20 19:58:19,806 INFO L290 TraceCheckUtils]: 49: Hoare triple {43626#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {43626#true} is VALID [2022-02-20 19:58:19,806 INFO L290 TraceCheckUtils]: 50: Hoare triple {43626#true} #res := ~__retres1~2; {43626#true} is VALID [2022-02-20 19:58:19,806 INFO L290 TraceCheckUtils]: 51: Hoare triple {43626#true} assume true; {43626#true} is VALID [2022-02-20 19:58:19,807 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {43626#true} {43628#(= ~p_dw_pc~0 0)} #1668#return; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,807 INFO L290 TraceCheckUtils]: 53: Hoare triple {43628#(= ~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; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,807 INFO L290 TraceCheckUtils]: 54: Hoare triple {43628#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,807 INFO L290 TraceCheckUtils]: 55: Hoare triple {43628#(= ~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; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,808 INFO L290 TraceCheckUtils]: 56: Hoare triple {43628#(= ~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; {43628#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:19,808 INFO L290 TraceCheckUtils]: 57: Hoare triple {43628#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {43627#false} is VALID [2022-02-20 19:58:19,808 INFO L290 TraceCheckUtils]: 58: Hoare triple {43627#false} assume 1 == ~p_dw_pc~0; {43627#false} is VALID [2022-02-20 19:58:19,808 INFO L290 TraceCheckUtils]: 59: Hoare triple {43627#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; {43627#false} is VALID [2022-02-20 19:58:19,808 INFO L290 TraceCheckUtils]: 60: Hoare triple {43627#false} assume !false; {43627#false} is VALID [2022-02-20 19:58:19,808 INFO L290 TraceCheckUtils]: 61: Hoare triple {43627#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {43627#false} is VALID [2022-02-20 19:58:19,809 INFO L290 TraceCheckUtils]: 62: Hoare triple {43627#false} assume { :end_inline_do_write_p } true; {43627#false} is VALID [2022-02-20 19:58:19,809 INFO L290 TraceCheckUtils]: 63: Hoare triple {43627#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; {43627#false} is VALID [2022-02-20 19:58:19,809 INFO L290 TraceCheckUtils]: 64: Hoare triple {43627#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; {43627#false} is VALID [2022-02-20 19:58:19,809 INFO L290 TraceCheckUtils]: 65: Hoare triple {43627#false} assume 0 == ~c_dr_pc~0; {43627#false} is VALID [2022-02-20 19:58:19,809 INFO L290 TraceCheckUtils]: 66: Hoare triple {43627#false} assume !false; {43627#false} is VALID [2022-02-20 19:58:19,809 INFO L290 TraceCheckUtils]: 67: Hoare triple {43627#false} assume !(1 == ~q_free~0); {43627#false} is VALID [2022-02-20 19:58:19,809 INFO L290 TraceCheckUtils]: 68: Hoare triple {43627#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; {43627#false} is VALID [2022-02-20 19:58:19,809 INFO L290 TraceCheckUtils]: 69: Hoare triple {43627#false} assume !(~p_last_write~0 == ~c_last_read~0); {43627#false} is VALID [2022-02-20 19:58:19,809 INFO L272 TraceCheckUtils]: 70: Hoare triple {43627#false} call error1(); {43627#false} is VALID [2022-02-20 19:58:19,809 INFO L290 TraceCheckUtils]: 71: Hoare triple {43627#false} assume !false; {43627#false} is VALID [2022-02-20 19:58:19,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:19,810 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:19,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320528195] [2022-02-20 19:58:19,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320528195] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:19,810 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:19,810 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:19,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082838325] [2022-02-20 19:58:19,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:19,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:58:19,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:19,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:19,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:19,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:19,850 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:19,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:19,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:19,850 INFO L87 Difference]: Start difference. First operand 2280 states and 2977 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:22,440 INFO L93 Difference]: Finished difference Result 5190 states and 6627 transitions. [2022-02-20 19:58:22,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:22,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:58:22,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:22,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 909 transitions. [2022-02-20 19:58:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 909 transitions. [2022-02-20 19:58:22,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 909 transitions. [2022-02-20 19:58:23,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 909 edges. 909 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:23,525 INFO L225 Difference]: With dead ends: 5190 [2022-02-20 19:58:23,525 INFO L226 Difference]: Without dead ends: 3260 [2022-02-20 19:58:23,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:58:23,528 INFO L933 BasicCegarLoop]: 649 mSDtfsCounter, 1226 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:23,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1257 Valid, 1584 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:58:23,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3260 states. [2022-02-20 19:58:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3260 to 3012. [2022-02-20 19:58:23,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:23,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3260 states. Second operand has 3012 states, 2385 states have (on average 1.3010482180293501) internal successors, (3103), 2421 states have internal predecessors, (3103), 319 states have call successors, (319), 249 states have call predecessors, (319), 306 states have return successors, (448), 348 states have call predecessors, (448), 317 states have call successors, (448) [2022-02-20 19:58:23,683 INFO L74 IsIncluded]: Start isIncluded. First operand 3260 states. Second operand has 3012 states, 2385 states have (on average 1.3010482180293501) internal successors, (3103), 2421 states have internal predecessors, (3103), 319 states have call successors, (319), 249 states have call predecessors, (319), 306 states have return successors, (448), 348 states have call predecessors, (448), 317 states have call successors, (448) [2022-02-20 19:58:23,685 INFO L87 Difference]: Start difference. First operand 3260 states. Second operand has 3012 states, 2385 states have (on average 1.3010482180293501) internal successors, (3103), 2421 states have internal predecessors, (3103), 319 states have call successors, (319), 249 states have call predecessors, (319), 306 states have return successors, (448), 348 states have call predecessors, (448), 317 states have call successors, (448) [2022-02-20 19:58:24,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:24,002 INFO L93 Difference]: Finished difference Result 3260 states and 4151 transitions. [2022-02-20 19:58:24,002 INFO L276 IsEmpty]: Start isEmpty. Operand 3260 states and 4151 transitions. [2022-02-20 19:58:24,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:24,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:24,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 3012 states, 2385 states have (on average 1.3010482180293501) internal successors, (3103), 2421 states have internal predecessors, (3103), 319 states have call successors, (319), 249 states have call predecessors, (319), 306 states have return successors, (448), 348 states have call predecessors, (448), 317 states have call successors, (448) Second operand 3260 states. [2022-02-20 19:58:24,013 INFO L87 Difference]: Start difference. First operand has 3012 states, 2385 states have (on average 1.3010482180293501) internal successors, (3103), 2421 states have internal predecessors, (3103), 319 states have call successors, (319), 249 states have call predecessors, (319), 306 states have return successors, (448), 348 states have call predecessors, (448), 317 states have call successors, (448) Second operand 3260 states. [2022-02-20 19:58:24,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:24,328 INFO L93 Difference]: Finished difference Result 3260 states and 4151 transitions. [2022-02-20 19:58:24,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3260 states and 4151 transitions. [2022-02-20 19:58:24,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:24,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:24,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:24,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3012 states, 2385 states have (on average 1.3010482180293501) internal successors, (3103), 2421 states have internal predecessors, (3103), 319 states have call successors, (319), 249 states have call predecessors, (319), 306 states have return successors, (448), 348 states have call predecessors, (448), 317 states have call successors, (448) [2022-02-20 19:58:24,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 3870 transitions. [2022-02-20 19:58:24,675 INFO L78 Accepts]: Start accepts. Automaton has 3012 states and 3870 transitions. Word has length 72 [2022-02-20 19:58:24,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:24,675 INFO L470 AbstractCegarLoop]: Abstraction has 3012 states and 3870 transitions. [2022-02-20 19:58:24,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 3870 transitions. [2022-02-20 19:58:24,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:58:24,676 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:24,677 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:24,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:58:24,677 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:24,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:24,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1467852209, now seen corresponding path program 1 times [2022-02-20 19:58:24,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:24,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131079171] [2022-02-20 19:58:24,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:24,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {61224#(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); {61183#true} is VALID [2022-02-20 19:58:24,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {61183#true} assume true; {61183#true} is VALID [2022-02-20 19:58:24,718 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61183#true} {61183#true} #1660#return; {61183#true} is VALID [2022-02-20 19:58:24,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {61225#(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); {61183#true} is VALID [2022-02-20 19:58:24,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {61183#true} assume !(0 == ~q_write_ev~0); {61183#true} is VALID [2022-02-20 19:58:24,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {61183#true} assume true; {61183#true} is VALID [2022-02-20 19:58:24,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61183#true} {61183#true} #1662#return; {61183#true} is VALID [2022-02-20 19:58:24,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {61183#true} havoc ~__retres1~0; {61183#true} is VALID [2022-02-20 19:58:24,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {61183#true} assume !(1 == ~p_dw_pc~0); {61183#true} is VALID [2022-02-20 19:58:24,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {61183#true} ~__retres1~0 := 0; {61183#true} is VALID [2022-02-20 19:58:24,734 INFO L290 TraceCheckUtils]: 3: Hoare triple {61183#true} #res := ~__retres1~0; {61183#true} is VALID [2022-02-20 19:58:24,734 INFO L290 TraceCheckUtils]: 4: Hoare triple {61183#true} assume true; {61183#true} is VALID [2022-02-20 19:58:24,734 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {61183#true} {61183#true} #1656#return; {61183#true} is VALID [2022-02-20 19:58:24,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {61183#true} havoc ~__retres1~1; {61183#true} is VALID [2022-02-20 19:58:24,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {61183#true} assume !(1 == ~c_dr_pc~0); {61183#true} is VALID [2022-02-20 19:58:24,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {61183#true} ~__retres1~1 := 0; {61183#true} is VALID [2022-02-20 19:58:24,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {61183#true} #res := ~__retres1~1; {61183#true} is VALID [2022-02-20 19:58:24,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {61183#true} assume true; {61183#true} is VALID [2022-02-20 19:58:24,736 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {61183#true} {61183#true} #1658#return; {61183#true} is VALID [2022-02-20 19:58:24,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {61226#(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; {61183#true} is VALID [2022-02-20 19:58:24,736 INFO L272 TraceCheckUtils]: 1: Hoare triple {61183#true} call #t~ret8 := is_do_write_p_triggered(); {61183#true} is VALID [2022-02-20 19:58:24,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {61183#true} havoc ~__retres1~0; {61183#true} is VALID [2022-02-20 19:58:24,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {61183#true} assume !(1 == ~p_dw_pc~0); {61183#true} is VALID [2022-02-20 19:58:24,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {61183#true} ~__retres1~0 := 0; {61183#true} is VALID [2022-02-20 19:58:24,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {61183#true} #res := ~__retres1~0; {61183#true} is VALID [2022-02-20 19:58:24,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {61183#true} assume true; {61183#true} is VALID [2022-02-20 19:58:24,737 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {61183#true} {61183#true} #1656#return; {61183#true} is VALID [2022-02-20 19:58:24,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {61183#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {61183#true} is VALID [2022-02-20 19:58:24,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {61183#true} assume !(0 != ~tmp~1); {61183#true} is VALID [2022-02-20 19:58:24,738 INFO L272 TraceCheckUtils]: 10: Hoare triple {61183#true} call #t~ret9 := is_do_read_c_triggered(); {61183#true} is VALID [2022-02-20 19:58:24,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {61183#true} havoc ~__retres1~1; {61183#true} is VALID [2022-02-20 19:58:24,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {61183#true} assume !(1 == ~c_dr_pc~0); {61183#true} is VALID [2022-02-20 19:58:24,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {61183#true} ~__retres1~1 := 0; {61183#true} is VALID [2022-02-20 19:58:24,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {61183#true} #res := ~__retres1~1; {61183#true} is VALID [2022-02-20 19:58:24,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {61183#true} assume true; {61183#true} is VALID [2022-02-20 19:58:24,738 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {61183#true} {61183#true} #1658#return; {61183#true} is VALID [2022-02-20 19:58:24,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {61183#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {61183#true} is VALID [2022-02-20 19:58:24,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {61183#true} assume !(0 != ~tmp___0~1); {61183#true} is VALID [2022-02-20 19:58:24,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {61183#true} assume true; {61183#true} is VALID [2022-02-20 19:58:24,739 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {61183#true} {61183#true} #1664#return; {61183#true} is VALID [2022-02-20 19:58:24,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {61225#(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); {61183#true} is VALID [2022-02-20 19:58:24,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {61183#true} assume !(1 == ~q_write_ev~0); {61183#true} is VALID [2022-02-20 19:58:24,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {61183#true} assume true; {61183#true} is VALID [2022-02-20 19:58:24,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61183#true} {61183#true} #1666#return; {61183#true} is VALID [2022-02-20 19:58:24,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {61183#true} havoc ~__retres1~2; {61183#true} is VALID [2022-02-20 19:58:24,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {61183#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {61183#true} is VALID [2022-02-20 19:58:24,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {61183#true} #res := ~__retres1~2; {61183#true} is VALID [2022-02-20 19:58:24,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {61183#true} assume true; {61183#true} is VALID [2022-02-20 19:58:24,745 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {61183#true} {61183#true} #1668#return; {61183#true} is VALID [2022-02-20 19:58:24,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {61183#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {61183#true} is VALID [2022-02-20 19:58:24,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {61183#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {61183#true} is VALID [2022-02-20 19:58:24,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {61183#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#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; {61183#true} is VALID [2022-02-20 19:58:24,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {61183#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; {61183#true} is VALID [2022-02-20 19:58:24,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {61183#true} call update_channels1(); {61224#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:24,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {61224#(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); {61183#true} is VALID [2022-02-20 19:58:24,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {61183#true} assume true; {61183#true} is VALID [2022-02-20 19:58:24,746 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {61183#true} {61183#true} #1660#return; {61183#true} is VALID [2022-02-20 19:58:24,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {61183#true} assume { :begin_inline_init_threads1 } true; {61183#true} is VALID [2022-02-20 19:58:24,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {61183#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {61183#true} is VALID [2022-02-20 19:58:24,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {61183#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {61183#true} is VALID [2022-02-20 19:58:24,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {61183#true} assume { :end_inline_init_threads1 } true; {61183#true} is VALID [2022-02-20 19:58:24,747 INFO L272 TraceCheckUtils]: 12: Hoare triple {61183#true} call fire_delta_events1(); {61225#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:24,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {61225#(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); {61183#true} is VALID [2022-02-20 19:58:24,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {61183#true} assume !(0 == ~q_write_ev~0); {61183#true} is VALID [2022-02-20 19:58:24,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {61183#true} assume true; {61183#true} is VALID [2022-02-20 19:58:24,747 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {61183#true} {61183#true} #1662#return; {61183#true} is VALID [2022-02-20 19:58:24,747 INFO L272 TraceCheckUtils]: 17: Hoare triple {61183#true} call activate_threads1(); {61226#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:24,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {61226#(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; {61183#true} is VALID [2022-02-20 19:58:24,748 INFO L272 TraceCheckUtils]: 19: Hoare triple {61183#true} call #t~ret8 := is_do_write_p_triggered(); {61183#true} is VALID [2022-02-20 19:58:24,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {61183#true} havoc ~__retres1~0; {61183#true} is VALID [2022-02-20 19:58:24,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {61183#true} assume !(1 == ~p_dw_pc~0); {61183#true} is VALID [2022-02-20 19:58:24,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {61183#true} ~__retres1~0 := 0; {61183#true} is VALID [2022-02-20 19:58:24,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {61183#true} #res := ~__retres1~0; {61183#true} is VALID [2022-02-20 19:58:24,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {61183#true} assume true; {61183#true} is VALID [2022-02-20 19:58:24,748 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {61183#true} {61183#true} #1656#return; {61183#true} is VALID [2022-02-20 19:58:24,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {61183#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {61183#true} is VALID [2022-02-20 19:58:24,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {61183#true} assume !(0 != ~tmp~1); {61183#true} is VALID [2022-02-20 19:58:24,748 INFO L272 TraceCheckUtils]: 28: Hoare triple {61183#true} call #t~ret9 := is_do_read_c_triggered(); {61183#true} is VALID [2022-02-20 19:58:24,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {61183#true} havoc ~__retres1~1; {61183#true} is VALID [2022-02-20 19:58:24,749 INFO L290 TraceCheckUtils]: 30: Hoare triple {61183#true} assume !(1 == ~c_dr_pc~0); {61183#true} is VALID [2022-02-20 19:58:24,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {61183#true} ~__retres1~1 := 0; {61183#true} is VALID [2022-02-20 19:58:24,749 INFO L290 TraceCheckUtils]: 32: Hoare triple {61183#true} #res := ~__retres1~1; {61183#true} is VALID [2022-02-20 19:58:24,749 INFO L290 TraceCheckUtils]: 33: Hoare triple {61183#true} assume true; {61183#true} is VALID [2022-02-20 19:58:24,749 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {61183#true} {61183#true} #1658#return; {61183#true} is VALID [2022-02-20 19:58:24,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {61183#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {61183#true} is VALID [2022-02-20 19:58:24,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {61183#true} assume !(0 != ~tmp___0~1); {61183#true} is VALID [2022-02-20 19:58:24,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {61183#true} assume true; {61183#true} is VALID [2022-02-20 19:58:24,749 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {61183#true} {61183#true} #1664#return; {61183#true} is VALID [2022-02-20 19:58:24,750 INFO L272 TraceCheckUtils]: 39: Hoare triple {61183#true} call reset_delta_events1(); {61225#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:24,750 INFO L290 TraceCheckUtils]: 40: Hoare triple {61225#(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); {61183#true} is VALID [2022-02-20 19:58:24,750 INFO L290 TraceCheckUtils]: 41: Hoare triple {61183#true} assume !(1 == ~q_write_ev~0); {61183#true} is VALID [2022-02-20 19:58:24,750 INFO L290 TraceCheckUtils]: 42: Hoare triple {61183#true} assume true; {61183#true} is VALID [2022-02-20 19:58:24,750 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {61183#true} {61183#true} #1666#return; {61183#true} is VALID [2022-02-20 19:58:24,750 INFO L290 TraceCheckUtils]: 44: Hoare triple {61183#true} assume !false; {61183#true} is VALID [2022-02-20 19:58:24,750 INFO L290 TraceCheckUtils]: 45: Hoare triple {61183#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; {61183#true} is VALID [2022-02-20 19:58:24,751 INFO L290 TraceCheckUtils]: 46: Hoare triple {61183#true} assume !false; {61183#true} is VALID [2022-02-20 19:58:24,751 INFO L272 TraceCheckUtils]: 47: Hoare triple {61183#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {61183#true} is VALID [2022-02-20 19:58:24,751 INFO L290 TraceCheckUtils]: 48: Hoare triple {61183#true} havoc ~__retres1~2; {61183#true} is VALID [2022-02-20 19:58:24,751 INFO L290 TraceCheckUtils]: 49: Hoare triple {61183#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {61183#true} is VALID [2022-02-20 19:58:24,751 INFO L290 TraceCheckUtils]: 50: Hoare triple {61183#true} #res := ~__retres1~2; {61183#true} is VALID [2022-02-20 19:58:24,751 INFO L290 TraceCheckUtils]: 51: Hoare triple {61183#true} assume true; {61183#true} is VALID [2022-02-20 19:58:24,751 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {61183#true} {61183#true} #1668#return; {61183#true} is VALID [2022-02-20 19:58:24,751 INFO L290 TraceCheckUtils]: 53: Hoare triple {61183#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; {61183#true} is VALID [2022-02-20 19:58:24,751 INFO L290 TraceCheckUtils]: 54: Hoare triple {61183#true} assume 0 != eval1_~tmp___1~0#1; {61183#true} is VALID [2022-02-20 19:58:24,751 INFO L290 TraceCheckUtils]: 55: Hoare triple {61183#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; {61183#true} is VALID [2022-02-20 19:58:24,752 INFO L290 TraceCheckUtils]: 56: Hoare triple {61183#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; {61183#true} is VALID [2022-02-20 19:58:24,752 INFO L290 TraceCheckUtils]: 57: Hoare triple {61183#true} assume 0 == ~p_dw_pc~0; {61183#true} is VALID [2022-02-20 19:58:24,752 INFO L290 TraceCheckUtils]: 58: Hoare triple {61183#true} assume !false; {61183#true} is VALID [2022-02-20 19:58:24,752 INFO L290 TraceCheckUtils]: 59: Hoare triple {61183#true} assume !(0 == ~q_free~0); {61183#true} is VALID [2022-02-20 19:58:24,752 INFO L290 TraceCheckUtils]: 60: Hoare triple {61183#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; {61222#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:24,753 INFO L290 TraceCheckUtils]: 61: Hoare triple {61222#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {61222#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:24,753 INFO L290 TraceCheckUtils]: 62: Hoare triple {61222#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {61222#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:24,753 INFO L290 TraceCheckUtils]: 63: Hoare triple {61222#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {61222#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:24,753 INFO L290 TraceCheckUtils]: 64: Hoare triple {61222#(= ~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; {61222#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:24,754 INFO L290 TraceCheckUtils]: 65: Hoare triple {61222#(= ~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; {61222#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:24,754 INFO L290 TraceCheckUtils]: 66: Hoare triple {61222#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {61222#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:24,754 INFO L290 TraceCheckUtils]: 67: Hoare triple {61222#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {61222#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:24,755 INFO L290 TraceCheckUtils]: 68: Hoare triple {61222#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {61222#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:24,755 INFO L290 TraceCheckUtils]: 69: Hoare triple {61222#(= ~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; {61223#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:58:24,755 INFO L290 TraceCheckUtils]: 70: Hoare triple {61223#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {61184#false} is VALID [2022-02-20 19:58:24,755 INFO L272 TraceCheckUtils]: 71: Hoare triple {61184#false} call error1(); {61184#false} is VALID [2022-02-20 19:58:24,755 INFO L290 TraceCheckUtils]: 72: Hoare triple {61184#false} assume !false; {61184#false} is VALID [2022-02-20 19:58:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:24,756 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:24,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131079171] [2022-02-20 19:58:24,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131079171] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:24,756 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:24,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:24,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876983493] [2022-02-20 19:58:24,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:24,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:58:24,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:24,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:24,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:24,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:24,801 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:24,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:24,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:24,802 INFO L87 Difference]: Start difference. First operand 3012 states and 3870 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:58:27,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:27,431 INFO L93 Difference]: Finished difference Result 3786 states and 4801 transitions. [2022-02-20 19:58:27,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:27,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:58:27,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:27,432 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:58:27,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 792 transitions. [2022-02-20 19:58:27,435 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:58:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 792 transitions. [2022-02-20 19:58:27,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 792 transitions. [2022-02-20 19:58:27,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 792 edges. 792 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:28,580 INFO L225 Difference]: With dead ends: 3786 [2022-02-20 19:58:28,581 INFO L226 Difference]: Without dead ends: 3783 [2022-02-20 19:58:28,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:58:28,582 INFO L933 BasicCegarLoop]: 644 mSDtfsCounter, 2168 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2178 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:28,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2178 Valid, 1265 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:58:28,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2022-02-20 19:58:28,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3506. [2022-02-20 19:58:28,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:28,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3783 states. Second operand has 3506 states, 2770 states have (on average 1.2906137184115523) internal successors, (3575), 2811 states have internal predecessors, (3575), 369 states have call successors, (369), 293 states have call predecessors, (369), 365 states have return successors, (527), 408 states have call predecessors, (527), 368 states have call successors, (527) [2022-02-20 19:58:28,794 INFO L74 IsIncluded]: Start isIncluded. First operand 3783 states. Second operand has 3506 states, 2770 states have (on average 1.2906137184115523) internal successors, (3575), 2811 states have internal predecessors, (3575), 369 states have call successors, (369), 293 states have call predecessors, (369), 365 states have return successors, (527), 408 states have call predecessors, (527), 368 states have call successors, (527) [2022-02-20 19:58:28,797 INFO L87 Difference]: Start difference. First operand 3783 states. Second operand has 3506 states, 2770 states have (on average 1.2906137184115523) internal successors, (3575), 2811 states have internal predecessors, (3575), 369 states have call successors, (369), 293 states have call predecessors, (369), 365 states have return successors, (527), 408 states have call predecessors, (527), 368 states have call successors, (527) [2022-02-20 19:58:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:29,210 INFO L93 Difference]: Finished difference Result 3783 states and 4787 transitions. [2022-02-20 19:58:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3783 states and 4787 transitions. [2022-02-20 19:58:29,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:29,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:29,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 3506 states, 2770 states have (on average 1.2906137184115523) internal successors, (3575), 2811 states have internal predecessors, (3575), 369 states have call successors, (369), 293 states have call predecessors, (369), 365 states have return successors, (527), 408 states have call predecessors, (527), 368 states have call successors, (527) Second operand 3783 states. [2022-02-20 19:58:29,225 INFO L87 Difference]: Start difference. First operand has 3506 states, 2770 states have (on average 1.2906137184115523) internal successors, (3575), 2811 states have internal predecessors, (3575), 369 states have call successors, (369), 293 states have call predecessors, (369), 365 states have return successors, (527), 408 states have call predecessors, (527), 368 states have call successors, (527) Second operand 3783 states. [2022-02-20 19:58:29,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:29,645 INFO L93 Difference]: Finished difference Result 3783 states and 4787 transitions. [2022-02-20 19:58:29,645 INFO L276 IsEmpty]: Start isEmpty. Operand 3783 states and 4787 transitions. [2022-02-20 19:58:29,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:29,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:29,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:29,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:29,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3506 states, 2770 states have (on average 1.2906137184115523) internal successors, (3575), 2811 states have internal predecessors, (3575), 369 states have call successors, (369), 293 states have call predecessors, (369), 365 states have return successors, (527), 408 states have call predecessors, (527), 368 states have call successors, (527) [2022-02-20 19:58:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3506 states to 3506 states and 4471 transitions. [2022-02-20 19:58:30,195 INFO L78 Accepts]: Start accepts. Automaton has 3506 states and 4471 transitions. Word has length 73 [2022-02-20 19:58:30,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:30,195 INFO L470 AbstractCegarLoop]: Abstraction has 3506 states and 4471 transitions. [2022-02-20 19:58:30,196 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:58:30,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3506 states and 4471 transitions. [2022-02-20 19:58:30,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 19:58:30,197 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:30,197 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:58:30,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:58:30,197 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:30,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:30,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1739934738, now seen corresponding path program 1 times [2022-02-20 19:58:30,197 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:30,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93766605] [2022-02-20 19:58:30,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:30,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:30,208 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,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {78595#(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); {78553#true} is VALID [2022-02-20 19:58:30,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:30,261 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78553#true} {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1660#return; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {78596#(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); {78553#true} is VALID [2022-02-20 19:58:30,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {78553#true} assume !(0 == ~q_write_ev~0); {78553#true} is VALID [2022-02-20 19:58:30,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:30,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78553#true} {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1662#return; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {78553#true} havoc ~__retres1~0; {78553#true} is VALID [2022-02-20 19:58:30,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {78553#true} assume !(1 == ~p_dw_pc~0); {78553#true} is VALID [2022-02-20 19:58:30,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {78553#true} ~__retres1~0 := 0; {78553#true} is VALID [2022-02-20 19:58:30,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {78553#true} #res := ~__retres1~0; {78553#true} is VALID [2022-02-20 19:58:30,285 INFO L290 TraceCheckUtils]: 4: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:30,285 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {78553#true} {78553#true} #1656#return; {78553#true} is VALID [2022-02-20 19:58:30,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {78553#true} havoc ~__retres1~1; {78553#true} is VALID [2022-02-20 19:58:30,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {78553#true} assume !(1 == ~c_dr_pc~0); {78553#true} is VALID [2022-02-20 19:58:30,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {78553#true} ~__retres1~1 := 0; {78553#true} is VALID [2022-02-20 19:58:30,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {78553#true} #res := ~__retres1~1; {78553#true} is VALID [2022-02-20 19:58:30,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:30,290 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {78553#true} {78553#true} #1658#return; {78553#true} is VALID [2022-02-20 19:58:30,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {78597#(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; {78553#true} is VALID [2022-02-20 19:58:30,290 INFO L272 TraceCheckUtils]: 1: Hoare triple {78553#true} call #t~ret8 := is_do_write_p_triggered(); {78553#true} is VALID [2022-02-20 19:58:30,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {78553#true} havoc ~__retres1~0; {78553#true} is VALID [2022-02-20 19:58:30,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {78553#true} assume !(1 == ~p_dw_pc~0); {78553#true} is VALID [2022-02-20 19:58:30,291 INFO L290 TraceCheckUtils]: 4: Hoare triple {78553#true} ~__retres1~0 := 0; {78553#true} is VALID [2022-02-20 19:58:30,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {78553#true} #res := ~__retres1~0; {78553#true} is VALID [2022-02-20 19:58:30,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:30,291 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {78553#true} {78553#true} #1656#return; {78553#true} is VALID [2022-02-20 19:58:30,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {78553#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {78553#true} is VALID [2022-02-20 19:58:30,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {78553#true} assume !(0 != ~tmp~1); {78553#true} is VALID [2022-02-20 19:58:30,291 INFO L272 TraceCheckUtils]: 10: Hoare triple {78553#true} call #t~ret9 := is_do_read_c_triggered(); {78553#true} is VALID [2022-02-20 19:58:30,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {78553#true} havoc ~__retres1~1; {78553#true} is VALID [2022-02-20 19:58:30,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {78553#true} assume !(1 == ~c_dr_pc~0); {78553#true} is VALID [2022-02-20 19:58:30,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {78553#true} ~__retres1~1 := 0; {78553#true} is VALID [2022-02-20 19:58:30,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {78553#true} #res := ~__retres1~1; {78553#true} is VALID [2022-02-20 19:58:30,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:30,292 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {78553#true} {78553#true} #1658#return; {78553#true} is VALID [2022-02-20 19:58:30,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {78553#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {78553#true} is VALID [2022-02-20 19:58:30,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {78553#true} assume !(0 != ~tmp___0~1); {78553#true} is VALID [2022-02-20 19:58:30,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:30,293 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {78553#true} {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1664#return; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {78596#(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); {78553#true} is VALID [2022-02-20 19:58:30,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {78553#true} assume !(1 == ~q_write_ev~0); {78553#true} is VALID [2022-02-20 19:58:30,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:30,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78553#true} {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1666#return; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {78553#true} havoc ~__retres1~2; {78553#true} is VALID [2022-02-20 19:58:30,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {78553#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {78553#true} is VALID [2022-02-20 19:58:30,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {78553#true} #res := ~__retres1~2; {78553#true} is VALID [2022-02-20 19:58:30,306 INFO L290 TraceCheckUtils]: 3: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:30,306 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {78553#true} {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1668#return; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {78553#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {78553#true} is VALID [2022-02-20 19:58:30,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {78553#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {78553#true} is VALID [2022-02-20 19:58:30,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {78553#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#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; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {78555#(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; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {78595#(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,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {78595#(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); {78553#true} is VALID [2022-02-20 19:58:30,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:30,308 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {78553#true} {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1660#return; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,310 INFO L272 TraceCheckUtils]: 12: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {78596#(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,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {78596#(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); {78553#true} is VALID [2022-02-20 19:58:30,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {78553#true} assume !(0 == ~q_write_ev~0); {78553#true} is VALID [2022-02-20 19:58:30,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:30,310 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {78553#true} {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1662#return; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,311 INFO L272 TraceCheckUtils]: 17: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {78597#(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,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {78597#(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; {78553#true} is VALID [2022-02-20 19:58:30,311 INFO L272 TraceCheckUtils]: 19: Hoare triple {78553#true} call #t~ret8 := is_do_write_p_triggered(); {78553#true} is VALID [2022-02-20 19:58:30,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {78553#true} havoc ~__retres1~0; {78553#true} is VALID [2022-02-20 19:58:30,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {78553#true} assume !(1 == ~p_dw_pc~0); {78553#true} is VALID [2022-02-20 19:58:30,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {78553#true} ~__retres1~0 := 0; {78553#true} is VALID [2022-02-20 19:58:30,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {78553#true} #res := ~__retres1~0; {78553#true} is VALID [2022-02-20 19:58:30,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:30,312 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {78553#true} {78553#true} #1656#return; {78553#true} is VALID [2022-02-20 19:58:30,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {78553#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {78553#true} is VALID [2022-02-20 19:58:30,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {78553#true} assume !(0 != ~tmp~1); {78553#true} is VALID [2022-02-20 19:58:30,312 INFO L272 TraceCheckUtils]: 28: Hoare triple {78553#true} call #t~ret9 := is_do_read_c_triggered(); {78553#true} is VALID [2022-02-20 19:58:30,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {78553#true} havoc ~__retres1~1; {78553#true} is VALID [2022-02-20 19:58:30,313 INFO L290 TraceCheckUtils]: 30: Hoare triple {78553#true} assume !(1 == ~c_dr_pc~0); {78553#true} is VALID [2022-02-20 19:58:30,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {78553#true} ~__retres1~1 := 0; {78553#true} is VALID [2022-02-20 19:58:30,313 INFO L290 TraceCheckUtils]: 32: Hoare triple {78553#true} #res := ~__retres1~1; {78553#true} is VALID [2022-02-20 19:58:30,313 INFO L290 TraceCheckUtils]: 33: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:30,313 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {78553#true} {78553#true} #1658#return; {78553#true} is VALID [2022-02-20 19:58:30,313 INFO L290 TraceCheckUtils]: 35: Hoare triple {78553#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {78553#true} is VALID [2022-02-20 19:58:30,313 INFO L290 TraceCheckUtils]: 36: Hoare triple {78553#true} assume !(0 != ~tmp___0~1); {78553#true} is VALID [2022-02-20 19:58:30,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:30,314 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {78553#true} {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1664#return; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,314 INFO L272 TraceCheckUtils]: 39: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {78596#(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,314 INFO L290 TraceCheckUtils]: 40: Hoare triple {78596#(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); {78553#true} is VALID [2022-02-20 19:58:30,314 INFO L290 TraceCheckUtils]: 41: Hoare triple {78553#true} assume !(1 == ~q_write_ev~0); {78553#true} is VALID [2022-02-20 19:58:30,314 INFO L290 TraceCheckUtils]: 42: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:30,315 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {78553#true} {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1666#return; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,315 INFO L290 TraceCheckUtils]: 44: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,315 INFO L290 TraceCheckUtils]: 45: Hoare triple {78555#(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; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,315 INFO L290 TraceCheckUtils]: 46: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,316 INFO L272 TraceCheckUtils]: 47: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {78553#true} is VALID [2022-02-20 19:58:30,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {78553#true} havoc ~__retres1~2; {78553#true} is VALID [2022-02-20 19:58:30,316 INFO L290 TraceCheckUtils]: 49: Hoare triple {78553#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {78553#true} is VALID [2022-02-20 19:58:30,316 INFO L290 TraceCheckUtils]: 50: Hoare triple {78553#true} #res := ~__retres1~2; {78553#true} is VALID [2022-02-20 19:58:30,316 INFO L290 TraceCheckUtils]: 51: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:30,316 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {78553#true} {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1668#return; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,317 INFO L290 TraceCheckUtils]: 53: Hoare triple {78555#(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; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,317 INFO L290 TraceCheckUtils]: 54: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,317 INFO L290 TraceCheckUtils]: 55: Hoare triple {78555#(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; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,318 INFO L290 TraceCheckUtils]: 56: Hoare triple {78555#(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; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,318 INFO L290 TraceCheckUtils]: 57: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,318 INFO L290 TraceCheckUtils]: 58: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,319 INFO L290 TraceCheckUtils]: 59: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:30,319 INFO L290 TraceCheckUtils]: 60: Hoare triple {78555#(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; {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:30,319 INFO L290 TraceCheckUtils]: 61: Hoare triple {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:30,320 INFO L290 TraceCheckUtils]: 62: Hoare triple {78593#(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; {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:30,320 INFO L290 TraceCheckUtils]: 63: Hoare triple {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:30,320 INFO L290 TraceCheckUtils]: 64: Hoare triple {78593#(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; {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:30,321 INFO L290 TraceCheckUtils]: 65: Hoare triple {78593#(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; {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:30,321 INFO L290 TraceCheckUtils]: 66: Hoare triple {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:30,321 INFO L290 TraceCheckUtils]: 67: Hoare triple {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:30,321 INFO L290 TraceCheckUtils]: 68: Hoare triple {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:30,322 INFO L290 TraceCheckUtils]: 69: Hoare triple {78593#(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; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:30,322 INFO L290 TraceCheckUtils]: 70: Hoare triple {78594#(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; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:30,323 INFO L290 TraceCheckUtils]: 71: Hoare triple {78594#(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); {78554#false} is VALID [2022-02-20 19:58:30,323 INFO L272 TraceCheckUtils]: 72: Hoare triple {78554#false} call error1(); {78554#false} is VALID [2022-02-20 19:58:30,323 INFO L290 TraceCheckUtils]: 73: Hoare triple {78554#false} assume !false; {78554#false} is VALID [2022-02-20 19:58:30,324 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:58:30,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:30,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93766605] [2022-02-20 19:58:30,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93766605] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:58:30,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508361600] [2022-02-20 19:58:30,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:30,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:58:30,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:30,326 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:58:30,332 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:58:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:58:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:30,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:58:31,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {78553#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {78553#true} is VALID [2022-02-20 19:58:31,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {78553#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {78553#true} is VALID [2022-02-20 19:58:31,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {78553#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#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; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,138 INFO L290 TraceCheckUtils]: 3: Hoare triple {78555#(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; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_req_up~0); {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,139 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1660#return; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,141 INFO L272 TraceCheckUtils]: 12: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_read_ev~0); {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_write_ev~0); {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,143 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1662#return; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,144 INFO L272 TraceCheckUtils]: 17: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~tmp~1;havoc ~tmp___0~1; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,144 INFO L272 TraceCheckUtils]: 19: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret8 := is_do_write_p_triggered(); {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~0; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~p_dw_pc~0); {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~0 := 0; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~0; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,147 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1656#return; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {78555#(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; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,147 INFO L290 TraceCheckUtils]: 27: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp~1); {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,148 INFO L272 TraceCheckUtils]: 28: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret9 := is_do_read_c_triggered(); {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,148 INFO L290 TraceCheckUtils]: 29: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~1; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,148 INFO L290 TraceCheckUtils]: 30: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~c_dr_pc~0); {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,149 INFO L290 TraceCheckUtils]: 31: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~1 := 0; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,149 INFO L290 TraceCheckUtils]: 32: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~1; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,150 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1658#return; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,150 INFO L290 TraceCheckUtils]: 35: Hoare triple {78555#(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; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,151 INFO L290 TraceCheckUtils]: 36: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp___0~1); {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,151 INFO L290 TraceCheckUtils]: 37: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,151 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1664#return; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,152 INFO L272 TraceCheckUtils]: 39: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_read_ev~0); {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,152 INFO L290 TraceCheckUtils]: 41: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_write_ev~0); {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,153 INFO L290 TraceCheckUtils]: 42: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,153 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1666#return; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,153 INFO L290 TraceCheckUtils]: 44: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,154 INFO L290 TraceCheckUtils]: 45: Hoare triple {78555#(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; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,154 INFO L290 TraceCheckUtils]: 46: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,154 INFO L272 TraceCheckUtils]: 47: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,155 INFO L290 TraceCheckUtils]: 48: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,155 INFO L290 TraceCheckUtils]: 49: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,156 INFO L290 TraceCheckUtils]: 50: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,156 INFO L290 TraceCheckUtils]: 51: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,156 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1668#return; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,157 INFO L290 TraceCheckUtils]: 53: Hoare triple {78555#(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; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,157 INFO L290 TraceCheckUtils]: 54: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,157 INFO L290 TraceCheckUtils]: 55: Hoare triple {78555#(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; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,158 INFO L290 TraceCheckUtils]: 56: Hoare triple {78555#(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; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,158 INFO L290 TraceCheckUtils]: 57: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,159 INFO L290 TraceCheckUtils]: 58: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,159 INFO L290 TraceCheckUtils]: 59: Hoare triple {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {78555#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:31,159 INFO L290 TraceCheckUtils]: 60: Hoare triple {78555#(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; {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:31,160 INFO L290 TraceCheckUtils]: 61: Hoare triple {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:31,160 INFO L290 TraceCheckUtils]: 62: Hoare triple {78593#(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; {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:31,161 INFO L290 TraceCheckUtils]: 63: Hoare triple {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:31,161 INFO L290 TraceCheckUtils]: 64: Hoare triple {78593#(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; {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:31,161 INFO L290 TraceCheckUtils]: 65: Hoare triple {78593#(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; {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:31,162 INFO L290 TraceCheckUtils]: 66: Hoare triple {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:31,162 INFO L290 TraceCheckUtils]: 67: Hoare triple {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:31,162 INFO L290 TraceCheckUtils]: 68: Hoare triple {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {78593#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:31,163 INFO L290 TraceCheckUtils]: 69: Hoare triple {78593#(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; {78820#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:31,163 INFO L290 TraceCheckUtils]: 70: Hoare triple {78820#(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; {78820#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:31,164 INFO L290 TraceCheckUtils]: 71: Hoare triple {78820#(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); {78554#false} is VALID [2022-02-20 19:58:31,164 INFO L272 TraceCheckUtils]: 72: Hoare triple {78554#false} call error1(); {78554#false} is VALID [2022-02-20 19:58:31,164 INFO L290 TraceCheckUtils]: 73: Hoare triple {78554#false} assume !false; {78554#false} is VALID [2022-02-20 19:58:31,164 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:58:31,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:58:31,478 INFO L290 TraceCheckUtils]: 73: Hoare triple {78554#false} assume !false; {78554#false} is VALID [2022-02-20 19:58:31,478 INFO L272 TraceCheckUtils]: 72: Hoare triple {78554#false} call error1(); {78554#false} is VALID [2022-02-20 19:58:31,478 INFO L290 TraceCheckUtils]: 71: Hoare triple {78594#(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); {78554#false} is VALID [2022-02-20 19:58:31,479 INFO L290 TraceCheckUtils]: 70: Hoare triple {78594#(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; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,479 INFO L290 TraceCheckUtils]: 69: Hoare triple {78845#(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; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,480 INFO L290 TraceCheckUtils]: 68: Hoare triple {78845#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !(1 == ~q_free~0); {78845#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:31,482 INFO L290 TraceCheckUtils]: 67: Hoare triple {78845#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {78845#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:31,483 INFO L290 TraceCheckUtils]: 66: Hoare triple {78845#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_pc~0; {78845#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:31,483 INFO L290 TraceCheckUtils]: 65: Hoare triple {78845#(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; {78845#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:31,483 INFO L290 TraceCheckUtils]: 64: Hoare triple {78845#(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; {78845#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:31,484 INFO L290 TraceCheckUtils]: 63: Hoare triple {78845#(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; {78845#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:31,484 INFO L290 TraceCheckUtils]: 62: Hoare triple {78845#(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; {78845#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:31,484 INFO L290 TraceCheckUtils]: 61: Hoare triple {78845#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {78845#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:31,485 INFO L290 TraceCheckUtils]: 60: Hoare triple {78594#(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; {78845#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:31,485 INFO L290 TraceCheckUtils]: 59: Hoare triple {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(0 == ~q_free~0); {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,486 INFO L290 TraceCheckUtils]: 58: Hoare triple {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,486 INFO L290 TraceCheckUtils]: 57: Hoare triple {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_pc~0; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,486 INFO L290 TraceCheckUtils]: 56: Hoare triple {78594#(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; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,487 INFO L290 TraceCheckUtils]: 55: Hoare triple {78594#(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; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,487 INFO L290 TraceCheckUtils]: 54: Hoare triple {78594#(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; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,487 INFO L290 TraceCheckUtils]: 53: Hoare triple {78594#(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; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,488 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {78553#true} {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1668#return; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,488 INFO L290 TraceCheckUtils]: 51: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:31,488 INFO L290 TraceCheckUtils]: 50: Hoare triple {78553#true} #res := ~__retres1~2; {78553#true} is VALID [2022-02-20 19:58:31,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {78553#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {78553#true} is VALID [2022-02-20 19:58:31,488 INFO L290 TraceCheckUtils]: 48: Hoare triple {78553#true} havoc ~__retres1~2; {78553#true} is VALID [2022-02-20 19:58:31,488 INFO L272 TraceCheckUtils]: 47: Hoare triple {78594#(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(); {78553#true} is VALID [2022-02-20 19:58:31,489 INFO L290 TraceCheckUtils]: 46: Hoare triple {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,489 INFO L290 TraceCheckUtils]: 45: Hoare triple {78594#(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; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,489 INFO L290 TraceCheckUtils]: 44: Hoare triple {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,490 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {78553#true} {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1666#return; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,490 INFO L290 TraceCheckUtils]: 42: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:31,490 INFO L290 TraceCheckUtils]: 41: Hoare triple {78553#true} assume !(1 == ~q_write_ev~0); {78553#true} is VALID [2022-02-20 19:58:31,490 INFO L290 TraceCheckUtils]: 40: Hoare triple {78553#true} assume !(1 == ~q_read_ev~0); {78553#true} is VALID [2022-02-20 19:58:31,490 INFO L272 TraceCheckUtils]: 39: Hoare triple {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call reset_delta_events1(); {78553#true} is VALID [2022-02-20 19:58:31,490 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {78553#true} {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1664#return; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,490 INFO L290 TraceCheckUtils]: 37: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:31,491 INFO L290 TraceCheckUtils]: 36: Hoare triple {78553#true} assume !(0 != ~tmp___0~1); {78553#true} is VALID [2022-02-20 19:58:31,491 INFO L290 TraceCheckUtils]: 35: Hoare triple {78553#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {78553#true} is VALID [2022-02-20 19:58:31,491 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {78553#true} {78553#true} #1658#return; {78553#true} is VALID [2022-02-20 19:58:31,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:31,491 INFO L290 TraceCheckUtils]: 32: Hoare triple {78553#true} #res := ~__retres1~1; {78553#true} is VALID [2022-02-20 19:58:31,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {78553#true} ~__retres1~1 := 0; {78553#true} is VALID [2022-02-20 19:58:31,491 INFO L290 TraceCheckUtils]: 30: Hoare triple {78553#true} assume !(1 == ~c_dr_pc~0); {78553#true} is VALID [2022-02-20 19:58:31,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {78553#true} havoc ~__retres1~1; {78553#true} is VALID [2022-02-20 19:58:31,491 INFO L272 TraceCheckUtils]: 28: Hoare triple {78553#true} call #t~ret9 := is_do_read_c_triggered(); {78553#true} is VALID [2022-02-20 19:58:31,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {78553#true} assume !(0 != ~tmp~1); {78553#true} is VALID [2022-02-20 19:58:31,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {78553#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {78553#true} is VALID [2022-02-20 19:58:31,492 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {78553#true} {78553#true} #1656#return; {78553#true} is VALID [2022-02-20 19:58:31,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:31,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {78553#true} #res := ~__retres1~0; {78553#true} is VALID [2022-02-20 19:58:31,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {78553#true} ~__retres1~0 := 0; {78553#true} is VALID [2022-02-20 19:58:31,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {78553#true} assume !(1 == ~p_dw_pc~0); {78553#true} is VALID [2022-02-20 19:58:31,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {78553#true} havoc ~__retres1~0; {78553#true} is VALID [2022-02-20 19:58:31,492 INFO L272 TraceCheckUtils]: 19: Hoare triple {78553#true} call #t~ret8 := is_do_write_p_triggered(); {78553#true} is VALID [2022-02-20 19:58:31,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {78553#true} havoc ~tmp~1;havoc ~tmp___0~1; {78553#true} is VALID [2022-02-20 19:58:31,493 INFO L272 TraceCheckUtils]: 17: Hoare triple {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call activate_threads1(); {78553#true} is VALID [2022-02-20 19:58:31,493 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {78553#true} {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1662#return; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:31,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {78553#true} assume !(0 == ~q_write_ev~0); {78553#true} is VALID [2022-02-20 19:58:31,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {78553#true} assume !(0 == ~q_read_ev~0); {78553#true} is VALID [2022-02-20 19:58:31,493 INFO L272 TraceCheckUtils]: 12: Hoare triple {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call fire_delta_events1(); {78553#true} is VALID [2022-02-20 19:58:31,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_threads1 } true; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {78594#(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; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {78594#(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; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :begin_inline_init_threads1 } true; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,504 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {78553#true} {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1660#return; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {78553#true} assume true; {78553#true} is VALID [2022-02-20 19:58:31,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {78553#true} assume !(1 == ~q_req_up~0); {78553#true} is VALID [2022-02-20 19:58:31,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call update_channels1(); {78553#true} is VALID [2022-02-20 19:58:31,504 INFO L290 TraceCheckUtils]: 3: Hoare triple {78594#(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; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {78553#true} assume 0 != main_#t~nondet46#1;havoc main_#t~nondet46#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; {78594#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:31,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {78553#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet46#1, main_#t~ret47#1, main_#t~ret48#1;assume -2147483648 <= main_#t~nondet46#1 && main_#t~nondet46#1 <= 2147483647; {78553#true} is VALID [2022-02-20 19:58:31,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {78553#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {78553#true} is VALID [2022-02-20 19:58:31,505 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:58:31,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508361600] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:58:31,505 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:58:31,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-02-20 19:58:31,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524056895] [2022-02-20 19:58:31,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:58:31,506 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:58:31,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:31,507 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:58:31,594 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:58:31,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:58:31,595 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:31,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:58:31,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:58:31,595 INFO L87 Difference]: Start difference. First operand 3506 states and 4471 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) [2022-02-20 19:58:40,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:40,231 INFO L93 Difference]: Finished difference Result 7947 states and 9957 transitions. [2022-02-20 19:58:40,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-20 19:58:40,231 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:58:40,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 19:58:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1287 transitions. [2022-02-20 19:58:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 19:58:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1287 transitions. [2022-02-20 19:58:40,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 1287 transitions. [2022-02-20 19:58:41,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1287 edges. 1287 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:43,705 INFO L225 Difference]: With dead ends: 7947 [2022-02-20 19:58:43,705 INFO L226 Difference]: Without dead ends: 7944 [2022-02-20 19:58:43,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-02-20 19:58:43,707 INFO L933 BasicCegarLoop]: 802 mSDtfsCounter, 2633 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 1820 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2703 SdHoareTripleChecker+Valid, 2551 SdHoareTripleChecker+Invalid, 2182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 1820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:43,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2703 Valid, 2551 Invalid, 2182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 1820 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-20 19:58:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7944 states. [2022-02-20 19:58:45,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7944 to 5296. [2022-02-20 19:58:45,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:45,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7944 states. Second operand has 5296 states, 4174 states have (on average 1.281983708672736) internal successors, (5351), 4237 states have internal predecessors, (5351), 553 states have call successors, (553), 451 states have call predecessors, (553), 567 states have return successors, (805), 614 states have call predecessors, (805), 552 states have call successors, (805) [2022-02-20 19:58:45,238 INFO L74 IsIncluded]: Start isIncluded. First operand 7944 states. Second operand has 5296 states, 4174 states have (on average 1.281983708672736) internal successors, (5351), 4237 states have internal predecessors, (5351), 553 states have call successors, (553), 451 states have call predecessors, (553), 567 states have return successors, (805), 614 states have call predecessors, (805), 552 states have call successors, (805) [2022-02-20 19:58:45,244 INFO L87 Difference]: Start difference. First operand 7944 states. Second operand has 5296 states, 4174 states have (on average 1.281983708672736) internal successors, (5351), 4237 states have internal predecessors, (5351), 553 states have call successors, (553), 451 states have call predecessors, (553), 567 states have return successors, (805), 614 states have call predecessors, (805), 552 states have call successors, (805) [2022-02-20 19:58:47,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:47,058 INFO L93 Difference]: Finished difference Result 7944 states and 9943 transitions. [2022-02-20 19:58:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 7944 states and 9943 transitions. [2022-02-20 19:58:47,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:47,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:47,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 5296 states, 4174 states have (on average 1.281983708672736) internal successors, (5351), 4237 states have internal predecessors, (5351), 553 states have call successors, (553), 451 states have call predecessors, (553), 567 states have return successors, (805), 614 states have call predecessors, (805), 552 states have call successors, (805) Second operand 7944 states. [2022-02-20 19:58:47,078 INFO L87 Difference]: Start difference. First operand has 5296 states, 4174 states have (on average 1.281983708672736) internal successors, (5351), 4237 states have internal predecessors, (5351), 553 states have call successors, (553), 451 states have call predecessors, (553), 567 states have return successors, (805), 614 states have call predecessors, (805), 552 states have call successors, (805) Second operand 7944 states.