./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.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.05.cil-1.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 52de5146a3a24866d31d2076a85235f80d04004402c35cfcf3c3304704a7fec0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:56:56,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:56:56,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:56:56,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:56:56,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:56:56,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:56:56,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:56:56,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:56:56,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:56:56,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:56:56,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:56:56,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:56:56,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:56:56,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:56:56,260 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:56:56,261 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:56:56,261 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:56:56,262 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:56:56,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:56:56,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:56:56,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:56:56,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:56:56,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:56:56,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:56:56,268 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:56:56,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:56:56,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:56:56,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:56:56,270 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:56:56,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:56:56,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:56:56,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:56:56,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:56:56,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:56:56,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:56:56,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:56:56,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:56:56,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:56:56,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:56:56,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:56:56,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:56:56,275 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:56:56,288 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:56:56,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:56:56,288 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:56:56,289 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:56:56,289 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:56:56,289 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:56:56,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:56:56,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:56:56,290 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:56:56,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:56:56,290 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:56:56,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:56:56,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:56:56,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:56:56,291 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:56:56,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:56:56,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:56:56,292 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:56:56,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:56:56,292 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:56:56,292 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:56:56,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:56:56,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:56:56,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:56:56,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:56:56,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:56:56,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:56:56,293 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:56:56,294 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:56:56,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:56:56,294 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:56:56,294 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:56:56,294 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:56:56,295 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 -> 52de5146a3a24866d31d2076a85235f80d04004402c35cfcf3c3304704a7fec0 [2022-02-20 19:56:56,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:56:56,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:56:56,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:56:56,492 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:56:56,492 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:56:56,493 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.05.cil-1.c [2022-02-20 19:56:56,541 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7dfd32e2/c11468a7e3194d5799cf1bcd944432d8/FLAGfd851cdcd [2022-02-20 19:56:56,889 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:56:56,896 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c [2022-02-20 19:56:56,912 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7dfd32e2/c11468a7e3194d5799cf1bcd944432d8/FLAGfd851cdcd [2022-02-20 19:56:57,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7dfd32e2/c11468a7e3194d5799cf1bcd944432d8 [2022-02-20 19:56:57,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:56:57,277 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:56:57,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:56:57,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:56:57,282 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:56:57,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:56:57" (1/1) ... [2022-02-20 19:56:57,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33eecabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:57, skipping insertion in model container [2022-02-20 19:56:57,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:56:57" (1/1) ... [2022-02-20 19:56:57,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:56:57,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:56:57,459 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.05.cil-1.c[914,927] [2022-02-20 19:56:57,498 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.05.cil-1.c[7115,7128] [2022-02-20 19:56:57,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:56:57,561 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:56:57,568 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.05.cil-1.c[914,927] [2022-02-20 19:56:57,583 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.05.cil-1.c[7115,7128] [2022-02-20 19:56:57,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:56:57,619 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:56:57,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:57 WrapperNode [2022-02-20 19:56:57,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:56:57,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:56:57,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:56:57,621 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:56:57,625 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:56:57" (1/1) ... [2022-02-20 19:56:57,633 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:56:57" (1/1) ... [2022-02-20 19:56:57,679 INFO L137 Inliner]: procedures = 63, calls = 72, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 634 [2022-02-20 19:56:57,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:56:57,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:56:57,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:56:57,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:56:57,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:57" (1/1) ... [2022-02-20 19:56:57,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:57" (1/1) ... [2022-02-20 19:56:57,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:57" (1/1) ... [2022-02-20 19:56:57,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:57" (1/1) ... [2022-02-20 19:56:57,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:57" (1/1) ... [2022-02-20 19:56:57,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:57" (1/1) ... [2022-02-20 19:56:57,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:57" (1/1) ... [2022-02-20 19:56:57,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:56:57,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:56:57,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:56:57,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:56:57,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:57" (1/1) ... [2022-02-20 19:56:57,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:56:57,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:56:57,763 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:56:57,765 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:56:57,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:56:57,794 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:56:57,794 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:56:57,795 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:56:57,795 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:56:57,796 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:56:57,799 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:56:57,799 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:56:57,799 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:56:57,799 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:56:57,800 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:56:57,800 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:56:57,800 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:56:57,800 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:56:57,800 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:56:57,801 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:56:57,801 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:56:57,801 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:56:57,801 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:56:57,801 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:56:57,802 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:56:57,802 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:56:57,802 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:56:57,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:56:57,802 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:56:57,802 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:56:57,802 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:56:57,802 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:56:57,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:56:57,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:56:57,803 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:56:57,803 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:56:57,873 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:56:57,874 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:56:58,337 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:56:58,345 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:56:58,346 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-02-20 19:56:58,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:56:58 BoogieIcfgContainer [2022-02-20 19:56:58,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:56:58,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:56:58,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:56:58,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:56:58,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:56:57" (1/3) ... [2022-02-20 19:56:58,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee96c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:56:58, skipping insertion in model container [2022-02-20 19:56:58,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:57" (2/3) ... [2022-02-20 19:56:58,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ee96c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:56:58, skipping insertion in model container [2022-02-20 19:56:58,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:56:58" (3/3) ... [2022-02-20 19:56:58,361 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.05.cil-1.c [2022-02-20 19:56:58,364 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:56:58,365 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:56:58,397 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:56:58,401 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:56:58,402 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:56:58,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 308 states, 258 states have (on average 1.5968992248062015) internal successors, (412), 264 states have internal predecessors, (412), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:56:58,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:58,442 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:58,443 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:56:58,443 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:58,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:58,447 INFO L85 PathProgramCache]: Analyzing trace with hash -2128266520, now seen corresponding path program 1 times [2022-02-20 19:56:58,454 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:58,454 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666561933] [2022-02-20 19:56:58,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:58,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {351#(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); {311#true} is VALID [2022-02-20 19:56:58,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {311#true} assume true; {311#true} is VALID [2022-02-20 19:56:58,708 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {311#true} {313#(= 1 ~c_dr_i~0)} #1100#return; {313#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 19:56:58,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {352#(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; {311#true} is VALID [2022-02-20 19:56:58,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {311#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {311#true} is VALID [2022-02-20 19:56:58,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {311#true} assume true; {311#true} is VALID [2022-02-20 19:56:58,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {311#true} {312#false} #1102#return; {312#false} is VALID [2022-02-20 19:56:58,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {311#true} havoc ~__retres1~0; {311#true} is VALID [2022-02-20 19:56:58,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {311#true} assume !(1 == ~p_dw_pc~0); {311#true} is VALID [2022-02-20 19:56:58,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {311#true} ~__retres1~0 := 0; {311#true} is VALID [2022-02-20 19:56:58,754 INFO L290 TraceCheckUtils]: 3: Hoare triple {311#true} #res := ~__retres1~0; {311#true} is VALID [2022-02-20 19:56:58,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {311#true} assume true; {311#true} is VALID [2022-02-20 19:56:58,762 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {311#true} {311#true} #1096#return; {311#true} is VALID [2022-02-20 19:56:58,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {311#true} havoc ~__retres1~1; {311#true} is VALID [2022-02-20 19:56:58,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {311#true} assume !(1 == ~c_dr_pc~0); {311#true} is VALID [2022-02-20 19:56:58,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {311#true} ~__retres1~1 := 0; {311#true} is VALID [2022-02-20 19:56:58,778 INFO L290 TraceCheckUtils]: 3: Hoare triple {311#true} #res := ~__retres1~1; {311#true} is VALID [2022-02-20 19:56:58,778 INFO L290 TraceCheckUtils]: 4: Hoare triple {311#true} assume true; {311#true} is VALID [2022-02-20 19:56:58,779 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {311#true} {311#true} #1098#return; {311#true} is VALID [2022-02-20 19:56:58,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {353#(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; {311#true} is VALID [2022-02-20 19:56:58,779 INFO L272 TraceCheckUtils]: 1: Hoare triple {311#true} call #t~ret8 := is_do_write_p_triggered(); {311#true} is VALID [2022-02-20 19:56:58,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {311#true} havoc ~__retres1~0; {311#true} is VALID [2022-02-20 19:56:58,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {311#true} assume !(1 == ~p_dw_pc~0); {311#true} is VALID [2022-02-20 19:56:58,780 INFO L290 TraceCheckUtils]: 4: Hoare triple {311#true} ~__retres1~0 := 0; {311#true} is VALID [2022-02-20 19:56:58,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {311#true} #res := ~__retres1~0; {311#true} is VALID [2022-02-20 19:56:58,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {311#true} assume true; {311#true} is VALID [2022-02-20 19:56:58,781 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {311#true} {311#true} #1096#return; {311#true} is VALID [2022-02-20 19:56:58,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {311#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {311#true} is VALID [2022-02-20 19:56:58,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {311#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {311#true} is VALID [2022-02-20 19:56:58,782 INFO L272 TraceCheckUtils]: 10: Hoare triple {311#true} call #t~ret9 := is_do_read_c_triggered(); {311#true} is VALID [2022-02-20 19:56:58,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {311#true} havoc ~__retres1~1; {311#true} is VALID [2022-02-20 19:56:58,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {311#true} assume !(1 == ~c_dr_pc~0); {311#true} is VALID [2022-02-20 19:56:58,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {311#true} ~__retres1~1 := 0; {311#true} is VALID [2022-02-20 19:56:58,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {311#true} #res := ~__retres1~1; {311#true} is VALID [2022-02-20 19:56:58,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {311#true} assume true; {311#true} is VALID [2022-02-20 19:56:58,784 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {311#true} {311#true} #1098#return; {311#true} is VALID [2022-02-20 19:56:58,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {311#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {311#true} is VALID [2022-02-20 19:56:58,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {311#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {311#true} is VALID [2022-02-20 19:56:58,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {311#true} assume true; {311#true} is VALID [2022-02-20 19:56:58,785 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {311#true} {312#false} #1104#return; {312#false} is VALID [2022-02-20 19:56:58,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {352#(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; {311#true} is VALID [2022-02-20 19:56:58,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {311#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {311#true} is VALID [2022-02-20 19:56:58,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {311#true} assume true; {311#true} is VALID [2022-02-20 19:56:58,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {311#true} {312#false} #1106#return; {312#false} is VALID [2022-02-20 19:56:58,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {311#true} havoc ~__retres1~2; {311#true} is VALID [2022-02-20 19:56:58,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {311#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {311#true} is VALID [2022-02-20 19:56:58,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {311#true} #res := ~__retres1~2; {311#true} is VALID [2022-02-20 19:56:58,812 INFO L290 TraceCheckUtils]: 3: Hoare triple {311#true} assume true; {311#true} is VALID [2022-02-20 19:56:58,812 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {311#true} {312#false} #1108#return; {312#false} is VALID [2022-02-20 19:56:58,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {311#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {311#true} is VALID [2022-02-20 19:56:58,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {311#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {311#true} is VALID [2022-02-20 19:56:58,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {311#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {313#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 19:56:58,814 INFO L290 TraceCheckUtils]: 3: Hoare triple {313#(= 1 ~c_dr_i~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~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; {313#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 19:56:58,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {313#(= 1 ~c_dr_i~0)} call update_channels1(); {351#(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:56:58,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {351#(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); {311#true} is VALID [2022-02-20 19:56:58,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {311#true} assume true; {311#true} is VALID [2022-02-20 19:56:58,818 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {311#true} {313#(= 1 ~c_dr_i~0)} #1100#return; {313#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 19:56:58,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {313#(= 1 ~c_dr_i~0)} assume { :begin_inline_init_threads1 } true; {313#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 19:56:58,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {313#(= 1 ~c_dr_i~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {313#(= 1 ~c_dr_i~0)} is VALID [2022-02-20 19:56:58,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {313#(= 1 ~c_dr_i~0)} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {312#false} is VALID [2022-02-20 19:56:58,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {312#false} assume { :end_inline_init_threads1 } true; {312#false} is VALID [2022-02-20 19:56:58,819 INFO L272 TraceCheckUtils]: 12: Hoare triple {312#false} call fire_delta_events1(); {352#(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:56:58,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {352#(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; {311#true} is VALID [2022-02-20 19:56:58,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {311#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {311#true} is VALID [2022-02-20 19:56:58,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {311#true} assume true; {311#true} is VALID [2022-02-20 19:56:58,820 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {311#true} {312#false} #1102#return; {312#false} is VALID [2022-02-20 19:56:58,820 INFO L272 TraceCheckUtils]: 17: Hoare triple {312#false} call activate_threads1(); {353#(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:56:58,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {353#(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; {311#true} is VALID [2022-02-20 19:56:58,821 INFO L272 TraceCheckUtils]: 19: Hoare triple {311#true} call #t~ret8 := is_do_write_p_triggered(); {311#true} is VALID [2022-02-20 19:56:58,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {311#true} havoc ~__retres1~0; {311#true} is VALID [2022-02-20 19:56:58,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {311#true} assume !(1 == ~p_dw_pc~0); {311#true} is VALID [2022-02-20 19:56:58,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {311#true} ~__retres1~0 := 0; {311#true} is VALID [2022-02-20 19:56:58,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {311#true} #res := ~__retres1~0; {311#true} is VALID [2022-02-20 19:56:58,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {311#true} assume true; {311#true} is VALID [2022-02-20 19:56:58,822 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {311#true} {311#true} #1096#return; {311#true} is VALID [2022-02-20 19:56:58,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {311#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {311#true} is VALID [2022-02-20 19:56:58,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {311#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {311#true} is VALID [2022-02-20 19:56:58,822 INFO L272 TraceCheckUtils]: 28: Hoare triple {311#true} call #t~ret9 := is_do_read_c_triggered(); {311#true} is VALID [2022-02-20 19:56:58,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {311#true} havoc ~__retres1~1; {311#true} is VALID [2022-02-20 19:56:58,825 INFO L290 TraceCheckUtils]: 30: Hoare triple {311#true} assume !(1 == ~c_dr_pc~0); {311#true} is VALID [2022-02-20 19:56:58,825 INFO L290 TraceCheckUtils]: 31: Hoare triple {311#true} ~__retres1~1 := 0; {311#true} is VALID [2022-02-20 19:56:58,825 INFO L290 TraceCheckUtils]: 32: Hoare triple {311#true} #res := ~__retres1~1; {311#true} is VALID [2022-02-20 19:56:58,825 INFO L290 TraceCheckUtils]: 33: Hoare triple {311#true} assume true; {311#true} is VALID [2022-02-20 19:56:58,825 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {311#true} {311#true} #1098#return; {311#true} is VALID [2022-02-20 19:56:58,826 INFO L290 TraceCheckUtils]: 35: Hoare triple {311#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {311#true} is VALID [2022-02-20 19:56:58,826 INFO L290 TraceCheckUtils]: 36: Hoare triple {311#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {311#true} is VALID [2022-02-20 19:56:58,826 INFO L290 TraceCheckUtils]: 37: Hoare triple {311#true} assume true; {311#true} is VALID [2022-02-20 19:56:58,826 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {311#true} {312#false} #1104#return; {312#false} is VALID [2022-02-20 19:56:58,826 INFO L272 TraceCheckUtils]: 39: Hoare triple {312#false} call reset_delta_events1(); {352#(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:56:58,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {352#(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; {311#true} is VALID [2022-02-20 19:56:58,827 INFO L290 TraceCheckUtils]: 41: Hoare triple {311#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {311#true} is VALID [2022-02-20 19:56:58,827 INFO L290 TraceCheckUtils]: 42: Hoare triple {311#true} assume true; {311#true} is VALID [2022-02-20 19:56:58,827 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {311#true} {312#false} #1106#return; {312#false} is VALID [2022-02-20 19:56:58,827 INFO L290 TraceCheckUtils]: 44: Hoare triple {312#false} assume !false; {312#false} is VALID [2022-02-20 19:56:58,827 INFO L290 TraceCheckUtils]: 45: Hoare triple {312#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; {312#false} is VALID [2022-02-20 19:56:58,828 INFO L290 TraceCheckUtils]: 46: Hoare triple {312#false} assume !false; {312#false} is VALID [2022-02-20 19:56:58,828 INFO L272 TraceCheckUtils]: 47: Hoare triple {312#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {311#true} is VALID [2022-02-20 19:56:58,828 INFO L290 TraceCheckUtils]: 48: Hoare triple {311#true} havoc ~__retres1~2; {311#true} is VALID [2022-02-20 19:56:58,828 INFO L290 TraceCheckUtils]: 49: Hoare triple {311#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {311#true} is VALID [2022-02-20 19:56:58,828 INFO L290 TraceCheckUtils]: 50: Hoare triple {311#true} #res := ~__retres1~2; {311#true} is VALID [2022-02-20 19:56:58,829 INFO L290 TraceCheckUtils]: 51: Hoare triple {311#true} assume true; {311#true} is VALID [2022-02-20 19:56:58,829 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {311#true} {312#false} #1108#return; {312#false} is VALID [2022-02-20 19:56:58,830 INFO L290 TraceCheckUtils]: 53: Hoare triple {312#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; {312#false} is VALID [2022-02-20 19:56:58,830 INFO L290 TraceCheckUtils]: 54: Hoare triple {312#false} assume 0 != eval1_~tmp___1~0#1; {312#false} is VALID [2022-02-20 19:56:58,831 INFO L290 TraceCheckUtils]: 55: Hoare triple {312#false} assume !(0 == ~p_dw_st~0); {312#false} is VALID [2022-02-20 19:56:58,831 INFO L290 TraceCheckUtils]: 56: Hoare triple {312#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; {312#false} is VALID [2022-02-20 19:56:58,831 INFO L290 TraceCheckUtils]: 57: Hoare triple {312#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; {312#false} is VALID [2022-02-20 19:56:58,831 INFO L290 TraceCheckUtils]: 58: Hoare triple {312#false} assume 0 == ~c_dr_pc~0; {312#false} is VALID [2022-02-20 19:56:58,832 INFO L290 TraceCheckUtils]: 59: Hoare triple {312#false} assume !false; {312#false} is VALID [2022-02-20 19:56:58,833 INFO L290 TraceCheckUtils]: 60: Hoare triple {312#false} assume !(1 == ~q_free~0); {312#false} is VALID [2022-02-20 19:56:58,833 INFO L290 TraceCheckUtils]: 61: Hoare triple {312#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; {312#false} is VALID [2022-02-20 19:56:58,833 INFO L290 TraceCheckUtils]: 62: Hoare triple {312#false} assume !(~p_last_write~0 == ~c_last_read~0); {312#false} is VALID [2022-02-20 19:56:58,833 INFO L272 TraceCheckUtils]: 63: Hoare triple {312#false} call error1(); {312#false} is VALID [2022-02-20 19:56:58,833 INFO L290 TraceCheckUtils]: 64: Hoare triple {312#false} assume !false; {312#false} is VALID [2022-02-20 19:56:58,834 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:56:58,835 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:58,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666561933] [2022-02-20 19:56:58,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666561933] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:58,836 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:58,836 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:56:58,837 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214357781] [2022-02-20 19:56:58,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:58,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:56:58,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:58,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:58,897 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:56:58,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:56:58,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:58,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:56:58,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:56:58,920 INFO L87 Difference]: Start difference. First operand has 308 states, 258 states have (on average 1.5968992248062015) internal successors, (412), 264 states have internal predecessors, (412), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:00,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:00,282 INFO L93 Difference]: Finished difference Result 613 states and 949 transitions. [2022-02-20 19:57:00,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 19:57:00,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:00,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:00,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 949 transitions. [2022-02-20 19:57:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 949 transitions. [2022-02-20 19:57:00,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 949 transitions. [2022-02-20 19:57:00,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 949 edges. 949 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:00,917 INFO L225 Difference]: With dead ends: 613 [2022-02-20 19:57:00,918 INFO L226 Difference]: Without dead ends: 316 [2022-02-20 19:57:00,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:57:00,923 INFO L933 BasicCegarLoop]: 443 mSDtfsCounter, 472 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:00,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [482 Valid, 1200 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:57:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-02-20 19:57:00,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 298. [2022-02-20 19:57:00,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:00,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 316 states. Second operand has 298 states, 250 states have (on average 1.5) internal successors, (375), 254 states have internal predecessors, (375), 33 states have call successors, (33), 14 states have call predecessors, (33), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 19:57:00,963 INFO L74 IsIncluded]: Start isIncluded. First operand 316 states. Second operand has 298 states, 250 states have (on average 1.5) internal successors, (375), 254 states have internal predecessors, (375), 33 states have call successors, (33), 14 states have call predecessors, (33), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 19:57:00,964 INFO L87 Difference]: Start difference. First operand 316 states. Second operand has 298 states, 250 states have (on average 1.5) internal successors, (375), 254 states have internal predecessors, (375), 33 states have call successors, (33), 14 states have call predecessors, (33), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 19:57:00,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:00,977 INFO L93 Difference]: Finished difference Result 316 states and 467 transitions. [2022-02-20 19:57:00,977 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 467 transitions. [2022-02-20 19:57:00,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:00,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:00,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 298 states, 250 states have (on average 1.5) internal successors, (375), 254 states have internal predecessors, (375), 33 states have call successors, (33), 14 states have call predecessors, (33), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 316 states. [2022-02-20 19:57:00,981 INFO L87 Difference]: Start difference. First operand has 298 states, 250 states have (on average 1.5) internal successors, (375), 254 states have internal predecessors, (375), 33 states have call successors, (33), 14 states have call predecessors, (33), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 316 states. [2022-02-20 19:57:00,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:00,992 INFO L93 Difference]: Finished difference Result 316 states and 467 transitions. [2022-02-20 19:57:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 467 transitions. [2022-02-20 19:57:00,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:00,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:00,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:00,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:00,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 250 states have (on average 1.5) internal successors, (375), 254 states have internal predecessors, (375), 33 states have call successors, (33), 14 states have call predecessors, (33), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 19:57:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 439 transitions. [2022-02-20 19:57:01,005 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 439 transitions. Word has length 65 [2022-02-20 19:57:01,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:01,005 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 439 transitions. [2022-02-20 19:57:01,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:01,006 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 439 transitions. [2022-02-20 19:57:01,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:01,007 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:01,007 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:01,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:57:01,008 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:01,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:01,008 INFO L85 PathProgramCache]: Analyzing trace with hash 779915366, now seen corresponding path program 1 times [2022-02-20 19:57:01,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:01,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017874306] [2022-02-20 19:57:01,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:01,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {2277#(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); {2278#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {2278#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {2278#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2278#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {2239#(= ~q_read_ev~0 2)} #1100#return; {2239#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:01,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {2279#(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; {2280#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:01,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {2280#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2280#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:01,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {2280#(= |old(~q_read_ev~0)| 0)} assume true; {2280#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:01,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2280#(= |old(~q_read_ev~0)| 0)} {2239#(= ~q_read_ev~0 2)} #1102#return; {2238#false} is VALID [2022-02-20 19:57:01,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {2237#true} havoc ~__retres1~0; {2237#true} is VALID [2022-02-20 19:57:01,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {2237#true} assume !(1 == ~p_dw_pc~0); {2237#true} is VALID [2022-02-20 19:57:01,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {2237#true} ~__retres1~0 := 0; {2237#true} is VALID [2022-02-20 19:57:01,098 INFO L290 TraceCheckUtils]: 3: Hoare triple {2237#true} #res := ~__retres1~0; {2237#true} is VALID [2022-02-20 19:57:01,099 INFO L290 TraceCheckUtils]: 4: Hoare triple {2237#true} assume true; {2237#true} is VALID [2022-02-20 19:57:01,099 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2237#true} {2237#true} #1096#return; {2237#true} is VALID [2022-02-20 19:57:01,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {2237#true} havoc ~__retres1~1; {2237#true} is VALID [2022-02-20 19:57:01,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {2237#true} assume !(1 == ~c_dr_pc~0); {2237#true} is VALID [2022-02-20 19:57:01,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {2237#true} ~__retres1~1 := 0; {2237#true} is VALID [2022-02-20 19:57:01,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {2237#true} #res := ~__retres1~1; {2237#true} is VALID [2022-02-20 19:57:01,102 INFO L290 TraceCheckUtils]: 4: Hoare triple {2237#true} assume true; {2237#true} is VALID [2022-02-20 19:57:01,102 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2237#true} {2237#true} #1098#return; {2237#true} is VALID [2022-02-20 19:57:01,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {2281#(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; {2237#true} is VALID [2022-02-20 19:57:01,102 INFO L272 TraceCheckUtils]: 1: Hoare triple {2237#true} call #t~ret8 := is_do_write_p_triggered(); {2237#true} is VALID [2022-02-20 19:57:01,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {2237#true} havoc ~__retres1~0; {2237#true} is VALID [2022-02-20 19:57:01,103 INFO L290 TraceCheckUtils]: 3: Hoare triple {2237#true} assume !(1 == ~p_dw_pc~0); {2237#true} is VALID [2022-02-20 19:57:01,103 INFO L290 TraceCheckUtils]: 4: Hoare triple {2237#true} ~__retres1~0 := 0; {2237#true} is VALID [2022-02-20 19:57:01,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {2237#true} #res := ~__retres1~0; {2237#true} is VALID [2022-02-20 19:57:01,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {2237#true} assume true; {2237#true} is VALID [2022-02-20 19:57:01,103 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2237#true} {2237#true} #1096#return; {2237#true} is VALID [2022-02-20 19:57:01,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {2237#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2237#true} is VALID [2022-02-20 19:57:01,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {2237#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2237#true} is VALID [2022-02-20 19:57:01,104 INFO L272 TraceCheckUtils]: 10: Hoare triple {2237#true} call #t~ret9 := is_do_read_c_triggered(); {2237#true} is VALID [2022-02-20 19:57:01,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {2237#true} havoc ~__retres1~1; {2237#true} is VALID [2022-02-20 19:57:01,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {2237#true} assume !(1 == ~c_dr_pc~0); {2237#true} is VALID [2022-02-20 19:57:01,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {2237#true} ~__retres1~1 := 0; {2237#true} is VALID [2022-02-20 19:57:01,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {2237#true} #res := ~__retres1~1; {2237#true} is VALID [2022-02-20 19:57:01,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {2237#true} assume true; {2237#true} is VALID [2022-02-20 19:57:01,105 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2237#true} {2237#true} #1098#return; {2237#true} is VALID [2022-02-20 19:57:01,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {2237#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2237#true} is VALID [2022-02-20 19:57:01,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {2237#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2237#true} is VALID [2022-02-20 19:57:01,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {2237#true} assume true; {2237#true} is VALID [2022-02-20 19:57:01,105 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2237#true} {2238#false} #1104#return; {2238#false} is VALID [2022-02-20 19:57:01,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {2279#(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; {2237#true} is VALID [2022-02-20 19:57:01,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {2237#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2237#true} is VALID [2022-02-20 19:57:01,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {2237#true} assume true; {2237#true} is VALID [2022-02-20 19:57:01,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2237#true} {2238#false} #1106#return; {2238#false} is VALID [2022-02-20 19:57:01,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:01,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {2237#true} havoc ~__retres1~2; {2237#true} is VALID [2022-02-20 19:57:01,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {2237#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2237#true} is VALID [2022-02-20 19:57:01,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {2237#true} #res := ~__retres1~2; {2237#true} is VALID [2022-02-20 19:57:01,113 INFO L290 TraceCheckUtils]: 3: Hoare triple {2237#true} assume true; {2237#true} is VALID [2022-02-20 19:57:01,113 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2237#true} {2238#false} #1108#return; {2238#false} is VALID [2022-02-20 19:57:01,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {2237#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {2237#true} is VALID [2022-02-20 19:57:01,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {2237#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {2237#true} is VALID [2022-02-20 19:57:01,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {2237#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {2239#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:01,114 INFO L290 TraceCheckUtils]: 3: Hoare triple {2239#(= ~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; {2239#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:01,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {2239#(= ~q_read_ev~0 2)} call update_channels1(); {2277#(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:01,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {2277#(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); {2278#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {2278#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {2278#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:01,116 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2278#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {2239#(= ~q_read_ev~0 2)} #1100#return; {2239#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:01,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {2239#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {2239#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:01,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {2239#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2239#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:01,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {2239#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2239#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:01,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {2239#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {2239#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:01,117 INFO L272 TraceCheckUtils]: 12: Hoare triple {2239#(= ~q_read_ev~0 2)} call fire_delta_events1(); {2279#(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:01,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {2279#(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; {2280#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:01,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {2280#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2280#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:01,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {2280#(= |old(~q_read_ev~0)| 0)} assume true; {2280#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:01,119 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2280#(= |old(~q_read_ev~0)| 0)} {2239#(= ~q_read_ev~0 2)} #1102#return; {2238#false} is VALID [2022-02-20 19:57:01,119 INFO L272 TraceCheckUtils]: 17: Hoare triple {2238#false} call activate_threads1(); {2281#(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:01,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {2281#(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; {2237#true} is VALID [2022-02-20 19:57:01,119 INFO L272 TraceCheckUtils]: 19: Hoare triple {2237#true} call #t~ret8 := is_do_write_p_triggered(); {2237#true} is VALID [2022-02-20 19:57:01,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {2237#true} havoc ~__retres1~0; {2237#true} is VALID [2022-02-20 19:57:01,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {2237#true} assume !(1 == ~p_dw_pc~0); {2237#true} is VALID [2022-02-20 19:57:01,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {2237#true} ~__retres1~0 := 0; {2237#true} is VALID [2022-02-20 19:57:01,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {2237#true} #res := ~__retres1~0; {2237#true} is VALID [2022-02-20 19:57:01,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {2237#true} assume true; {2237#true} is VALID [2022-02-20 19:57:01,120 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2237#true} {2237#true} #1096#return; {2237#true} is VALID [2022-02-20 19:57:01,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {2237#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2237#true} is VALID [2022-02-20 19:57:01,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {2237#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2237#true} is VALID [2022-02-20 19:57:01,121 INFO L272 TraceCheckUtils]: 28: Hoare triple {2237#true} call #t~ret9 := is_do_read_c_triggered(); {2237#true} is VALID [2022-02-20 19:57:01,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {2237#true} havoc ~__retres1~1; {2237#true} is VALID [2022-02-20 19:57:01,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {2237#true} assume !(1 == ~c_dr_pc~0); {2237#true} is VALID [2022-02-20 19:57:01,121 INFO L290 TraceCheckUtils]: 31: Hoare triple {2237#true} ~__retres1~1 := 0; {2237#true} is VALID [2022-02-20 19:57:01,121 INFO L290 TraceCheckUtils]: 32: Hoare triple {2237#true} #res := ~__retres1~1; {2237#true} is VALID [2022-02-20 19:57:01,121 INFO L290 TraceCheckUtils]: 33: Hoare triple {2237#true} assume true; {2237#true} is VALID [2022-02-20 19:57:01,121 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2237#true} {2237#true} #1098#return; {2237#true} is VALID [2022-02-20 19:57:01,122 INFO L290 TraceCheckUtils]: 35: Hoare triple {2237#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2237#true} is VALID [2022-02-20 19:57:01,122 INFO L290 TraceCheckUtils]: 36: Hoare triple {2237#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2237#true} is VALID [2022-02-20 19:57:01,122 INFO L290 TraceCheckUtils]: 37: Hoare triple {2237#true} assume true; {2237#true} is VALID [2022-02-20 19:57:01,122 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2237#true} {2238#false} #1104#return; {2238#false} is VALID [2022-02-20 19:57:01,122 INFO L272 TraceCheckUtils]: 39: Hoare triple {2238#false} call reset_delta_events1(); {2279#(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:01,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {2279#(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; {2237#true} is VALID [2022-02-20 19:57:01,122 INFO L290 TraceCheckUtils]: 41: Hoare triple {2237#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {2237#true} is VALID [2022-02-20 19:57:01,123 INFO L290 TraceCheckUtils]: 42: Hoare triple {2237#true} assume true; {2237#true} is VALID [2022-02-20 19:57:01,123 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2237#true} {2238#false} #1106#return; {2238#false} is VALID [2022-02-20 19:57:01,123 INFO L290 TraceCheckUtils]: 44: Hoare triple {2238#false} assume !false; {2238#false} is VALID [2022-02-20 19:57:01,123 INFO L290 TraceCheckUtils]: 45: Hoare triple {2238#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; {2238#false} is VALID [2022-02-20 19:57:01,123 INFO L290 TraceCheckUtils]: 46: Hoare triple {2238#false} assume !false; {2238#false} is VALID [2022-02-20 19:57:01,123 INFO L272 TraceCheckUtils]: 47: Hoare triple {2238#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2237#true} is VALID [2022-02-20 19:57:01,123 INFO L290 TraceCheckUtils]: 48: Hoare triple {2237#true} havoc ~__retres1~2; {2237#true} is VALID [2022-02-20 19:57:01,124 INFO L290 TraceCheckUtils]: 49: Hoare triple {2237#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2237#true} is VALID [2022-02-20 19:57:01,124 INFO L290 TraceCheckUtils]: 50: Hoare triple {2237#true} #res := ~__retres1~2; {2237#true} is VALID [2022-02-20 19:57:01,124 INFO L290 TraceCheckUtils]: 51: Hoare triple {2237#true} assume true; {2237#true} is VALID [2022-02-20 19:57:01,124 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2237#true} {2238#false} #1108#return; {2238#false} is VALID [2022-02-20 19:57:01,124 INFO L290 TraceCheckUtils]: 53: Hoare triple {2238#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; {2238#false} is VALID [2022-02-20 19:57:01,124 INFO L290 TraceCheckUtils]: 54: Hoare triple {2238#false} assume 0 != eval1_~tmp___1~0#1; {2238#false} is VALID [2022-02-20 19:57:01,124 INFO L290 TraceCheckUtils]: 55: Hoare triple {2238#false} assume !(0 == ~p_dw_st~0); {2238#false} is VALID [2022-02-20 19:57:01,125 INFO L290 TraceCheckUtils]: 56: Hoare triple {2238#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; {2238#false} is VALID [2022-02-20 19:57:01,125 INFO L290 TraceCheckUtils]: 57: Hoare triple {2238#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; {2238#false} is VALID [2022-02-20 19:57:01,125 INFO L290 TraceCheckUtils]: 58: Hoare triple {2238#false} assume 0 == ~c_dr_pc~0; {2238#false} is VALID [2022-02-20 19:57:01,125 INFO L290 TraceCheckUtils]: 59: Hoare triple {2238#false} assume !false; {2238#false} is VALID [2022-02-20 19:57:01,125 INFO L290 TraceCheckUtils]: 60: Hoare triple {2238#false} assume !(1 == ~q_free~0); {2238#false} is VALID [2022-02-20 19:57:01,125 INFO L290 TraceCheckUtils]: 61: Hoare triple {2238#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; {2238#false} is VALID [2022-02-20 19:57:01,125 INFO L290 TraceCheckUtils]: 62: Hoare triple {2238#false} assume !(~p_last_write~0 == ~c_last_read~0); {2238#false} is VALID [2022-02-20 19:57:01,126 INFO L272 TraceCheckUtils]: 63: Hoare triple {2238#false} call error1(); {2238#false} is VALID [2022-02-20 19:57:01,126 INFO L290 TraceCheckUtils]: 64: Hoare triple {2238#false} assume !false; {2238#false} is VALID [2022-02-20 19:57:01,126 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:01,126 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:01,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017874306] [2022-02-20 19:57:01,127 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017874306] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:01,127 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:01,127 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:01,127 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251846859] [2022-02-20 19:57:01,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:01,128 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:01,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:01,129 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:01,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:01,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:01,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:01,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:01,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:01,164 INFO L87 Difference]: Start difference. First operand 298 states and 439 transitions. 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:03,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:03,253 INFO L93 Difference]: Finished difference Result 521 states and 753 transitions. [2022-02-20 19:57:03,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:57:03,254 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:03,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:03,254 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:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 753 transitions. [2022-02-20 19:57:03,262 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:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 753 transitions. [2022-02-20 19:57:03,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 753 transitions. [2022-02-20 19:57:03,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 753 edges. 753 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:03,808 INFO L225 Difference]: With dead ends: 521 [2022-02-20 19:57:03,808 INFO L226 Difference]: Without dead ends: 433 [2022-02-20 19:57:03,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:57:03,813 INFO L933 BasicCegarLoop]: 444 mSDtfsCounter, 783 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:03,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [788 Valid, 1438 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:57:03,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-02-20 19:57:03,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 394. [2022-02-20 19:57:03,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:03,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 433 states. Second operand has 394 states, 326 states have (on average 1.469325153374233) internal successors, (479), 332 states have internal predecessors, (479), 44 states have call successors, (44), 21 states have call predecessors, (44), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2022-02-20 19:57:03,851 INFO L74 IsIncluded]: Start isIncluded. First operand 433 states. Second operand has 394 states, 326 states have (on average 1.469325153374233) internal successors, (479), 332 states have internal predecessors, (479), 44 states have call successors, (44), 21 states have call predecessors, (44), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2022-02-20 19:57:03,852 INFO L87 Difference]: Start difference. First operand 433 states. Second operand has 394 states, 326 states have (on average 1.469325153374233) internal successors, (479), 332 states have internal predecessors, (479), 44 states have call successors, (44), 21 states have call predecessors, (44), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2022-02-20 19:57:03,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:03,869 INFO L93 Difference]: Finished difference Result 433 states and 624 transitions. [2022-02-20 19:57:03,869 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 624 transitions. [2022-02-20 19:57:03,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:03,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:03,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 394 states, 326 states have (on average 1.469325153374233) internal successors, (479), 332 states have internal predecessors, (479), 44 states have call successors, (44), 21 states have call predecessors, (44), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) Second operand 433 states. [2022-02-20 19:57:03,874 INFO L87 Difference]: Start difference. First operand has 394 states, 326 states have (on average 1.469325153374233) internal successors, (479), 332 states have internal predecessors, (479), 44 states have call successors, (44), 21 states have call predecessors, (44), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) Second operand 433 states. [2022-02-20 19:57:03,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:03,900 INFO L93 Difference]: Finished difference Result 433 states and 624 transitions. [2022-02-20 19:57:03,900 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 624 transitions. [2022-02-20 19:57:03,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:03,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:03,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:03,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 326 states have (on average 1.469325153374233) internal successors, (479), 332 states have internal predecessors, (479), 44 states have call successors, (44), 21 states have call predecessors, (44), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2022-02-20 19:57:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 570 transitions. [2022-02-20 19:57:03,914 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 570 transitions. Word has length 65 [2022-02-20 19:57:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:03,915 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 570 transitions. [2022-02-20 19:57:03,915 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:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 570 transitions. [2022-02-20 19:57:03,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:03,918 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:03,918 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:03,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:57:03,918 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:03,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:03,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1836163290, now seen corresponding path program 1 times [2022-02-20 19:57:03,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:03,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651377808] [2022-02-20 19:57:03,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:03,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:03,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:03,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {4459#(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); {4460#(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:03,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {4460#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {4460#(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:03,992 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4460#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {4421#(= ~q_write_ev~0 ~q_read_ev~0)} #1100#return; {4421#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:03,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {4460#(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); {4461#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:04,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {4461#(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; {4462#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:04,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {4462#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {4462#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:04,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4462#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {4421#(= ~q_write_ev~0 ~q_read_ev~0)} #1102#return; {4420#false} is VALID [2022-02-20 19:57:04,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {4419#true} havoc ~__retres1~0; {4419#true} is VALID [2022-02-20 19:57:04,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {4419#true} assume !(1 == ~p_dw_pc~0); {4419#true} is VALID [2022-02-20 19:57:04,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {4419#true} ~__retres1~0 := 0; {4419#true} is VALID [2022-02-20 19:57:04,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {4419#true} #res := ~__retres1~0; {4419#true} is VALID [2022-02-20 19:57:04,027 INFO L290 TraceCheckUtils]: 4: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-02-20 19:57:04,027 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4419#true} {4419#true} #1096#return; {4419#true} is VALID [2022-02-20 19:57:04,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {4419#true} havoc ~__retres1~1; {4419#true} is VALID [2022-02-20 19:57:04,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {4419#true} assume !(1 == ~c_dr_pc~0); {4419#true} is VALID [2022-02-20 19:57:04,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {4419#true} ~__retres1~1 := 0; {4419#true} is VALID [2022-02-20 19:57:04,030 INFO L290 TraceCheckUtils]: 3: Hoare triple {4419#true} #res := ~__retres1~1; {4419#true} is VALID [2022-02-20 19:57:04,030 INFO L290 TraceCheckUtils]: 4: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-02-20 19:57:04,030 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4419#true} {4419#true} #1098#return; {4419#true} is VALID [2022-02-20 19:57:04,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {4463#(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; {4419#true} is VALID [2022-02-20 19:57:04,031 INFO L272 TraceCheckUtils]: 1: Hoare triple {4419#true} call #t~ret8 := is_do_write_p_triggered(); {4419#true} is VALID [2022-02-20 19:57:04,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {4419#true} havoc ~__retres1~0; {4419#true} is VALID [2022-02-20 19:57:04,031 INFO L290 TraceCheckUtils]: 3: Hoare triple {4419#true} assume !(1 == ~p_dw_pc~0); {4419#true} is VALID [2022-02-20 19:57:04,031 INFO L290 TraceCheckUtils]: 4: Hoare triple {4419#true} ~__retres1~0 := 0; {4419#true} is VALID [2022-02-20 19:57:04,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {4419#true} #res := ~__retres1~0; {4419#true} is VALID [2022-02-20 19:57:04,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-02-20 19:57:04,032 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4419#true} {4419#true} #1096#return; {4419#true} is VALID [2022-02-20 19:57:04,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {4419#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {4419#true} is VALID [2022-02-20 19:57:04,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {4419#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4419#true} is VALID [2022-02-20 19:57:04,032 INFO L272 TraceCheckUtils]: 10: Hoare triple {4419#true} call #t~ret9 := is_do_read_c_triggered(); {4419#true} is VALID [2022-02-20 19:57:04,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {4419#true} havoc ~__retres1~1; {4419#true} is VALID [2022-02-20 19:57:04,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {4419#true} assume !(1 == ~c_dr_pc~0); {4419#true} is VALID [2022-02-20 19:57:04,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {4419#true} ~__retres1~1 := 0; {4419#true} is VALID [2022-02-20 19:57:04,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {4419#true} #res := ~__retres1~1; {4419#true} is VALID [2022-02-20 19:57:04,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-02-20 19:57:04,033 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4419#true} {4419#true} #1098#return; {4419#true} is VALID [2022-02-20 19:57:04,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {4419#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {4419#true} is VALID [2022-02-20 19:57:04,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {4419#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4419#true} is VALID [2022-02-20 19:57:04,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-02-20 19:57:04,033 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4419#true} {4420#false} #1104#return; {4420#false} is VALID [2022-02-20 19:57:04,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {4460#(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); {4419#true} is VALID [2022-02-20 19:57:04,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {4419#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4419#true} is VALID [2022-02-20 19:57:04,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-02-20 19:57:04,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4419#true} {4420#false} #1106#return; {4420#false} is VALID [2022-02-20 19:57:04,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:04,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {4419#true} havoc ~__retres1~2; {4419#true} is VALID [2022-02-20 19:57:04,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {4419#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4419#true} is VALID [2022-02-20 19:57:04,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {4419#true} #res := ~__retres1~2; {4419#true} is VALID [2022-02-20 19:57:04,040 INFO L290 TraceCheckUtils]: 3: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-02-20 19:57:04,041 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4419#true} {4420#false} #1108#return; {4420#false} is VALID [2022-02-20 19:57:04,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {4419#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {4419#true} is VALID [2022-02-20 19:57:04,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {4419#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {4419#true} is VALID [2022-02-20 19:57:04,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {4419#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {4421#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:04,042 INFO L290 TraceCheckUtils]: 3: Hoare triple {4421#(= ~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; {4421#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:04,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {4421#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {4459#(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:04,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {4459#(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); {4460#(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:04,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {4460#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {4460#(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:04,043 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4460#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {4421#(= ~q_write_ev~0 ~q_read_ev~0)} #1100#return; {4421#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:04,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {4421#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {4421#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:04,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {4421#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {4421#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:04,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {4421#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {4421#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:04,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {4421#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {4421#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:04,045 INFO L272 TraceCheckUtils]: 12: Hoare triple {4421#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {4460#(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:04,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {4460#(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); {4461#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:04,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {4461#(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; {4462#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:04,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {4462#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {4462#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:04,046 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4462#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {4421#(= ~q_write_ev~0 ~q_read_ev~0)} #1102#return; {4420#false} is VALID [2022-02-20 19:57:04,046 INFO L272 TraceCheckUtils]: 17: Hoare triple {4420#false} call activate_threads1(); {4463#(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:04,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {4463#(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; {4419#true} is VALID [2022-02-20 19:57:04,047 INFO L272 TraceCheckUtils]: 19: Hoare triple {4419#true} call #t~ret8 := is_do_write_p_triggered(); {4419#true} is VALID [2022-02-20 19:57:04,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {4419#true} havoc ~__retres1~0; {4419#true} is VALID [2022-02-20 19:57:04,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {4419#true} assume !(1 == ~p_dw_pc~0); {4419#true} is VALID [2022-02-20 19:57:04,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {4419#true} ~__retres1~0 := 0; {4419#true} is VALID [2022-02-20 19:57:04,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {4419#true} #res := ~__retres1~0; {4419#true} is VALID [2022-02-20 19:57:04,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-02-20 19:57:04,047 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4419#true} {4419#true} #1096#return; {4419#true} is VALID [2022-02-20 19:57:04,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {4419#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {4419#true} is VALID [2022-02-20 19:57:04,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {4419#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4419#true} is VALID [2022-02-20 19:57:04,048 INFO L272 TraceCheckUtils]: 28: Hoare triple {4419#true} call #t~ret9 := is_do_read_c_triggered(); {4419#true} is VALID [2022-02-20 19:57:04,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {4419#true} havoc ~__retres1~1; {4419#true} is VALID [2022-02-20 19:57:04,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {4419#true} assume !(1 == ~c_dr_pc~0); {4419#true} is VALID [2022-02-20 19:57:04,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {4419#true} ~__retres1~1 := 0; {4419#true} is VALID [2022-02-20 19:57:04,048 INFO L290 TraceCheckUtils]: 32: Hoare triple {4419#true} #res := ~__retres1~1; {4419#true} is VALID [2022-02-20 19:57:04,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-02-20 19:57:04,048 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4419#true} {4419#true} #1098#return; {4419#true} is VALID [2022-02-20 19:57:04,049 INFO L290 TraceCheckUtils]: 35: Hoare triple {4419#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {4419#true} is VALID [2022-02-20 19:57:04,049 INFO L290 TraceCheckUtils]: 36: Hoare triple {4419#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {4419#true} is VALID [2022-02-20 19:57:04,049 INFO L290 TraceCheckUtils]: 37: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-02-20 19:57:04,049 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4419#true} {4420#false} #1104#return; {4420#false} is VALID [2022-02-20 19:57:04,049 INFO L272 TraceCheckUtils]: 39: Hoare triple {4420#false} call reset_delta_events1(); {4460#(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:04,049 INFO L290 TraceCheckUtils]: 40: Hoare triple {4460#(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); {4419#true} is VALID [2022-02-20 19:57:04,049 INFO L290 TraceCheckUtils]: 41: Hoare triple {4419#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {4419#true} is VALID [2022-02-20 19:57:04,049 INFO L290 TraceCheckUtils]: 42: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-02-20 19:57:04,050 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4419#true} {4420#false} #1106#return; {4420#false} is VALID [2022-02-20 19:57:04,050 INFO L290 TraceCheckUtils]: 44: Hoare triple {4420#false} assume !false; {4420#false} is VALID [2022-02-20 19:57:04,050 INFO L290 TraceCheckUtils]: 45: Hoare triple {4420#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; {4420#false} is VALID [2022-02-20 19:57:04,050 INFO L290 TraceCheckUtils]: 46: Hoare triple {4420#false} assume !false; {4420#false} is VALID [2022-02-20 19:57:04,050 INFO L272 TraceCheckUtils]: 47: Hoare triple {4420#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {4419#true} is VALID [2022-02-20 19:57:04,050 INFO L290 TraceCheckUtils]: 48: Hoare triple {4419#true} havoc ~__retres1~2; {4419#true} is VALID [2022-02-20 19:57:04,050 INFO L290 TraceCheckUtils]: 49: Hoare triple {4419#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4419#true} is VALID [2022-02-20 19:57:04,050 INFO L290 TraceCheckUtils]: 50: Hoare triple {4419#true} #res := ~__retres1~2; {4419#true} is VALID [2022-02-20 19:57:04,051 INFO L290 TraceCheckUtils]: 51: Hoare triple {4419#true} assume true; {4419#true} is VALID [2022-02-20 19:57:04,051 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4419#true} {4420#false} #1108#return; {4420#false} is VALID [2022-02-20 19:57:04,051 INFO L290 TraceCheckUtils]: 53: Hoare triple {4420#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; {4420#false} is VALID [2022-02-20 19:57:04,051 INFO L290 TraceCheckUtils]: 54: Hoare triple {4420#false} assume 0 != eval1_~tmp___1~0#1; {4420#false} is VALID [2022-02-20 19:57:04,051 INFO L290 TraceCheckUtils]: 55: Hoare triple {4420#false} assume !(0 == ~p_dw_st~0); {4420#false} is VALID [2022-02-20 19:57:04,051 INFO L290 TraceCheckUtils]: 56: Hoare triple {4420#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; {4420#false} is VALID [2022-02-20 19:57:04,051 INFO L290 TraceCheckUtils]: 57: Hoare triple {4420#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; {4420#false} is VALID [2022-02-20 19:57:04,051 INFO L290 TraceCheckUtils]: 58: Hoare triple {4420#false} assume 0 == ~c_dr_pc~0; {4420#false} is VALID [2022-02-20 19:57:04,052 INFO L290 TraceCheckUtils]: 59: Hoare triple {4420#false} assume !false; {4420#false} is VALID [2022-02-20 19:57:04,052 INFO L290 TraceCheckUtils]: 60: Hoare triple {4420#false} assume !(1 == ~q_free~0); {4420#false} is VALID [2022-02-20 19:57:04,052 INFO L290 TraceCheckUtils]: 61: Hoare triple {4420#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; {4420#false} is VALID [2022-02-20 19:57:04,052 INFO L290 TraceCheckUtils]: 62: Hoare triple {4420#false} assume !(~p_last_write~0 == ~c_last_read~0); {4420#false} is VALID [2022-02-20 19:57:04,052 INFO L272 TraceCheckUtils]: 63: Hoare triple {4420#false} call error1(); {4420#false} is VALID [2022-02-20 19:57:04,052 INFO L290 TraceCheckUtils]: 64: Hoare triple {4420#false} assume !false; {4420#false} is VALID [2022-02-20 19:57:04,052 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:04,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:04,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651377808] [2022-02-20 19:57:04,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651377808] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:04,053 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:04,053 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:04,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737070531] [2022-02-20 19:57:04,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:04,054 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:04,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:04,054 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:04,084 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:04,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:04,084 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:04,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:04,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:04,085 INFO L87 Difference]: Start difference. First operand 394 states and 570 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:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:06,793 INFO L93 Difference]: Finished difference Result 741 states and 1046 transitions. [2022-02-20 19:57:06,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:57:06,793 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:06,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:06,794 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:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 776 transitions. [2022-02-20 19:57:06,799 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:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 776 transitions. [2022-02-20 19:57:06,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 776 transitions. [2022-02-20 19:57:07,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 776 edges. 776 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:07,371 INFO L225 Difference]: With dead ends: 741 [2022-02-20 19:57:07,371 INFO L226 Difference]: Without dead ends: 564 [2022-02-20 19:57:07,372 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:07,372 INFO L933 BasicCegarLoop]: 500 mSDtfsCounter, 845 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:07,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [868 Valid, 1742 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:57:07,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-02-20 19:57:07,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 490. [2022-02-20 19:57:07,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:07,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 564 states. Second operand has 490 states, 402 states have (on average 1.4477611940298507) internal successors, (582), 410 states have internal predecessors, (582), 55 states have call successors, (55), 28 states have call predecessors, (55), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 19:57:07,388 INFO L74 IsIncluded]: Start isIncluded. First operand 564 states. Second operand has 490 states, 402 states have (on average 1.4477611940298507) internal successors, (582), 410 states have internal predecessors, (582), 55 states have call successors, (55), 28 states have call predecessors, (55), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 19:57:07,389 INFO L87 Difference]: Start difference. First operand 564 states. Second operand has 490 states, 402 states have (on average 1.4477611940298507) internal successors, (582), 410 states have internal predecessors, (582), 55 states have call successors, (55), 28 states have call predecessors, (55), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 19:57:07,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:07,403 INFO L93 Difference]: Finished difference Result 564 states and 806 transitions. [2022-02-20 19:57:07,403 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 806 transitions. [2022-02-20 19:57:07,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:07,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:07,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 490 states, 402 states have (on average 1.4477611940298507) internal successors, (582), 410 states have internal predecessors, (582), 55 states have call successors, (55), 28 states have call predecessors, (55), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) Second operand 564 states. [2022-02-20 19:57:07,406 INFO L87 Difference]: Start difference. First operand has 490 states, 402 states have (on average 1.4477611940298507) internal successors, (582), 410 states have internal predecessors, (582), 55 states have call successors, (55), 28 states have call predecessors, (55), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) Second operand 564 states. [2022-02-20 19:57:07,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:07,420 INFO L93 Difference]: Finished difference Result 564 states and 806 transitions. [2022-02-20 19:57:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 806 transitions. [2022-02-20 19:57:07,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:07,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:07,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:07,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 402 states have (on average 1.4477611940298507) internal successors, (582), 410 states have internal predecessors, (582), 55 states have call successors, (55), 28 states have call predecessors, (55), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) [2022-02-20 19:57:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 703 transitions. [2022-02-20 19:57:07,435 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 703 transitions. Word has length 65 [2022-02-20 19:57:07,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:07,436 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 703 transitions. [2022-02-20 19:57:07,436 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:07,436 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 703 transitions. [2022-02-20 19:57:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:07,437 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:07,437 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:07,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:57:07,437 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:07,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:07,438 INFO L85 PathProgramCache]: Analyzing trace with hash 430217896, now seen corresponding path program 1 times [2022-02-20 19:57:07,438 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:07,438 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539939000] [2022-02-20 19:57:07,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:07,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {7331#(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); {7292#true} is VALID [2022-02-20 19:57:07,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {7292#true} assume true; {7292#true} is VALID [2022-02-20 19:57:07,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7292#true} {7292#true} #1100#return; {7292#true} is VALID [2022-02-20 19:57:07,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {7332#(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); {7292#true} is VALID [2022-02-20 19:57:07,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {7292#true} assume !(0 == ~q_write_ev~0); {7292#true} is VALID [2022-02-20 19:57:07,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {7292#true} assume true; {7292#true} is VALID [2022-02-20 19:57:07,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7292#true} {7292#true} #1102#return; {7292#true} is VALID [2022-02-20 19:57:07,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {7292#true} havoc ~__retres1~0; {7292#true} is VALID [2022-02-20 19:57:07,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {7292#true} assume !(1 == ~p_dw_pc~0); {7292#true} is VALID [2022-02-20 19:57:07,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {7292#true} ~__retres1~0 := 0; {7348#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:07,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {7348#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7349#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:07,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {7349#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7349#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:07,554 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7349#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7292#true} #1096#return; {7340#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:07,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {7292#true} havoc ~__retres1~1; {7292#true} is VALID [2022-02-20 19:57:07,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {7292#true} assume !(1 == ~c_dr_pc~0); {7292#true} is VALID [2022-02-20 19:57:07,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {7292#true} ~__retres1~1 := 0; {7292#true} is VALID [2022-02-20 19:57:07,558 INFO L290 TraceCheckUtils]: 3: Hoare triple {7292#true} #res := ~__retres1~1; {7292#true} is VALID [2022-02-20 19:57:07,558 INFO L290 TraceCheckUtils]: 4: Hoare triple {7292#true} assume true; {7292#true} is VALID [2022-02-20 19:57:07,558 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7292#true} {7293#false} #1098#return; {7293#false} is VALID [2022-02-20 19:57:07,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {7333#(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; {7292#true} is VALID [2022-02-20 19:57:07,559 INFO L272 TraceCheckUtils]: 1: Hoare triple {7292#true} call #t~ret8 := is_do_write_p_triggered(); {7292#true} is VALID [2022-02-20 19:57:07,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {7292#true} havoc ~__retres1~0; {7292#true} is VALID [2022-02-20 19:57:07,559 INFO L290 TraceCheckUtils]: 3: Hoare triple {7292#true} assume !(1 == ~p_dw_pc~0); {7292#true} is VALID [2022-02-20 19:57:07,559 INFO L290 TraceCheckUtils]: 4: Hoare triple {7292#true} ~__retres1~0 := 0; {7348#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:07,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {7348#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7349#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:07,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {7349#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7349#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:07,560 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7349#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7292#true} #1096#return; {7340#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:07,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {7340#(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; {7341#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:07,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {7341#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7293#false} is VALID [2022-02-20 19:57:07,561 INFO L272 TraceCheckUtils]: 10: Hoare triple {7293#false} call #t~ret9 := is_do_read_c_triggered(); {7292#true} is VALID [2022-02-20 19:57:07,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {7292#true} havoc ~__retres1~1; {7292#true} is VALID [2022-02-20 19:57:07,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {7292#true} assume !(1 == ~c_dr_pc~0); {7292#true} is VALID [2022-02-20 19:57:07,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {7292#true} ~__retres1~1 := 0; {7292#true} is VALID [2022-02-20 19:57:07,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {7292#true} #res := ~__retres1~1; {7292#true} is VALID [2022-02-20 19:57:07,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {7292#true} assume true; {7292#true} is VALID [2022-02-20 19:57:07,562 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7292#true} {7293#false} #1098#return; {7293#false} is VALID [2022-02-20 19:57:07,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {7293#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7293#false} is VALID [2022-02-20 19:57:07,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {7293#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7293#false} is VALID [2022-02-20 19:57:07,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {7293#false} assume true; {7293#false} is VALID [2022-02-20 19:57:07,563 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7293#false} {7292#true} #1104#return; {7293#false} is VALID [2022-02-20 19:57:07,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {7332#(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); {7292#true} is VALID [2022-02-20 19:57:07,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {7292#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7292#true} is VALID [2022-02-20 19:57:07,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {7292#true} assume true; {7292#true} is VALID [2022-02-20 19:57:07,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7292#true} {7293#false} #1106#return; {7293#false} is VALID [2022-02-20 19:57:07,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:07,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {7292#true} havoc ~__retres1~2; {7292#true} is VALID [2022-02-20 19:57:07,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {7292#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7292#true} is VALID [2022-02-20 19:57:07,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {7292#true} #res := ~__retres1~2; {7292#true} is VALID [2022-02-20 19:57:07,571 INFO L290 TraceCheckUtils]: 3: Hoare triple {7292#true} assume true; {7292#true} is VALID [2022-02-20 19:57:07,571 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7292#true} {7293#false} #1108#return; {7293#false} is VALID [2022-02-20 19:57:07,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {7292#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {7292#true} is VALID [2022-02-20 19:57:07,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {7292#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {7292#true} is VALID [2022-02-20 19:57:07,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {7292#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {7292#true} is VALID [2022-02-20 19:57:07,571 INFO L290 TraceCheckUtils]: 3: Hoare triple {7292#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; {7292#true} is VALID [2022-02-20 19:57:07,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {7292#true} call update_channels1(); {7331#(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:07,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {7331#(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); {7292#true} is VALID [2022-02-20 19:57:07,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {7292#true} assume true; {7292#true} is VALID [2022-02-20 19:57:07,572 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7292#true} {7292#true} #1100#return; {7292#true} is VALID [2022-02-20 19:57:07,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {7292#true} assume { :begin_inline_init_threads1 } true; {7292#true} is VALID [2022-02-20 19:57:07,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {7292#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7292#true} is VALID [2022-02-20 19:57:07,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {7292#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7292#true} is VALID [2022-02-20 19:57:07,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {7292#true} assume { :end_inline_init_threads1 } true; {7292#true} is VALID [2022-02-20 19:57:07,573 INFO L272 TraceCheckUtils]: 12: Hoare triple {7292#true} call fire_delta_events1(); {7332#(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:07,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {7332#(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); {7292#true} is VALID [2022-02-20 19:57:07,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {7292#true} assume !(0 == ~q_write_ev~0); {7292#true} is VALID [2022-02-20 19:57:07,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {7292#true} assume true; {7292#true} is VALID [2022-02-20 19:57:07,574 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7292#true} {7292#true} #1102#return; {7292#true} is VALID [2022-02-20 19:57:07,574 INFO L272 TraceCheckUtils]: 17: Hoare triple {7292#true} call activate_threads1(); {7333#(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:07,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {7333#(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; {7292#true} is VALID [2022-02-20 19:57:07,574 INFO L272 TraceCheckUtils]: 19: Hoare triple {7292#true} call #t~ret8 := is_do_write_p_triggered(); {7292#true} is VALID [2022-02-20 19:57:07,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {7292#true} havoc ~__retres1~0; {7292#true} is VALID [2022-02-20 19:57:07,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {7292#true} assume !(1 == ~p_dw_pc~0); {7292#true} is VALID [2022-02-20 19:57:07,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {7292#true} ~__retres1~0 := 0; {7348#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:07,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {7348#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7349#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:07,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {7349#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7349#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:07,576 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7349#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7292#true} #1096#return; {7340#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:07,576 INFO L290 TraceCheckUtils]: 26: Hoare triple {7340#(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; {7341#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:07,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {7341#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7293#false} is VALID [2022-02-20 19:57:07,577 INFO L272 TraceCheckUtils]: 28: Hoare triple {7293#false} call #t~ret9 := is_do_read_c_triggered(); {7292#true} is VALID [2022-02-20 19:57:07,577 INFO L290 TraceCheckUtils]: 29: Hoare triple {7292#true} havoc ~__retres1~1; {7292#true} is VALID [2022-02-20 19:57:07,577 INFO L290 TraceCheckUtils]: 30: Hoare triple {7292#true} assume !(1 == ~c_dr_pc~0); {7292#true} is VALID [2022-02-20 19:57:07,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {7292#true} ~__retres1~1 := 0; {7292#true} is VALID [2022-02-20 19:57:07,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {7292#true} #res := ~__retres1~1; {7292#true} is VALID [2022-02-20 19:57:07,577 INFO L290 TraceCheckUtils]: 33: Hoare triple {7292#true} assume true; {7292#true} is VALID [2022-02-20 19:57:07,578 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7292#true} {7293#false} #1098#return; {7293#false} is VALID [2022-02-20 19:57:07,578 INFO L290 TraceCheckUtils]: 35: Hoare triple {7293#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7293#false} is VALID [2022-02-20 19:57:07,578 INFO L290 TraceCheckUtils]: 36: Hoare triple {7293#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7293#false} is VALID [2022-02-20 19:57:07,578 INFO L290 TraceCheckUtils]: 37: Hoare triple {7293#false} assume true; {7293#false} is VALID [2022-02-20 19:57:07,578 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7293#false} {7292#true} #1104#return; {7293#false} is VALID [2022-02-20 19:57:07,578 INFO L272 TraceCheckUtils]: 39: Hoare triple {7293#false} call reset_delta_events1(); {7332#(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:07,578 INFO L290 TraceCheckUtils]: 40: Hoare triple {7332#(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); {7292#true} is VALID [2022-02-20 19:57:07,578 INFO L290 TraceCheckUtils]: 41: Hoare triple {7292#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7292#true} is VALID [2022-02-20 19:57:07,578 INFO L290 TraceCheckUtils]: 42: Hoare triple {7292#true} assume true; {7292#true} is VALID [2022-02-20 19:57:07,579 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7292#true} {7293#false} #1106#return; {7293#false} is VALID [2022-02-20 19:57:07,579 INFO L290 TraceCheckUtils]: 44: Hoare triple {7293#false} assume !false; {7293#false} is VALID [2022-02-20 19:57:07,579 INFO L290 TraceCheckUtils]: 45: Hoare triple {7293#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; {7293#false} is VALID [2022-02-20 19:57:07,579 INFO L290 TraceCheckUtils]: 46: Hoare triple {7293#false} assume !false; {7293#false} is VALID [2022-02-20 19:57:07,579 INFO L272 TraceCheckUtils]: 47: Hoare triple {7293#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7292#true} is VALID [2022-02-20 19:57:07,579 INFO L290 TraceCheckUtils]: 48: Hoare triple {7292#true} havoc ~__retres1~2; {7292#true} is VALID [2022-02-20 19:57:07,579 INFO L290 TraceCheckUtils]: 49: Hoare triple {7292#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7292#true} is VALID [2022-02-20 19:57:07,579 INFO L290 TraceCheckUtils]: 50: Hoare triple {7292#true} #res := ~__retres1~2; {7292#true} is VALID [2022-02-20 19:57:07,580 INFO L290 TraceCheckUtils]: 51: Hoare triple {7292#true} assume true; {7292#true} is VALID [2022-02-20 19:57:07,580 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7292#true} {7293#false} #1108#return; {7293#false} is VALID [2022-02-20 19:57:07,580 INFO L290 TraceCheckUtils]: 53: Hoare triple {7293#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; {7293#false} is VALID [2022-02-20 19:57:07,580 INFO L290 TraceCheckUtils]: 54: Hoare triple {7293#false} assume 0 != eval1_~tmp___1~0#1; {7293#false} is VALID [2022-02-20 19:57:07,580 INFO L290 TraceCheckUtils]: 55: Hoare triple {7293#false} assume !(0 == ~p_dw_st~0); {7293#false} is VALID [2022-02-20 19:57:07,580 INFO L290 TraceCheckUtils]: 56: Hoare triple {7293#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; {7293#false} is VALID [2022-02-20 19:57:07,580 INFO L290 TraceCheckUtils]: 57: Hoare triple {7293#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; {7293#false} is VALID [2022-02-20 19:57:07,580 INFO L290 TraceCheckUtils]: 58: Hoare triple {7293#false} assume 0 == ~c_dr_pc~0; {7293#false} is VALID [2022-02-20 19:57:07,580 INFO L290 TraceCheckUtils]: 59: Hoare triple {7293#false} assume !false; {7293#false} is VALID [2022-02-20 19:57:07,581 INFO L290 TraceCheckUtils]: 60: Hoare triple {7293#false} assume !(1 == ~q_free~0); {7293#false} is VALID [2022-02-20 19:57:07,581 INFO L290 TraceCheckUtils]: 61: Hoare triple {7293#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; {7293#false} is VALID [2022-02-20 19:57:07,581 INFO L290 TraceCheckUtils]: 62: Hoare triple {7293#false} assume !(~p_last_write~0 == ~c_last_read~0); {7293#false} is VALID [2022-02-20 19:57:07,581 INFO L272 TraceCheckUtils]: 63: Hoare triple {7293#false} call error1(); {7293#false} is VALID [2022-02-20 19:57:07,581 INFO L290 TraceCheckUtils]: 64: Hoare triple {7293#false} assume !false; {7293#false} is VALID [2022-02-20 19:57:07,581 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:07,581 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:07,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539939000] [2022-02-20 19:57:07,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539939000] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:07,582 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:07,582 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:07,582 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829885493] [2022-02-20 19:57:07,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:07,583 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:07,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:07,583 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:07,615 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:07,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:07,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:07,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:07,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:07,616 INFO L87 Difference]: Start difference. First operand 490 states and 703 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:57:10,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:10,030 INFO L93 Difference]: Finished difference Result 791 states and 1117 transitions. [2022-02-20 19:57:10,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:10,030 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:10,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:10,032 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:57:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 595 transitions. [2022-02-20 19:57:10,036 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:57:10,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 595 transitions. [2022-02-20 19:57:10,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 595 transitions. [2022-02-20 19:57:10,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 595 edges. 595 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:10,441 INFO L225 Difference]: With dead ends: 791 [2022-02-20 19:57:10,442 INFO L226 Difference]: Without dead ends: 524 [2022-02-20 19:57:10,442 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:57:10,448 INFO L933 BasicCegarLoop]: 427 mSDtfsCounter, 370 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:10,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 1901 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:57:10,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-02-20 19:57:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 495. [2022-02-20 19:57:10,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:10,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 524 states. Second operand has 495 states, 406 states have (on average 1.438423645320197) internal successors, (584), 414 states have internal predecessors, (584), 55 states have call successors, (55), 28 states have call predecessors, (55), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) [2022-02-20 19:57:10,475 INFO L74 IsIncluded]: Start isIncluded. First operand 524 states. Second operand has 495 states, 406 states have (on average 1.438423645320197) internal successors, (584), 414 states have internal predecessors, (584), 55 states have call successors, (55), 28 states have call predecessors, (55), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) [2022-02-20 19:57:10,476 INFO L87 Difference]: Start difference. First operand 524 states. Second operand has 495 states, 406 states have (on average 1.438423645320197) internal successors, (584), 414 states have internal predecessors, (584), 55 states have call successors, (55), 28 states have call predecessors, (55), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) [2022-02-20 19:57:10,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:10,489 INFO L93 Difference]: Finished difference Result 524 states and 747 transitions. [2022-02-20 19:57:10,489 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 747 transitions. [2022-02-20 19:57:10,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:10,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:10,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 495 states, 406 states have (on average 1.438423645320197) internal successors, (584), 414 states have internal predecessors, (584), 55 states have call successors, (55), 28 states have call predecessors, (55), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) Second operand 524 states. [2022-02-20 19:57:10,492 INFO L87 Difference]: Start difference. First operand has 495 states, 406 states have (on average 1.438423645320197) internal successors, (584), 414 states have internal predecessors, (584), 55 states have call successors, (55), 28 states have call predecessors, (55), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) Second operand 524 states. [2022-02-20 19:57:10,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:10,505 INFO L93 Difference]: Finished difference Result 524 states and 747 transitions. [2022-02-20 19:57:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 747 transitions. [2022-02-20 19:57:10,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:10,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:10,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:10,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:10,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 406 states have (on average 1.438423645320197) internal successors, (584), 414 states have internal predecessors, (584), 55 states have call successors, (55), 28 states have call predecessors, (55), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) [2022-02-20 19:57:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 706 transitions. [2022-02-20 19:57:10,520 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 706 transitions. Word has length 65 [2022-02-20 19:57:10,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:10,520 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 706 transitions. [2022-02-20 19:57:10,520 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:57:10,520 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 706 transitions. [2022-02-20 19:57:10,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:10,521 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:10,522 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:10,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:57:10,522 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:10,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:10,522 INFO L85 PathProgramCache]: Analyzing trace with hash -599141402, now seen corresponding path program 1 times [2022-02-20 19:57:10,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:10,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913181152] [2022-02-20 19:57:10,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:10,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {10189#(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); {10150#true} is VALID [2022-02-20 19:57:10,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {10150#true} assume true; {10150#true} is VALID [2022-02-20 19:57:10,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10150#true} {10150#true} #1100#return; {10150#true} is VALID [2022-02-20 19:57:10,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {10190#(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); {10150#true} is VALID [2022-02-20 19:57:10,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {10150#true} assume !(0 == ~q_write_ev~0); {10150#true} is VALID [2022-02-20 19:57:10,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {10150#true} assume true; {10150#true} is VALID [2022-02-20 19:57:10,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10150#true} {10150#true} #1102#return; {10150#true} is VALID [2022-02-20 19:57:10,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {10150#true} havoc ~__retres1~0; {10150#true} is VALID [2022-02-20 19:57:10,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {10150#true} assume !(1 == ~p_dw_pc~0); {10150#true} is VALID [2022-02-20 19:57:10,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {10150#true} ~__retres1~0 := 0; {10150#true} is VALID [2022-02-20 19:57:10,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {10150#true} #res := ~__retres1~0; {10150#true} is VALID [2022-02-20 19:57:10,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {10150#true} assume true; {10150#true} is VALID [2022-02-20 19:57:10,623 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10150#true} {10150#true} #1096#return; {10150#true} is VALID [2022-02-20 19:57:10,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {10150#true} havoc ~__retres1~1; {10150#true} is VALID [2022-02-20 19:57:10,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {10150#true} assume !(1 == ~c_dr_pc~0); {10150#true} is VALID [2022-02-20 19:57:10,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {10150#true} ~__retres1~1 := 0; {10206#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:10,653 INFO L290 TraceCheckUtils]: 3: Hoare triple {10206#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10207#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:10,653 INFO L290 TraceCheckUtils]: 4: Hoare triple {10207#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10207#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:10,654 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10207#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10150#true} #1098#return; {10204#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:10,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {10191#(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; {10150#true} is VALID [2022-02-20 19:57:10,654 INFO L272 TraceCheckUtils]: 1: Hoare triple {10150#true} call #t~ret8 := is_do_write_p_triggered(); {10150#true} is VALID [2022-02-20 19:57:10,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {10150#true} havoc ~__retres1~0; {10150#true} is VALID [2022-02-20 19:57:10,654 INFO L290 TraceCheckUtils]: 3: Hoare triple {10150#true} assume !(1 == ~p_dw_pc~0); {10150#true} is VALID [2022-02-20 19:57:10,654 INFO L290 TraceCheckUtils]: 4: Hoare triple {10150#true} ~__retres1~0 := 0; {10150#true} is VALID [2022-02-20 19:57:10,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {10150#true} #res := ~__retres1~0; {10150#true} is VALID [2022-02-20 19:57:10,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {10150#true} assume true; {10150#true} is VALID [2022-02-20 19:57:10,655 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10150#true} {10150#true} #1096#return; {10150#true} is VALID [2022-02-20 19:57:10,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {10150#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10150#true} is VALID [2022-02-20 19:57:10,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {10150#true} assume !(0 != ~tmp~1); {10150#true} is VALID [2022-02-20 19:57:10,659 INFO L272 TraceCheckUtils]: 10: Hoare triple {10150#true} call #t~ret9 := is_do_read_c_triggered(); {10150#true} is VALID [2022-02-20 19:57:10,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {10150#true} havoc ~__retres1~1; {10150#true} is VALID [2022-02-20 19:57:10,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {10150#true} assume !(1 == ~c_dr_pc~0); {10150#true} is VALID [2022-02-20 19:57:10,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {10150#true} ~__retres1~1 := 0; {10206#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:10,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {10206#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10207#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:10,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {10207#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10207#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:10,661 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10207#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10150#true} #1098#return; {10204#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:10,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {10204#(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; {10205#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:10,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {10205#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10151#false} is VALID [2022-02-20 19:57:10,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {10151#false} assume true; {10151#false} is VALID [2022-02-20 19:57:10,662 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10151#false} {10150#true} #1104#return; {10151#false} is VALID [2022-02-20 19:57:10,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {10190#(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); {10150#true} is VALID [2022-02-20 19:57:10,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {10150#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10150#true} is VALID [2022-02-20 19:57:10,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {10150#true} assume true; {10150#true} is VALID [2022-02-20 19:57:10,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10150#true} {10151#false} #1106#return; {10151#false} is VALID [2022-02-20 19:57:10,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:10,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {10150#true} havoc ~__retres1~2; {10150#true} is VALID [2022-02-20 19:57:10,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {10150#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10150#true} is VALID [2022-02-20 19:57:10,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {10150#true} #res := ~__retres1~2; {10150#true} is VALID [2022-02-20 19:57:10,674 INFO L290 TraceCheckUtils]: 3: Hoare triple {10150#true} assume true; {10150#true} is VALID [2022-02-20 19:57:10,675 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10150#true} {10151#false} #1108#return; {10151#false} is VALID [2022-02-20 19:57:10,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {10150#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {10150#true} is VALID [2022-02-20 19:57:10,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {10150#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {10150#true} is VALID [2022-02-20 19:57:10,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {10150#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {10150#true} is VALID [2022-02-20 19:57:10,681 INFO L290 TraceCheckUtils]: 3: Hoare triple {10150#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; {10150#true} is VALID [2022-02-20 19:57:10,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {10150#true} call update_channels1(); {10189#(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:10,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {10189#(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); {10150#true} is VALID [2022-02-20 19:57:10,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {10150#true} assume true; {10150#true} is VALID [2022-02-20 19:57:10,684 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10150#true} {10150#true} #1100#return; {10150#true} is VALID [2022-02-20 19:57:10,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {10150#true} assume { :begin_inline_init_threads1 } true; {10150#true} is VALID [2022-02-20 19:57:10,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {10150#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10150#true} is VALID [2022-02-20 19:57:10,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {10150#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10150#true} is VALID [2022-02-20 19:57:10,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {10150#true} assume { :end_inline_init_threads1 } true; {10150#true} is VALID [2022-02-20 19:57:10,685 INFO L272 TraceCheckUtils]: 12: Hoare triple {10150#true} call fire_delta_events1(); {10190#(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:10,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {10190#(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); {10150#true} is VALID [2022-02-20 19:57:10,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {10150#true} assume !(0 == ~q_write_ev~0); {10150#true} is VALID [2022-02-20 19:57:10,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {10150#true} assume true; {10150#true} is VALID [2022-02-20 19:57:10,686 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10150#true} {10150#true} #1102#return; {10150#true} is VALID [2022-02-20 19:57:10,686 INFO L272 TraceCheckUtils]: 17: Hoare triple {10150#true} call activate_threads1(); {10191#(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:10,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {10191#(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; {10150#true} is VALID [2022-02-20 19:57:10,686 INFO L272 TraceCheckUtils]: 19: Hoare triple {10150#true} call #t~ret8 := is_do_write_p_triggered(); {10150#true} is VALID [2022-02-20 19:57:10,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {10150#true} havoc ~__retres1~0; {10150#true} is VALID [2022-02-20 19:57:10,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {10150#true} assume !(1 == ~p_dw_pc~0); {10150#true} is VALID [2022-02-20 19:57:10,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {10150#true} ~__retres1~0 := 0; {10150#true} is VALID [2022-02-20 19:57:10,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {10150#true} #res := ~__retres1~0; {10150#true} is VALID [2022-02-20 19:57:10,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {10150#true} assume true; {10150#true} is VALID [2022-02-20 19:57:10,687 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10150#true} {10150#true} #1096#return; {10150#true} is VALID [2022-02-20 19:57:10,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {10150#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10150#true} is VALID [2022-02-20 19:57:10,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {10150#true} assume !(0 != ~tmp~1); {10150#true} is VALID [2022-02-20 19:57:10,687 INFO L272 TraceCheckUtils]: 28: Hoare triple {10150#true} call #t~ret9 := is_do_read_c_triggered(); {10150#true} is VALID [2022-02-20 19:57:10,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {10150#true} havoc ~__retres1~1; {10150#true} is VALID [2022-02-20 19:57:10,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {10150#true} assume !(1 == ~c_dr_pc~0); {10150#true} is VALID [2022-02-20 19:57:10,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {10150#true} ~__retres1~1 := 0; {10206#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:10,688 INFO L290 TraceCheckUtils]: 32: Hoare triple {10206#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10207#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:10,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {10207#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10207#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:10,689 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10207#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10150#true} #1098#return; {10204#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:10,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {10204#(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; {10205#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:10,690 INFO L290 TraceCheckUtils]: 36: Hoare triple {10205#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10151#false} is VALID [2022-02-20 19:57:10,690 INFO L290 TraceCheckUtils]: 37: Hoare triple {10151#false} assume true; {10151#false} is VALID [2022-02-20 19:57:10,690 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10151#false} {10150#true} #1104#return; {10151#false} is VALID [2022-02-20 19:57:10,690 INFO L272 TraceCheckUtils]: 39: Hoare triple {10151#false} call reset_delta_events1(); {10190#(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:10,690 INFO L290 TraceCheckUtils]: 40: Hoare triple {10190#(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); {10150#true} is VALID [2022-02-20 19:57:10,690 INFO L290 TraceCheckUtils]: 41: Hoare triple {10150#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10150#true} is VALID [2022-02-20 19:57:10,690 INFO L290 TraceCheckUtils]: 42: Hoare triple {10150#true} assume true; {10150#true} is VALID [2022-02-20 19:57:10,690 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10150#true} {10151#false} #1106#return; {10151#false} is VALID [2022-02-20 19:57:10,691 INFO L290 TraceCheckUtils]: 44: Hoare triple {10151#false} assume !false; {10151#false} is VALID [2022-02-20 19:57:10,691 INFO L290 TraceCheckUtils]: 45: Hoare triple {10151#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; {10151#false} is VALID [2022-02-20 19:57:10,691 INFO L290 TraceCheckUtils]: 46: Hoare triple {10151#false} assume !false; {10151#false} is VALID [2022-02-20 19:57:10,691 INFO L272 TraceCheckUtils]: 47: Hoare triple {10151#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10150#true} is VALID [2022-02-20 19:57:10,691 INFO L290 TraceCheckUtils]: 48: Hoare triple {10150#true} havoc ~__retres1~2; {10150#true} is VALID [2022-02-20 19:57:10,691 INFO L290 TraceCheckUtils]: 49: Hoare triple {10150#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10150#true} is VALID [2022-02-20 19:57:10,691 INFO L290 TraceCheckUtils]: 50: Hoare triple {10150#true} #res := ~__retres1~2; {10150#true} is VALID [2022-02-20 19:57:10,691 INFO L290 TraceCheckUtils]: 51: Hoare triple {10150#true} assume true; {10150#true} is VALID [2022-02-20 19:57:10,691 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10150#true} {10151#false} #1108#return; {10151#false} is VALID [2022-02-20 19:57:10,692 INFO L290 TraceCheckUtils]: 53: Hoare triple {10151#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; {10151#false} is VALID [2022-02-20 19:57:10,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {10151#false} assume 0 != eval1_~tmp___1~0#1; {10151#false} is VALID [2022-02-20 19:57:10,692 INFO L290 TraceCheckUtils]: 55: Hoare triple {10151#false} assume !(0 == ~p_dw_st~0); {10151#false} is VALID [2022-02-20 19:57:10,692 INFO L290 TraceCheckUtils]: 56: Hoare triple {10151#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; {10151#false} is VALID [2022-02-20 19:57:10,692 INFO L290 TraceCheckUtils]: 57: Hoare triple {10151#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; {10151#false} is VALID [2022-02-20 19:57:10,692 INFO L290 TraceCheckUtils]: 58: Hoare triple {10151#false} assume 0 == ~c_dr_pc~0; {10151#false} is VALID [2022-02-20 19:57:10,692 INFO L290 TraceCheckUtils]: 59: Hoare triple {10151#false} assume !false; {10151#false} is VALID [2022-02-20 19:57:10,692 INFO L290 TraceCheckUtils]: 60: Hoare triple {10151#false} assume !(1 == ~q_free~0); {10151#false} is VALID [2022-02-20 19:57:10,692 INFO L290 TraceCheckUtils]: 61: Hoare triple {10151#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; {10151#false} is VALID [2022-02-20 19:57:10,692 INFO L290 TraceCheckUtils]: 62: Hoare triple {10151#false} assume !(~p_last_write~0 == ~c_last_read~0); {10151#false} is VALID [2022-02-20 19:57:10,693 INFO L272 TraceCheckUtils]: 63: Hoare triple {10151#false} call error1(); {10151#false} is VALID [2022-02-20 19:57:10,693 INFO L290 TraceCheckUtils]: 64: Hoare triple {10151#false} assume !false; {10151#false} is VALID [2022-02-20 19:57:10,693 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:10,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:10,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913181152] [2022-02-20 19:57:10,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913181152] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:10,693 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:10,693 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:10,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036984374] [2022-02-20 19:57:10,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:10,694 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:10,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:10,695 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:10,724 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:10,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:10,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:10,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:10,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:10,725 INFO L87 Difference]: Start difference. First operand 495 states and 706 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:57:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:13,040 INFO L93 Difference]: Finished difference Result 813 states and 1139 transitions. [2022-02-20 19:57:13,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:57:13,040 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:13,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:13,041 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:57:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 599 transitions. [2022-02-20 19:57:13,045 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:57:13,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 599 transitions. [2022-02-20 19:57:13,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 599 transitions. [2022-02-20 19:57:13,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 599 edges. 599 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:13,441 INFO L225 Difference]: With dead ends: 813 [2022-02-20 19:57:13,441 INFO L226 Difference]: Without dead ends: 541 [2022-02-20 19:57:13,441 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:57:13,442 INFO L933 BasicCegarLoop]: 425 mSDtfsCounter, 549 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:13,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [551 Valid, 1707 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:57:13,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-02-20 19:57:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 510. [2022-02-20 19:57:13,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:13,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 541 states. Second operand has 510 states, 418 states have (on average 1.4258373205741626) internal successors, (596), 426 states have internal predecessors, (596), 55 states have call successors, (55), 28 states have call predecessors, (55), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) [2022-02-20 19:57:13,467 INFO L74 IsIncluded]: Start isIncluded. First operand 541 states. Second operand has 510 states, 418 states have (on average 1.4258373205741626) internal successors, (596), 426 states have internal predecessors, (596), 55 states have call successors, (55), 28 states have call predecessors, (55), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) [2022-02-20 19:57:13,468 INFO L87 Difference]: Start difference. First operand 541 states. Second operand has 510 states, 418 states have (on average 1.4258373205741626) internal successors, (596), 426 states have internal predecessors, (596), 55 states have call successors, (55), 28 states have call predecessors, (55), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) [2022-02-20 19:57:13,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:13,483 INFO L93 Difference]: Finished difference Result 541 states and 765 transitions. [2022-02-20 19:57:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 765 transitions. [2022-02-20 19:57:13,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:13,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:13,486 INFO L74 IsIncluded]: Start isIncluded. First operand has 510 states, 418 states have (on average 1.4258373205741626) internal successors, (596), 426 states have internal predecessors, (596), 55 states have call successors, (55), 28 states have call predecessors, (55), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) Second operand 541 states. [2022-02-20 19:57:13,486 INFO L87 Difference]: Start difference. First operand has 510 states, 418 states have (on average 1.4258373205741626) internal successors, (596), 426 states have internal predecessors, (596), 55 states have call successors, (55), 28 states have call predecessors, (55), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) Second operand 541 states. [2022-02-20 19:57:13,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:13,500 INFO L93 Difference]: Finished difference Result 541 states and 765 transitions. [2022-02-20 19:57:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 765 transitions. [2022-02-20 19:57:13,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:13,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:13,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:13,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:13,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 418 states have (on average 1.4258373205741626) internal successors, (596), 426 states have internal predecessors, (596), 55 states have call successors, (55), 28 states have call predecessors, (55), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) [2022-02-20 19:57:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 721 transitions. [2022-02-20 19:57:13,518 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 721 transitions. Word has length 65 [2022-02-20 19:57:13,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:13,518 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 721 transitions. [2022-02-20 19:57:13,518 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:57:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 721 transitions. [2022-02-20 19:57:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:13,519 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:13,519 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:13,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:57:13,520 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:13,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:13,520 INFO L85 PathProgramCache]: Analyzing trace with hash 787061992, now seen corresponding path program 1 times [2022-02-20 19:57:13,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:13,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782925391] [2022-02-20 19:57:13,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:13,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {13128#(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); {13129#(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:13,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {13129#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13129#(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:13,587 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13129#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13090#(= ~q_write_ev~0 ~q_read_ev~0)} #1100#return; {13090#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {13129#(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); {13129#(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:13,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {13129#(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); {13129#(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:13,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {13129#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13129#(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:13,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13129#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13090#(= ~q_write_ev~0 ~q_read_ev~0)} #1102#return; {13090#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {13088#true} havoc ~__retres1~0; {13088#true} is VALID [2022-02-20 19:57:13,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {13088#true} assume !(1 == ~p_dw_pc~0); {13088#true} is VALID [2022-02-20 19:57:13,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {13088#true} ~__retres1~0 := 0; {13088#true} is VALID [2022-02-20 19:57:13,609 INFO L290 TraceCheckUtils]: 3: Hoare triple {13088#true} #res := ~__retres1~0; {13088#true} is VALID [2022-02-20 19:57:13,609 INFO L290 TraceCheckUtils]: 4: Hoare triple {13088#true} assume true; {13088#true} is VALID [2022-02-20 19:57:13,609 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13088#true} {13088#true} #1096#return; {13088#true} is VALID [2022-02-20 19:57:13,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {13088#true} havoc ~__retres1~1; {13088#true} is VALID [2022-02-20 19:57:13,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {13088#true} assume !(1 == ~c_dr_pc~0); {13088#true} is VALID [2022-02-20 19:57:13,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {13088#true} ~__retres1~1 := 0; {13088#true} is VALID [2022-02-20 19:57:13,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {13088#true} #res := ~__retres1~1; {13088#true} is VALID [2022-02-20 19:57:13,612 INFO L290 TraceCheckUtils]: 4: Hoare triple {13088#true} assume true; {13088#true} is VALID [2022-02-20 19:57:13,612 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13088#true} {13088#true} #1098#return; {13088#true} is VALID [2022-02-20 19:57:13,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {13130#(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; {13088#true} is VALID [2022-02-20 19:57:13,613 INFO L272 TraceCheckUtils]: 1: Hoare triple {13088#true} call #t~ret8 := is_do_write_p_triggered(); {13088#true} is VALID [2022-02-20 19:57:13,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {13088#true} havoc ~__retres1~0; {13088#true} is VALID [2022-02-20 19:57:13,614 INFO L290 TraceCheckUtils]: 3: Hoare triple {13088#true} assume !(1 == ~p_dw_pc~0); {13088#true} is VALID [2022-02-20 19:57:13,614 INFO L290 TraceCheckUtils]: 4: Hoare triple {13088#true} ~__retres1~0 := 0; {13088#true} is VALID [2022-02-20 19:57:13,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {13088#true} #res := ~__retres1~0; {13088#true} is VALID [2022-02-20 19:57:13,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {13088#true} assume true; {13088#true} is VALID [2022-02-20 19:57:13,614 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13088#true} {13088#true} #1096#return; {13088#true} is VALID [2022-02-20 19:57:13,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {13088#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13088#true} is VALID [2022-02-20 19:57:13,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {13088#true} assume !(0 != ~tmp~1); {13088#true} is VALID [2022-02-20 19:57:13,614 INFO L272 TraceCheckUtils]: 10: Hoare triple {13088#true} call #t~ret9 := is_do_read_c_triggered(); {13088#true} is VALID [2022-02-20 19:57:13,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {13088#true} havoc ~__retres1~1; {13088#true} is VALID [2022-02-20 19:57:13,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {13088#true} assume !(1 == ~c_dr_pc~0); {13088#true} is VALID [2022-02-20 19:57:13,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {13088#true} ~__retres1~1 := 0; {13088#true} is VALID [2022-02-20 19:57:13,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {13088#true} #res := ~__retres1~1; {13088#true} is VALID [2022-02-20 19:57:13,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {13088#true} assume true; {13088#true} is VALID [2022-02-20 19:57:13,615 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13088#true} {13088#true} #1098#return; {13088#true} is VALID [2022-02-20 19:57:13,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {13088#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13088#true} is VALID [2022-02-20 19:57:13,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {13088#true} assume !(0 != ~tmp___0~1); {13088#true} is VALID [2022-02-20 19:57:13,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {13088#true} assume true; {13088#true} is VALID [2022-02-20 19:57:13,616 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13088#true} {13090#(= ~q_write_ev~0 ~q_read_ev~0)} #1104#return; {13090#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {13129#(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); {13143#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:57:13,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {13143#(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; {13144#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:13,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {13144#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {13144#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:13,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13144#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {13090#(= ~q_write_ev~0 ~q_read_ev~0)} #1106#return; {13089#false} is VALID [2022-02-20 19:57:13,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {13088#true} havoc ~__retres1~2; {13088#true} is VALID [2022-02-20 19:57:13,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {13088#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13088#true} is VALID [2022-02-20 19:57:13,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {13088#true} #res := ~__retres1~2; {13088#true} is VALID [2022-02-20 19:57:13,637 INFO L290 TraceCheckUtils]: 3: Hoare triple {13088#true} assume true; {13088#true} is VALID [2022-02-20 19:57:13,637 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13088#true} {13089#false} #1108#return; {13089#false} is VALID [2022-02-20 19:57:13,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {13088#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {13088#true} is VALID [2022-02-20 19:57:13,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {13088#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {13088#true} is VALID [2022-02-20 19:57:13,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {13088#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {13090#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {13090#(= ~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; {13090#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {13090#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {13128#(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:13,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {13128#(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); {13129#(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:13,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {13129#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13129#(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:13,640 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13129#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13090#(= ~q_write_ev~0 ~q_read_ev~0)} #1100#return; {13090#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {13090#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {13090#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {13090#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {13090#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {13090#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {13090#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {13090#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {13090#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,641 INFO L272 TraceCheckUtils]: 12: Hoare triple {13090#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {13129#(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:13,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {13129#(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); {13129#(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:13,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {13129#(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); {13129#(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:13,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {13129#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13129#(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:13,643 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13129#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13090#(= ~q_write_ev~0 ~q_read_ev~0)} #1102#return; {13090#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,644 INFO L272 TraceCheckUtils]: 17: Hoare triple {13090#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {13130#(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:13,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {13130#(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; {13088#true} is VALID [2022-02-20 19:57:13,644 INFO L272 TraceCheckUtils]: 19: Hoare triple {13088#true} call #t~ret8 := is_do_write_p_triggered(); {13088#true} is VALID [2022-02-20 19:57:13,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {13088#true} havoc ~__retres1~0; {13088#true} is VALID [2022-02-20 19:57:13,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {13088#true} assume !(1 == ~p_dw_pc~0); {13088#true} is VALID [2022-02-20 19:57:13,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {13088#true} ~__retres1~0 := 0; {13088#true} is VALID [2022-02-20 19:57:13,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {13088#true} #res := ~__retres1~0; {13088#true} is VALID [2022-02-20 19:57:13,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {13088#true} assume true; {13088#true} is VALID [2022-02-20 19:57:13,644 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13088#true} {13088#true} #1096#return; {13088#true} is VALID [2022-02-20 19:57:13,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {13088#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13088#true} is VALID [2022-02-20 19:57:13,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {13088#true} assume !(0 != ~tmp~1); {13088#true} is VALID [2022-02-20 19:57:13,645 INFO L272 TraceCheckUtils]: 28: Hoare triple {13088#true} call #t~ret9 := is_do_read_c_triggered(); {13088#true} is VALID [2022-02-20 19:57:13,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {13088#true} havoc ~__retres1~1; {13088#true} is VALID [2022-02-20 19:57:13,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {13088#true} assume !(1 == ~c_dr_pc~0); {13088#true} is VALID [2022-02-20 19:57:13,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {13088#true} ~__retres1~1 := 0; {13088#true} is VALID [2022-02-20 19:57:13,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {13088#true} #res := ~__retres1~1; {13088#true} is VALID [2022-02-20 19:57:13,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {13088#true} assume true; {13088#true} is VALID [2022-02-20 19:57:13,645 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13088#true} {13088#true} #1098#return; {13088#true} is VALID [2022-02-20 19:57:13,645 INFO L290 TraceCheckUtils]: 35: Hoare triple {13088#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13088#true} is VALID [2022-02-20 19:57:13,646 INFO L290 TraceCheckUtils]: 36: Hoare triple {13088#true} assume !(0 != ~tmp___0~1); {13088#true} is VALID [2022-02-20 19:57:13,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {13088#true} assume true; {13088#true} is VALID [2022-02-20 19:57:13,648 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13088#true} {13090#(= ~q_write_ev~0 ~q_read_ev~0)} #1104#return; {13090#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:13,648 INFO L272 TraceCheckUtils]: 39: Hoare triple {13090#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {13129#(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:13,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {13129#(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); {13143#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:57:13,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {13143#(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; {13144#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:13,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {13144#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {13144#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:13,650 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13144#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {13090#(= ~q_write_ev~0 ~q_read_ev~0)} #1106#return; {13089#false} is VALID [2022-02-20 19:57:13,650 INFO L290 TraceCheckUtils]: 44: Hoare triple {13089#false} assume !false; {13089#false} is VALID [2022-02-20 19:57:13,650 INFO L290 TraceCheckUtils]: 45: Hoare triple {13089#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; {13089#false} is VALID [2022-02-20 19:57:13,650 INFO L290 TraceCheckUtils]: 46: Hoare triple {13089#false} assume !false; {13089#false} is VALID [2022-02-20 19:57:13,650 INFO L272 TraceCheckUtils]: 47: Hoare triple {13089#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {13088#true} is VALID [2022-02-20 19:57:13,650 INFO L290 TraceCheckUtils]: 48: Hoare triple {13088#true} havoc ~__retres1~2; {13088#true} is VALID [2022-02-20 19:57:13,650 INFO L290 TraceCheckUtils]: 49: Hoare triple {13088#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13088#true} is VALID [2022-02-20 19:57:13,650 INFO L290 TraceCheckUtils]: 50: Hoare triple {13088#true} #res := ~__retres1~2; {13088#true} is VALID [2022-02-20 19:57:13,650 INFO L290 TraceCheckUtils]: 51: Hoare triple {13088#true} assume true; {13088#true} is VALID [2022-02-20 19:57:13,651 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13088#true} {13089#false} #1108#return; {13089#false} is VALID [2022-02-20 19:57:13,651 INFO L290 TraceCheckUtils]: 53: Hoare triple {13089#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; {13089#false} is VALID [2022-02-20 19:57:13,651 INFO L290 TraceCheckUtils]: 54: Hoare triple {13089#false} assume 0 != eval1_~tmp___1~0#1; {13089#false} is VALID [2022-02-20 19:57:13,651 INFO L290 TraceCheckUtils]: 55: Hoare triple {13089#false} assume !(0 == ~p_dw_st~0); {13089#false} is VALID [2022-02-20 19:57:13,651 INFO L290 TraceCheckUtils]: 56: Hoare triple {13089#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; {13089#false} is VALID [2022-02-20 19:57:13,651 INFO L290 TraceCheckUtils]: 57: Hoare triple {13089#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; {13089#false} is VALID [2022-02-20 19:57:13,651 INFO L290 TraceCheckUtils]: 58: Hoare triple {13089#false} assume 0 == ~c_dr_pc~0; {13089#false} is VALID [2022-02-20 19:57:13,651 INFO L290 TraceCheckUtils]: 59: Hoare triple {13089#false} assume !false; {13089#false} is VALID [2022-02-20 19:57:13,651 INFO L290 TraceCheckUtils]: 60: Hoare triple {13089#false} assume !(1 == ~q_free~0); {13089#false} is VALID [2022-02-20 19:57:13,652 INFO L290 TraceCheckUtils]: 61: Hoare triple {13089#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; {13089#false} is VALID [2022-02-20 19:57:13,652 INFO L290 TraceCheckUtils]: 62: Hoare triple {13089#false} assume !(~p_last_write~0 == ~c_last_read~0); {13089#false} is VALID [2022-02-20 19:57:13,652 INFO L272 TraceCheckUtils]: 63: Hoare triple {13089#false} call error1(); {13089#false} is VALID [2022-02-20 19:57:13,652 INFO L290 TraceCheckUtils]: 64: Hoare triple {13089#false} assume !false; {13089#false} is VALID [2022-02-20 19:57:13,652 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:13,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:13,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782925391] [2022-02-20 19:57:13,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782925391] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:13,653 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:13,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:13,653 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584420614] [2022-02-20 19:57:13,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:13,654 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:13,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:13,655 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:13,684 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:13,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:13,684 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:13,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:13,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:13,685 INFO L87 Difference]: Start difference. First operand 510 states and 721 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:15,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:15,571 INFO L93 Difference]: Finished difference Result 902 states and 1232 transitions. [2022-02-20 19:57:15,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:57:15,572 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:15,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:15,572 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:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 777 transitions. [2022-02-20 19:57:15,578 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:15,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 777 transitions. [2022-02-20 19:57:15,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 777 transitions. [2022-02-20 19:57:16,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 777 edges. 777 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:16,126 INFO L225 Difference]: With dead ends: 902 [2022-02-20 19:57:16,126 INFO L226 Difference]: Without dead ends: 617 [2022-02-20 19:57:16,127 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:57:16,128 INFO L933 BasicCegarLoop]: 453 mSDtfsCounter, 1071 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:16,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1095 Valid, 1315 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:57:16,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-02-20 19:57:16,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 522. [2022-02-20 19:57:16,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:16,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 617 states. Second operand has 522 states, 428 states have (on average 1.4158878504672898) internal successors, (606), 436 states have internal predecessors, (606), 56 states have call successors, (56), 29 states have call predecessors, (56), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) [2022-02-20 19:57:16,160 INFO L74 IsIncluded]: Start isIncluded. First operand 617 states. Second operand has 522 states, 428 states have (on average 1.4158878504672898) internal successors, (606), 436 states have internal predecessors, (606), 56 states have call successors, (56), 29 states have call predecessors, (56), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) [2022-02-20 19:57:16,162 INFO L87 Difference]: Start difference. First operand 617 states. Second operand has 522 states, 428 states have (on average 1.4158878504672898) internal successors, (606), 436 states have internal predecessors, (606), 56 states have call successors, (56), 29 states have call predecessors, (56), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) [2022-02-20 19:57:16,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:16,178 INFO L93 Difference]: Finished difference Result 617 states and 852 transitions. [2022-02-20 19:57:16,178 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 852 transitions. [2022-02-20 19:57:16,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:16,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:16,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 522 states, 428 states have (on average 1.4158878504672898) internal successors, (606), 436 states have internal predecessors, (606), 56 states have call successors, (56), 29 states have call predecessors, (56), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) Second operand 617 states. [2022-02-20 19:57:16,181 INFO L87 Difference]: Start difference. First operand has 522 states, 428 states have (on average 1.4158878504672898) internal successors, (606), 436 states have internal predecessors, (606), 56 states have call successors, (56), 29 states have call predecessors, (56), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) Second operand 617 states. [2022-02-20 19:57:16,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:16,196 INFO L93 Difference]: Finished difference Result 617 states and 852 transitions. [2022-02-20 19:57:16,196 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 852 transitions. [2022-02-20 19:57:16,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:16,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:16,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:16,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:16,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 428 states have (on average 1.4158878504672898) internal successors, (606), 436 states have internal predecessors, (606), 56 states have call successors, (56), 29 states have call predecessors, (56), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) [2022-02-20 19:57:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 731 transitions. [2022-02-20 19:57:16,213 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 731 transitions. Word has length 65 [2022-02-20 19:57:16,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:16,213 INFO L470 AbstractCegarLoop]: Abstraction has 522 states and 731 transitions. [2022-02-20 19:57:16,213 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:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 731 transitions. [2022-02-20 19:57:16,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:16,214 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:16,214 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:16,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:57:16,214 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:16,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:16,215 INFO L85 PathProgramCache]: Analyzing trace with hash 653048486, now seen corresponding path program 1 times [2022-02-20 19:57:16,215 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:16,215 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733512133] [2022-02-20 19:57:16,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:16,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {16351#(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); {16311#true} is VALID [2022-02-20 19:57:16,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {16311#true} assume true; {16311#true} is VALID [2022-02-20 19:57:16,248 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16311#true} {16311#true} #1100#return; {16311#true} is VALID [2022-02-20 19:57:16,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {16352#(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); {16311#true} is VALID [2022-02-20 19:57:16,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {16311#true} assume !(0 == ~q_write_ev~0); {16311#true} is VALID [2022-02-20 19:57:16,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {16311#true} assume true; {16311#true} is VALID [2022-02-20 19:57:16,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16311#true} {16316#(= ~p_dw_st~0 0)} #1102#return; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {16311#true} havoc ~__retres1~0; {16311#true} is VALID [2022-02-20 19:57:16,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {16311#true} assume !(1 == ~p_dw_pc~0); {16311#true} is VALID [2022-02-20 19:57:16,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {16311#true} ~__retres1~0 := 0; {16311#true} is VALID [2022-02-20 19:57:16,274 INFO L290 TraceCheckUtils]: 3: Hoare triple {16311#true} #res := ~__retres1~0; {16311#true} is VALID [2022-02-20 19:57:16,274 INFO L290 TraceCheckUtils]: 4: Hoare triple {16311#true} assume true; {16311#true} is VALID [2022-02-20 19:57:16,274 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {16311#true} {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1096#return; {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {16311#true} havoc ~__retres1~1; {16311#true} is VALID [2022-02-20 19:57:16,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {16311#true} assume !(1 == ~c_dr_pc~0); {16311#true} is VALID [2022-02-20 19:57:16,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {16311#true} ~__retres1~1 := 0; {16311#true} is VALID [2022-02-20 19:57:16,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {16311#true} #res := ~__retres1~1; {16311#true} is VALID [2022-02-20 19:57:16,292 INFO L290 TraceCheckUtils]: 4: Hoare triple {16311#true} assume true; {16311#true} is VALID [2022-02-20 19:57:16,292 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {16311#true} {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1098#return; {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {16353#(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; {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,293 INFO L272 TraceCheckUtils]: 1: Hoare triple {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {16311#true} is VALID [2022-02-20 19:57:16,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {16311#true} havoc ~__retres1~0; {16311#true} is VALID [2022-02-20 19:57:16,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {16311#true} assume !(1 == ~p_dw_pc~0); {16311#true} is VALID [2022-02-20 19:57:16,293 INFO L290 TraceCheckUtils]: 4: Hoare triple {16311#true} ~__retres1~0 := 0; {16311#true} is VALID [2022-02-20 19:57:16,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {16311#true} #res := ~__retres1~0; {16311#true} is VALID [2022-02-20 19:57:16,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {16311#true} assume true; {16311#true} is VALID [2022-02-20 19:57:16,303 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16311#true} {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1096#return; {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,304 INFO L272 TraceCheckUtils]: 10: Hoare triple {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {16311#true} is VALID [2022-02-20 19:57:16,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {16311#true} havoc ~__retres1~1; {16311#true} is VALID [2022-02-20 19:57:16,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {16311#true} assume !(1 == ~c_dr_pc~0); {16311#true} is VALID [2022-02-20 19:57:16,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {16311#true} ~__retres1~1 := 0; {16311#true} is VALID [2022-02-20 19:57:16,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {16311#true} #res := ~__retres1~1; {16311#true} is VALID [2022-02-20 19:57:16,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {16311#true} assume true; {16311#true} is VALID [2022-02-20 19:57:16,305 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16311#true} {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1098#return; {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,306 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {16316#(= ~p_dw_st~0 0)} #1104#return; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {16352#(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); {16311#true} is VALID [2022-02-20 19:57:16,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {16311#true} assume !(1 == ~q_write_ev~0); {16311#true} is VALID [2022-02-20 19:57:16,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {16311#true} assume true; {16311#true} is VALID [2022-02-20 19:57:16,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16311#true} {16316#(= ~p_dw_st~0 0)} #1106#return; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:16,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {16311#true} havoc ~__retres1~2; {16311#true} is VALID [2022-02-20 19:57:16,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {16311#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {16316#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,314 INFO L290 TraceCheckUtils]: 3: Hoare triple {16316#(= ~p_dw_st~0 0)} assume true; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,314 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16316#(= ~p_dw_st~0 0)} {16316#(= ~p_dw_st~0 0)} #1108#return; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {16311#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {16311#true} is VALID [2022-02-20 19:57:16,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {16311#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {16311#true} is VALID [2022-02-20 19:57:16,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {16311#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {16311#true} is VALID [2022-02-20 19:57:16,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {16311#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; {16311#true} is VALID [2022-02-20 19:57:16,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {16311#true} call update_channels1(); {16351#(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:16,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {16351#(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); {16311#true} is VALID [2022-02-20 19:57:16,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {16311#true} assume true; {16311#true} is VALID [2022-02-20 19:57:16,328 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16311#true} {16311#true} #1100#return; {16311#true} is VALID [2022-02-20 19:57:16,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {16311#true} assume { :begin_inline_init_threads1 } true; {16311#true} is VALID [2022-02-20 19:57:16,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {16311#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {16316#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {16316#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,329 INFO L272 TraceCheckUtils]: 12: Hoare triple {16316#(= ~p_dw_st~0 0)} call fire_delta_events1(); {16352#(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:16,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {16352#(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); {16311#true} is VALID [2022-02-20 19:57:16,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {16311#true} assume !(0 == ~q_write_ev~0); {16311#true} is VALID [2022-02-20 19:57:16,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {16311#true} assume true; {16311#true} is VALID [2022-02-20 19:57:16,329 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16311#true} {16316#(= ~p_dw_st~0 0)} #1102#return; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,330 INFO L272 TraceCheckUtils]: 17: Hoare triple {16316#(= ~p_dw_st~0 0)} call activate_threads1(); {16353#(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:16,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {16353#(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; {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,330 INFO L272 TraceCheckUtils]: 19: Hoare triple {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {16311#true} is VALID [2022-02-20 19:57:16,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {16311#true} havoc ~__retres1~0; {16311#true} is VALID [2022-02-20 19:57:16,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {16311#true} assume !(1 == ~p_dw_pc~0); {16311#true} is VALID [2022-02-20 19:57:16,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {16311#true} ~__retres1~0 := 0; {16311#true} is VALID [2022-02-20 19:57:16,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {16311#true} #res := ~__retres1~0; {16311#true} is VALID [2022-02-20 19:57:16,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {16311#true} assume true; {16311#true} is VALID [2022-02-20 19:57:16,331 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {16311#true} {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1096#return; {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,331 INFO L272 TraceCheckUtils]: 28: Hoare triple {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {16311#true} is VALID [2022-02-20 19:57:16,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {16311#true} havoc ~__retres1~1; {16311#true} is VALID [2022-02-20 19:57:16,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {16311#true} assume !(1 == ~c_dr_pc~0); {16311#true} is VALID [2022-02-20 19:57:16,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {16311#true} ~__retres1~1 := 0; {16311#true} is VALID [2022-02-20 19:57:16,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {16311#true} #res := ~__retres1~1; {16311#true} is VALID [2022-02-20 19:57:16,332 INFO L290 TraceCheckUtils]: 33: Hoare triple {16311#true} assume true; {16311#true} is VALID [2022-02-20 19:57:16,332 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16311#true} {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1098#return; {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:16,333 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {16354#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {16316#(= ~p_dw_st~0 0)} #1104#return; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,334 INFO L272 TraceCheckUtils]: 39: Hoare triple {16316#(= ~p_dw_st~0 0)} call reset_delta_events1(); {16352#(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:16,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {16352#(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); {16311#true} is VALID [2022-02-20 19:57:16,334 INFO L290 TraceCheckUtils]: 41: Hoare triple {16311#true} assume !(1 == ~q_write_ev~0); {16311#true} is VALID [2022-02-20 19:57:16,334 INFO L290 TraceCheckUtils]: 42: Hoare triple {16311#true} assume true; {16311#true} is VALID [2022-02-20 19:57:16,334 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {16311#true} {16316#(= ~p_dw_st~0 0)} #1106#return; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,334 INFO L290 TraceCheckUtils]: 44: Hoare triple {16316#(= ~p_dw_st~0 0)} assume !false; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,335 INFO L290 TraceCheckUtils]: 45: Hoare triple {16316#(= ~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; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,335 INFO L290 TraceCheckUtils]: 46: Hoare triple {16316#(= ~p_dw_st~0 0)} assume !false; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,335 INFO L272 TraceCheckUtils]: 47: Hoare triple {16316#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {16311#true} is VALID [2022-02-20 19:57:16,335 INFO L290 TraceCheckUtils]: 48: Hoare triple {16311#true} havoc ~__retres1~2; {16311#true} is VALID [2022-02-20 19:57:16,335 INFO L290 TraceCheckUtils]: 49: Hoare triple {16311#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,335 INFO L290 TraceCheckUtils]: 50: Hoare triple {16316#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,336 INFO L290 TraceCheckUtils]: 51: Hoare triple {16316#(= ~p_dw_st~0 0)} assume true; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,336 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {16316#(= ~p_dw_st~0 0)} {16316#(= ~p_dw_st~0 0)} #1108#return; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,336 INFO L290 TraceCheckUtils]: 53: Hoare triple {16316#(= ~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; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,337 INFO L290 TraceCheckUtils]: 54: Hoare triple {16316#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {16316#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:16,337 INFO L290 TraceCheckUtils]: 55: Hoare triple {16316#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {16312#false} is VALID [2022-02-20 19:57:16,337 INFO L290 TraceCheckUtils]: 56: Hoare triple {16312#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; {16312#false} is VALID [2022-02-20 19:57:16,337 INFO L290 TraceCheckUtils]: 57: Hoare triple {16312#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; {16312#false} is VALID [2022-02-20 19:57:16,337 INFO L290 TraceCheckUtils]: 58: Hoare triple {16312#false} assume 0 == ~c_dr_pc~0; {16312#false} is VALID [2022-02-20 19:57:16,337 INFO L290 TraceCheckUtils]: 59: Hoare triple {16312#false} assume !false; {16312#false} is VALID [2022-02-20 19:57:16,337 INFO L290 TraceCheckUtils]: 60: Hoare triple {16312#false} assume !(1 == ~q_free~0); {16312#false} is VALID [2022-02-20 19:57:16,337 INFO L290 TraceCheckUtils]: 61: Hoare triple {16312#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; {16312#false} is VALID [2022-02-20 19:57:16,337 INFO L290 TraceCheckUtils]: 62: Hoare triple {16312#false} assume !(~p_last_write~0 == ~c_last_read~0); {16312#false} is VALID [2022-02-20 19:57:16,337 INFO L272 TraceCheckUtils]: 63: Hoare triple {16312#false} call error1(); {16312#false} is VALID [2022-02-20 19:57:16,337 INFO L290 TraceCheckUtils]: 64: Hoare triple {16312#false} assume !false; {16312#false} is VALID [2022-02-20 19:57:16,337 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:16,338 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:16,338 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733512133] [2022-02-20 19:57:16,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733512133] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:16,338 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:16,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:16,338 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096216323] [2022-02-20 19:57:16,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:16,338 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:57:16,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:16,339 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:57:16,395 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:16,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:16,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:16,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:16,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:16,396 INFO L87 Difference]: Start difference. First operand 522 states and 731 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:57:17,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:17,997 INFO L93 Difference]: Finished difference Result 1164 states and 1575 transitions. [2022-02-20 19:57:17,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:57:17,998 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:57:17,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:17,998 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:57:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 720 transitions. [2022-02-20 19:57:18,008 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:57:18,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 720 transitions. [2022-02-20 19:57:18,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 720 transitions. [2022-02-20 19:57:18,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 720 edges. 720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:18,513 INFO L225 Difference]: With dead ends: 1164 [2022-02-20 19:57:18,513 INFO L226 Difference]: Without dead ends: 868 [2022-02-20 19:57:18,514 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:57:18,515 INFO L933 BasicCegarLoop]: 413 mSDtfsCounter, 1056 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:18,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1082 Valid, 1046 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:18,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-02-20 19:57:18,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 812. [2022-02-20 19:57:18,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:18,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 868 states. Second operand has 812 states, 652 states have (on average 1.3650306748466257) internal successors, (890), 667 states have internal predecessors, (890), 91 states have call successors, (91), 51 states have call predecessors, (91), 67 states have return successors, (126), 100 states have call predecessors, (126), 89 states have call successors, (126) [2022-02-20 19:57:18,557 INFO L74 IsIncluded]: Start isIncluded. First operand 868 states. Second operand has 812 states, 652 states have (on average 1.3650306748466257) internal successors, (890), 667 states have internal predecessors, (890), 91 states have call successors, (91), 51 states have call predecessors, (91), 67 states have return successors, (126), 100 states have call predecessors, (126), 89 states have call successors, (126) [2022-02-20 19:57:18,559 INFO L87 Difference]: Start difference. First operand 868 states. Second operand has 812 states, 652 states have (on average 1.3650306748466257) internal successors, (890), 667 states have internal predecessors, (890), 91 states have call successors, (91), 51 states have call predecessors, (91), 67 states have return successors, (126), 100 states have call predecessors, (126), 89 states have call successors, (126) [2022-02-20 19:57:18,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:18,587 INFO L93 Difference]: Finished difference Result 868 states and 1181 transitions. [2022-02-20 19:57:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1181 transitions. [2022-02-20 19:57:18,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:18,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:18,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 812 states, 652 states have (on average 1.3650306748466257) internal successors, (890), 667 states have internal predecessors, (890), 91 states have call successors, (91), 51 states have call predecessors, (91), 67 states have return successors, (126), 100 states have call predecessors, (126), 89 states have call successors, (126) Second operand 868 states. [2022-02-20 19:57:18,604 INFO L87 Difference]: Start difference. First operand has 812 states, 652 states have (on average 1.3650306748466257) internal successors, (890), 667 states have internal predecessors, (890), 91 states have call successors, (91), 51 states have call predecessors, (91), 67 states have return successors, (126), 100 states have call predecessors, (126), 89 states have call successors, (126) Second operand 868 states. [2022-02-20 19:57:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:18,637 INFO L93 Difference]: Finished difference Result 868 states and 1181 transitions. [2022-02-20 19:57:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1181 transitions. [2022-02-20 19:57:18,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:18,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:18,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:18,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:18,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 652 states have (on average 1.3650306748466257) internal successors, (890), 667 states have internal predecessors, (890), 91 states have call successors, (91), 51 states have call predecessors, (91), 67 states have return successors, (126), 100 states have call predecessors, (126), 89 states have call successors, (126) [2022-02-20 19:57:18,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1107 transitions. [2022-02-20 19:57:18,677 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1107 transitions. Word has length 65 [2022-02-20 19:57:18,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:18,677 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1107 transitions. [2022-02-20 19:57:18,677 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:57:18,677 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1107 transitions. [2022-02-20 19:57:18,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:57:18,679 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:18,679 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:18,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:57:18,679 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:18,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:18,680 INFO L85 PathProgramCache]: Analyzing trace with hash -547287697, now seen corresponding path program 1 times [2022-02-20 19:57:18,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:18,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032237817] [2022-02-20 19:57:18,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:18,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {20820#(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); {20780#true} is VALID [2022-02-20 19:57:18,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {20780#true} assume true; {20780#true} is VALID [2022-02-20 19:57:18,714 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20780#true} {20782#(= ~q_free~0 1)} #1100#return; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {20821#(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); {20780#true} is VALID [2022-02-20 19:57:18,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {20780#true} assume !(0 == ~q_write_ev~0); {20780#true} is VALID [2022-02-20 19:57:18,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {20780#true} assume true; {20780#true} is VALID [2022-02-20 19:57:18,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20780#true} {20782#(= ~q_free~0 1)} #1102#return; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {20780#true} havoc ~__retres1~0; {20780#true} is VALID [2022-02-20 19:57:18,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {20780#true} assume !(1 == ~p_dw_pc~0); {20780#true} is VALID [2022-02-20 19:57:18,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {20780#true} ~__retres1~0 := 0; {20780#true} is VALID [2022-02-20 19:57:18,734 INFO L290 TraceCheckUtils]: 3: Hoare triple {20780#true} #res := ~__retres1~0; {20780#true} is VALID [2022-02-20 19:57:18,734 INFO L290 TraceCheckUtils]: 4: Hoare triple {20780#true} assume true; {20780#true} is VALID [2022-02-20 19:57:18,734 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {20780#true} {20780#true} #1096#return; {20780#true} is VALID [2022-02-20 19:57:18,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {20780#true} havoc ~__retres1~1; {20780#true} is VALID [2022-02-20 19:57:18,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {20780#true} assume !(1 == ~c_dr_pc~0); {20780#true} is VALID [2022-02-20 19:57:18,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {20780#true} ~__retres1~1 := 0; {20780#true} is VALID [2022-02-20 19:57:18,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {20780#true} #res := ~__retres1~1; {20780#true} is VALID [2022-02-20 19:57:18,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {20780#true} assume true; {20780#true} is VALID [2022-02-20 19:57:18,737 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {20780#true} {20780#true} #1098#return; {20780#true} is VALID [2022-02-20 19:57:18,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {20822#(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; {20780#true} is VALID [2022-02-20 19:57:18,737 INFO L272 TraceCheckUtils]: 1: Hoare triple {20780#true} call #t~ret8 := is_do_write_p_triggered(); {20780#true} is VALID [2022-02-20 19:57:18,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {20780#true} havoc ~__retres1~0; {20780#true} is VALID [2022-02-20 19:57:18,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {20780#true} assume !(1 == ~p_dw_pc~0); {20780#true} is VALID [2022-02-20 19:57:18,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {20780#true} ~__retres1~0 := 0; {20780#true} is VALID [2022-02-20 19:57:18,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {20780#true} #res := ~__retres1~0; {20780#true} is VALID [2022-02-20 19:57:18,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {20780#true} assume true; {20780#true} is VALID [2022-02-20 19:57:18,738 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20780#true} {20780#true} #1096#return; {20780#true} is VALID [2022-02-20 19:57:18,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {20780#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {20780#true} is VALID [2022-02-20 19:57:18,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {20780#true} assume !(0 != ~tmp~1); {20780#true} is VALID [2022-02-20 19:57:18,738 INFO L272 TraceCheckUtils]: 10: Hoare triple {20780#true} call #t~ret9 := is_do_read_c_triggered(); {20780#true} is VALID [2022-02-20 19:57:18,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {20780#true} havoc ~__retres1~1; {20780#true} is VALID [2022-02-20 19:57:18,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {20780#true} assume !(1 == ~c_dr_pc~0); {20780#true} is VALID [2022-02-20 19:57:18,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {20780#true} ~__retres1~1 := 0; {20780#true} is VALID [2022-02-20 19:57:18,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {20780#true} #res := ~__retres1~1; {20780#true} is VALID [2022-02-20 19:57:18,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {20780#true} assume true; {20780#true} is VALID [2022-02-20 19:57:18,739 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20780#true} {20780#true} #1098#return; {20780#true} is VALID [2022-02-20 19:57:18,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {20780#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {20780#true} is VALID [2022-02-20 19:57:18,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {20780#true} assume !(0 != ~tmp___0~1); {20780#true} is VALID [2022-02-20 19:57:18,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {20780#true} assume true; {20780#true} is VALID [2022-02-20 19:57:18,739 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {20780#true} {20782#(= ~q_free~0 1)} #1104#return; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {20821#(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); {20780#true} is VALID [2022-02-20 19:57:18,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {20780#true} assume !(1 == ~q_write_ev~0); {20780#true} is VALID [2022-02-20 19:57:18,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {20780#true} assume true; {20780#true} is VALID [2022-02-20 19:57:18,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20780#true} {20782#(= ~q_free~0 1)} #1106#return; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {20780#true} havoc ~__retres1~2; {20780#true} is VALID [2022-02-20 19:57:18,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {20780#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20780#true} is VALID [2022-02-20 19:57:18,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {20780#true} #res := ~__retres1~2; {20780#true} is VALID [2022-02-20 19:57:18,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {20780#true} assume true; {20780#true} is VALID [2022-02-20 19:57:18,752 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20780#true} {20782#(= ~q_free~0 1)} #1108#return; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {20780#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {20780#true} is VALID [2022-02-20 19:57:18,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {20780#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {20780#true} is VALID [2022-02-20 19:57:18,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {20780#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,753 INFO L290 TraceCheckUtils]: 3: Hoare triple {20782#(= ~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; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {20782#(= ~q_free~0 1)} call update_channels1(); {20820#(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:18,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {20820#(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); {20780#true} is VALID [2022-02-20 19:57:18,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {20780#true} assume true; {20780#true} is VALID [2022-02-20 19:57:18,754 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20780#true} {20782#(= ~q_free~0 1)} #1100#return; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {20782#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {20782#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {20782#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {20782#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,756 INFO L272 TraceCheckUtils]: 12: Hoare triple {20782#(= ~q_free~0 1)} call fire_delta_events1(); {20821#(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:18,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {20821#(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); {20780#true} is VALID [2022-02-20 19:57:18,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {20780#true} assume !(0 == ~q_write_ev~0); {20780#true} is VALID [2022-02-20 19:57:18,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {20780#true} assume true; {20780#true} is VALID [2022-02-20 19:57:18,756 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20780#true} {20782#(= ~q_free~0 1)} #1102#return; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,757 INFO L272 TraceCheckUtils]: 17: Hoare triple {20782#(= ~q_free~0 1)} call activate_threads1(); {20822#(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:18,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {20822#(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; {20780#true} is VALID [2022-02-20 19:57:18,757 INFO L272 TraceCheckUtils]: 19: Hoare triple {20780#true} call #t~ret8 := is_do_write_p_triggered(); {20780#true} is VALID [2022-02-20 19:57:18,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {20780#true} havoc ~__retres1~0; {20780#true} is VALID [2022-02-20 19:57:18,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {20780#true} assume !(1 == ~p_dw_pc~0); {20780#true} is VALID [2022-02-20 19:57:18,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {20780#true} ~__retres1~0 := 0; {20780#true} is VALID [2022-02-20 19:57:18,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {20780#true} #res := ~__retres1~0; {20780#true} is VALID [2022-02-20 19:57:18,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {20780#true} assume true; {20780#true} is VALID [2022-02-20 19:57:18,757 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {20780#true} {20780#true} #1096#return; {20780#true} is VALID [2022-02-20 19:57:18,758 INFO L290 TraceCheckUtils]: 26: Hoare triple {20780#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {20780#true} is VALID [2022-02-20 19:57:18,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {20780#true} assume !(0 != ~tmp~1); {20780#true} is VALID [2022-02-20 19:57:18,758 INFO L272 TraceCheckUtils]: 28: Hoare triple {20780#true} call #t~ret9 := is_do_read_c_triggered(); {20780#true} is VALID [2022-02-20 19:57:18,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {20780#true} havoc ~__retres1~1; {20780#true} is VALID [2022-02-20 19:57:18,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {20780#true} assume !(1 == ~c_dr_pc~0); {20780#true} is VALID [2022-02-20 19:57:18,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {20780#true} ~__retres1~1 := 0; {20780#true} is VALID [2022-02-20 19:57:18,758 INFO L290 TraceCheckUtils]: 32: Hoare triple {20780#true} #res := ~__retres1~1; {20780#true} is VALID [2022-02-20 19:57:18,758 INFO L290 TraceCheckUtils]: 33: Hoare triple {20780#true} assume true; {20780#true} is VALID [2022-02-20 19:57:18,758 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20780#true} {20780#true} #1098#return; {20780#true} is VALID [2022-02-20 19:57:18,759 INFO L290 TraceCheckUtils]: 35: Hoare triple {20780#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {20780#true} is VALID [2022-02-20 19:57:18,759 INFO L290 TraceCheckUtils]: 36: Hoare triple {20780#true} assume !(0 != ~tmp___0~1); {20780#true} is VALID [2022-02-20 19:57:18,759 INFO L290 TraceCheckUtils]: 37: Hoare triple {20780#true} assume true; {20780#true} is VALID [2022-02-20 19:57:18,759 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {20780#true} {20782#(= ~q_free~0 1)} #1104#return; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,760 INFO L272 TraceCheckUtils]: 39: Hoare triple {20782#(= ~q_free~0 1)} call reset_delta_events1(); {20821#(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:18,760 INFO L290 TraceCheckUtils]: 40: Hoare triple {20821#(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); {20780#true} is VALID [2022-02-20 19:57:18,760 INFO L290 TraceCheckUtils]: 41: Hoare triple {20780#true} assume !(1 == ~q_write_ev~0); {20780#true} is VALID [2022-02-20 19:57:18,760 INFO L290 TraceCheckUtils]: 42: Hoare triple {20780#true} assume true; {20780#true} is VALID [2022-02-20 19:57:18,760 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {20780#true} {20782#(= ~q_free~0 1)} #1106#return; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,760 INFO L290 TraceCheckUtils]: 44: Hoare triple {20782#(= ~q_free~0 1)} assume !false; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,761 INFO L290 TraceCheckUtils]: 45: Hoare triple {20782#(= ~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; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,761 INFO L290 TraceCheckUtils]: 46: Hoare triple {20782#(= ~q_free~0 1)} assume !false; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,761 INFO L272 TraceCheckUtils]: 47: Hoare triple {20782#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {20780#true} is VALID [2022-02-20 19:57:18,761 INFO L290 TraceCheckUtils]: 48: Hoare triple {20780#true} havoc ~__retres1~2; {20780#true} is VALID [2022-02-20 19:57:18,761 INFO L290 TraceCheckUtils]: 49: Hoare triple {20780#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {20780#true} is VALID [2022-02-20 19:57:18,761 INFO L290 TraceCheckUtils]: 50: Hoare triple {20780#true} #res := ~__retres1~2; {20780#true} is VALID [2022-02-20 19:57:18,761 INFO L290 TraceCheckUtils]: 51: Hoare triple {20780#true} assume true; {20780#true} is VALID [2022-02-20 19:57:18,762 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {20780#true} {20782#(= ~q_free~0 1)} #1108#return; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,762 INFO L290 TraceCheckUtils]: 53: Hoare triple {20782#(= ~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; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,762 INFO L290 TraceCheckUtils]: 54: Hoare triple {20782#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,763 INFO L290 TraceCheckUtils]: 55: Hoare triple {20782#(= ~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; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,763 INFO L290 TraceCheckUtils]: 56: Hoare triple {20782#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,763 INFO L290 TraceCheckUtils]: 57: Hoare triple {20782#(= ~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; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,764 INFO L290 TraceCheckUtils]: 58: Hoare triple {20782#(= ~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; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,764 INFO L290 TraceCheckUtils]: 59: Hoare triple {20782#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,764 INFO L290 TraceCheckUtils]: 60: Hoare triple {20782#(= ~q_free~0 1)} assume !false; {20782#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:18,764 INFO L290 TraceCheckUtils]: 61: Hoare triple {20782#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {20781#false} is VALID [2022-02-20 19:57:18,764 INFO L290 TraceCheckUtils]: 62: Hoare triple {20781#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; {20781#false} is VALID [2022-02-20 19:57:18,765 INFO L290 TraceCheckUtils]: 63: Hoare triple {20781#false} assume !(~p_last_write~0 == ~c_last_read~0); {20781#false} is VALID [2022-02-20 19:57:18,765 INFO L272 TraceCheckUtils]: 64: Hoare triple {20781#false} call error1(); {20781#false} is VALID [2022-02-20 19:57:18,765 INFO L290 TraceCheckUtils]: 65: Hoare triple {20781#false} assume !false; {20781#false} is VALID [2022-02-20 19:57:18,765 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:18,765 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:18,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032237817] [2022-02-20 19:57:18,765 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032237817] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:18,766 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:18,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:18,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660785205] [2022-02-20 19:57:18,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:18,766 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:57:18,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:18,767 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:57:18,812 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:57:18,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:18,812 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:18,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:18,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:18,813 INFO L87 Difference]: Start difference. First operand 812 states and 1107 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:57:20,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:20,352 INFO L93 Difference]: Finished difference Result 2015 states and 2674 transitions. [2022-02-20 19:57:20,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:57:20,353 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:57:20,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:20,353 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:57:20,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 718 transitions. [2022-02-20 19:57:20,357 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:57:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 718 transitions. [2022-02-20 19:57:20,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 718 transitions. [2022-02-20 19:57:20,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 718 edges. 718 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:20,951 INFO L225 Difference]: With dead ends: 2015 [2022-02-20 19:57:20,951 INFO L226 Difference]: Without dead ends: 1408 [2022-02-20 19:57:20,953 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:57:20,956 INFO L933 BasicCegarLoop]: 428 mSDtfsCounter, 769 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:20,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [777 Valid, 1004 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:20,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2022-02-20 19:57:21,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1293. [2022-02-20 19:57:21,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:21,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1408 states. Second operand has 1293 states, 1031 states have (on average 1.3317167798254121) internal successors, (1373), 1049 states have internal predecessors, (1373), 136 states have call successors, (136), 95 states have call predecessors, (136), 124 states have return successors, (198), 155 states have call predecessors, (198), 134 states have call successors, (198) [2022-02-20 19:57:21,109 INFO L74 IsIncluded]: Start isIncluded. First operand 1408 states. Second operand has 1293 states, 1031 states have (on average 1.3317167798254121) internal successors, (1373), 1049 states have internal predecessors, (1373), 136 states have call successors, (136), 95 states have call predecessors, (136), 124 states have return successors, (198), 155 states have call predecessors, (198), 134 states have call successors, (198) [2022-02-20 19:57:21,112 INFO L87 Difference]: Start difference. First operand 1408 states. Second operand has 1293 states, 1031 states have (on average 1.3317167798254121) internal successors, (1373), 1049 states have internal predecessors, (1373), 136 states have call successors, (136), 95 states have call predecessors, (136), 124 states have return successors, (198), 155 states have call predecessors, (198), 134 states have call successors, (198) [2022-02-20 19:57:21,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:21,170 INFO L93 Difference]: Finished difference Result 1408 states and 1842 transitions. [2022-02-20 19:57:21,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1842 transitions. [2022-02-20 19:57:21,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:21,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:21,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 1293 states, 1031 states have (on average 1.3317167798254121) internal successors, (1373), 1049 states have internal predecessors, (1373), 136 states have call successors, (136), 95 states have call predecessors, (136), 124 states have return successors, (198), 155 states have call predecessors, (198), 134 states have call successors, (198) Second operand 1408 states. [2022-02-20 19:57:21,176 INFO L87 Difference]: Start difference. First operand has 1293 states, 1031 states have (on average 1.3317167798254121) internal successors, (1373), 1049 states have internal predecessors, (1373), 136 states have call successors, (136), 95 states have call predecessors, (136), 124 states have return successors, (198), 155 states have call predecessors, (198), 134 states have call successors, (198) Second operand 1408 states. [2022-02-20 19:57:21,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:21,233 INFO L93 Difference]: Finished difference Result 1408 states and 1842 transitions. [2022-02-20 19:57:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1842 transitions. [2022-02-20 19:57:21,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:21,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:21,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:21,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1031 states have (on average 1.3317167798254121) internal successors, (1373), 1049 states have internal predecessors, (1373), 136 states have call successors, (136), 95 states have call predecessors, (136), 124 states have return successors, (198), 155 states have call predecessors, (198), 134 states have call successors, (198) [2022-02-20 19:57:21,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1707 transitions. [2022-02-20 19:57:21,303 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1707 transitions. Word has length 66 [2022-02-20 19:57:21,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:21,303 INFO L470 AbstractCegarLoop]: Abstraction has 1293 states and 1707 transitions. [2022-02-20 19:57:21,303 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:57:21,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1707 transitions. [2022-02-20 19:57:21,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:57:21,304 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:21,304 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:57:21,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:57:21,305 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:21,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:21,305 INFO L85 PathProgramCache]: Analyzing trace with hash 910951962, now seen corresponding path program 1 times [2022-02-20 19:57:21,305 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:21,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110220730] [2022-02-20 19:57:21,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:21,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {28130#(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); {28090#true} is VALID [2022-02-20 19:57:21,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {28090#true} assume true; {28090#true} is VALID [2022-02-20 19:57:21,334 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28090#true} {28092#(= ~c_dr_pc~0 0)} #1100#return; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {28131#(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); {28090#true} is VALID [2022-02-20 19:57:21,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {28090#true} assume !(0 == ~q_write_ev~0); {28090#true} is VALID [2022-02-20 19:57:21,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {28090#true} assume true; {28090#true} is VALID [2022-02-20 19:57:21,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28090#true} {28092#(= ~c_dr_pc~0 0)} #1102#return; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {28090#true} havoc ~__retres1~0; {28090#true} is VALID [2022-02-20 19:57:21,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {28090#true} assume !(1 == ~p_dw_pc~0); {28090#true} is VALID [2022-02-20 19:57:21,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {28090#true} ~__retres1~0 := 0; {28090#true} is VALID [2022-02-20 19:57:21,357 INFO L290 TraceCheckUtils]: 3: Hoare triple {28090#true} #res := ~__retres1~0; {28090#true} is VALID [2022-02-20 19:57:21,357 INFO L290 TraceCheckUtils]: 4: Hoare triple {28090#true} assume true; {28090#true} is VALID [2022-02-20 19:57:21,358 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {28090#true} {28090#true} #1096#return; {28090#true} is VALID [2022-02-20 19:57:21,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {28090#true} havoc ~__retres1~1; {28090#true} is VALID [2022-02-20 19:57:21,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {28090#true} assume !(1 == ~c_dr_pc~0); {28090#true} is VALID [2022-02-20 19:57:21,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {28090#true} ~__retres1~1 := 0; {28090#true} is VALID [2022-02-20 19:57:21,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {28090#true} #res := ~__retres1~1; {28090#true} is VALID [2022-02-20 19:57:21,360 INFO L290 TraceCheckUtils]: 4: Hoare triple {28090#true} assume true; {28090#true} is VALID [2022-02-20 19:57:21,361 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {28090#true} {28090#true} #1098#return; {28090#true} is VALID [2022-02-20 19:57:21,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {28132#(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; {28090#true} is VALID [2022-02-20 19:57:21,361 INFO L272 TraceCheckUtils]: 1: Hoare triple {28090#true} call #t~ret8 := is_do_write_p_triggered(); {28090#true} is VALID [2022-02-20 19:57:21,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {28090#true} havoc ~__retres1~0; {28090#true} is VALID [2022-02-20 19:57:21,361 INFO L290 TraceCheckUtils]: 3: Hoare triple {28090#true} assume !(1 == ~p_dw_pc~0); {28090#true} is VALID [2022-02-20 19:57:21,361 INFO L290 TraceCheckUtils]: 4: Hoare triple {28090#true} ~__retres1~0 := 0; {28090#true} is VALID [2022-02-20 19:57:21,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {28090#true} #res := ~__retres1~0; {28090#true} is VALID [2022-02-20 19:57:21,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {28090#true} assume true; {28090#true} is VALID [2022-02-20 19:57:21,361 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28090#true} {28090#true} #1096#return; {28090#true} is VALID [2022-02-20 19:57:21,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {28090#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {28090#true} is VALID [2022-02-20 19:57:21,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {28090#true} assume !(0 != ~tmp~1); {28090#true} is VALID [2022-02-20 19:57:21,362 INFO L272 TraceCheckUtils]: 10: Hoare triple {28090#true} call #t~ret9 := is_do_read_c_triggered(); {28090#true} is VALID [2022-02-20 19:57:21,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {28090#true} havoc ~__retres1~1; {28090#true} is VALID [2022-02-20 19:57:21,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {28090#true} assume !(1 == ~c_dr_pc~0); {28090#true} is VALID [2022-02-20 19:57:21,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {28090#true} ~__retres1~1 := 0; {28090#true} is VALID [2022-02-20 19:57:21,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {28090#true} #res := ~__retres1~1; {28090#true} is VALID [2022-02-20 19:57:21,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {28090#true} assume true; {28090#true} is VALID [2022-02-20 19:57:21,362 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28090#true} {28090#true} #1098#return; {28090#true} is VALID [2022-02-20 19:57:21,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {28090#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {28090#true} is VALID [2022-02-20 19:57:21,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {28090#true} assume !(0 != ~tmp___0~1); {28090#true} is VALID [2022-02-20 19:57:21,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {28090#true} assume true; {28090#true} is VALID [2022-02-20 19:57:21,363 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {28090#true} {28092#(= ~c_dr_pc~0 0)} #1104#return; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {28131#(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); {28090#true} is VALID [2022-02-20 19:57:21,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {28090#true} assume !(1 == ~q_write_ev~0); {28090#true} is VALID [2022-02-20 19:57:21,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {28090#true} assume true; {28090#true} is VALID [2022-02-20 19:57:21,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28090#true} {28092#(= ~c_dr_pc~0 0)} #1106#return; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {28090#true} havoc ~__retres1~2; {28090#true} is VALID [2022-02-20 19:57:21,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {28090#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {28090#true} is VALID [2022-02-20 19:57:21,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {28090#true} #res := ~__retres1~2; {28090#true} is VALID [2022-02-20 19:57:21,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {28090#true} assume true; {28090#true} is VALID [2022-02-20 19:57:21,370 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {28090#true} {28092#(= ~c_dr_pc~0 0)} #1108#return; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {28090#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {28090#true} is VALID [2022-02-20 19:57:21,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {28090#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {28090#true} is VALID [2022-02-20 19:57:21,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {28090#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,371 INFO L290 TraceCheckUtils]: 3: Hoare triple {28092#(= ~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; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {28092#(= ~c_dr_pc~0 0)} call update_channels1(); {28130#(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:21,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {28130#(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); {28090#true} is VALID [2022-02-20 19:57:21,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {28090#true} assume true; {28090#true} is VALID [2022-02-20 19:57:21,372 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {28090#true} {28092#(= ~c_dr_pc~0 0)} #1100#return; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {28092#(= ~c_dr_pc~0 0)} assume { :begin_inline_init_threads1 } true; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {28092#(= ~c_dr_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {28092#(= ~c_dr_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {28092#(= ~c_dr_pc~0 0)} assume { :end_inline_init_threads1 } true; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,373 INFO L272 TraceCheckUtils]: 12: Hoare triple {28092#(= ~c_dr_pc~0 0)} call fire_delta_events1(); {28131#(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:21,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {28131#(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); {28090#true} is VALID [2022-02-20 19:57:21,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {28090#true} assume !(0 == ~q_write_ev~0); {28090#true} is VALID [2022-02-20 19:57:21,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {28090#true} assume true; {28090#true} is VALID [2022-02-20 19:57:21,374 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {28090#true} {28092#(= ~c_dr_pc~0 0)} #1102#return; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,374 INFO L272 TraceCheckUtils]: 17: Hoare triple {28092#(= ~c_dr_pc~0 0)} call activate_threads1(); {28132#(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:21,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {28132#(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; {28090#true} is VALID [2022-02-20 19:57:21,374 INFO L272 TraceCheckUtils]: 19: Hoare triple {28090#true} call #t~ret8 := is_do_write_p_triggered(); {28090#true} is VALID [2022-02-20 19:57:21,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {28090#true} havoc ~__retres1~0; {28090#true} is VALID [2022-02-20 19:57:21,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {28090#true} assume !(1 == ~p_dw_pc~0); {28090#true} is VALID [2022-02-20 19:57:21,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {28090#true} ~__retres1~0 := 0; {28090#true} is VALID [2022-02-20 19:57:21,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {28090#true} #res := ~__retres1~0; {28090#true} is VALID [2022-02-20 19:57:21,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {28090#true} assume true; {28090#true} is VALID [2022-02-20 19:57:21,375 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {28090#true} {28090#true} #1096#return; {28090#true} is VALID [2022-02-20 19:57:21,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {28090#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {28090#true} is VALID [2022-02-20 19:57:21,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {28090#true} assume !(0 != ~tmp~1); {28090#true} is VALID [2022-02-20 19:57:21,375 INFO L272 TraceCheckUtils]: 28: Hoare triple {28090#true} call #t~ret9 := is_do_read_c_triggered(); {28090#true} is VALID [2022-02-20 19:57:21,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {28090#true} havoc ~__retres1~1; {28090#true} is VALID [2022-02-20 19:57:21,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {28090#true} assume !(1 == ~c_dr_pc~0); {28090#true} is VALID [2022-02-20 19:57:21,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {28090#true} ~__retres1~1 := 0; {28090#true} is VALID [2022-02-20 19:57:21,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {28090#true} #res := ~__retres1~1; {28090#true} is VALID [2022-02-20 19:57:21,376 INFO L290 TraceCheckUtils]: 33: Hoare triple {28090#true} assume true; {28090#true} is VALID [2022-02-20 19:57:21,376 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {28090#true} {28090#true} #1098#return; {28090#true} is VALID [2022-02-20 19:57:21,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {28090#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {28090#true} is VALID [2022-02-20 19:57:21,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {28090#true} assume !(0 != ~tmp___0~1); {28090#true} is VALID [2022-02-20 19:57:21,376 INFO L290 TraceCheckUtils]: 37: Hoare triple {28090#true} assume true; {28090#true} is VALID [2022-02-20 19:57:21,377 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {28090#true} {28092#(= ~c_dr_pc~0 0)} #1104#return; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,377 INFO L272 TraceCheckUtils]: 39: Hoare triple {28092#(= ~c_dr_pc~0 0)} call reset_delta_events1(); {28131#(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:21,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {28131#(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); {28090#true} is VALID [2022-02-20 19:57:21,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {28090#true} assume !(1 == ~q_write_ev~0); {28090#true} is VALID [2022-02-20 19:57:21,377 INFO L290 TraceCheckUtils]: 42: Hoare triple {28090#true} assume true; {28090#true} is VALID [2022-02-20 19:57:21,378 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {28090#true} {28092#(= ~c_dr_pc~0 0)} #1106#return; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {28092#(= ~c_dr_pc~0 0)} assume !false; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,378 INFO L290 TraceCheckUtils]: 45: Hoare triple {28092#(= ~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; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,378 INFO L290 TraceCheckUtils]: 46: Hoare triple {28092#(= ~c_dr_pc~0 0)} assume !false; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,378 INFO L272 TraceCheckUtils]: 47: Hoare triple {28092#(= ~c_dr_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {28090#true} is VALID [2022-02-20 19:57:21,379 INFO L290 TraceCheckUtils]: 48: Hoare triple {28090#true} havoc ~__retres1~2; {28090#true} is VALID [2022-02-20 19:57:21,379 INFO L290 TraceCheckUtils]: 49: Hoare triple {28090#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {28090#true} is VALID [2022-02-20 19:57:21,379 INFO L290 TraceCheckUtils]: 50: Hoare triple {28090#true} #res := ~__retres1~2; {28090#true} is VALID [2022-02-20 19:57:21,379 INFO L290 TraceCheckUtils]: 51: Hoare triple {28090#true} assume true; {28090#true} is VALID [2022-02-20 19:57:21,379 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {28090#true} {28092#(= ~c_dr_pc~0 0)} #1108#return; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,379 INFO L290 TraceCheckUtils]: 53: Hoare triple {28092#(= ~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; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,380 INFO L290 TraceCheckUtils]: 54: Hoare triple {28092#(= ~c_dr_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,380 INFO L290 TraceCheckUtils]: 55: Hoare triple {28092#(= ~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; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,380 INFO L290 TraceCheckUtils]: 56: Hoare triple {28092#(= ~c_dr_pc~0 0)} assume !(0 != eval1_~tmp~2#1); {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,380 INFO L290 TraceCheckUtils]: 57: Hoare triple {28092#(= ~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; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,381 INFO L290 TraceCheckUtils]: 58: Hoare triple {28092#(= ~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; {28092#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:21,381 INFO L290 TraceCheckUtils]: 59: Hoare triple {28092#(= ~c_dr_pc~0 0)} assume !(0 == ~c_dr_pc~0); {28091#false} is VALID [2022-02-20 19:57:21,381 INFO L290 TraceCheckUtils]: 60: Hoare triple {28091#false} assume 1 == ~c_dr_pc~0; {28091#false} is VALID [2022-02-20 19:57:21,381 INFO L290 TraceCheckUtils]: 61: Hoare triple {28091#false} do_read_c_~a~0#1 := ~a_t~0; {28091#false} is VALID [2022-02-20 19:57:21,381 INFO L290 TraceCheckUtils]: 62: Hoare triple {28091#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; {28091#false} is VALID [2022-02-20 19:57:21,381 INFO L290 TraceCheckUtils]: 63: Hoare triple {28091#false} assume !(~p_last_write~0 == ~c_last_read~0); {28091#false} is VALID [2022-02-20 19:57:21,382 INFO L272 TraceCheckUtils]: 64: Hoare triple {28091#false} call error1(); {28091#false} is VALID [2022-02-20 19:57:21,382 INFO L290 TraceCheckUtils]: 65: Hoare triple {28091#false} assume !false; {28091#false} is VALID [2022-02-20 19:57:21,382 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:21,382 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:21,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110220730] [2022-02-20 19:57:21,382 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110220730] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:21,382 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:21,382 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:21,383 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832933006] [2022-02-20 19:57:21,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:21,383 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:57:21,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:21,383 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:57:21,424 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:57:21,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:21,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:21,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:21,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:21,425 INFO L87 Difference]: Start difference. First operand 1293 states and 1707 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:57:22,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:22,865 INFO L93 Difference]: Finished difference Result 3481 states and 4513 transitions. [2022-02-20 19:57:22,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:22,866 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:57:22,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:22,866 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:57:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 717 transitions. [2022-02-20 19:57:22,870 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:57:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 717 transitions. [2022-02-20 19:57:22,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 717 transitions. [2022-02-20 19:57:23,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 717 edges. 717 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:23,500 INFO L225 Difference]: With dead ends: 3481 [2022-02-20 19:57:23,500 INFO L226 Difference]: Without dead ends: 2413 [2022-02-20 19:57:23,502 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:57:23,504 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 1057 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:23,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1083 Valid, 854 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 19:57:23,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states. [2022-02-20 19:57:23,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 2155. [2022-02-20 19:57:23,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:23,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2413 states. Second operand has 2155 states, 1697 states have (on average 1.296405421331762) internal successors, (2200), 1725 states have internal predecessors, (2200), 234 states have call successors, (234), 179 states have call predecessors, (234), 222 states have return successors, (334), 257 states have call predecessors, (334), 232 states have call successors, (334) [2022-02-20 19:57:23,642 INFO L74 IsIncluded]: Start isIncluded. First operand 2413 states. Second operand has 2155 states, 1697 states have (on average 1.296405421331762) internal successors, (2200), 1725 states have internal predecessors, (2200), 234 states have call successors, (234), 179 states have call predecessors, (234), 222 states have return successors, (334), 257 states have call predecessors, (334), 232 states have call successors, (334) [2022-02-20 19:57:23,645 INFO L87 Difference]: Start difference. First operand 2413 states. Second operand has 2155 states, 1697 states have (on average 1.296405421331762) internal successors, (2200), 1725 states have internal predecessors, (2200), 234 states have call successors, (234), 179 states have call predecessors, (234), 222 states have return successors, (334), 257 states have call predecessors, (334), 232 states have call successors, (334) [2022-02-20 19:57:23,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:23,805 INFO L93 Difference]: Finished difference Result 2413 states and 3068 transitions. [2022-02-20 19:57:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 3068 transitions. [2022-02-20 19:57:23,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:23,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:23,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 2155 states, 1697 states have (on average 1.296405421331762) internal successors, (2200), 1725 states have internal predecessors, (2200), 234 states have call successors, (234), 179 states have call predecessors, (234), 222 states have return successors, (334), 257 states have call predecessors, (334), 232 states have call successors, (334) Second operand 2413 states. [2022-02-20 19:57:23,814 INFO L87 Difference]: Start difference. First operand has 2155 states, 1697 states have (on average 1.296405421331762) internal successors, (2200), 1725 states have internal predecessors, (2200), 234 states have call successors, (234), 179 states have call predecessors, (234), 222 states have return successors, (334), 257 states have call predecessors, (334), 232 states have call successors, (334) Second operand 2413 states. [2022-02-20 19:57:23,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:23,972 INFO L93 Difference]: Finished difference Result 2413 states and 3068 transitions. [2022-02-20 19:57:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 3068 transitions. [2022-02-20 19:57:23,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:23,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:23,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:23,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:23,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 1697 states have (on average 1.296405421331762) internal successors, (2200), 1725 states have internal predecessors, (2200), 234 states have call successors, (234), 179 states have call predecessors, (234), 222 states have return successors, (334), 257 states have call predecessors, (334), 232 states have call successors, (334) [2022-02-20 19:57:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2768 transitions. [2022-02-20 19:57:24,184 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 2768 transitions. Word has length 66 [2022-02-20 19:57:24,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:24,184 INFO L470 AbstractCegarLoop]: Abstraction has 2155 states and 2768 transitions. [2022-02-20 19:57:24,185 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:57:24,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2768 transitions. [2022-02-20 19:57:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:57:24,187 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:24,187 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:57:24,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:57:24,187 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:24,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:24,188 INFO L85 PathProgramCache]: Analyzing trace with hash 680194510, now seen corresponding path program 1 times [2022-02-20 19:57:24,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:24,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359960588] [2022-02-20 19:57:24,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:24,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {40559#(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); {40519#true} is VALID [2022-02-20 19:57:24,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {40519#true} assume true; {40519#true} is VALID [2022-02-20 19:57:24,230 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40519#true} {40521#(= ~p_dw_pc~0 0)} #1100#return; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {40560#(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); {40519#true} is VALID [2022-02-20 19:57:24,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {40519#true} assume !(0 == ~q_write_ev~0); {40519#true} is VALID [2022-02-20 19:57:24,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {40519#true} assume true; {40519#true} is VALID [2022-02-20 19:57:24,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40519#true} {40521#(= ~p_dw_pc~0 0)} #1102#return; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {40519#true} havoc ~__retres1~0; {40519#true} is VALID [2022-02-20 19:57:24,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {40519#true} assume !(1 == ~p_dw_pc~0); {40519#true} is VALID [2022-02-20 19:57:24,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {40519#true} ~__retres1~0 := 0; {40519#true} is VALID [2022-02-20 19:57:24,270 INFO L290 TraceCheckUtils]: 3: Hoare triple {40519#true} #res := ~__retres1~0; {40519#true} is VALID [2022-02-20 19:57:24,270 INFO L290 TraceCheckUtils]: 4: Hoare triple {40519#true} assume true; {40519#true} is VALID [2022-02-20 19:57:24,270 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {40519#true} {40519#true} #1096#return; {40519#true} is VALID [2022-02-20 19:57:24,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {40519#true} havoc ~__retres1~1; {40519#true} is VALID [2022-02-20 19:57:24,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {40519#true} assume !(1 == ~c_dr_pc~0); {40519#true} is VALID [2022-02-20 19:57:24,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {40519#true} ~__retres1~1 := 0; {40519#true} is VALID [2022-02-20 19:57:24,273 INFO L290 TraceCheckUtils]: 3: Hoare triple {40519#true} #res := ~__retres1~1; {40519#true} is VALID [2022-02-20 19:57:24,273 INFO L290 TraceCheckUtils]: 4: Hoare triple {40519#true} assume true; {40519#true} is VALID [2022-02-20 19:57:24,273 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {40519#true} {40519#true} #1098#return; {40519#true} is VALID [2022-02-20 19:57:24,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {40561#(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; {40519#true} is VALID [2022-02-20 19:57:24,273 INFO L272 TraceCheckUtils]: 1: Hoare triple {40519#true} call #t~ret8 := is_do_write_p_triggered(); {40519#true} is VALID [2022-02-20 19:57:24,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {40519#true} havoc ~__retres1~0; {40519#true} is VALID [2022-02-20 19:57:24,273 INFO L290 TraceCheckUtils]: 3: Hoare triple {40519#true} assume !(1 == ~p_dw_pc~0); {40519#true} is VALID [2022-02-20 19:57:24,274 INFO L290 TraceCheckUtils]: 4: Hoare triple {40519#true} ~__retres1~0 := 0; {40519#true} is VALID [2022-02-20 19:57:24,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {40519#true} #res := ~__retres1~0; {40519#true} is VALID [2022-02-20 19:57:24,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {40519#true} assume true; {40519#true} is VALID [2022-02-20 19:57:24,274 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {40519#true} {40519#true} #1096#return; {40519#true} is VALID [2022-02-20 19:57:24,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {40519#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {40519#true} is VALID [2022-02-20 19:57:24,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {40519#true} assume !(0 != ~tmp~1); {40519#true} is VALID [2022-02-20 19:57:24,274 INFO L272 TraceCheckUtils]: 10: Hoare triple {40519#true} call #t~ret9 := is_do_read_c_triggered(); {40519#true} is VALID [2022-02-20 19:57:24,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {40519#true} havoc ~__retres1~1; {40519#true} is VALID [2022-02-20 19:57:24,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {40519#true} assume !(1 == ~c_dr_pc~0); {40519#true} is VALID [2022-02-20 19:57:24,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {40519#true} ~__retres1~1 := 0; {40519#true} is VALID [2022-02-20 19:57:24,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {40519#true} #res := ~__retres1~1; {40519#true} is VALID [2022-02-20 19:57:24,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {40519#true} assume true; {40519#true} is VALID [2022-02-20 19:57:24,276 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {40519#true} {40519#true} #1098#return; {40519#true} is VALID [2022-02-20 19:57:24,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {40519#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {40519#true} is VALID [2022-02-20 19:57:24,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {40519#true} assume !(0 != ~tmp___0~1); {40519#true} is VALID [2022-02-20 19:57:24,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {40519#true} assume true; {40519#true} is VALID [2022-02-20 19:57:24,276 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {40519#true} {40521#(= ~p_dw_pc~0 0)} #1104#return; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {40560#(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); {40519#true} is VALID [2022-02-20 19:57:24,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {40519#true} assume !(1 == ~q_write_ev~0); {40519#true} is VALID [2022-02-20 19:57:24,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {40519#true} assume true; {40519#true} is VALID [2022-02-20 19:57:24,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40519#true} {40521#(= ~p_dw_pc~0 0)} #1106#return; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {40519#true} havoc ~__retres1~2; {40519#true} is VALID [2022-02-20 19:57:24,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {40519#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {40519#true} is VALID [2022-02-20 19:57:24,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {40519#true} #res := ~__retres1~2; {40519#true} is VALID [2022-02-20 19:57:24,297 INFO L290 TraceCheckUtils]: 3: Hoare triple {40519#true} assume true; {40519#true} is VALID [2022-02-20 19:57:24,297 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {40519#true} {40521#(= ~p_dw_pc~0 0)} #1108#return; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {40519#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {40519#true} is VALID [2022-02-20 19:57:24,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {40519#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {40519#true} is VALID [2022-02-20 19:57:24,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {40519#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,298 INFO L290 TraceCheckUtils]: 3: Hoare triple {40521#(= ~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; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {40521#(= ~p_dw_pc~0 0)} call update_channels1(); {40559#(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:24,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {40559#(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); {40519#true} is VALID [2022-02-20 19:57:24,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {40519#true} assume true; {40519#true} is VALID [2022-02-20 19:57:24,299 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {40519#true} {40521#(= ~p_dw_pc~0 0)} #1100#return; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {40521#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {40521#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {40521#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {40521#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,300 INFO L272 TraceCheckUtils]: 12: Hoare triple {40521#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {40560#(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:24,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {40560#(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); {40519#true} is VALID [2022-02-20 19:57:24,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {40519#true} assume !(0 == ~q_write_ev~0); {40519#true} is VALID [2022-02-20 19:57:24,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {40519#true} assume true; {40519#true} is VALID [2022-02-20 19:57:24,300 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {40519#true} {40521#(= ~p_dw_pc~0 0)} #1102#return; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,301 INFO L272 TraceCheckUtils]: 17: Hoare triple {40521#(= ~p_dw_pc~0 0)} call activate_threads1(); {40561#(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:24,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {40561#(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; {40519#true} is VALID [2022-02-20 19:57:24,301 INFO L272 TraceCheckUtils]: 19: Hoare triple {40519#true} call #t~ret8 := is_do_write_p_triggered(); {40519#true} is VALID [2022-02-20 19:57:24,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {40519#true} havoc ~__retres1~0; {40519#true} is VALID [2022-02-20 19:57:24,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {40519#true} assume !(1 == ~p_dw_pc~0); {40519#true} is VALID [2022-02-20 19:57:24,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {40519#true} ~__retres1~0 := 0; {40519#true} is VALID [2022-02-20 19:57:24,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {40519#true} #res := ~__retres1~0; {40519#true} is VALID [2022-02-20 19:57:24,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {40519#true} assume true; {40519#true} is VALID [2022-02-20 19:57:24,301 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {40519#true} {40519#true} #1096#return; {40519#true} is VALID [2022-02-20 19:57:24,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {40519#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {40519#true} is VALID [2022-02-20 19:57:24,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {40519#true} assume !(0 != ~tmp~1); {40519#true} is VALID [2022-02-20 19:57:24,301 INFO L272 TraceCheckUtils]: 28: Hoare triple {40519#true} call #t~ret9 := is_do_read_c_triggered(); {40519#true} is VALID [2022-02-20 19:57:24,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {40519#true} havoc ~__retres1~1; {40519#true} is VALID [2022-02-20 19:57:24,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {40519#true} assume !(1 == ~c_dr_pc~0); {40519#true} is VALID [2022-02-20 19:57:24,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {40519#true} ~__retres1~1 := 0; {40519#true} is VALID [2022-02-20 19:57:24,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {40519#true} #res := ~__retres1~1; {40519#true} is VALID [2022-02-20 19:57:24,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {40519#true} assume true; {40519#true} is VALID [2022-02-20 19:57:24,302 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {40519#true} {40519#true} #1098#return; {40519#true} is VALID [2022-02-20 19:57:24,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {40519#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {40519#true} is VALID [2022-02-20 19:57:24,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {40519#true} assume !(0 != ~tmp___0~1); {40519#true} is VALID [2022-02-20 19:57:24,302 INFO L290 TraceCheckUtils]: 37: Hoare triple {40519#true} assume true; {40519#true} is VALID [2022-02-20 19:57:24,302 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {40519#true} {40521#(= ~p_dw_pc~0 0)} #1104#return; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,303 INFO L272 TraceCheckUtils]: 39: Hoare triple {40521#(= ~p_dw_pc~0 0)} call reset_delta_events1(); {40560#(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:24,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {40560#(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); {40519#true} is VALID [2022-02-20 19:57:24,303 INFO L290 TraceCheckUtils]: 41: Hoare triple {40519#true} assume !(1 == ~q_write_ev~0); {40519#true} is VALID [2022-02-20 19:57:24,303 INFO L290 TraceCheckUtils]: 42: Hoare triple {40519#true} assume true; {40519#true} is VALID [2022-02-20 19:57:24,303 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {40519#true} {40521#(= ~p_dw_pc~0 0)} #1106#return; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,304 INFO L290 TraceCheckUtils]: 44: Hoare triple {40521#(= ~p_dw_pc~0 0)} assume !false; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,304 INFO L290 TraceCheckUtils]: 45: Hoare triple {40521#(= ~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; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,304 INFO L290 TraceCheckUtils]: 46: Hoare triple {40521#(= ~p_dw_pc~0 0)} assume !false; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,304 INFO L272 TraceCheckUtils]: 47: Hoare triple {40521#(= ~p_dw_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {40519#true} is VALID [2022-02-20 19:57:24,304 INFO L290 TraceCheckUtils]: 48: Hoare triple {40519#true} havoc ~__retres1~2; {40519#true} is VALID [2022-02-20 19:57:24,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {40519#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {40519#true} is VALID [2022-02-20 19:57:24,305 INFO L290 TraceCheckUtils]: 50: Hoare triple {40519#true} #res := ~__retres1~2; {40519#true} is VALID [2022-02-20 19:57:24,305 INFO L290 TraceCheckUtils]: 51: Hoare triple {40519#true} assume true; {40519#true} is VALID [2022-02-20 19:57:24,305 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {40519#true} {40521#(= ~p_dw_pc~0 0)} #1108#return; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,305 INFO L290 TraceCheckUtils]: 53: Hoare triple {40521#(= ~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; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,306 INFO L290 TraceCheckUtils]: 54: Hoare triple {40521#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,306 INFO L290 TraceCheckUtils]: 55: Hoare triple {40521#(= ~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; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,306 INFO L290 TraceCheckUtils]: 56: Hoare triple {40521#(= ~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; {40521#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:24,307 INFO L290 TraceCheckUtils]: 57: Hoare triple {40521#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {40520#false} is VALID [2022-02-20 19:57:24,307 INFO L290 TraceCheckUtils]: 58: Hoare triple {40520#false} assume 1 == ~p_dw_pc~0; {40520#false} is VALID [2022-02-20 19:57:24,307 INFO L290 TraceCheckUtils]: 59: Hoare triple {40520#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; {40520#false} is VALID [2022-02-20 19:57:24,307 INFO L290 TraceCheckUtils]: 60: Hoare triple {40520#false} assume !false; {40520#false} is VALID [2022-02-20 19:57:24,307 INFO L290 TraceCheckUtils]: 61: Hoare triple {40520#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {40520#false} is VALID [2022-02-20 19:57:24,307 INFO L290 TraceCheckUtils]: 62: Hoare triple {40520#false} assume { :end_inline_do_write_p } true; {40520#false} is VALID [2022-02-20 19:57:24,307 INFO L290 TraceCheckUtils]: 63: Hoare triple {40520#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; {40520#false} is VALID [2022-02-20 19:57:24,307 INFO L290 TraceCheckUtils]: 64: Hoare triple {40520#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; {40520#false} is VALID [2022-02-20 19:57:24,307 INFO L290 TraceCheckUtils]: 65: Hoare triple {40520#false} assume 0 == ~c_dr_pc~0; {40520#false} is VALID [2022-02-20 19:57:24,308 INFO L290 TraceCheckUtils]: 66: Hoare triple {40520#false} assume !false; {40520#false} is VALID [2022-02-20 19:57:24,308 INFO L290 TraceCheckUtils]: 67: Hoare triple {40520#false} assume !(1 == ~q_free~0); {40520#false} is VALID [2022-02-20 19:57:24,308 INFO L290 TraceCheckUtils]: 68: Hoare triple {40520#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; {40520#false} is VALID [2022-02-20 19:57:24,308 INFO L290 TraceCheckUtils]: 69: Hoare triple {40520#false} assume !(~p_last_write~0 == ~c_last_read~0); {40520#false} is VALID [2022-02-20 19:57:24,308 INFO L272 TraceCheckUtils]: 70: Hoare triple {40520#false} call error1(); {40520#false} is VALID [2022-02-20 19:57:24,308 INFO L290 TraceCheckUtils]: 71: Hoare triple {40520#false} assume !false; {40520#false} is VALID [2022-02-20 19:57:24,308 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:24,308 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:24,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359960588] [2022-02-20 19:57:24,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359960588] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:24,309 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:24,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:24,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517240775] [2022-02-20 19:57:24,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:24,309 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:57:24,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:24,310 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:57:24,356 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:57:24,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:24,356 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:24,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:24,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:24,357 INFO L87 Difference]: Start difference. First operand 2155 states and 2768 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:57:26,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:26,442 INFO L93 Difference]: Finished difference Result 5065 states and 6418 transitions. [2022-02-20 19:57:26,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:57:26,443 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:57:26,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:26,443 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:57:26,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 703 transitions. [2022-02-20 19:57:26,446 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:57:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 703 transitions. [2022-02-20 19:57:26,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 703 transitions. [2022-02-20 19:57:26,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 703 edges. 703 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:27,282 INFO L225 Difference]: With dead ends: 5065 [2022-02-20 19:57:27,282 INFO L226 Difference]: Without dead ends: 3135 [2022-02-20 19:57:27,285 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:57:27,286 INFO L933 BasicCegarLoop]: 443 mSDtfsCounter, 825 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:27,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [851 Valid, 1091 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 19:57:27,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2022-02-20 19:57:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2887. [2022-02-20 19:57:27,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:27,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3135 states. Second operand has 2887 states, 2265 states have (on average 1.2821192052980133) internal successors, (2904), 2301 states have internal predecessors, (2904), 314 states have call successors, (314), 249 states have call predecessors, (314), 306 states have return successors, (443), 343 states have call predecessors, (443), 312 states have call successors, (443) [2022-02-20 19:57:27,454 INFO L74 IsIncluded]: Start isIncluded. First operand 3135 states. Second operand has 2887 states, 2265 states have (on average 1.2821192052980133) internal successors, (2904), 2301 states have internal predecessors, (2904), 314 states have call successors, (314), 249 states have call predecessors, (314), 306 states have return successors, (443), 343 states have call predecessors, (443), 312 states have call successors, (443) [2022-02-20 19:57:27,458 INFO L87 Difference]: Start difference. First operand 3135 states. Second operand has 2887 states, 2265 states have (on average 1.2821192052980133) internal successors, (2904), 2301 states have internal predecessors, (2904), 314 states have call successors, (314), 249 states have call predecessors, (314), 306 states have return successors, (443), 343 states have call predecessors, (443), 312 states have call successors, (443) [2022-02-20 19:57:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:27,749 INFO L93 Difference]: Finished difference Result 3135 states and 3942 transitions. [2022-02-20 19:57:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 3942 transitions. [2022-02-20 19:57:27,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:27,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:27,759 INFO L74 IsIncluded]: Start isIncluded. First operand has 2887 states, 2265 states have (on average 1.2821192052980133) internal successors, (2904), 2301 states have internal predecessors, (2904), 314 states have call successors, (314), 249 states have call predecessors, (314), 306 states have return successors, (443), 343 states have call predecessors, (443), 312 states have call successors, (443) Second operand 3135 states. [2022-02-20 19:57:27,762 INFO L87 Difference]: Start difference. First operand has 2887 states, 2265 states have (on average 1.2821192052980133) internal successors, (2904), 2301 states have internal predecessors, (2904), 314 states have call successors, (314), 249 states have call predecessors, (314), 306 states have return successors, (443), 343 states have call predecessors, (443), 312 states have call successors, (443) Second operand 3135 states. [2022-02-20 19:57:28,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:28,086 INFO L93 Difference]: Finished difference Result 3135 states and 3942 transitions. [2022-02-20 19:57:28,086 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 3942 transitions. [2022-02-20 19:57:28,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:28,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:28,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:28,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:28,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2887 states, 2265 states have (on average 1.2821192052980133) internal successors, (2904), 2301 states have internal predecessors, (2904), 314 states have call successors, (314), 249 states have call predecessors, (314), 306 states have return successors, (443), 343 states have call predecessors, (443), 312 states have call successors, (443) [2022-02-20 19:57:28,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 3661 transitions. [2022-02-20 19:57:28,412 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 3661 transitions. Word has length 72 [2022-02-20 19:57:28,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:28,413 INFO L470 AbstractCegarLoop]: Abstraction has 2887 states and 3661 transitions. [2022-02-20 19:57:28,413 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:57:28,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 3661 transitions. [2022-02-20 19:57:28,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:57:28,415 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:28,415 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:57:28,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:57:28,416 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:28,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:28,416 INFO L85 PathProgramCache]: Analyzing trace with hash -905222844, now seen corresponding path program 1 times [2022-02-20 19:57:28,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:28,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627457312] [2022-02-20 19:57:28,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:28,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:28,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:28,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {57557#(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); {57516#true} is VALID [2022-02-20 19:57:28,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {57516#true} assume true; {57516#true} is VALID [2022-02-20 19:57:28,460 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57516#true} {57516#true} #1100#return; {57516#true} is VALID [2022-02-20 19:57:28,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:28,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {57558#(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); {57516#true} is VALID [2022-02-20 19:57:28,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {57516#true} assume !(0 == ~q_write_ev~0); {57516#true} is VALID [2022-02-20 19:57:28,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {57516#true} assume true; {57516#true} is VALID [2022-02-20 19:57:28,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57516#true} {57516#true} #1102#return; {57516#true} is VALID [2022-02-20 19:57:28,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:28,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:28,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {57516#true} havoc ~__retres1~0; {57516#true} is VALID [2022-02-20 19:57:28,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {57516#true} assume !(1 == ~p_dw_pc~0); {57516#true} is VALID [2022-02-20 19:57:28,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {57516#true} ~__retres1~0 := 0; {57516#true} is VALID [2022-02-20 19:57:28,478 INFO L290 TraceCheckUtils]: 3: Hoare triple {57516#true} #res := ~__retres1~0; {57516#true} is VALID [2022-02-20 19:57:28,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {57516#true} assume true; {57516#true} is VALID [2022-02-20 19:57:28,478 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {57516#true} {57516#true} #1096#return; {57516#true} is VALID [2022-02-20 19:57:28,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:28,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {57516#true} havoc ~__retres1~1; {57516#true} is VALID [2022-02-20 19:57:28,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {57516#true} assume !(1 == ~c_dr_pc~0); {57516#true} is VALID [2022-02-20 19:57:28,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {57516#true} ~__retres1~1 := 0; {57516#true} is VALID [2022-02-20 19:57:28,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {57516#true} #res := ~__retres1~1; {57516#true} is VALID [2022-02-20 19:57:28,482 INFO L290 TraceCheckUtils]: 4: Hoare triple {57516#true} assume true; {57516#true} is VALID [2022-02-20 19:57:28,483 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {57516#true} {57516#true} #1098#return; {57516#true} is VALID [2022-02-20 19:57:28,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {57559#(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; {57516#true} is VALID [2022-02-20 19:57:28,483 INFO L272 TraceCheckUtils]: 1: Hoare triple {57516#true} call #t~ret8 := is_do_write_p_triggered(); {57516#true} is VALID [2022-02-20 19:57:28,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {57516#true} havoc ~__retres1~0; {57516#true} is VALID [2022-02-20 19:57:28,483 INFO L290 TraceCheckUtils]: 3: Hoare triple {57516#true} assume !(1 == ~p_dw_pc~0); {57516#true} is VALID [2022-02-20 19:57:28,483 INFO L290 TraceCheckUtils]: 4: Hoare triple {57516#true} ~__retres1~0 := 0; {57516#true} is VALID [2022-02-20 19:57:28,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {57516#true} #res := ~__retres1~0; {57516#true} is VALID [2022-02-20 19:57:28,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {57516#true} assume true; {57516#true} is VALID [2022-02-20 19:57:28,483 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {57516#true} {57516#true} #1096#return; {57516#true} is VALID [2022-02-20 19:57:28,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {57516#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {57516#true} is VALID [2022-02-20 19:57:28,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {57516#true} assume !(0 != ~tmp~1); {57516#true} is VALID [2022-02-20 19:57:28,484 INFO L272 TraceCheckUtils]: 10: Hoare triple {57516#true} call #t~ret9 := is_do_read_c_triggered(); {57516#true} is VALID [2022-02-20 19:57:28,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {57516#true} havoc ~__retres1~1; {57516#true} is VALID [2022-02-20 19:57:28,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {57516#true} assume !(1 == ~c_dr_pc~0); {57516#true} is VALID [2022-02-20 19:57:28,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {57516#true} ~__retres1~1 := 0; {57516#true} is VALID [2022-02-20 19:57:28,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {57516#true} #res := ~__retres1~1; {57516#true} is VALID [2022-02-20 19:57:28,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {57516#true} assume true; {57516#true} is VALID [2022-02-20 19:57:28,484 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {57516#true} {57516#true} #1098#return; {57516#true} is VALID [2022-02-20 19:57:28,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {57516#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {57516#true} is VALID [2022-02-20 19:57:28,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {57516#true} assume !(0 != ~tmp___0~1); {57516#true} is VALID [2022-02-20 19:57:28,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {57516#true} assume true; {57516#true} is VALID [2022-02-20 19:57:28,485 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {57516#true} {57516#true} #1104#return; {57516#true} is VALID [2022-02-20 19:57:28,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:28,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {57558#(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); {57516#true} is VALID [2022-02-20 19:57:28,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {57516#true} assume !(1 == ~q_write_ev~0); {57516#true} is VALID [2022-02-20 19:57:28,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {57516#true} assume true; {57516#true} is VALID [2022-02-20 19:57:28,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57516#true} {57516#true} #1106#return; {57516#true} is VALID [2022-02-20 19:57:28,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:28,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {57516#true} havoc ~__retres1~2; {57516#true} is VALID [2022-02-20 19:57:28,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {57516#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {57516#true} is VALID [2022-02-20 19:57:28,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {57516#true} #res := ~__retres1~2; {57516#true} is VALID [2022-02-20 19:57:28,494 INFO L290 TraceCheckUtils]: 3: Hoare triple {57516#true} assume true; {57516#true} is VALID [2022-02-20 19:57:28,494 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {57516#true} {57516#true} #1108#return; {57516#true} is VALID [2022-02-20 19:57:28,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {57516#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {57516#true} is VALID [2022-02-20 19:57:28,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {57516#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {57516#true} is VALID [2022-02-20 19:57:28,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {57516#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {57516#true} is VALID [2022-02-20 19:57:28,494 INFO L290 TraceCheckUtils]: 3: Hoare triple {57516#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; {57516#true} is VALID [2022-02-20 19:57:28,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {57516#true} call update_channels1(); {57557#(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:28,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {57557#(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); {57516#true} is VALID [2022-02-20 19:57:28,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {57516#true} assume true; {57516#true} is VALID [2022-02-20 19:57:28,495 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {57516#true} {57516#true} #1100#return; {57516#true} is VALID [2022-02-20 19:57:28,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {57516#true} assume { :begin_inline_init_threads1 } true; {57516#true} is VALID [2022-02-20 19:57:28,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {57516#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {57516#true} is VALID [2022-02-20 19:57:28,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {57516#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {57516#true} is VALID [2022-02-20 19:57:28,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {57516#true} assume { :end_inline_init_threads1 } true; {57516#true} is VALID [2022-02-20 19:57:28,496 INFO L272 TraceCheckUtils]: 12: Hoare triple {57516#true} call fire_delta_events1(); {57558#(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:28,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {57558#(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); {57516#true} is VALID [2022-02-20 19:57:28,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {57516#true} assume !(0 == ~q_write_ev~0); {57516#true} is VALID [2022-02-20 19:57:28,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {57516#true} assume true; {57516#true} is VALID [2022-02-20 19:57:28,496 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {57516#true} {57516#true} #1102#return; {57516#true} is VALID [2022-02-20 19:57:28,497 INFO L272 TraceCheckUtils]: 17: Hoare triple {57516#true} call activate_threads1(); {57559#(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:28,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {57559#(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; {57516#true} is VALID [2022-02-20 19:57:28,497 INFO L272 TraceCheckUtils]: 19: Hoare triple {57516#true} call #t~ret8 := is_do_write_p_triggered(); {57516#true} is VALID [2022-02-20 19:57:28,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {57516#true} havoc ~__retres1~0; {57516#true} is VALID [2022-02-20 19:57:28,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {57516#true} assume !(1 == ~p_dw_pc~0); {57516#true} is VALID [2022-02-20 19:57:28,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {57516#true} ~__retres1~0 := 0; {57516#true} is VALID [2022-02-20 19:57:28,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {57516#true} #res := ~__retres1~0; {57516#true} is VALID [2022-02-20 19:57:28,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {57516#true} assume true; {57516#true} is VALID [2022-02-20 19:57:28,498 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {57516#true} {57516#true} #1096#return; {57516#true} is VALID [2022-02-20 19:57:28,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {57516#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {57516#true} is VALID [2022-02-20 19:57:28,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {57516#true} assume !(0 != ~tmp~1); {57516#true} is VALID [2022-02-20 19:57:28,498 INFO L272 TraceCheckUtils]: 28: Hoare triple {57516#true} call #t~ret9 := is_do_read_c_triggered(); {57516#true} is VALID [2022-02-20 19:57:28,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {57516#true} havoc ~__retres1~1; {57516#true} is VALID [2022-02-20 19:57:28,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {57516#true} assume !(1 == ~c_dr_pc~0); {57516#true} is VALID [2022-02-20 19:57:28,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {57516#true} ~__retres1~1 := 0; {57516#true} is VALID [2022-02-20 19:57:28,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {57516#true} #res := ~__retres1~1; {57516#true} is VALID [2022-02-20 19:57:28,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {57516#true} assume true; {57516#true} is VALID [2022-02-20 19:57:28,499 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {57516#true} {57516#true} #1098#return; {57516#true} is VALID [2022-02-20 19:57:28,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {57516#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {57516#true} is VALID [2022-02-20 19:57:28,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {57516#true} assume !(0 != ~tmp___0~1); {57516#true} is VALID [2022-02-20 19:57:28,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {57516#true} assume true; {57516#true} is VALID [2022-02-20 19:57:28,499 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {57516#true} {57516#true} #1104#return; {57516#true} is VALID [2022-02-20 19:57:28,500 INFO L272 TraceCheckUtils]: 39: Hoare triple {57516#true} call reset_delta_events1(); {57558#(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:28,500 INFO L290 TraceCheckUtils]: 40: Hoare triple {57558#(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); {57516#true} is VALID [2022-02-20 19:57:28,500 INFO L290 TraceCheckUtils]: 41: Hoare triple {57516#true} assume !(1 == ~q_write_ev~0); {57516#true} is VALID [2022-02-20 19:57:28,500 INFO L290 TraceCheckUtils]: 42: Hoare triple {57516#true} assume true; {57516#true} is VALID [2022-02-20 19:57:28,500 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {57516#true} {57516#true} #1106#return; {57516#true} is VALID [2022-02-20 19:57:28,500 INFO L290 TraceCheckUtils]: 44: Hoare triple {57516#true} assume !false; {57516#true} is VALID [2022-02-20 19:57:28,500 INFO L290 TraceCheckUtils]: 45: Hoare triple {57516#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; {57516#true} is VALID [2022-02-20 19:57:28,500 INFO L290 TraceCheckUtils]: 46: Hoare triple {57516#true} assume !false; {57516#true} is VALID [2022-02-20 19:57:28,501 INFO L272 TraceCheckUtils]: 47: Hoare triple {57516#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {57516#true} is VALID [2022-02-20 19:57:28,501 INFO L290 TraceCheckUtils]: 48: Hoare triple {57516#true} havoc ~__retres1~2; {57516#true} is VALID [2022-02-20 19:57:28,501 INFO L290 TraceCheckUtils]: 49: Hoare triple {57516#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {57516#true} is VALID [2022-02-20 19:57:28,501 INFO L290 TraceCheckUtils]: 50: Hoare triple {57516#true} #res := ~__retres1~2; {57516#true} is VALID [2022-02-20 19:57:28,501 INFO L290 TraceCheckUtils]: 51: Hoare triple {57516#true} assume true; {57516#true} is VALID [2022-02-20 19:57:28,501 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {57516#true} {57516#true} #1108#return; {57516#true} is VALID [2022-02-20 19:57:28,501 INFO L290 TraceCheckUtils]: 53: Hoare triple {57516#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; {57516#true} is VALID [2022-02-20 19:57:28,501 INFO L290 TraceCheckUtils]: 54: Hoare triple {57516#true} assume 0 != eval1_~tmp___1~0#1; {57516#true} is VALID [2022-02-20 19:57:28,501 INFO L290 TraceCheckUtils]: 55: Hoare triple {57516#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; {57516#true} is VALID [2022-02-20 19:57:28,502 INFO L290 TraceCheckUtils]: 56: Hoare triple {57516#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; {57516#true} is VALID [2022-02-20 19:57:28,502 INFO L290 TraceCheckUtils]: 57: Hoare triple {57516#true} assume 0 == ~p_dw_pc~0; {57516#true} is VALID [2022-02-20 19:57:28,502 INFO L290 TraceCheckUtils]: 58: Hoare triple {57516#true} assume !false; {57516#true} is VALID [2022-02-20 19:57:28,502 INFO L290 TraceCheckUtils]: 59: Hoare triple {57516#true} assume !(0 == ~q_free~0); {57516#true} is VALID [2022-02-20 19:57:28,502 INFO L290 TraceCheckUtils]: 60: Hoare triple {57516#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; {57555#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:28,503 INFO L290 TraceCheckUtils]: 61: Hoare triple {57555#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {57555#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:28,503 INFO L290 TraceCheckUtils]: 62: Hoare triple {57555#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {57555#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:28,503 INFO L290 TraceCheckUtils]: 63: Hoare triple {57555#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {57555#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:28,504 INFO L290 TraceCheckUtils]: 64: Hoare triple {57555#(= ~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; {57555#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:28,504 INFO L290 TraceCheckUtils]: 65: Hoare triple {57555#(= ~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; {57555#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:28,504 INFO L290 TraceCheckUtils]: 66: Hoare triple {57555#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {57555#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:28,504 INFO L290 TraceCheckUtils]: 67: Hoare triple {57555#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {57555#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:28,505 INFO L290 TraceCheckUtils]: 68: Hoare triple {57555#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {57555#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:28,505 INFO L290 TraceCheckUtils]: 69: Hoare triple {57555#(= ~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; {57556#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:57:28,505 INFO L290 TraceCheckUtils]: 70: Hoare triple {57556#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {57517#false} is VALID [2022-02-20 19:57:28,505 INFO L272 TraceCheckUtils]: 71: Hoare triple {57517#false} call error1(); {57517#false} is VALID [2022-02-20 19:57:28,506 INFO L290 TraceCheckUtils]: 72: Hoare triple {57517#false} assume !false; {57517#false} is VALID [2022-02-20 19:57:28,506 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:57:28,506 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:28,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627457312] [2022-02-20 19:57:28,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627457312] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:28,506 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:28,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:28,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376703512] [2022-02-20 19:57:28,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:28,507 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:57:28,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:28,507 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:57:28,553 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:57:28,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:28,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:28,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:28,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:28,554 INFO L87 Difference]: Start difference. First operand 2887 states and 3661 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:57:30,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:30,949 INFO L93 Difference]: Finished difference Result 3661 states and 4592 transitions. [2022-02-20 19:57:30,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:30,950 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:57:30,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:30,950 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:57:30,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 586 transitions. [2022-02-20 19:57:30,953 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:57:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 586 transitions. [2022-02-20 19:57:30,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 586 transitions. [2022-02-20 19:57:31,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 586 edges. 586 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:31,863 INFO L225 Difference]: With dead ends: 3661 [2022-02-20 19:57:31,863 INFO L226 Difference]: Without dead ends: 3658 [2022-02-20 19:57:31,864 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:57:31,864 INFO L933 BasicCegarLoop]: 438 mSDtfsCounter, 1263 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:31,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1273 Valid, 1067 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3658 states. [2022-02-20 19:57:32,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3658 to 3381. [2022-02-20 19:57:32,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:32,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3658 states. Second operand has 3381 states, 2650 states have (on average 1.2739622641509434) internal successors, (3376), 2691 states have internal predecessors, (3376), 364 states have call successors, (364), 293 states have call predecessors, (364), 365 states have return successors, (522), 403 states have call predecessors, (522), 363 states have call successors, (522) [2022-02-20 19:57:32,107 INFO L74 IsIncluded]: Start isIncluded. First operand 3658 states. Second operand has 3381 states, 2650 states have (on average 1.2739622641509434) internal successors, (3376), 2691 states have internal predecessors, (3376), 364 states have call successors, (364), 293 states have call predecessors, (364), 365 states have return successors, (522), 403 states have call predecessors, (522), 363 states have call successors, (522) [2022-02-20 19:57:32,111 INFO L87 Difference]: Start difference. First operand 3658 states. Second operand has 3381 states, 2650 states have (on average 1.2739622641509434) internal successors, (3376), 2691 states have internal predecessors, (3376), 364 states have call successors, (364), 293 states have call predecessors, (364), 365 states have return successors, (522), 403 states have call predecessors, (522), 363 states have call successors, (522) [2022-02-20 19:57:32,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:32,498 INFO L93 Difference]: Finished difference Result 3658 states and 4578 transitions. [2022-02-20 19:57:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 4578 transitions. [2022-02-20 19:57:32,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:32,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:32,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 3381 states, 2650 states have (on average 1.2739622641509434) internal successors, (3376), 2691 states have internal predecessors, (3376), 364 states have call successors, (364), 293 states have call predecessors, (364), 365 states have return successors, (522), 403 states have call predecessors, (522), 363 states have call successors, (522) Second operand 3658 states. [2022-02-20 19:57:32,513 INFO L87 Difference]: Start difference. First operand has 3381 states, 2650 states have (on average 1.2739622641509434) internal successors, (3376), 2691 states have internal predecessors, (3376), 364 states have call successors, (364), 293 states have call predecessors, (364), 365 states have return successors, (522), 403 states have call predecessors, (522), 363 states have call successors, (522) Second operand 3658 states. [2022-02-20 19:57:32,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:32,909 INFO L93 Difference]: Finished difference Result 3658 states and 4578 transitions. [2022-02-20 19:57:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 4578 transitions. [2022-02-20 19:57:32,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:32,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:32,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:32,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 2650 states have (on average 1.2739622641509434) internal successors, (3376), 2691 states have internal predecessors, (3376), 364 states have call successors, (364), 293 states have call predecessors, (364), 365 states have return successors, (522), 403 states have call predecessors, (522), 363 states have call successors, (522) [2022-02-20 19:57:33,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4262 transitions. [2022-02-20 19:57:33,405 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4262 transitions. Word has length 73 [2022-02-20 19:57:33,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:33,405 INFO L470 AbstractCegarLoop]: Abstraction has 3381 states and 4262 transitions. [2022-02-20 19:57:33,405 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:57:33,405 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4262 transitions. [2022-02-20 19:57:33,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 19:57:33,406 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:33,407 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:57:33,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 19:57:33,407 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:33,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:33,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2001942744, now seen corresponding path program 1 times [2022-02-20 19:57:33,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:33,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787197843] [2022-02-20 19:57:33,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:33,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {74368#(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); {74326#true} is VALID [2022-02-20 19:57:33,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:33,493 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74326#true} {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1100#return; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {74369#(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); {74326#true} is VALID [2022-02-20 19:57:33,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {74326#true} assume !(0 == ~q_write_ev~0); {74326#true} is VALID [2022-02-20 19:57:33,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:33,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74326#true} {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1102#return; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {74326#true} havoc ~__retres1~0; {74326#true} is VALID [2022-02-20 19:57:33,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {74326#true} assume !(1 == ~p_dw_pc~0); {74326#true} is VALID [2022-02-20 19:57:33,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {74326#true} ~__retres1~0 := 0; {74326#true} is VALID [2022-02-20 19:57:33,517 INFO L290 TraceCheckUtils]: 3: Hoare triple {74326#true} #res := ~__retres1~0; {74326#true} is VALID [2022-02-20 19:57:33,517 INFO L290 TraceCheckUtils]: 4: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:33,517 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {74326#true} {74326#true} #1096#return; {74326#true} is VALID [2022-02-20 19:57:33,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {74326#true} havoc ~__retres1~1; {74326#true} is VALID [2022-02-20 19:57:33,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {74326#true} assume !(1 == ~c_dr_pc~0); {74326#true} is VALID [2022-02-20 19:57:33,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {74326#true} ~__retres1~1 := 0; {74326#true} is VALID [2022-02-20 19:57:33,520 INFO L290 TraceCheckUtils]: 3: Hoare triple {74326#true} #res := ~__retres1~1; {74326#true} is VALID [2022-02-20 19:57:33,520 INFO L290 TraceCheckUtils]: 4: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:33,521 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {74326#true} {74326#true} #1098#return; {74326#true} is VALID [2022-02-20 19:57:33,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {74370#(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; {74326#true} is VALID [2022-02-20 19:57:33,521 INFO L272 TraceCheckUtils]: 1: Hoare triple {74326#true} call #t~ret8 := is_do_write_p_triggered(); {74326#true} is VALID [2022-02-20 19:57:33,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {74326#true} havoc ~__retres1~0; {74326#true} is VALID [2022-02-20 19:57:33,521 INFO L290 TraceCheckUtils]: 3: Hoare triple {74326#true} assume !(1 == ~p_dw_pc~0); {74326#true} is VALID [2022-02-20 19:57:33,521 INFO L290 TraceCheckUtils]: 4: Hoare triple {74326#true} ~__retres1~0 := 0; {74326#true} is VALID [2022-02-20 19:57:33,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {74326#true} #res := ~__retres1~0; {74326#true} is VALID [2022-02-20 19:57:33,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:33,521 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {74326#true} {74326#true} #1096#return; {74326#true} is VALID [2022-02-20 19:57:33,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {74326#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {74326#true} is VALID [2022-02-20 19:57:33,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {74326#true} assume !(0 != ~tmp~1); {74326#true} is VALID [2022-02-20 19:57:33,522 INFO L272 TraceCheckUtils]: 10: Hoare triple {74326#true} call #t~ret9 := is_do_read_c_triggered(); {74326#true} is VALID [2022-02-20 19:57:33,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {74326#true} havoc ~__retres1~1; {74326#true} is VALID [2022-02-20 19:57:33,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {74326#true} assume !(1 == ~c_dr_pc~0); {74326#true} is VALID [2022-02-20 19:57:33,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {74326#true} ~__retres1~1 := 0; {74326#true} is VALID [2022-02-20 19:57:33,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {74326#true} #res := ~__retres1~1; {74326#true} is VALID [2022-02-20 19:57:33,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:33,522 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {74326#true} {74326#true} #1098#return; {74326#true} is VALID [2022-02-20 19:57:33,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {74326#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {74326#true} is VALID [2022-02-20 19:57:33,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {74326#true} assume !(0 != ~tmp___0~1); {74326#true} is VALID [2022-02-20 19:57:33,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:33,523 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {74326#true} {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1104#return; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {74369#(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); {74326#true} is VALID [2022-02-20 19:57:33,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {74326#true} assume !(1 == ~q_write_ev~0); {74326#true} is VALID [2022-02-20 19:57:33,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:33,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74326#true} {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1106#return; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {74326#true} havoc ~__retres1~2; {74326#true} is VALID [2022-02-20 19:57:33,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {74326#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {74326#true} is VALID [2022-02-20 19:57:33,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {74326#true} #res := ~__retres1~2; {74326#true} is VALID [2022-02-20 19:57:33,531 INFO L290 TraceCheckUtils]: 3: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:33,531 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {74326#true} {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1108#return; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {74326#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {74326#true} is VALID [2022-02-20 19:57:33,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {74326#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {74326#true} is VALID [2022-02-20 19:57:33,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {74326#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,532 INFO L290 TraceCheckUtils]: 3: Hoare triple {74328#(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; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {74368#(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:33,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {74368#(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); {74326#true} is VALID [2022-02-20 19:57:33,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:33,533 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {74326#true} {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1100#return; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,535 INFO L272 TraceCheckUtils]: 12: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {74369#(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:33,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {74369#(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); {74326#true} is VALID [2022-02-20 19:57:33,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {74326#true} assume !(0 == ~q_write_ev~0); {74326#true} is VALID [2022-02-20 19:57:33,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:33,536 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {74326#true} {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1102#return; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,536 INFO L272 TraceCheckUtils]: 17: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {74370#(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:33,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {74370#(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; {74326#true} is VALID [2022-02-20 19:57:33,537 INFO L272 TraceCheckUtils]: 19: Hoare triple {74326#true} call #t~ret8 := is_do_write_p_triggered(); {74326#true} is VALID [2022-02-20 19:57:33,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {74326#true} havoc ~__retres1~0; {74326#true} is VALID [2022-02-20 19:57:33,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {74326#true} assume !(1 == ~p_dw_pc~0); {74326#true} is VALID [2022-02-20 19:57:33,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {74326#true} ~__retres1~0 := 0; {74326#true} is VALID [2022-02-20 19:57:33,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {74326#true} #res := ~__retres1~0; {74326#true} is VALID [2022-02-20 19:57:33,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:33,537 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {74326#true} {74326#true} #1096#return; {74326#true} is VALID [2022-02-20 19:57:33,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {74326#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {74326#true} is VALID [2022-02-20 19:57:33,537 INFO L290 TraceCheckUtils]: 27: Hoare triple {74326#true} assume !(0 != ~tmp~1); {74326#true} is VALID [2022-02-20 19:57:33,537 INFO L272 TraceCheckUtils]: 28: Hoare triple {74326#true} call #t~ret9 := is_do_read_c_triggered(); {74326#true} is VALID [2022-02-20 19:57:33,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {74326#true} havoc ~__retres1~1; {74326#true} is VALID [2022-02-20 19:57:33,538 INFO L290 TraceCheckUtils]: 30: Hoare triple {74326#true} assume !(1 == ~c_dr_pc~0); {74326#true} is VALID [2022-02-20 19:57:33,538 INFO L290 TraceCheckUtils]: 31: Hoare triple {74326#true} ~__retres1~1 := 0; {74326#true} is VALID [2022-02-20 19:57:33,538 INFO L290 TraceCheckUtils]: 32: Hoare triple {74326#true} #res := ~__retres1~1; {74326#true} is VALID [2022-02-20 19:57:33,538 INFO L290 TraceCheckUtils]: 33: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:33,538 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {74326#true} {74326#true} #1098#return; {74326#true} is VALID [2022-02-20 19:57:33,538 INFO L290 TraceCheckUtils]: 35: Hoare triple {74326#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {74326#true} is VALID [2022-02-20 19:57:33,538 INFO L290 TraceCheckUtils]: 36: Hoare triple {74326#true} assume !(0 != ~tmp___0~1); {74326#true} is VALID [2022-02-20 19:57:33,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:33,539 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {74326#true} {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1104#return; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,539 INFO L272 TraceCheckUtils]: 39: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {74369#(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:33,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {74369#(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); {74326#true} is VALID [2022-02-20 19:57:33,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {74326#true} assume !(1 == ~q_write_ev~0); {74326#true} is VALID [2022-02-20 19:57:33,540 INFO L290 TraceCheckUtils]: 42: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:33,540 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {74326#true} {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1106#return; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,540 INFO L290 TraceCheckUtils]: 44: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,541 INFO L290 TraceCheckUtils]: 45: Hoare triple {74328#(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; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,541 INFO L290 TraceCheckUtils]: 46: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,541 INFO L272 TraceCheckUtils]: 47: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {74326#true} is VALID [2022-02-20 19:57:33,541 INFO L290 TraceCheckUtils]: 48: Hoare triple {74326#true} havoc ~__retres1~2; {74326#true} is VALID [2022-02-20 19:57:33,541 INFO L290 TraceCheckUtils]: 49: Hoare triple {74326#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {74326#true} is VALID [2022-02-20 19:57:33,541 INFO L290 TraceCheckUtils]: 50: Hoare triple {74326#true} #res := ~__retres1~2; {74326#true} is VALID [2022-02-20 19:57:33,541 INFO L290 TraceCheckUtils]: 51: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:33,542 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {74326#true} {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1108#return; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,542 INFO L290 TraceCheckUtils]: 53: Hoare triple {74328#(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; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,543 INFO L290 TraceCheckUtils]: 54: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,543 INFO L290 TraceCheckUtils]: 55: Hoare triple {74328#(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; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,543 INFO L290 TraceCheckUtils]: 56: Hoare triple {74328#(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; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,544 INFO L290 TraceCheckUtils]: 57: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,544 INFO L290 TraceCheckUtils]: 58: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,544 INFO L290 TraceCheckUtils]: 59: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:33,545 INFO L290 TraceCheckUtils]: 60: Hoare triple {74328#(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; {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:33,545 INFO L290 TraceCheckUtils]: 61: Hoare triple {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:33,545 INFO L290 TraceCheckUtils]: 62: Hoare triple {74366#(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; {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:33,546 INFO L290 TraceCheckUtils]: 63: Hoare triple {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:33,546 INFO L290 TraceCheckUtils]: 64: Hoare triple {74366#(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; {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:33,546 INFO L290 TraceCheckUtils]: 65: Hoare triple {74366#(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; {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:33,547 INFO L290 TraceCheckUtils]: 66: Hoare triple {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:33,547 INFO L290 TraceCheckUtils]: 67: Hoare triple {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:33,547 INFO L290 TraceCheckUtils]: 68: Hoare triple {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:33,548 INFO L290 TraceCheckUtils]: 69: Hoare triple {74366#(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; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:33,548 INFO L290 TraceCheckUtils]: 70: Hoare triple {74367#(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; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:33,549 INFO L290 TraceCheckUtils]: 71: Hoare triple {74367#(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); {74327#false} is VALID [2022-02-20 19:57:33,549 INFO L272 TraceCheckUtils]: 72: Hoare triple {74327#false} call error1(); {74327#false} is VALID [2022-02-20 19:57:33,549 INFO L290 TraceCheckUtils]: 73: Hoare triple {74327#false} assume !false; {74327#false} is VALID [2022-02-20 19:57:33,549 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:57:33,549 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:33,549 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787197843] [2022-02-20 19:57:33,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787197843] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:57:33,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302973319] [2022-02-20 19:57:33,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:33,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:57:33,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:57:33,576 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:57:33,595 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:57:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:57:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:33,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:57:34,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {74326#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {74326#true} is VALID [2022-02-20 19:57:34,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {74326#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {74326#true} is VALID [2022-02-20 19:57:34,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {74326#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,257 INFO L290 TraceCheckUtils]: 3: Hoare triple {74328#(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; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_req_up~0); {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,259 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1100#return; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,260 INFO L272 TraceCheckUtils]: 12: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_read_ev~0); {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_write_ev~0); {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,262 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1102#return; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,262 INFO L272 TraceCheckUtils]: 17: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~tmp~1;havoc ~tmp___0~1; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,263 INFO L272 TraceCheckUtils]: 19: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret8 := is_do_write_p_triggered(); {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~0; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~p_dw_pc~0); {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~0 := 0; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~0; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,288 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1096#return; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {74328#(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; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp~1); {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,289 INFO L272 TraceCheckUtils]: 28: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret9 := is_do_read_c_triggered(); {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,289 INFO L290 TraceCheckUtils]: 29: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~1; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~c_dr_pc~0); {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,290 INFO L290 TraceCheckUtils]: 31: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~1 := 0; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,290 INFO L290 TraceCheckUtils]: 32: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~1; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,290 INFO L290 TraceCheckUtils]: 33: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,291 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1098#return; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,291 INFO L290 TraceCheckUtils]: 35: Hoare triple {74328#(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; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,291 INFO L290 TraceCheckUtils]: 36: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp___0~1); {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,292 INFO L290 TraceCheckUtils]: 37: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,292 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1104#return; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,292 INFO L272 TraceCheckUtils]: 39: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_read_ev~0); {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,293 INFO L290 TraceCheckUtils]: 41: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_write_ev~0); {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,293 INFO L290 TraceCheckUtils]: 42: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,294 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1106#return; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,294 INFO L290 TraceCheckUtils]: 44: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {74328#(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; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,295 INFO L290 TraceCheckUtils]: 46: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,295 INFO L272 TraceCheckUtils]: 47: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,295 INFO L290 TraceCheckUtils]: 48: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,296 INFO L290 TraceCheckUtils]: 49: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,296 INFO L290 TraceCheckUtils]: 50: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,296 INFO L290 TraceCheckUtils]: 51: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,297 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1108#return; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,297 INFO L290 TraceCheckUtils]: 53: Hoare triple {74328#(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; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,298 INFO L290 TraceCheckUtils]: 54: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,298 INFO L290 TraceCheckUtils]: 55: Hoare triple {74328#(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; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,298 INFO L290 TraceCheckUtils]: 56: Hoare triple {74328#(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; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,299 INFO L290 TraceCheckUtils]: 57: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,299 INFO L290 TraceCheckUtils]: 58: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,299 INFO L290 TraceCheckUtils]: 59: Hoare triple {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {74328#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:34,300 INFO L290 TraceCheckUtils]: 60: Hoare triple {74328#(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; {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:34,300 INFO L290 TraceCheckUtils]: 61: Hoare triple {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:34,301 INFO L290 TraceCheckUtils]: 62: Hoare triple {74366#(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; {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:34,301 INFO L290 TraceCheckUtils]: 63: Hoare triple {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:34,301 INFO L290 TraceCheckUtils]: 64: Hoare triple {74366#(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; {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:34,302 INFO L290 TraceCheckUtils]: 65: Hoare triple {74366#(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; {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:34,302 INFO L290 TraceCheckUtils]: 66: Hoare triple {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:34,302 INFO L290 TraceCheckUtils]: 67: Hoare triple {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:34,303 INFO L290 TraceCheckUtils]: 68: Hoare triple {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {74366#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:34,303 INFO L290 TraceCheckUtils]: 69: Hoare triple {74366#(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; {74593#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:34,303 INFO L290 TraceCheckUtils]: 70: Hoare triple {74593#(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; {74593#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:34,304 INFO L290 TraceCheckUtils]: 71: Hoare triple {74593#(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); {74327#false} is VALID [2022-02-20 19:57:34,304 INFO L272 TraceCheckUtils]: 72: Hoare triple {74327#false} call error1(); {74327#false} is VALID [2022-02-20 19:57:34,304 INFO L290 TraceCheckUtils]: 73: Hoare triple {74327#false} assume !false; {74327#false} is VALID [2022-02-20 19:57:34,304 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:57:34,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:57:34,674 INFO L290 TraceCheckUtils]: 73: Hoare triple {74327#false} assume !false; {74327#false} is VALID [2022-02-20 19:57:34,674 INFO L272 TraceCheckUtils]: 72: Hoare triple {74327#false} call error1(); {74327#false} is VALID [2022-02-20 19:57:34,674 INFO L290 TraceCheckUtils]: 71: Hoare triple {74367#(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); {74327#false} is VALID [2022-02-20 19:57:34,675 INFO L290 TraceCheckUtils]: 70: Hoare triple {74367#(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; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,675 INFO L290 TraceCheckUtils]: 69: Hoare triple {74618#(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; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,676 INFO L290 TraceCheckUtils]: 68: Hoare triple {74618#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !(1 == ~q_free~0); {74618#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:34,676 INFO L290 TraceCheckUtils]: 67: Hoare triple {74618#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {74618#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:34,676 INFO L290 TraceCheckUtils]: 66: Hoare triple {74618#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_pc~0; {74618#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:34,677 INFO L290 TraceCheckUtils]: 65: Hoare triple {74618#(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; {74618#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:34,677 INFO L290 TraceCheckUtils]: 64: Hoare triple {74618#(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; {74618#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:34,677 INFO L290 TraceCheckUtils]: 63: Hoare triple {74618#(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; {74618#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:34,678 INFO L290 TraceCheckUtils]: 62: Hoare triple {74618#(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; {74618#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:34,678 INFO L290 TraceCheckUtils]: 61: Hoare triple {74618#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {74618#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:34,679 INFO L290 TraceCheckUtils]: 60: Hoare triple {74367#(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; {74618#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:34,679 INFO L290 TraceCheckUtils]: 59: Hoare triple {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(0 == ~q_free~0); {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,679 INFO L290 TraceCheckUtils]: 58: Hoare triple {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,680 INFO L290 TraceCheckUtils]: 57: Hoare triple {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_pc~0; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,680 INFO L290 TraceCheckUtils]: 56: Hoare triple {74367#(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; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,681 INFO L290 TraceCheckUtils]: 55: Hoare triple {74367#(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; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,681 INFO L290 TraceCheckUtils]: 54: Hoare triple {74367#(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; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,681 INFO L290 TraceCheckUtils]: 53: Hoare triple {74367#(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; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,682 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {74326#true} {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1108#return; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,682 INFO L290 TraceCheckUtils]: 51: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:34,682 INFO L290 TraceCheckUtils]: 50: Hoare triple {74326#true} #res := ~__retres1~2; {74326#true} is VALID [2022-02-20 19:57:34,682 INFO L290 TraceCheckUtils]: 49: Hoare triple {74326#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {74326#true} is VALID [2022-02-20 19:57:34,682 INFO L290 TraceCheckUtils]: 48: Hoare triple {74326#true} havoc ~__retres1~2; {74326#true} is VALID [2022-02-20 19:57:34,682 INFO L272 TraceCheckUtils]: 47: Hoare triple {74367#(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(); {74326#true} is VALID [2022-02-20 19:57:34,683 INFO L290 TraceCheckUtils]: 46: Hoare triple {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,683 INFO L290 TraceCheckUtils]: 45: Hoare triple {74367#(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; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,683 INFO L290 TraceCheckUtils]: 44: Hoare triple {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,684 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {74326#true} {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1106#return; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,684 INFO L290 TraceCheckUtils]: 42: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:34,684 INFO L290 TraceCheckUtils]: 41: Hoare triple {74326#true} assume !(1 == ~q_write_ev~0); {74326#true} is VALID [2022-02-20 19:57:34,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {74326#true} assume !(1 == ~q_read_ev~0); {74326#true} is VALID [2022-02-20 19:57:34,684 INFO L272 TraceCheckUtils]: 39: Hoare triple {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call reset_delta_events1(); {74326#true} is VALID [2022-02-20 19:57:34,684 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {74326#true} {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1104#return; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,685 INFO L290 TraceCheckUtils]: 37: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:34,685 INFO L290 TraceCheckUtils]: 36: Hoare triple {74326#true} assume !(0 != ~tmp___0~1); {74326#true} is VALID [2022-02-20 19:57:34,685 INFO L290 TraceCheckUtils]: 35: Hoare triple {74326#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {74326#true} is VALID [2022-02-20 19:57:34,685 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {74326#true} {74326#true} #1098#return; {74326#true} is VALID [2022-02-20 19:57:34,685 INFO L290 TraceCheckUtils]: 33: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:34,685 INFO L290 TraceCheckUtils]: 32: Hoare triple {74326#true} #res := ~__retres1~1; {74326#true} is VALID [2022-02-20 19:57:34,685 INFO L290 TraceCheckUtils]: 31: Hoare triple {74326#true} ~__retres1~1 := 0; {74326#true} is VALID [2022-02-20 19:57:34,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {74326#true} assume !(1 == ~c_dr_pc~0); {74326#true} is VALID [2022-02-20 19:57:34,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {74326#true} havoc ~__retres1~1; {74326#true} is VALID [2022-02-20 19:57:34,685 INFO L272 TraceCheckUtils]: 28: Hoare triple {74326#true} call #t~ret9 := is_do_read_c_triggered(); {74326#true} is VALID [2022-02-20 19:57:34,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {74326#true} assume !(0 != ~tmp~1); {74326#true} is VALID [2022-02-20 19:57:34,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {74326#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {74326#true} is VALID [2022-02-20 19:57:34,686 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {74326#true} {74326#true} #1096#return; {74326#true} is VALID [2022-02-20 19:57:34,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:34,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {74326#true} #res := ~__retres1~0; {74326#true} is VALID [2022-02-20 19:57:34,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {74326#true} ~__retres1~0 := 0; {74326#true} is VALID [2022-02-20 19:57:34,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {74326#true} assume !(1 == ~p_dw_pc~0); {74326#true} is VALID [2022-02-20 19:57:34,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {74326#true} havoc ~__retres1~0; {74326#true} is VALID [2022-02-20 19:57:34,686 INFO L272 TraceCheckUtils]: 19: Hoare triple {74326#true} call #t~ret8 := is_do_write_p_triggered(); {74326#true} is VALID [2022-02-20 19:57:34,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {74326#true} havoc ~tmp~1;havoc ~tmp___0~1; {74326#true} is VALID [2022-02-20 19:57:34,687 INFO L272 TraceCheckUtils]: 17: Hoare triple {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call activate_threads1(); {74326#true} is VALID [2022-02-20 19:57:34,687 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {74326#true} {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1102#return; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:34,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {74326#true} assume !(0 == ~q_write_ev~0); {74326#true} is VALID [2022-02-20 19:57:34,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {74326#true} assume !(0 == ~q_read_ev~0); {74326#true} is VALID [2022-02-20 19:57:34,687 INFO L272 TraceCheckUtils]: 12: Hoare triple {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call fire_delta_events1(); {74326#true} is VALID [2022-02-20 19:57:34,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_threads1 } true; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {74367#(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; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {74367#(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; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :begin_inline_init_threads1 } true; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,689 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {74326#true} {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1100#return; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {74326#true} assume true; {74326#true} is VALID [2022-02-20 19:57:34,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {74326#true} assume !(1 == ~q_req_up~0); {74326#true} is VALID [2022-02-20 19:57:34,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call update_channels1(); {74326#true} is VALID [2022-02-20 19:57:34,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {74367#(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; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {74326#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {74367#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:34,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {74326#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {74326#true} is VALID [2022-02-20 19:57:34,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {74326#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {74326#true} is VALID [2022-02-20 19:57:34,691 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:57:34,691 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302973319] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:57:34,691 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:57:34,691 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-02-20 19:57:34,691 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56298179] [2022-02-20 19:57:34,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:57:34,692 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:57:34,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:34,694 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:57:34,845 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:57:34,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:57:34,846 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:34,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:57:34,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:57:34,847 INFO L87 Difference]: Start difference. First operand 3381 states and 4262 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:57:42,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:42,214 INFO L93 Difference]: Finished difference Result 7822 states and 9748 transitions. [2022-02-20 19:57:42,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-20 19:57:42,214 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:57:42,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:42,215 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:57:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1081 transitions. [2022-02-20 19:57:42,220 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:57:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1081 transitions. [2022-02-20 19:57:42,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 1081 transitions. [2022-02-20 19:57:42,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1081 edges. 1081 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:45,191 INFO L225 Difference]: With dead ends: 7822 [2022-02-20 19:57:45,191 INFO L226 Difference]: Without dead ends: 7819 [2022-02-20 19:57:45,193 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:57:45,195 INFO L933 BasicCegarLoop]: 596 mSDtfsCounter, 1936 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2001 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:45,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2001 Valid, 1866 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:57:45,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7819 states. [2022-02-20 19:57:46,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7819 to 5171. [2022-02-20 19:57:46,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:46,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7819 states. Second operand has 5171 states, 4054 states have (on average 1.27084361124815) internal successors, (5152), 4117 states have internal predecessors, (5152), 548 states have call successors, (548), 451 states have call predecessors, (548), 567 states have return successors, (800), 609 states have call predecessors, (800), 547 states have call successors, (800) [2022-02-20 19:57:46,498 INFO L74 IsIncluded]: Start isIncluded. First operand 7819 states. Second operand has 5171 states, 4054 states have (on average 1.27084361124815) internal successors, (5152), 4117 states have internal predecessors, (5152), 548 states have call successors, (548), 451 states have call predecessors, (548), 567 states have return successors, (800), 609 states have call predecessors, (800), 547 states have call successors, (800) [2022-02-20 19:57:46,503 INFO L87 Difference]: Start difference. First operand 7819 states. Second operand has 5171 states, 4054 states have (on average 1.27084361124815) internal successors, (5152), 4117 states have internal predecessors, (5152), 548 states have call successors, (548), 451 states have call predecessors, (548), 567 states have return successors, (800), 609 states have call predecessors, (800), 547 states have call successors, (800) [2022-02-20 19:57:48,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:48,458 INFO L93 Difference]: Finished difference Result 7819 states and 9734 transitions. [2022-02-20 19:57:48,458 INFO L276 IsEmpty]: Start isEmpty. Operand 7819 states and 9734 transitions. [2022-02-20 19:57:48,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:48,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:48,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 5171 states, 4054 states have (on average 1.27084361124815) internal successors, (5152), 4117 states have internal predecessors, (5152), 548 states have call successors, (548), 451 states have call predecessors, (548), 567 states have return successors, (800), 609 states have call predecessors, (800), 547 states have call successors, (800) Second operand 7819 states. [2022-02-20 19:57:48,481 INFO L87 Difference]: Start difference. First operand has 5171 states, 4054 states have (on average 1.27084361124815) internal successors, (5152), 4117 states have internal predecessors, (5152), 548 states have call successors, (548), 451 states have call predecessors, (548), 567 states have return successors, (800), 609 states have call predecessors, (800), 547 states have call successors, (800) Second operand 7819 states. [2022-02-20 19:57:50,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:50,267 INFO L93 Difference]: Finished difference Result 7819 states and 9734 transitions. [2022-02-20 19:57:50,267 INFO L276 IsEmpty]: Start isEmpty. Operand 7819 states and 9734 transitions. [2022-02-20 19:57:50,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:50,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:50,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:50,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:50,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5171 states, 4054 states have (on average 1.27084361124815) internal successors, (5152), 4117 states have internal predecessors, (5152), 548 states have call successors, (548), 451 states have call predecessors, (548), 567 states have return successors, (800), 609 states have call predecessors, (800), 547 states have call successors, (800) [2022-02-20 19:57:51,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5171 states to 5171 states and 6500 transitions. [2022-02-20 19:57:51,359 INFO L78 Accepts]: Start accepts. Automaton has 5171 states and 6500 transitions. Word has length 74 [2022-02-20 19:57:51,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:51,359 INFO L470 AbstractCegarLoop]: Abstraction has 5171 states and 6500 transitions. [2022-02-20 19:57:51,359 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2022-02-20 19:57:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 5171 states and 6500 transitions. [2022-02-20 19:57:51,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:57:51,361 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:51,361 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:51,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 19:57:51,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-20 19:57:51,583 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:51,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:51,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1151605564, now seen corresponding path program 2 times [2022-02-20 19:57:51,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:51,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984007963] [2022-02-20 19:57:51,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:51,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:51,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:51,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {107869#(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); {107829#true} is VALID [2022-02-20 19:57:51,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {107829#true} assume true; {107829#true} is VALID [2022-02-20 19:57:51,617 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107829#true} {107829#true} #1100#return; {107829#true} is VALID [2022-02-20 19:57:51,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:51,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {107870#(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); {107829#true} is VALID [2022-02-20 19:57:51,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {107829#true} assume !(0 == ~q_write_ev~0); {107829#true} is VALID [2022-02-20 19:57:51,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {107829#true} assume true; {107829#true} is VALID [2022-02-20 19:57:51,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107829#true} {107829#true} #1102#return; {107829#true} is VALID [2022-02-20 19:57:51,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:51,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:51,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {107829#true} havoc ~__retres1~0; {107829#true} is VALID [2022-02-20 19:57:51,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {107829#true} assume !(1 == ~p_dw_pc~0); {107829#true} is VALID [2022-02-20 19:57:51,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {107829#true} ~__retres1~0 := 0; {107829#true} is VALID [2022-02-20 19:57:51,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {107829#true} #res := ~__retres1~0; {107829#true} is VALID [2022-02-20 19:57:51,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {107829#true} assume true; {107829#true} is VALID [2022-02-20 19:57:51,632 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {107829#true} {107829#true} #1096#return; {107829#true} is VALID [2022-02-20 19:57:51,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:51,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {107829#true} havoc ~__retres1~1; {107829#true} is VALID [2022-02-20 19:57:51,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {107829#true} assume !(1 == ~c_dr_pc~0); {107829#true} is VALID [2022-02-20 19:57:51,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {107829#true} ~__retres1~1 := 0; {107829#true} is VALID [2022-02-20 19:57:51,634 INFO L290 TraceCheckUtils]: 3: Hoare triple {107829#true} #res := ~__retres1~1; {107829#true} is VALID [2022-02-20 19:57:51,634 INFO L290 TraceCheckUtils]: 4: Hoare triple {107829#true} assume true; {107829#true} is VALID [2022-02-20 19:57:51,635 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {107829#true} {107829#true} #1098#return; {107829#true} is VALID [2022-02-20 19:57:51,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {107871#(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; {107829#true} is VALID [2022-02-20 19:57:51,635 INFO L272 TraceCheckUtils]: 1: Hoare triple {107829#true} call #t~ret8 := is_do_write_p_triggered(); {107829#true} is VALID [2022-02-20 19:57:51,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {107829#true} havoc ~__retres1~0; {107829#true} is VALID [2022-02-20 19:57:51,635 INFO L290 TraceCheckUtils]: 3: Hoare triple {107829#true} assume !(1 == ~p_dw_pc~0); {107829#true} is VALID [2022-02-20 19:57:51,635 INFO L290 TraceCheckUtils]: 4: Hoare triple {107829#true} ~__retres1~0 := 0; {107829#true} is VALID [2022-02-20 19:57:51,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {107829#true} #res := ~__retres1~0; {107829#true} is VALID [2022-02-20 19:57:51,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {107829#true} assume true; {107829#true} is VALID [2022-02-20 19:57:51,635 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {107829#true} {107829#true} #1096#return; {107829#true} is VALID [2022-02-20 19:57:51,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {107829#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {107829#true} is VALID [2022-02-20 19:57:51,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {107829#true} assume !(0 != ~tmp~1); {107829#true} is VALID [2022-02-20 19:57:51,636 INFO L272 TraceCheckUtils]: 10: Hoare triple {107829#true} call #t~ret9 := is_do_read_c_triggered(); {107829#true} is VALID [2022-02-20 19:57:51,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {107829#true} havoc ~__retres1~1; {107829#true} is VALID [2022-02-20 19:57:51,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {107829#true} assume !(1 == ~c_dr_pc~0); {107829#true} is VALID [2022-02-20 19:57:51,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {107829#true} ~__retres1~1 := 0; {107829#true} is VALID [2022-02-20 19:57:51,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {107829#true} #res := ~__retres1~1; {107829#true} is VALID [2022-02-20 19:57:51,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {107829#true} assume true; {107829#true} is VALID [2022-02-20 19:57:51,636 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {107829#true} {107829#true} #1098#return; {107829#true} is VALID [2022-02-20 19:57:51,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {107829#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {107829#true} is VALID [2022-02-20 19:57:51,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {107829#true} assume !(0 != ~tmp___0~1); {107829#true} is VALID [2022-02-20 19:57:51,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {107829#true} assume true; {107829#true} is VALID [2022-02-20 19:57:51,637 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {107829#true} {107829#true} #1104#return; {107829#true} is VALID [2022-02-20 19:57:51,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:51,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {107870#(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); {107829#true} is VALID [2022-02-20 19:57:51,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {107829#true} assume !(1 == ~q_write_ev~0); {107829#true} is VALID [2022-02-20 19:57:51,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {107829#true} assume true; {107829#true} is VALID [2022-02-20 19:57:51,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107829#true} {107829#true} #1106#return; {107829#true} is VALID [2022-02-20 19:57:51,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:51,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {107829#true} havoc ~__retres1~2; {107829#true} is VALID [2022-02-20 19:57:51,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {107829#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {107829#true} is VALID [2022-02-20 19:57:51,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {107829#true} #res := ~__retres1~2; {107829#true} is VALID [2022-02-20 19:57:51,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {107829#true} assume true; {107829#true} is VALID [2022-02-20 19:57:51,642 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {107829#true} {107829#true} #1108#return; {107829#true} is VALID [2022-02-20 19:57:51,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {107829#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {107829#true} is VALID [2022-02-20 19:57:51,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {107829#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {107829#true} is VALID [2022-02-20 19:57:51,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {107829#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {107829#true} is VALID [2022-02-20 19:57:51,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {107829#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; {107829#true} is VALID [2022-02-20 19:57:51,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {107829#true} call update_channels1(); {107869#(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:51,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {107869#(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); {107829#true} is VALID [2022-02-20 19:57:51,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {107829#true} assume true; {107829#true} is VALID [2022-02-20 19:57:51,643 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {107829#true} {107829#true} #1100#return; {107829#true} is VALID [2022-02-20 19:57:51,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {107829#true} assume { :begin_inline_init_threads1 } true; {107829#true} is VALID [2022-02-20 19:57:51,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {107829#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {107829#true} is VALID [2022-02-20 19:57:51,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {107829#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {107829#true} is VALID [2022-02-20 19:57:51,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {107829#true} assume { :end_inline_init_threads1 } true; {107829#true} is VALID [2022-02-20 19:57:51,644 INFO L272 TraceCheckUtils]: 12: Hoare triple {107829#true} call fire_delta_events1(); {107870#(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:51,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {107870#(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); {107829#true} is VALID [2022-02-20 19:57:51,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {107829#true} assume !(0 == ~q_write_ev~0); {107829#true} is VALID [2022-02-20 19:57:51,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {107829#true} assume true; {107829#true} is VALID [2022-02-20 19:57:51,644 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {107829#true} {107829#true} #1102#return; {107829#true} is VALID [2022-02-20 19:57:51,645 INFO L272 TraceCheckUtils]: 17: Hoare triple {107829#true} call activate_threads1(); {107871#(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:51,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {107871#(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; {107829#true} is VALID [2022-02-20 19:57:51,645 INFO L272 TraceCheckUtils]: 19: Hoare triple {107829#true} call #t~ret8 := is_do_write_p_triggered(); {107829#true} is VALID [2022-02-20 19:57:51,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {107829#true} havoc ~__retres1~0; {107829#true} is VALID [2022-02-20 19:57:51,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {107829#true} assume !(1 == ~p_dw_pc~0); {107829#true} is VALID [2022-02-20 19:57:51,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {107829#true} ~__retres1~0 := 0; {107829#true} is VALID [2022-02-20 19:57:51,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {107829#true} #res := ~__retres1~0; {107829#true} is VALID [2022-02-20 19:57:51,645 INFO L290 TraceCheckUtils]: 24: Hoare triple {107829#true} assume true; {107829#true} is VALID [2022-02-20 19:57:51,645 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {107829#true} {107829#true} #1096#return; {107829#true} is VALID [2022-02-20 19:57:51,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {107829#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {107829#true} is VALID [2022-02-20 19:57:51,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {107829#true} assume !(0 != ~tmp~1); {107829#true} is VALID [2022-02-20 19:57:51,646 INFO L272 TraceCheckUtils]: 28: Hoare triple {107829#true} call #t~ret9 := is_do_read_c_triggered(); {107829#true} is VALID [2022-02-20 19:57:51,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {107829#true} havoc ~__retres1~1; {107829#true} is VALID [2022-02-20 19:57:51,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {107829#true} assume !(1 == ~c_dr_pc~0); {107829#true} is VALID [2022-02-20 19:57:51,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {107829#true} ~__retres1~1 := 0; {107829#true} is VALID [2022-02-20 19:57:51,646 INFO L290 TraceCheckUtils]: 32: Hoare triple {107829#true} #res := ~__retres1~1; {107829#true} is VALID [2022-02-20 19:57:51,646 INFO L290 TraceCheckUtils]: 33: Hoare triple {107829#true} assume true; {107829#true} is VALID [2022-02-20 19:57:51,646 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {107829#true} {107829#true} #1098#return; {107829#true} is VALID [2022-02-20 19:57:51,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {107829#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {107829#true} is VALID [2022-02-20 19:57:51,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {107829#true} assume !(0 != ~tmp___0~1); {107829#true} is VALID [2022-02-20 19:57:51,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {107829#true} assume true; {107829#true} is VALID [2022-02-20 19:57:51,647 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {107829#true} {107829#true} #1104#return; {107829#true} is VALID [2022-02-20 19:57:51,647 INFO L272 TraceCheckUtils]: 39: Hoare triple {107829#true} call reset_delta_events1(); {107870#(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:51,647 INFO L290 TraceCheckUtils]: 40: Hoare triple {107870#(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); {107829#true} is VALID [2022-02-20 19:57:51,647 INFO L290 TraceCheckUtils]: 41: Hoare triple {107829#true} assume !(1 == ~q_write_ev~0); {107829#true} is VALID [2022-02-20 19:57:51,647 INFO L290 TraceCheckUtils]: 42: Hoare triple {107829#true} assume true; {107829#true} is VALID [2022-02-20 19:57:51,647 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {107829#true} {107829#true} #1106#return; {107829#true} is VALID [2022-02-20 19:57:51,648 INFO L290 TraceCheckUtils]: 44: Hoare triple {107829#true} assume !false; {107829#true} is VALID [2022-02-20 19:57:51,648 INFO L290 TraceCheckUtils]: 45: Hoare triple {107829#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; {107829#true} is VALID [2022-02-20 19:57:51,648 INFO L290 TraceCheckUtils]: 46: Hoare triple {107829#true} assume !false; {107829#true} is VALID [2022-02-20 19:57:51,648 INFO L272 TraceCheckUtils]: 47: Hoare triple {107829#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {107829#true} is VALID [2022-02-20 19:57:51,648 INFO L290 TraceCheckUtils]: 48: Hoare triple {107829#true} havoc ~__retres1~2; {107829#true} is VALID [2022-02-20 19:57:51,648 INFO L290 TraceCheckUtils]: 49: Hoare triple {107829#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {107829#true} is VALID [2022-02-20 19:57:51,648 INFO L290 TraceCheckUtils]: 50: Hoare triple {107829#true} #res := ~__retres1~2; {107829#true} is VALID [2022-02-20 19:57:51,648 INFO L290 TraceCheckUtils]: 51: Hoare triple {107829#true} assume true; {107829#true} is VALID [2022-02-20 19:57:51,648 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {107829#true} {107829#true} #1108#return; {107829#true} is VALID [2022-02-20 19:57:51,649 INFO L290 TraceCheckUtils]: 53: Hoare triple {107829#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; {107829#true} is VALID [2022-02-20 19:57:51,649 INFO L290 TraceCheckUtils]: 54: Hoare triple {107829#true} assume 0 != eval1_~tmp___1~0#1; {107829#true} is VALID [2022-02-20 19:57:51,649 INFO L290 TraceCheckUtils]: 55: Hoare triple {107829#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; {107829#true} is VALID [2022-02-20 19:57:51,649 INFO L290 TraceCheckUtils]: 56: Hoare triple {107829#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; {107829#true} is VALID [2022-02-20 19:57:51,649 INFO L290 TraceCheckUtils]: 57: Hoare triple {107829#true} assume 0 == ~p_dw_pc~0; {107829#true} is VALID [2022-02-20 19:57:51,649 INFO L290 TraceCheckUtils]: 58: Hoare triple {107829#true} assume !false; {107829#true} is VALID [2022-02-20 19:57:51,649 INFO L290 TraceCheckUtils]: 59: Hoare triple {107829#true} assume !(0 == ~q_free~0); {107829#true} is VALID [2022-02-20 19:57:51,649 INFO L290 TraceCheckUtils]: 60: Hoare triple {107829#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; {107868#(= ~q_free~0 0)} is VALID [2022-02-20 19:57:51,650 INFO L290 TraceCheckUtils]: 61: Hoare triple {107868#(= ~q_free~0 0)} assume !false; {107868#(= ~q_free~0 0)} is VALID [2022-02-20 19:57:51,650 INFO L290 TraceCheckUtils]: 62: Hoare triple {107868#(= ~q_free~0 0)} assume !(0 == ~q_free~0); {107830#false} is VALID [2022-02-20 19:57:51,650 INFO L290 TraceCheckUtils]: 63: Hoare triple {107830#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; {107830#false} is VALID [2022-02-20 19:57:51,650 INFO L290 TraceCheckUtils]: 64: Hoare triple {107830#false} assume !false; {107830#false} is VALID [2022-02-20 19:57:51,650 INFO L290 TraceCheckUtils]: 65: Hoare triple {107830#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {107830#false} is VALID [2022-02-20 19:57:51,650 INFO L290 TraceCheckUtils]: 66: Hoare triple {107830#false} assume { :end_inline_do_write_p } true; {107830#false} is VALID [2022-02-20 19:57:51,651 INFO L290 TraceCheckUtils]: 67: Hoare triple {107830#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; {107830#false} is VALID [2022-02-20 19:57:51,651 INFO L290 TraceCheckUtils]: 68: Hoare triple {107830#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; {107830#false} is VALID [2022-02-20 19:57:51,651 INFO L290 TraceCheckUtils]: 69: Hoare triple {107830#false} assume 0 == ~c_dr_pc~0; {107830#false} is VALID [2022-02-20 19:57:51,651 INFO L290 TraceCheckUtils]: 70: Hoare triple {107830#false} assume !false; {107830#false} is VALID [2022-02-20 19:57:51,651 INFO L290 TraceCheckUtils]: 71: Hoare triple {107830#false} assume !(1 == ~q_free~0); {107830#false} is VALID [2022-02-20 19:57:51,651 INFO L290 TraceCheckUtils]: 72: Hoare triple {107830#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; {107830#false} is VALID [2022-02-20 19:57:51,651 INFO L290 TraceCheckUtils]: 73: Hoare triple {107830#false} assume ~p_last_write~0 == ~c_last_read~0; {107830#false} is VALID [2022-02-20 19:57:51,651 INFO L290 TraceCheckUtils]: 74: Hoare triple {107830#false} assume !(~p_num_write~0 == ~c_num_read~0); {107830#false} is VALID [2022-02-20 19:57:51,651 INFO L272 TraceCheckUtils]: 75: Hoare triple {107830#false} call error1(); {107830#false} is VALID [2022-02-20 19:57:51,652 INFO L290 TraceCheckUtils]: 76: Hoare triple {107830#false} assume !false; {107830#false} is VALID [2022-02-20 19:57:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:51,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:51,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984007963] [2022-02-20 19:57:51,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984007963] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:51,652 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:51,652 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:51,652 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53377114] [2022-02-20 19:57:51,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:51,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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 77 [2022-02-20 19:57:51,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:51,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:57:51,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:51,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:51,687 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:51,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:51,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:51,687 INFO L87 Difference]: Start difference. First operand 5171 states and 6500 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:57:55,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:55,720 INFO L93 Difference]: Finished difference Result 7853 states and 9873 transitions. [2022-02-20 19:57:55,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 19:57:55,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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 77 [2022-02-20 19:57:55,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:57:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 690 transitions. [2022-02-20 19:57:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:57:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 690 transitions. [2022-02-20 19:57:55,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 690 transitions. [2022-02-20 19:57:56,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 690 edges. 690 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:56,838 INFO L225 Difference]: With dead ends: 7853 [2022-02-20 19:57:56,839 INFO L226 Difference]: Without dead ends: 3778 [2022-02-20 19:57:56,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:57:56,844 INFO L933 BasicCegarLoop]: 488 mSDtfsCounter, 746 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:56,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [775 Valid, 1194 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 19:57:56,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778 states. [2022-02-20 19:57:57,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778 to 3543. [2022-02-20 19:57:57,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:57,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3778 states. Second operand has 3543 states, 2782 states have (on average 1.2552120776419842) internal successors, (3492), 2823 states have internal predecessors, (3492), 380 states have call successors, (380), 307 states have call predecessors, (380), 379 states have return successors, (526), 419 states have call predecessors, (526), 379 states have call successors, (526) [2022-02-20 19:57:57,903 INFO L74 IsIncluded]: Start isIncluded. First operand 3778 states. Second operand has 3543 states, 2782 states have (on average 1.2552120776419842) internal successors, (3492), 2823 states have internal predecessors, (3492), 380 states have call successors, (380), 307 states have call predecessors, (380), 379 states have return successors, (526), 419 states have call predecessors, (526), 379 states have call successors, (526) [2022-02-20 19:57:57,905 INFO L87 Difference]: Start difference. First operand 3778 states. Second operand has 3543 states, 2782 states have (on average 1.2552120776419842) internal successors, (3492), 2823 states have internal predecessors, (3492), 380 states have call successors, (380), 307 states have call predecessors, (380), 379 states have return successors, (526), 419 states have call predecessors, (526), 379 states have call successors, (526) [2022-02-20 19:57:58,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:58,356 INFO L93 Difference]: Finished difference Result 3778 states and 4662 transitions. [2022-02-20 19:57:58,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3778 states and 4662 transitions. [2022-02-20 19:57:58,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:58,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:58,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 3543 states, 2782 states have (on average 1.2552120776419842) internal successors, (3492), 2823 states have internal predecessors, (3492), 380 states have call successors, (380), 307 states have call predecessors, (380), 379 states have return successors, (526), 419 states have call predecessors, (526), 379 states have call successors, (526) Second operand 3778 states. [2022-02-20 19:57:58,366 INFO L87 Difference]: Start difference. First operand has 3543 states, 2782 states have (on average 1.2552120776419842) internal successors, (3492), 2823 states have internal predecessors, (3492), 380 states have call successors, (380), 307 states have call predecessors, (380), 379 states have return successors, (526), 419 states have call predecessors, (526), 379 states have call successors, (526) Second operand 3778 states. [2022-02-20 19:57:58,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:58,753 INFO L93 Difference]: Finished difference Result 3778 states and 4662 transitions. [2022-02-20 19:57:58,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3778 states and 4662 transitions. [2022-02-20 19:57:58,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:58,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:58,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:58,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3543 states, 2782 states have (on average 1.2552120776419842) internal successors, (3492), 2823 states have internal predecessors, (3492), 380 states have call successors, (380), 307 states have call predecessors, (380), 379 states have return successors, (526), 419 states have call predecessors, (526), 379 states have call successors, (526) [2022-02-20 19:57:59,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 3543 states and 4398 transitions. [2022-02-20 19:57:59,357 INFO L78 Accepts]: Start accepts. Automaton has 3543 states and 4398 transitions. Word has length 77 [2022-02-20 19:57:59,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:59,357 INFO L470 AbstractCegarLoop]: Abstraction has 3543 states and 4398 transitions. [2022-02-20 19:57:59,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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:57:59,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3543 states and 4398 transitions. [2022-02-20 19:57:59,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-02-20 19:57:59,359 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:59,359 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:59,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 19:57:59,359 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:59,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:59,360 INFO L85 PathProgramCache]: Analyzing trace with hash -948888726, now seen corresponding path program 1 times [2022-02-20 19:57:59,360 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:59,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583265951] [2022-02-20 19:57:59,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:59,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:59,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:59,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {130761#(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); {130762#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:59,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {130762#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {130762#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:59,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {130762#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {130717#(= ~q_read_ev~0 2)} #1100#return; {130717#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:59,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:59,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {130763#(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); {130715#true} is VALID [2022-02-20 19:57:59,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {130715#true} assume !(0 == ~q_write_ev~0); {130715#true} is VALID [2022-02-20 19:57:59,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {130715#true} assume true; {130715#true} is VALID [2022-02-20 19:57:59,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130715#true} {130717#(= ~q_read_ev~0 2)} #1102#return; {130715#true} is VALID [2022-02-20 19:57:59,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:59,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:59,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {130715#true} havoc ~__retres1~0; {130715#true} is VALID [2022-02-20 19:57:59,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {130715#true} assume !(1 == ~p_dw_pc~0); {130715#true} is VALID [2022-02-20 19:57:59,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {130715#true} ~__retres1~0 := 0; {130715#true} is VALID [2022-02-20 19:57:59,414 INFO L290 TraceCheckUtils]: 3: Hoare triple {130715#true} #res := ~__retres1~0; {130715#true} is VALID [2022-02-20 19:57:59,414 INFO L290 TraceCheckUtils]: 4: Hoare triple {130715#true} assume true; {130715#true} is VALID [2022-02-20 19:57:59,414 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {130715#true} {130715#true} #1096#return; {130715#true} is VALID [2022-02-20 19:57:59,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:59,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {130715#true} havoc ~__retres1~1; {130715#true} is VALID [2022-02-20 19:57:59,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {130715#true} assume !(1 == ~c_dr_pc~0); {130715#true} is VALID [2022-02-20 19:57:59,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {130715#true} ~__retres1~1 := 0; {130715#true} is VALID [2022-02-20 19:57:59,416 INFO L290 TraceCheckUtils]: 3: Hoare triple {130715#true} #res := ~__retres1~1; {130715#true} is VALID [2022-02-20 19:57:59,416 INFO L290 TraceCheckUtils]: 4: Hoare triple {130715#true} assume true; {130715#true} is VALID [2022-02-20 19:57:59,416 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {130715#true} {130715#true} #1098#return; {130715#true} is VALID [2022-02-20 19:57:59,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {130764#(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; {130715#true} is VALID [2022-02-20 19:57:59,417 INFO L272 TraceCheckUtils]: 1: Hoare triple {130715#true} call #t~ret8 := is_do_write_p_triggered(); {130715#true} is VALID [2022-02-20 19:57:59,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {130715#true} havoc ~__retres1~0; {130715#true} is VALID [2022-02-20 19:57:59,417 INFO L290 TraceCheckUtils]: 3: Hoare triple {130715#true} assume !(1 == ~p_dw_pc~0); {130715#true} is VALID [2022-02-20 19:57:59,417 INFO L290 TraceCheckUtils]: 4: Hoare triple {130715#true} ~__retres1~0 := 0; {130715#true} is VALID [2022-02-20 19:57:59,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {130715#true} #res := ~__retres1~0; {130715#true} is VALID [2022-02-20 19:57:59,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {130715#true} assume true; {130715#true} is VALID [2022-02-20 19:57:59,417 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {130715#true} {130715#true} #1096#return; {130715#true} is VALID [2022-02-20 19:57:59,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {130715#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {130715#true} is VALID [2022-02-20 19:57:59,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {130715#true} assume !(0 != ~tmp~1); {130715#true} is VALID [2022-02-20 19:57:59,417 INFO L272 TraceCheckUtils]: 10: Hoare triple {130715#true} call #t~ret9 := is_do_read_c_triggered(); {130715#true} is VALID [2022-02-20 19:57:59,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {130715#true} havoc ~__retres1~1; {130715#true} is VALID [2022-02-20 19:57:59,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {130715#true} assume !(1 == ~c_dr_pc~0); {130715#true} is VALID [2022-02-20 19:57:59,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {130715#true} ~__retres1~1 := 0; {130715#true} is VALID [2022-02-20 19:57:59,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {130715#true} #res := ~__retres1~1; {130715#true} is VALID [2022-02-20 19:57:59,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {130715#true} assume true; {130715#true} is VALID [2022-02-20 19:57:59,418 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {130715#true} {130715#true} #1098#return; {130715#true} is VALID [2022-02-20 19:57:59,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {130715#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {130715#true} is VALID [2022-02-20 19:57:59,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {130715#true} assume !(0 != ~tmp___0~1); {130715#true} is VALID [2022-02-20 19:57:59,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {130715#true} assume true; {130715#true} is VALID [2022-02-20 19:57:59,419 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {130715#true} {130715#true} #1104#return; {130715#true} is VALID [2022-02-20 19:57:59,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:59,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {130763#(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); {130715#true} is VALID [2022-02-20 19:57:59,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {130715#true} assume !(1 == ~q_write_ev~0); {130715#true} is VALID [2022-02-20 19:57:59,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {130715#true} assume true; {130715#true} is VALID [2022-02-20 19:57:59,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130715#true} {130715#true} #1106#return; {130715#true} is VALID [2022-02-20 19:57:59,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:59,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {130715#true} havoc ~__retres1~2; {130715#true} is VALID [2022-02-20 19:57:59,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {130715#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {130715#true} is VALID [2022-02-20 19:57:59,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {130715#true} #res := ~__retres1~2; {130715#true} is VALID [2022-02-20 19:57:59,423 INFO L290 TraceCheckUtils]: 3: Hoare triple {130715#true} assume true; {130715#true} is VALID [2022-02-20 19:57:59,423 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {130715#true} {130715#true} #1108#return; {130715#true} is VALID [2022-02-20 19:57:59,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-02-20 19:57:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:59,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {130715#true} havoc ~__retres1~2; {130715#true} is VALID [2022-02-20 19:57:59,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {130715#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {130715#true} is VALID [2022-02-20 19:57:59,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {130715#true} #res := ~__retres1~2; {130715#true} is VALID [2022-02-20 19:57:59,426 INFO L290 TraceCheckUtils]: 3: Hoare triple {130715#true} assume true; {130715#true} is VALID [2022-02-20 19:57:59,426 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {130715#true} {130755#(not (= ~c_dr_st~0 0))} #1108#return; {130755#(not (= ~c_dr_st~0 0))} is VALID [2022-02-20 19:57:59,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {130715#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_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;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_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;~token~0 := 0;~local~0 := 0; {130715#true} is VALID [2022-02-20 19:57:59,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {130715#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet36#1, main_#t~ret37#1, main_#t~ret38#1;assume -2147483648 <= main_#t~nondet36#1 && main_#t~nondet36#1 <= 2147483647; {130715#true} is VALID [2022-02-20 19:57:59,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {130715#true} assume 0 != main_#t~nondet36#1;havoc main_#t~nondet36#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; {130717#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:59,427 INFO L290 TraceCheckUtils]: 3: Hoare triple {130717#(= ~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; {130717#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:59,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {130717#(= ~q_read_ev~0 2)} call update_channels1(); {130761#(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:59,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {130761#(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); {130762#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:59,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {130762#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {130762#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:59,429 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {130762#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {130717#(= ~q_read_ev~0 2)} #1100#return; {130717#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:59,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {130717#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {130717#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:59,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {130717#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {130717#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:59,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {130717#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {130717#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:59,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {130717#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {130717#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:59,430 INFO L272 TraceCheckUtils]: 12: Hoare triple {130717#(= ~q_read_ev~0 2)} call fire_delta_events1(); {130763#(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:59,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {130763#(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); {130715#true} is VALID [2022-02-20 19:57:59,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {130715#true} assume !(0 == ~q_write_ev~0); {130715#true} is VALID [2022-02-20 19:57:59,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {130715#true} assume true; {130715#true} is VALID [2022-02-20 19:57:59,430 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {130715#true} {130717#(= ~q_read_ev~0 2)} #1102#return; {130715#true} is VALID [2022-02-20 19:57:59,431 INFO L272 TraceCheckUtils]: 17: Hoare triple {130715#true} call activate_threads1(); {130764#(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:59,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {130764#(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; {130715#true} is VALID [2022-02-20 19:57:59,431 INFO L272 TraceCheckUtils]: 19: Hoare triple {130715#true} call #t~ret8 := is_do_write_p_triggered(); {130715#true} is VALID [2022-02-20 19:57:59,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {130715#true} havoc ~__retres1~0; {130715#true} is VALID [2022-02-20 19:57:59,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {130715#true} assume !(1 == ~p_dw_pc~0); {130715#true} is VALID [2022-02-20 19:57:59,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {130715#true} ~__retres1~0 := 0; {130715#true} is VALID [2022-02-20 19:57:59,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {130715#true} #res := ~__retres1~0; {130715#true} is VALID [2022-02-20 19:57:59,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {130715#true} assume true; {130715#true} is VALID [2022-02-20 19:57:59,432 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {130715#true} {130715#true} #1096#return; {130715#true} is VALID [2022-02-20 19:57:59,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {130715#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {130715#true} is VALID [2022-02-20 19:57:59,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {130715#true} assume !(0 != ~tmp~1); {130715#true} is VALID [2022-02-20 19:57:59,432 INFO L272 TraceCheckUtils]: 28: Hoare triple {130715#true} call #t~ret9 := is_do_read_c_triggered(); {130715#true} is VALID [2022-02-20 19:57:59,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {130715#true} havoc ~__retres1~1; {130715#true} is VALID [2022-02-20 19:57:59,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {130715#true} assume !(1 == ~c_dr_pc~0); {130715#true} is VALID [2022-02-20 19:57:59,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {130715#true} ~__retres1~1 := 0; {130715#true} is VALID [2022-02-20 19:57:59,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {130715#true} #res := ~__retres1~1; {130715#true} is VALID [2022-02-20 19:57:59,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {130715#true} assume true; {130715#true} is VALID [2022-02-20 19:57:59,433 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {130715#true} {130715#true} #1098#return; {130715#true} is VALID [2022-02-20 19:57:59,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {130715#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {130715#true} is VALID [2022-02-20 19:57:59,433 INFO L290 TraceCheckUtils]: 36: Hoare triple {130715#true} assume !(0 != ~tmp___0~1); {130715#true} is VALID [2022-02-20 19:57:59,433 INFO L290 TraceCheckUtils]: 37: Hoare triple {130715#true} assume true; {130715#true} is VALID [2022-02-20 19:57:59,433 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {130715#true} {130715#true} #1104#return; {130715#true} is VALID [2022-02-20 19:57:59,433 INFO L272 TraceCheckUtils]: 39: Hoare triple {130715#true} call reset_delta_events1(); {130763#(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:59,433 INFO L290 TraceCheckUtils]: 40: Hoare triple {130763#(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); {130715#true} is VALID [2022-02-20 19:57:59,434 INFO L290 TraceCheckUtils]: 41: Hoare triple {130715#true} assume !(1 == ~q_write_ev~0); {130715#true} is VALID [2022-02-20 19:57:59,434 INFO L290 TraceCheckUtils]: 42: Hoare triple {130715#true} assume true; {130715#true} is VALID [2022-02-20 19:57:59,434 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {130715#true} {130715#true} #1106#return; {130715#true} is VALID [2022-02-20 19:57:59,434 INFO L290 TraceCheckUtils]: 44: Hoare triple {130715#true} assume !false; {130715#true} is VALID [2022-02-20 19:57:59,434 INFO L290 TraceCheckUtils]: 45: Hoare triple {130715#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; {130715#true} is VALID [2022-02-20 19:57:59,434 INFO L290 TraceCheckUtils]: 46: Hoare triple {130715#true} assume !false; {130715#true} is VALID [2022-02-20 19:57:59,434 INFO L272 TraceCheckUtils]: 47: Hoare triple {130715#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {130715#true} is VALID [2022-02-20 19:57:59,434 INFO L290 TraceCheckUtils]: 48: Hoare triple {130715#true} havoc ~__retres1~2; {130715#true} is VALID [2022-02-20 19:57:59,434 INFO L290 TraceCheckUtils]: 49: Hoare triple {130715#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {130715#true} is VALID [2022-02-20 19:57:59,435 INFO L290 TraceCheckUtils]: 50: Hoare triple {130715#true} #res := ~__retres1~2; {130715#true} is VALID [2022-02-20 19:57:59,435 INFO L290 TraceCheckUtils]: 51: Hoare triple {130715#true} assume true; {130715#true} is VALID [2022-02-20 19:57:59,435 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {130715#true} {130715#true} #1108#return; {130715#true} is VALID [2022-02-20 19:57:59,435 INFO L290 TraceCheckUtils]: 53: Hoare triple {130715#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; {130715#true} is VALID [2022-02-20 19:57:59,435 INFO L290 TraceCheckUtils]: 54: Hoare triple {130715#true} assume 0 != eval1_~tmp___1~0#1; {130715#true} is VALID [2022-02-20 19:57:59,435 INFO L290 TraceCheckUtils]: 55: Hoare triple {130715#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; {130715#true} is VALID [2022-02-20 19:57:59,435 INFO L290 TraceCheckUtils]: 56: Hoare triple {130715#true} assume !(0 != eval1_~tmp~2#1); {130715#true} is VALID [2022-02-20 19:57:59,435 INFO L290 TraceCheckUtils]: 57: Hoare triple {130715#true} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {130715#true} is VALID [2022-02-20 19:57:59,435 INFO L290 TraceCheckUtils]: 58: Hoare triple {130715#true} 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; {130715#true} is VALID [2022-02-20 19:57:59,435 INFO L290 TraceCheckUtils]: 59: Hoare triple {130715#true} assume 0 == ~c_dr_pc~0; {130715#true} is VALID [2022-02-20 19:57:59,436 INFO L290 TraceCheckUtils]: 60: Hoare triple {130715#true} assume !false; {130715#true} is VALID [2022-02-20 19:57:59,436 INFO L290 TraceCheckUtils]: 61: Hoare triple {130715#true} assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 1;~a_t~0 := do_read_c_~a~0#1; {130755#(not (= ~c_dr_st~0 0))} is VALID [2022-02-20 19:57:59,436 INFO L290 TraceCheckUtils]: 62: Hoare triple {130755#(not (= ~c_dr_st~0 0))} assume { :end_inline_do_read_c } true; {130755#(not (= ~c_dr_st~0 0))} is VALID [2022-02-20 19:57:59,436 INFO L290 TraceCheckUtils]: 63: Hoare triple {130755#(not (= ~c_dr_st~0 0))} assume !false; {130755#(not (= ~c_dr_st~0 0))} is VALID [2022-02-20 19:57:59,437 INFO L272 TraceCheckUtils]: 64: Hoare triple {130755#(not (= ~c_dr_st~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {130715#true} is VALID [2022-02-20 19:57:59,437 INFO L290 TraceCheckUtils]: 65: Hoare triple {130715#true} havoc ~__retres1~2; {130715#true} is VALID [2022-02-20 19:57:59,437 INFO L290 TraceCheckUtils]: 66: Hoare triple {130715#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {130715#true} is VALID [2022-02-20 19:57:59,437 INFO L290 TraceCheckUtils]: 67: Hoare triple {130715#true} #res := ~__retres1~2; {130715#true} is VALID [2022-02-20 19:57:59,437 INFO L290 TraceCheckUtils]: 68: Hoare triple {130715#true} assume true; {130715#true} is VALID [2022-02-20 19:57:59,437 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {130715#true} {130755#(not (= ~c_dr_st~0 0))} #1108#return; {130755#(not (= ~c_dr_st~0 0))} is VALID [2022-02-20 19:57:59,438 INFO L290 TraceCheckUtils]: 70: Hoare triple {130755#(not (= ~c_dr_st~0 0))} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {130755#(not (= ~c_dr_st~0 0))} is VALID [2022-02-20 19:57:59,438 INFO L290 TraceCheckUtils]: 71: Hoare triple {130755#(not (= ~c_dr_st~0 0))} assume 0 != eval1_~tmp___1~0#1; {130755#(not (= ~c_dr_st~0 0))} is VALID [2022-02-20 19:57:59,438 INFO L290 TraceCheckUtils]: 72: Hoare triple {130755#(not (= ~c_dr_st~0 0))} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {130755#(not (= ~c_dr_st~0 0))} is VALID [2022-02-20 19:57:59,438 INFO L290 TraceCheckUtils]: 73: Hoare triple {130755#(not (= ~c_dr_st~0 0))} assume !(0 != eval1_~tmp~2#1); {130755#(not (= ~c_dr_st~0 0))} is VALID [2022-02-20 19:57:59,439 INFO L290 TraceCheckUtils]: 74: Hoare triple {130755#(not (= ~c_dr_st~0 0))} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {130716#false} is VALID [2022-02-20 19:57:59,439 INFO L290 TraceCheckUtils]: 75: Hoare triple {130716#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; {130716#false} is VALID [2022-02-20 19:57:59,439 INFO L290 TraceCheckUtils]: 76: Hoare triple {130716#false} assume !(0 == ~c_dr_pc~0); {130716#false} is VALID [2022-02-20 19:57:59,439 INFO L290 TraceCheckUtils]: 77: Hoare triple {130716#false} assume 1 == ~c_dr_pc~0; {130716#false} is VALID [2022-02-20 19:57:59,439 INFO L290 TraceCheckUtils]: 78: Hoare triple {130716#false} do_read_c_~a~0#1 := ~a_t~0; {130716#false} is VALID [2022-02-20 19:57:59,439 INFO L290 TraceCheckUtils]: 79: Hoare triple {130716#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; {130716#false} is VALID [2022-02-20 19:57:59,439 INFO L290 TraceCheckUtils]: 80: Hoare triple {130716#false} assume ~p_last_write~0 == ~c_last_read~0; {130716#false} is VALID [2022-02-20 19:57:59,439 INFO L290 TraceCheckUtils]: 81: Hoare triple {130716#false} assume !(~p_num_write~0 == ~c_num_read~0); {130716#false} is VALID [2022-02-20 19:57:59,440 INFO L272 TraceCheckUtils]: 82: Hoare triple {130716#false} call error1(); {130716#false} is VALID [2022-02-20 19:57:59,440 INFO L290 TraceCheckUtils]: 83: Hoare triple {130716#false} assume !false; {130716#false} is VALID [2022-02-20 19:57:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 19:57:59,440 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:59,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583265951] [2022-02-20 19:57:59,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583265951] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:59,440 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:59,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:59,441 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502210028] [2022-02-20 19:57:59,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:59,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-02-20 19:57:59,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:59,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 19:57:59,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:59,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:59,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:59,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:59,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:59,488 INFO L87 Difference]: Start difference. First operand 3543 states and 4398 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)