./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.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.09.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 2cb37d56f61ec273f723a733aad4526e011a3841f34b26767a03fdc541dd1ee3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:57:35,202 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:57:35,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:57:35,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:57:35,246 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:57:35,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:57:35,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:57:35,265 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:57:35,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:57:35,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:57:35,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:57:35,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:57:35,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:57:35,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:57:35,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:57:35,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:57:35,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:57:35,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:57:35,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:57:35,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:57:35,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:57:35,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:57:35,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:57:35,291 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:57:35,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:57:35,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:57:35,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:57:35,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:57:35,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:57:35,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:57:35,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:57:35,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:57:35,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:57:35,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:57:35,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:57:35,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:57:35,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:57:35,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:57:35,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:57:35,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:57:35,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:57:35,308 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:57:35,344 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:57:35,344 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:57:35,345 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:57:35,345 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:57:35,346 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:57:35,346 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:57:35,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:57:35,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:57:35,347 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:57:35,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:57:35,348 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:57:35,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:57:35,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:57:35,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:57:35,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:57:35,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:57:35,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:57:35,349 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:57:35,349 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:57:35,349 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:57:35,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:57:35,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:57:35,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:57:35,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:57:35,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:57:35,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:57:35,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:57:35,352 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:57:35,352 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:57:35,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:57:35,352 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:57:35,352 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:57:35,353 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:57:35,353 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 -> 2cb37d56f61ec273f723a733aad4526e011a3841f34b26767a03fdc541dd1ee3 [2022-02-20 19:57:35,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:57:35,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:57:35,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:57:35,578 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:57:35,579 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:57:35,580 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.09.cil-1.c [2022-02-20 19:57:35,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ace66b9e/453f6034180f4ee3b18a9569782c8801/FLAGd62b5455c [2022-02-20 19:57:36,050 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:57:36,050 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-1.c [2022-02-20 19:57:36,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ace66b9e/453f6034180f4ee3b18a9569782c8801/FLAGd62b5455c [2022-02-20 19:57:36,076 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ace66b9e/453f6034180f4ee3b18a9569782c8801 [2022-02-20 19:57:36,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:57:36,079 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:57:36,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:57:36,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:57:36,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:57:36,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:57:36" (1/1) ... [2022-02-20 19:57:36,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a0dcc27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:36, skipping insertion in model container [2022-02-20 19:57:36,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:57:36" (1/1) ... [2022-02-20 19:57:36,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:57:36,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:57:36,305 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.09.cil-1.c[914,927] [2022-02-20 19:57:36,371 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.09.cil-1.c[7115,7128] [2022-02-20 19:57:36,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:57:36,500 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:57:36,512 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.09.cil-1.c[914,927] [2022-02-20 19:57:36,526 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.09.cil-1.c[7115,7128] [2022-02-20 19:57:36,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:57:36,582 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:57:36,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:36 WrapperNode [2022-02-20 19:57:36,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:57:36,591 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:57:36,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:57:36,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:57:36,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:36" (1/1) ... [2022-02-20 19:57:36,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:36" (1/1) ... [2022-02-20 19:57:36,673 INFO L137 Inliner]: procedures = 71, calls = 84, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 866 [2022-02-20 19:57:36,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:57:36,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:57:36,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:57:36,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:57:36,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:36" (1/1) ... [2022-02-20 19:57:36,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:36" (1/1) ... [2022-02-20 19:57:36,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:57:36" (1/1) ... [2022-02-20 19:57:36,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:57:36" (1/1) ... [2022-02-20 19:57:36,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:36" (1/1) ... [2022-02-20 19:57:36,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:36" (1/1) ... [2022-02-20 19:57:36,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:36" (1/1) ... [2022-02-20 19:57:36,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:57:36,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:57:36,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:57:36,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:57:36,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:36" (1/1) ... [2022-02-20 19:57:36,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:57:36,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:57:36,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:57:36,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:57:36,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:57:36,811 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:57:36,811 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:57:36,812 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:57:36,812 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:57:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:57:36,813 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:57:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:57:36,814 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:57:36,814 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:57:36,814 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:57:36,814 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:57:36,814 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:57:36,814 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:57:36,814 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:57:36,815 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:57:36,815 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:57:36,815 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:57:36,815 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:57:36,815 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:57:36,815 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:57:36,815 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:57:36,816 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:57:36,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:57:36,816 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:57:36,816 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:57:36,816 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:57:36,816 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:57:36,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:57:36,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:57:36,817 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:57:36,817 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:57:37,001 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:57:37,003 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:57:37,705 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:57:37,715 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:57:37,716 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-02-20 19:57:37,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:57:37 BoogieIcfgContainer [2022-02-20 19:57:37,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:57:37,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:57:37,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:57:37,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:57:37,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:57:36" (1/3) ... [2022-02-20 19:57:37,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9731a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:57:37, skipping insertion in model container [2022-02-20 19:57:37,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:36" (2/3) ... [2022-02-20 19:57:37,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9731a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:57:37, skipping insertion in model container [2022-02-20 19:57:37,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:57:37" (3/3) ... [2022-02-20 19:57:37,723 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.09.cil-1.c [2022-02-20 19:57:37,727 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:57:37,728 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:57:37,763 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:57:37,771 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:57:37,771 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:57:37,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 408 states, 354 states have (on average 1.6271186440677967) internal successors, (576), 360 states have internal predecessors, (576), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-02-20 19:57:37,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:37,819 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:37,821 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:37,821 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:37,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:37,828 INFO L85 PathProgramCache]: Analyzing trace with hash 398033314, now seen corresponding path program 1 times [2022-02-20 19:57:37,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:37,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987206810] [2022-02-20 19:57:37,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:37,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {451#(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); {452#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:38,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {452#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:38,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {452#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {413#(= ~q_read_ev~0 2)} #1548#return; {413#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:38,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {453#(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; {454#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:38,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {454#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {454#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:38,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {454#(= |old(~q_read_ev~0)| 0)} assume true; {454#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:38,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {454#(= |old(~q_read_ev~0)| 0)} {413#(= ~q_read_ev~0 2)} #1550#return; {412#false} is VALID [2022-02-20 19:57:38,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {411#true} havoc ~__retres1~0; {411#true} is VALID [2022-02-20 19:57:38,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {411#true} assume !(1 == ~p_dw_pc~0); {411#true} is VALID [2022-02-20 19:57:38,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {411#true} ~__retres1~0 := 0; {411#true} is VALID [2022-02-20 19:57:38,221 INFO L290 TraceCheckUtils]: 3: Hoare triple {411#true} #res := ~__retres1~0; {411#true} is VALID [2022-02-20 19:57:38,221 INFO L290 TraceCheckUtils]: 4: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 19:57:38,221 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {411#true} {411#true} #1544#return; {411#true} is VALID [2022-02-20 19:57:38,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {411#true} havoc ~__retres1~1; {411#true} is VALID [2022-02-20 19:57:38,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {411#true} assume !(1 == ~c_dr_pc~0); {411#true} is VALID [2022-02-20 19:57:38,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {411#true} ~__retres1~1 := 0; {411#true} is VALID [2022-02-20 19:57:38,227 INFO L290 TraceCheckUtils]: 3: Hoare triple {411#true} #res := ~__retres1~1; {411#true} is VALID [2022-02-20 19:57:38,227 INFO L290 TraceCheckUtils]: 4: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 19:57:38,227 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {411#true} {411#true} #1546#return; {411#true} is VALID [2022-02-20 19:57:38,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {455#(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; {411#true} is VALID [2022-02-20 19:57:38,228 INFO L272 TraceCheckUtils]: 1: Hoare triple {411#true} call #t~ret8 := is_do_write_p_triggered(); {411#true} is VALID [2022-02-20 19:57:38,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {411#true} havoc ~__retres1~0; {411#true} is VALID [2022-02-20 19:57:38,229 INFO L290 TraceCheckUtils]: 3: Hoare triple {411#true} assume !(1 == ~p_dw_pc~0); {411#true} is VALID [2022-02-20 19:57:38,229 INFO L290 TraceCheckUtils]: 4: Hoare triple {411#true} ~__retres1~0 := 0; {411#true} is VALID [2022-02-20 19:57:38,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {411#true} #res := ~__retres1~0; {411#true} is VALID [2022-02-20 19:57:38,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 19:57:38,230 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {411#true} {411#true} #1544#return; {411#true} is VALID [2022-02-20 19:57:38,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {411#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {411#true} is VALID [2022-02-20 19:57:38,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {411#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {411#true} is VALID [2022-02-20 19:57:38,231 INFO L272 TraceCheckUtils]: 10: Hoare triple {411#true} call #t~ret9 := is_do_read_c_triggered(); {411#true} is VALID [2022-02-20 19:57:38,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {411#true} havoc ~__retres1~1; {411#true} is VALID [2022-02-20 19:57:38,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {411#true} assume !(1 == ~c_dr_pc~0); {411#true} is VALID [2022-02-20 19:57:38,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {411#true} ~__retres1~1 := 0; {411#true} is VALID [2022-02-20 19:57:38,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {411#true} #res := ~__retres1~1; {411#true} is VALID [2022-02-20 19:57:38,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 19:57:38,234 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {411#true} {411#true} #1546#return; {411#true} is VALID [2022-02-20 19:57:38,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {411#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {411#true} is VALID [2022-02-20 19:57:38,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {411#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {411#true} is VALID [2022-02-20 19:57:38,235 INFO L290 TraceCheckUtils]: 19: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 19:57:38,236 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {411#true} {412#false} #1552#return; {412#false} is VALID [2022-02-20 19:57:38,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {453#(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; {411#true} is VALID [2022-02-20 19:57:38,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {411#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {411#true} is VALID [2022-02-20 19:57:38,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 19:57:38,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {411#true} {412#false} #1554#return; {412#false} is VALID [2022-02-20 19:57:38,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:38,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {411#true} havoc ~__retres1~2; {411#true} is VALID [2022-02-20 19:57:38,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {411#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {411#true} is VALID [2022-02-20 19:57:38,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {411#true} #res := ~__retres1~2; {411#true} is VALID [2022-02-20 19:57:38,259 INFO L290 TraceCheckUtils]: 3: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 19:57:38,259 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {411#true} {412#false} #1556#return; {412#false} is VALID [2022-02-20 19:57:38,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {411#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {411#true} is VALID [2022-02-20 19:57:38,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {411#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1;assume -2147483648 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 2147483647; {411#true} is VALID [2022-02-20 19:57:38,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {411#true} assume 0 != main_#t~nondet44#1;havoc main_#t~nondet44#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; {413#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:38,264 INFO L290 TraceCheckUtils]: 3: Hoare triple {413#(= ~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; {413#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:38,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {413#(= ~q_read_ev~0 2)} call update_channels1(); {451#(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:38,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {451#(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); {452#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:38,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {452#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {452#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:38,268 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {452#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {413#(= ~q_read_ev~0 2)} #1548#return; {413#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:38,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {413#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {413#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:38,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {413#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {413#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:38,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {413#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {413#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:38,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {413#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {413#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:38,272 INFO L272 TraceCheckUtils]: 12: Hoare triple {413#(= ~q_read_ev~0 2)} call fire_delta_events1(); {453#(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:38,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {453#(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; {454#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:38,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {454#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:38,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {454#(= |old(~q_read_ev~0)| 0)} assume true; {454#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:38,274 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {454#(= |old(~q_read_ev~0)| 0)} {413#(= ~q_read_ev~0 2)} #1550#return; {412#false} is VALID [2022-02-20 19:57:38,274 INFO L272 TraceCheckUtils]: 17: Hoare triple {412#false} call activate_threads1(); {455#(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:38,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {455#(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; {411#true} is VALID [2022-02-20 19:57:38,275 INFO L272 TraceCheckUtils]: 19: Hoare triple {411#true} call #t~ret8 := is_do_write_p_triggered(); {411#true} is VALID [2022-02-20 19:57:38,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {411#true} havoc ~__retres1~0; {411#true} is VALID [2022-02-20 19:57:38,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {411#true} assume !(1 == ~p_dw_pc~0); {411#true} is VALID [2022-02-20 19:57:38,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {411#true} ~__retres1~0 := 0; {411#true} is VALID [2022-02-20 19:57:38,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {411#true} #res := ~__retres1~0; {411#true} is VALID [2022-02-20 19:57:38,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 19:57:38,277 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {411#true} {411#true} #1544#return; {411#true} is VALID [2022-02-20 19:57:38,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {411#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {411#true} is VALID [2022-02-20 19:57:38,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {411#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {411#true} is VALID [2022-02-20 19:57:38,277 INFO L272 TraceCheckUtils]: 28: Hoare triple {411#true} call #t~ret9 := is_do_read_c_triggered(); {411#true} is VALID [2022-02-20 19:57:38,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {411#true} havoc ~__retres1~1; {411#true} is VALID [2022-02-20 19:57:38,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {411#true} assume !(1 == ~c_dr_pc~0); {411#true} is VALID [2022-02-20 19:57:38,278 INFO L290 TraceCheckUtils]: 31: Hoare triple {411#true} ~__retres1~1 := 0; {411#true} is VALID [2022-02-20 19:57:38,279 INFO L290 TraceCheckUtils]: 32: Hoare triple {411#true} #res := ~__retres1~1; {411#true} is VALID [2022-02-20 19:57:38,279 INFO L290 TraceCheckUtils]: 33: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 19:57:38,279 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {411#true} {411#true} #1546#return; {411#true} is VALID [2022-02-20 19:57:38,279 INFO L290 TraceCheckUtils]: 35: Hoare triple {411#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {411#true} is VALID [2022-02-20 19:57:38,280 INFO L290 TraceCheckUtils]: 36: Hoare triple {411#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {411#true} is VALID [2022-02-20 19:57:38,280 INFO L290 TraceCheckUtils]: 37: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 19:57:38,280 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {411#true} {412#false} #1552#return; {412#false} is VALID [2022-02-20 19:57:38,280 INFO L272 TraceCheckUtils]: 39: Hoare triple {412#false} call reset_delta_events1(); {453#(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:38,281 INFO L290 TraceCheckUtils]: 40: Hoare triple {453#(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; {411#true} is VALID [2022-02-20 19:57:38,281 INFO L290 TraceCheckUtils]: 41: Hoare triple {411#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {411#true} is VALID [2022-02-20 19:57:38,282 INFO L290 TraceCheckUtils]: 42: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 19:57:38,282 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {411#true} {412#false} #1554#return; {412#false} is VALID [2022-02-20 19:57:38,282 INFO L290 TraceCheckUtils]: 44: Hoare triple {412#false} assume !false; {412#false} is VALID [2022-02-20 19:57:38,283 INFO L290 TraceCheckUtils]: 45: Hoare triple {412#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; {412#false} is VALID [2022-02-20 19:57:38,283 INFO L290 TraceCheckUtils]: 46: Hoare triple {412#false} assume !false; {412#false} is VALID [2022-02-20 19:57:38,283 INFO L272 TraceCheckUtils]: 47: Hoare triple {412#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {411#true} is VALID [2022-02-20 19:57:38,283 INFO L290 TraceCheckUtils]: 48: Hoare triple {411#true} havoc ~__retres1~2; {411#true} is VALID [2022-02-20 19:57:38,284 INFO L290 TraceCheckUtils]: 49: Hoare triple {411#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {411#true} is VALID [2022-02-20 19:57:38,284 INFO L290 TraceCheckUtils]: 50: Hoare triple {411#true} #res := ~__retres1~2; {411#true} is VALID [2022-02-20 19:57:38,284 INFO L290 TraceCheckUtils]: 51: Hoare triple {411#true} assume true; {411#true} is VALID [2022-02-20 19:57:38,286 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {411#true} {412#false} #1556#return; {412#false} is VALID [2022-02-20 19:57:38,286 INFO L290 TraceCheckUtils]: 53: Hoare triple {412#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; {412#false} is VALID [2022-02-20 19:57:38,287 INFO L290 TraceCheckUtils]: 54: Hoare triple {412#false} assume 0 != eval1_~tmp___1~0#1; {412#false} is VALID [2022-02-20 19:57:38,287 INFO L290 TraceCheckUtils]: 55: Hoare triple {412#false} assume !(0 == ~p_dw_st~0); {412#false} is VALID [2022-02-20 19:57:38,288 INFO L290 TraceCheckUtils]: 56: Hoare triple {412#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; {412#false} is VALID [2022-02-20 19:57:38,288 INFO L290 TraceCheckUtils]: 57: Hoare triple {412#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; {412#false} is VALID [2022-02-20 19:57:38,288 INFO L290 TraceCheckUtils]: 58: Hoare triple {412#false} assume 0 == ~c_dr_pc~0; {412#false} is VALID [2022-02-20 19:57:38,288 INFO L290 TraceCheckUtils]: 59: Hoare triple {412#false} assume !false; {412#false} is VALID [2022-02-20 19:57:38,290 INFO L290 TraceCheckUtils]: 60: Hoare triple {412#false} assume !(1 == ~q_free~0); {412#false} is VALID [2022-02-20 19:57:38,290 INFO L290 TraceCheckUtils]: 61: Hoare triple {412#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; {412#false} is VALID [2022-02-20 19:57:38,290 INFO L290 TraceCheckUtils]: 62: Hoare triple {412#false} assume !(~p_last_write~0 == ~c_last_read~0); {412#false} is VALID [2022-02-20 19:57:38,291 INFO L272 TraceCheckUtils]: 63: Hoare triple {412#false} call error1(); {412#false} is VALID [2022-02-20 19:57:38,295 INFO L290 TraceCheckUtils]: 64: Hoare triple {412#false} assume !false; {412#false} is VALID [2022-02-20 19:57:38,296 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:38,297 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:38,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987206810] [2022-02-20 19:57:38,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987206810] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:38,298 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:38,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:38,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889995470] [2022-02-20 19:57:38,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:38,305 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:38,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:38,309 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:38,375 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:38,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:38,376 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:38,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:38,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:38,395 INFO L87 Difference]: Start difference. First operand has 408 states, 354 states have (on average 1.6271186440677967) internal successors, (576), 360 states have internal predecessors, (576), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) 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:41,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:41,887 INFO L93 Difference]: Finished difference Result 926 states and 1464 transitions. [2022-02-20 19:57:41,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:57:41,888 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:41,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:41,889 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:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1464 transitions. [2022-02-20 19:57:41,920 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:41,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1464 transitions. [2022-02-20 19:57:41,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1464 transitions. [2022-02-20 19:57:42,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1464 edges. 1464 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:43,055 INFO L225 Difference]: With dead ends: 926 [2022-02-20 19:57:43,055 INFO L226 Difference]: Without dead ends: 533 [2022-02-20 19:57:43,060 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:43,063 INFO L933 BasicCegarLoop]: 617 mSDtfsCounter, 733 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 2037 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:43,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [738 Valid, 2037 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:57:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-02-20 19:57:43,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 494. [2022-02-20 19:57:43,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:43,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 533 states. Second operand has 494 states, 422 states have (on average 1.509478672985782) internal successors, (637), 428 states have internal predecessors, (637), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 19:57:43,179 INFO L74 IsIncluded]: Start isIncluded. First operand 533 states. Second operand has 494 states, 422 states have (on average 1.509478672985782) internal successors, (637), 428 states have internal predecessors, (637), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 19:57:43,181 INFO L87 Difference]: Start difference. First operand 533 states. Second operand has 494 states, 422 states have (on average 1.509478672985782) internal successors, (637), 428 states have internal predecessors, (637), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 19:57:43,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:43,209 INFO L93 Difference]: Finished difference Result 533 states and 790 transitions. [2022-02-20 19:57:43,209 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 790 transitions. [2022-02-20 19:57:43,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:43,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:43,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 494 states, 422 states have (on average 1.509478672985782) internal successors, (637), 428 states have internal predecessors, (637), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) Second operand 533 states. [2022-02-20 19:57:43,217 INFO L87 Difference]: Start difference. First operand has 494 states, 422 states have (on average 1.509478672985782) internal successors, (637), 428 states have internal predecessors, (637), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) Second operand 533 states. [2022-02-20 19:57:43,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:43,243 INFO L93 Difference]: Finished difference Result 533 states and 790 transitions. [2022-02-20 19:57:43,243 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 790 transitions. [2022-02-20 19:57:43,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:43,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:43,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:43,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:43,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 422 states have (on average 1.509478672985782) internal successors, (637), 428 states have internal predecessors, (637), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2022-02-20 19:57:43,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 736 transitions. [2022-02-20 19:57:43,274 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 736 transitions. Word has length 65 [2022-02-20 19:57:43,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:43,274 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 736 transitions. [2022-02-20 19:57:43,275 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:43,275 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 736 transitions. [2022-02-20 19:57:43,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:43,276 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:43,277 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:43,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:57:43,277 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:43,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:43,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2076921954, now seen corresponding path program 1 times [2022-02-20 19:57:43,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:43,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064783427] [2022-02-20 19:57:43,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:43,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {3479#(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); {3480#(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:43,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {3480#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3480#(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:43,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3480#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3441#(= ~q_write_ev~0 ~q_read_ev~0)} #1548#return; {3441#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:43,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {3480#(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); {3481#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:43,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {3481#(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; {3482#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:43,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {3482#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3482#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:43,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3482#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3441#(= ~q_write_ev~0 ~q_read_ev~0)} #1550#return; {3440#false} is VALID [2022-02-20 19:57:43,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {3439#true} havoc ~__retres1~0; {3439#true} is VALID [2022-02-20 19:57:43,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {3439#true} assume !(1 == ~p_dw_pc~0); {3439#true} is VALID [2022-02-20 19:57:43,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {3439#true} ~__retres1~0 := 0; {3439#true} is VALID [2022-02-20 19:57:43,390 INFO L290 TraceCheckUtils]: 3: Hoare triple {3439#true} #res := ~__retres1~0; {3439#true} is VALID [2022-02-20 19:57:43,390 INFO L290 TraceCheckUtils]: 4: Hoare triple {3439#true} assume true; {3439#true} is VALID [2022-02-20 19:57:43,390 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3439#true} {3439#true} #1544#return; {3439#true} is VALID [2022-02-20 19:57:43,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {3439#true} havoc ~__retres1~1; {3439#true} is VALID [2022-02-20 19:57:43,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {3439#true} assume !(1 == ~c_dr_pc~0); {3439#true} is VALID [2022-02-20 19:57:43,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {3439#true} ~__retres1~1 := 0; {3439#true} is VALID [2022-02-20 19:57:43,399 INFO L290 TraceCheckUtils]: 3: Hoare triple {3439#true} #res := ~__retres1~1; {3439#true} is VALID [2022-02-20 19:57:43,399 INFO L290 TraceCheckUtils]: 4: Hoare triple {3439#true} assume true; {3439#true} is VALID [2022-02-20 19:57:43,399 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3439#true} {3439#true} #1546#return; {3439#true} is VALID [2022-02-20 19:57:43,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {3483#(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; {3439#true} is VALID [2022-02-20 19:57:43,399 INFO L272 TraceCheckUtils]: 1: Hoare triple {3439#true} call #t~ret8 := is_do_write_p_triggered(); {3439#true} is VALID [2022-02-20 19:57:43,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {3439#true} havoc ~__retres1~0; {3439#true} is VALID [2022-02-20 19:57:43,400 INFO L290 TraceCheckUtils]: 3: Hoare triple {3439#true} assume !(1 == ~p_dw_pc~0); {3439#true} is VALID [2022-02-20 19:57:43,400 INFO L290 TraceCheckUtils]: 4: Hoare triple {3439#true} ~__retres1~0 := 0; {3439#true} is VALID [2022-02-20 19:57:43,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {3439#true} #res := ~__retres1~0; {3439#true} is VALID [2022-02-20 19:57:43,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {3439#true} assume true; {3439#true} is VALID [2022-02-20 19:57:43,401 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3439#true} {3439#true} #1544#return; {3439#true} is VALID [2022-02-20 19:57:43,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {3439#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3439#true} is VALID [2022-02-20 19:57:43,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {3439#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3439#true} is VALID [2022-02-20 19:57:43,401 INFO L272 TraceCheckUtils]: 10: Hoare triple {3439#true} call #t~ret9 := is_do_read_c_triggered(); {3439#true} is VALID [2022-02-20 19:57:43,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {3439#true} havoc ~__retres1~1; {3439#true} is VALID [2022-02-20 19:57:43,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {3439#true} assume !(1 == ~c_dr_pc~0); {3439#true} is VALID [2022-02-20 19:57:43,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {3439#true} ~__retres1~1 := 0; {3439#true} is VALID [2022-02-20 19:57:43,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {3439#true} #res := ~__retres1~1; {3439#true} is VALID [2022-02-20 19:57:43,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {3439#true} assume true; {3439#true} is VALID [2022-02-20 19:57:43,402 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3439#true} {3439#true} #1546#return; {3439#true} is VALID [2022-02-20 19:57:43,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {3439#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3439#true} is VALID [2022-02-20 19:57:43,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {3439#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3439#true} is VALID [2022-02-20 19:57:43,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {3439#true} assume true; {3439#true} is VALID [2022-02-20 19:57:43,403 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3439#true} {3440#false} #1552#return; {3440#false} is VALID [2022-02-20 19:57:43,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {3480#(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); {3439#true} is VALID [2022-02-20 19:57:43,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {3439#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3439#true} is VALID [2022-02-20 19:57:43,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {3439#true} assume true; {3439#true} is VALID [2022-02-20 19:57:43,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3439#true} {3440#false} #1554#return; {3440#false} is VALID [2022-02-20 19:57:43,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {3439#true} havoc ~__retres1~2; {3439#true} is VALID [2022-02-20 19:57:43,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {3439#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3439#true} is VALID [2022-02-20 19:57:43,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {3439#true} #res := ~__retres1~2; {3439#true} is VALID [2022-02-20 19:57:43,413 INFO L290 TraceCheckUtils]: 3: Hoare triple {3439#true} assume true; {3439#true} is VALID [2022-02-20 19:57:43,413 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3439#true} {3440#false} #1556#return; {3440#false} is VALID [2022-02-20 19:57:43,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {3439#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {3439#true} is VALID [2022-02-20 19:57:43,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {3439#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1;assume -2147483648 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 2147483647; {3439#true} is VALID [2022-02-20 19:57:43,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {3439#true} assume 0 != main_#t~nondet44#1;havoc main_#t~nondet44#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; {3441#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:43,414 INFO L290 TraceCheckUtils]: 3: Hoare triple {3441#(= ~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; {3441#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:43,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {3441#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {3479#(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:43,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {3479#(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); {3480#(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:43,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {3480#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3480#(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:43,417 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3480#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3441#(= ~q_write_ev~0 ~q_read_ev~0)} #1548#return; {3441#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:43,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {3441#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {3441#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:43,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {3441#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3441#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:43,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {3441#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3441#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:43,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {3441#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {3441#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:43,419 INFO L272 TraceCheckUtils]: 12: Hoare triple {3441#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {3480#(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:43,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {3480#(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); {3481#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:43,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {3481#(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; {3482#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:43,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {3482#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3482#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:43,420 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3482#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3441#(= ~q_write_ev~0 ~q_read_ev~0)} #1550#return; {3440#false} is VALID [2022-02-20 19:57:43,421 INFO L272 TraceCheckUtils]: 17: Hoare triple {3440#false} call activate_threads1(); {3483#(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:43,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {3483#(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; {3439#true} is VALID [2022-02-20 19:57:43,421 INFO L272 TraceCheckUtils]: 19: Hoare triple {3439#true} call #t~ret8 := is_do_write_p_triggered(); {3439#true} is VALID [2022-02-20 19:57:43,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {3439#true} havoc ~__retres1~0; {3439#true} is VALID [2022-02-20 19:57:43,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {3439#true} assume !(1 == ~p_dw_pc~0); {3439#true} is VALID [2022-02-20 19:57:43,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {3439#true} ~__retres1~0 := 0; {3439#true} is VALID [2022-02-20 19:57:43,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {3439#true} #res := ~__retres1~0; {3439#true} is VALID [2022-02-20 19:57:43,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {3439#true} assume true; {3439#true} is VALID [2022-02-20 19:57:43,422 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3439#true} {3439#true} #1544#return; {3439#true} is VALID [2022-02-20 19:57:43,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {3439#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3439#true} is VALID [2022-02-20 19:57:43,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {3439#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3439#true} is VALID [2022-02-20 19:57:43,423 INFO L272 TraceCheckUtils]: 28: Hoare triple {3439#true} call #t~ret9 := is_do_read_c_triggered(); {3439#true} is VALID [2022-02-20 19:57:43,423 INFO L290 TraceCheckUtils]: 29: Hoare triple {3439#true} havoc ~__retres1~1; {3439#true} is VALID [2022-02-20 19:57:43,423 INFO L290 TraceCheckUtils]: 30: Hoare triple {3439#true} assume !(1 == ~c_dr_pc~0); {3439#true} is VALID [2022-02-20 19:57:43,423 INFO L290 TraceCheckUtils]: 31: Hoare triple {3439#true} ~__retres1~1 := 0; {3439#true} is VALID [2022-02-20 19:57:43,423 INFO L290 TraceCheckUtils]: 32: Hoare triple {3439#true} #res := ~__retres1~1; {3439#true} is VALID [2022-02-20 19:57:43,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {3439#true} assume true; {3439#true} is VALID [2022-02-20 19:57:43,424 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3439#true} {3439#true} #1546#return; {3439#true} is VALID [2022-02-20 19:57:43,424 INFO L290 TraceCheckUtils]: 35: Hoare triple {3439#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3439#true} is VALID [2022-02-20 19:57:43,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {3439#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3439#true} is VALID [2022-02-20 19:57:43,424 INFO L290 TraceCheckUtils]: 37: Hoare triple {3439#true} assume true; {3439#true} is VALID [2022-02-20 19:57:43,424 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3439#true} {3440#false} #1552#return; {3440#false} is VALID [2022-02-20 19:57:43,424 INFO L272 TraceCheckUtils]: 39: Hoare triple {3440#false} call reset_delta_events1(); {3480#(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:43,425 INFO L290 TraceCheckUtils]: 40: Hoare triple {3480#(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); {3439#true} is VALID [2022-02-20 19:57:43,425 INFO L290 TraceCheckUtils]: 41: Hoare triple {3439#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3439#true} is VALID [2022-02-20 19:57:43,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {3439#true} assume true; {3439#true} is VALID [2022-02-20 19:57:43,425 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3439#true} {3440#false} #1554#return; {3440#false} is VALID [2022-02-20 19:57:43,425 INFO L290 TraceCheckUtils]: 44: Hoare triple {3440#false} assume !false; {3440#false} is VALID [2022-02-20 19:57:43,426 INFO L290 TraceCheckUtils]: 45: Hoare triple {3440#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; {3440#false} is VALID [2022-02-20 19:57:43,426 INFO L290 TraceCheckUtils]: 46: Hoare triple {3440#false} assume !false; {3440#false} is VALID [2022-02-20 19:57:43,426 INFO L272 TraceCheckUtils]: 47: Hoare triple {3440#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3439#true} is VALID [2022-02-20 19:57:43,426 INFO L290 TraceCheckUtils]: 48: Hoare triple {3439#true} havoc ~__retres1~2; {3439#true} is VALID [2022-02-20 19:57:43,426 INFO L290 TraceCheckUtils]: 49: Hoare triple {3439#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3439#true} is VALID [2022-02-20 19:57:43,426 INFO L290 TraceCheckUtils]: 50: Hoare triple {3439#true} #res := ~__retres1~2; {3439#true} is VALID [2022-02-20 19:57:43,427 INFO L290 TraceCheckUtils]: 51: Hoare triple {3439#true} assume true; {3439#true} is VALID [2022-02-20 19:57:43,427 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3439#true} {3440#false} #1556#return; {3440#false} is VALID [2022-02-20 19:57:43,427 INFO L290 TraceCheckUtils]: 53: Hoare triple {3440#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; {3440#false} is VALID [2022-02-20 19:57:43,427 INFO L290 TraceCheckUtils]: 54: Hoare triple {3440#false} assume 0 != eval1_~tmp___1~0#1; {3440#false} is VALID [2022-02-20 19:57:43,427 INFO L290 TraceCheckUtils]: 55: Hoare triple {3440#false} assume !(0 == ~p_dw_st~0); {3440#false} is VALID [2022-02-20 19:57:43,428 INFO L290 TraceCheckUtils]: 56: Hoare triple {3440#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; {3440#false} is VALID [2022-02-20 19:57:43,428 INFO L290 TraceCheckUtils]: 57: Hoare triple {3440#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; {3440#false} is VALID [2022-02-20 19:57:43,428 INFO L290 TraceCheckUtils]: 58: Hoare triple {3440#false} assume 0 == ~c_dr_pc~0; {3440#false} is VALID [2022-02-20 19:57:43,428 INFO L290 TraceCheckUtils]: 59: Hoare triple {3440#false} assume !false; {3440#false} is VALID [2022-02-20 19:57:43,428 INFO L290 TraceCheckUtils]: 60: Hoare triple {3440#false} assume !(1 == ~q_free~0); {3440#false} is VALID [2022-02-20 19:57:43,428 INFO L290 TraceCheckUtils]: 61: Hoare triple {3440#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; {3440#false} is VALID [2022-02-20 19:57:43,429 INFO L290 TraceCheckUtils]: 62: Hoare triple {3440#false} assume !(~p_last_write~0 == ~c_last_read~0); {3440#false} is VALID [2022-02-20 19:57:43,429 INFO L272 TraceCheckUtils]: 63: Hoare triple {3440#false} call error1(); {3440#false} is VALID [2022-02-20 19:57:43,429 INFO L290 TraceCheckUtils]: 64: Hoare triple {3440#false} assume !false; {3440#false} is VALID [2022-02-20 19:57:43,429 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:43,430 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:43,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064783427] [2022-02-20 19:57:43,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064783427] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:43,430 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:43,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:43,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763894090] [2022-02-20 19:57:43,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:43,432 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:43,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:43,433 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:43,474 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:43,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:43,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:43,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:43,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:43,476 INFO L87 Difference]: Start difference. First operand 494 states and 736 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:47,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:47,180 INFO L93 Difference]: Finished difference Result 841 states and 1213 transitions. [2022-02-20 19:57:47,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:57:47,180 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:47,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:47,181 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:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 942 transitions. [2022-02-20 19:57:47,192 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:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 942 transitions. [2022-02-20 19:57:47,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 942 transitions. [2022-02-20 19:57:47,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 942 edges. 942 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:47,993 INFO L225 Difference]: With dead ends: 841 [2022-02-20 19:57:47,993 INFO L226 Difference]: Without dead ends: 664 [2022-02-20 19:57:47,997 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:48,000 INFO L933 BasicCegarLoop]: 661 mSDtfsCounter, 1450 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:48,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1477 Valid, 1975 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 19:57:48,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-02-20 19:57:48,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 590. [2022-02-20 19:57:48,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:48,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 664 states. Second operand has 590 states, 498 states have (on average 1.4879518072289157) internal successors, (741), 506 states have internal predecessors, (741), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-02-20 19:57:48,052 INFO L74 IsIncluded]: Start isIncluded. First operand 664 states. Second operand has 590 states, 498 states have (on average 1.4879518072289157) internal successors, (741), 506 states have internal predecessors, (741), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-02-20 19:57:48,055 INFO L87 Difference]: Start difference. First operand 664 states. Second operand has 590 states, 498 states have (on average 1.4879518072289157) internal successors, (741), 506 states have internal predecessors, (741), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-02-20 19:57:48,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:48,087 INFO L93 Difference]: Finished difference Result 664 states and 973 transitions. [2022-02-20 19:57:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 973 transitions. [2022-02-20 19:57:48,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:48,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:48,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 590 states, 498 states have (on average 1.4879518072289157) internal successors, (741), 506 states have internal predecessors, (741), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) Second operand 664 states. [2022-02-20 19:57:48,095 INFO L87 Difference]: Start difference. First operand has 590 states, 498 states have (on average 1.4879518072289157) internal successors, (741), 506 states have internal predecessors, (741), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) Second operand 664 states. [2022-02-20 19:57:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:48,126 INFO L93 Difference]: Finished difference Result 664 states and 973 transitions. [2022-02-20 19:57:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 973 transitions. [2022-02-20 19:57:48,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:48,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:48,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:48,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 498 states have (on average 1.4879518072289157) internal successors, (741), 506 states have internal predecessors, (741), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2022-02-20 19:57:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 870 transitions. [2022-02-20 19:57:48,160 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 870 transitions. Word has length 65 [2022-02-20 19:57:48,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:48,161 INFO L470 AbstractCegarLoop]: Abstraction has 590 states and 870 transitions. [2022-02-20 19:57:48,162 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:48,162 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 870 transitions. [2022-02-20 19:57:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:48,163 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:48,164 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:48,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:57:48,164 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:48,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:48,165 INFO L85 PathProgramCache]: Analyzing trace with hash 48335844, now seen corresponding path program 1 times [2022-02-20 19:57:48,165 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:48,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135172526] [2022-02-20 19:57:48,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:48,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {6799#(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); {6760#true} is VALID [2022-02-20 19:57:48,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-02-20 19:57:48,207 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6760#true} {6760#true} #1548#return; {6760#true} is VALID [2022-02-20 19:57:48,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {6800#(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); {6760#true} is VALID [2022-02-20 19:57:48,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {6760#true} assume !(0 == ~q_write_ev~0); {6760#true} is VALID [2022-02-20 19:57:48,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-02-20 19:57:48,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6760#true} {6760#true} #1550#return; {6760#true} is VALID [2022-02-20 19:57:48,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {6760#true} havoc ~__retres1~0; {6760#true} is VALID [2022-02-20 19:57:48,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {6760#true} assume !(1 == ~p_dw_pc~0); {6760#true} is VALID [2022-02-20 19:57:48,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {6760#true} ~__retres1~0 := 0; {6816#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:48,324 INFO L290 TraceCheckUtils]: 3: Hoare triple {6816#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {6817#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:48,325 INFO L290 TraceCheckUtils]: 4: Hoare triple {6817#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {6817#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:48,326 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6817#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {6760#true} #1544#return; {6808#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:48,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {6760#true} havoc ~__retres1~1; {6760#true} is VALID [2022-02-20 19:57:48,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {6760#true} assume !(1 == ~c_dr_pc~0); {6760#true} is VALID [2022-02-20 19:57:48,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {6760#true} ~__retres1~1 := 0; {6760#true} is VALID [2022-02-20 19:57:48,332 INFO L290 TraceCheckUtils]: 3: Hoare triple {6760#true} #res := ~__retres1~1; {6760#true} is VALID [2022-02-20 19:57:48,332 INFO L290 TraceCheckUtils]: 4: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-02-20 19:57:48,332 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6760#true} {6761#false} #1546#return; {6761#false} is VALID [2022-02-20 19:57:48,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {6801#(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; {6760#true} is VALID [2022-02-20 19:57:48,333 INFO L272 TraceCheckUtils]: 1: Hoare triple {6760#true} call #t~ret8 := is_do_write_p_triggered(); {6760#true} is VALID [2022-02-20 19:57:48,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {6760#true} havoc ~__retres1~0; {6760#true} is VALID [2022-02-20 19:57:48,333 INFO L290 TraceCheckUtils]: 3: Hoare triple {6760#true} assume !(1 == ~p_dw_pc~0); {6760#true} is VALID [2022-02-20 19:57:48,333 INFO L290 TraceCheckUtils]: 4: Hoare triple {6760#true} ~__retres1~0 := 0; {6816#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:48,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {6816#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {6817#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:48,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {6817#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {6817#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:48,335 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6817#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {6760#true} #1544#return; {6808#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:48,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {6808#(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; {6809#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:48,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {6809#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {6761#false} is VALID [2022-02-20 19:57:48,336 INFO L272 TraceCheckUtils]: 10: Hoare triple {6761#false} call #t~ret9 := is_do_read_c_triggered(); {6760#true} is VALID [2022-02-20 19:57:48,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {6760#true} havoc ~__retres1~1; {6760#true} is VALID [2022-02-20 19:57:48,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {6760#true} assume !(1 == ~c_dr_pc~0); {6760#true} is VALID [2022-02-20 19:57:48,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {6760#true} ~__retres1~1 := 0; {6760#true} is VALID [2022-02-20 19:57:48,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {6760#true} #res := ~__retres1~1; {6760#true} is VALID [2022-02-20 19:57:48,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-02-20 19:57:48,338 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6760#true} {6761#false} #1546#return; {6761#false} is VALID [2022-02-20 19:57:48,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {6761#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6761#false} is VALID [2022-02-20 19:57:48,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {6761#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6761#false} is VALID [2022-02-20 19:57:48,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {6761#false} assume true; {6761#false} is VALID [2022-02-20 19:57:48,338 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {6761#false} {6760#true} #1552#return; {6761#false} is VALID [2022-02-20 19:57:48,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {6800#(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); {6760#true} is VALID [2022-02-20 19:57:48,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {6760#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6760#true} is VALID [2022-02-20 19:57:48,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-02-20 19:57:48,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6760#true} {6761#false} #1554#return; {6761#false} is VALID [2022-02-20 19:57:48,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {6760#true} havoc ~__retres1~2; {6760#true} is VALID [2022-02-20 19:57:48,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {6760#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6760#true} is VALID [2022-02-20 19:57:48,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {6760#true} #res := ~__retres1~2; {6760#true} is VALID [2022-02-20 19:57:48,347 INFO L290 TraceCheckUtils]: 3: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-02-20 19:57:48,347 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6760#true} {6761#false} #1556#return; {6761#false} is VALID [2022-02-20 19:57:48,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {6760#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {6760#true} is VALID [2022-02-20 19:57:48,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {6760#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1;assume -2147483648 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 2147483647; {6760#true} is VALID [2022-02-20 19:57:48,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {6760#true} assume 0 != main_#t~nondet44#1;havoc main_#t~nondet44#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; {6760#true} is VALID [2022-02-20 19:57:48,348 INFO L290 TraceCheckUtils]: 3: Hoare triple {6760#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; {6760#true} is VALID [2022-02-20 19:57:48,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {6760#true} call update_channels1(); {6799#(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:48,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {6799#(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); {6760#true} is VALID [2022-02-20 19:57:48,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-02-20 19:57:48,349 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6760#true} {6760#true} #1548#return; {6760#true} is VALID [2022-02-20 19:57:48,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {6760#true} assume { :begin_inline_init_threads1 } true; {6760#true} is VALID [2022-02-20 19:57:48,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {6760#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {6760#true} is VALID [2022-02-20 19:57:48,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {6760#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {6760#true} is VALID [2022-02-20 19:57:48,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {6760#true} assume { :end_inline_init_threads1 } true; {6760#true} is VALID [2022-02-20 19:57:48,350 INFO L272 TraceCheckUtils]: 12: Hoare triple {6760#true} call fire_delta_events1(); {6800#(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:48,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {6800#(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); {6760#true} is VALID [2022-02-20 19:57:48,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {6760#true} assume !(0 == ~q_write_ev~0); {6760#true} is VALID [2022-02-20 19:57:48,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-02-20 19:57:48,351 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6760#true} {6760#true} #1550#return; {6760#true} is VALID [2022-02-20 19:57:48,351 INFO L272 TraceCheckUtils]: 17: Hoare triple {6760#true} call activate_threads1(); {6801#(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:48,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {6801#(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; {6760#true} is VALID [2022-02-20 19:57:48,352 INFO L272 TraceCheckUtils]: 19: Hoare triple {6760#true} call #t~ret8 := is_do_write_p_triggered(); {6760#true} is VALID [2022-02-20 19:57:48,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {6760#true} havoc ~__retres1~0; {6760#true} is VALID [2022-02-20 19:57:48,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {6760#true} assume !(1 == ~p_dw_pc~0); {6760#true} is VALID [2022-02-20 19:57:48,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {6760#true} ~__retres1~0 := 0; {6816#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:48,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {6816#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {6817#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:48,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {6817#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {6817#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:48,354 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6817#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {6760#true} #1544#return; {6808#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:48,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {6808#(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; {6809#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:48,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {6809#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {6761#false} is VALID [2022-02-20 19:57:48,355 INFO L272 TraceCheckUtils]: 28: Hoare triple {6761#false} call #t~ret9 := is_do_read_c_triggered(); {6760#true} is VALID [2022-02-20 19:57:48,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {6760#true} havoc ~__retres1~1; {6760#true} is VALID [2022-02-20 19:57:48,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {6760#true} assume !(1 == ~c_dr_pc~0); {6760#true} is VALID [2022-02-20 19:57:48,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {6760#true} ~__retres1~1 := 0; {6760#true} is VALID [2022-02-20 19:57:48,356 INFO L290 TraceCheckUtils]: 32: Hoare triple {6760#true} #res := ~__retres1~1; {6760#true} is VALID [2022-02-20 19:57:48,356 INFO L290 TraceCheckUtils]: 33: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-02-20 19:57:48,357 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6760#true} {6761#false} #1546#return; {6761#false} is VALID [2022-02-20 19:57:48,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {6761#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {6761#false} is VALID [2022-02-20 19:57:48,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {6761#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {6761#false} is VALID [2022-02-20 19:57:48,357 INFO L290 TraceCheckUtils]: 37: Hoare triple {6761#false} assume true; {6761#false} is VALID [2022-02-20 19:57:48,357 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6761#false} {6760#true} #1552#return; {6761#false} is VALID [2022-02-20 19:57:48,357 INFO L272 TraceCheckUtils]: 39: Hoare triple {6761#false} call reset_delta_events1(); {6800#(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:48,358 INFO L290 TraceCheckUtils]: 40: Hoare triple {6800#(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); {6760#true} is VALID [2022-02-20 19:57:48,358 INFO L290 TraceCheckUtils]: 41: Hoare triple {6760#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {6760#true} is VALID [2022-02-20 19:57:48,358 INFO L290 TraceCheckUtils]: 42: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-02-20 19:57:48,358 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {6760#true} {6761#false} #1554#return; {6761#false} is VALID [2022-02-20 19:57:48,358 INFO L290 TraceCheckUtils]: 44: Hoare triple {6761#false} assume !false; {6761#false} is VALID [2022-02-20 19:57:48,358 INFO L290 TraceCheckUtils]: 45: Hoare triple {6761#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; {6761#false} is VALID [2022-02-20 19:57:48,359 INFO L290 TraceCheckUtils]: 46: Hoare triple {6761#false} assume !false; {6761#false} is VALID [2022-02-20 19:57:48,359 INFO L272 TraceCheckUtils]: 47: Hoare triple {6761#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {6760#true} is VALID [2022-02-20 19:57:48,359 INFO L290 TraceCheckUtils]: 48: Hoare triple {6760#true} havoc ~__retres1~2; {6760#true} is VALID [2022-02-20 19:57:48,359 INFO L290 TraceCheckUtils]: 49: Hoare triple {6760#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {6760#true} is VALID [2022-02-20 19:57:48,359 INFO L290 TraceCheckUtils]: 50: Hoare triple {6760#true} #res := ~__retres1~2; {6760#true} is VALID [2022-02-20 19:57:48,360 INFO L290 TraceCheckUtils]: 51: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-02-20 19:57:48,360 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {6760#true} {6761#false} #1556#return; {6761#false} is VALID [2022-02-20 19:57:48,360 INFO L290 TraceCheckUtils]: 53: Hoare triple {6761#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; {6761#false} is VALID [2022-02-20 19:57:48,360 INFO L290 TraceCheckUtils]: 54: Hoare triple {6761#false} assume 0 != eval1_~tmp___1~0#1; {6761#false} is VALID [2022-02-20 19:57:48,360 INFO L290 TraceCheckUtils]: 55: Hoare triple {6761#false} assume !(0 == ~p_dw_st~0); {6761#false} is VALID [2022-02-20 19:57:48,360 INFO L290 TraceCheckUtils]: 56: Hoare triple {6761#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; {6761#false} is VALID [2022-02-20 19:57:48,361 INFO L290 TraceCheckUtils]: 57: Hoare triple {6761#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; {6761#false} is VALID [2022-02-20 19:57:48,361 INFO L290 TraceCheckUtils]: 58: Hoare triple {6761#false} assume 0 == ~c_dr_pc~0; {6761#false} is VALID [2022-02-20 19:57:48,361 INFO L290 TraceCheckUtils]: 59: Hoare triple {6761#false} assume !false; {6761#false} is VALID [2022-02-20 19:57:48,361 INFO L290 TraceCheckUtils]: 60: Hoare triple {6761#false} assume !(1 == ~q_free~0); {6761#false} is VALID [2022-02-20 19:57:48,361 INFO L290 TraceCheckUtils]: 61: Hoare triple {6761#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; {6761#false} is VALID [2022-02-20 19:57:48,361 INFO L290 TraceCheckUtils]: 62: Hoare triple {6761#false} assume !(~p_last_write~0 == ~c_last_read~0); {6761#false} is VALID [2022-02-20 19:57:48,362 INFO L272 TraceCheckUtils]: 63: Hoare triple {6761#false} call error1(); {6761#false} is VALID [2022-02-20 19:57:48,362 INFO L290 TraceCheckUtils]: 64: Hoare triple {6761#false} assume !false; {6761#false} is VALID [2022-02-20 19:57:48,362 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:48,362 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:48,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135172526] [2022-02-20 19:57:48,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135172526] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:48,363 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:48,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:48,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551144253] [2022-02-20 19:57:48,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:48,364 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:48,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:48,364 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:48,405 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:48,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:48,406 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:48,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:48,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:48,407 INFO L87 Difference]: Start difference. First operand 590 states and 870 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:51,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:51,828 INFO L93 Difference]: Finished difference Result 891 states and 1284 transitions. [2022-02-20 19:57:51,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:51,828 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:51,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:51,829 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:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 760 transitions. [2022-02-20 19:57:51,835 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:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 760 transitions. [2022-02-20 19:57:51,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 760 transitions. [2022-02-20 19:57:52,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 760 edges. 760 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:52,411 INFO L225 Difference]: With dead ends: 891 [2022-02-20 19:57:52,411 INFO L226 Difference]: Without dead ends: 624 [2022-02-20 19:57:52,412 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:52,413 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 530 mSDsluCounter, 2028 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 2620 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:52,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [531 Valid, 2620 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1432 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 19:57:52,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-02-20 19:57:52,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 595. [2022-02-20 19:57:52,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:52,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 624 states. Second operand has 595 states, 502 states have (on average 1.4800796812749004) internal successors, (743), 510 states have internal predecessors, (743), 59 states have call successors, (59), 28 states have call predecessors, (59), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) [2022-02-20 19:57:52,440 INFO L74 IsIncluded]: Start isIncluded. First operand 624 states. Second operand has 595 states, 502 states have (on average 1.4800796812749004) internal successors, (743), 510 states have internal predecessors, (743), 59 states have call successors, (59), 28 states have call predecessors, (59), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) [2022-02-20 19:57:52,442 INFO L87 Difference]: Start difference. First operand 624 states. Second operand has 595 states, 502 states have (on average 1.4800796812749004) internal successors, (743), 510 states have internal predecessors, (743), 59 states have call successors, (59), 28 states have call predecessors, (59), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) [2022-02-20 19:57:52,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:52,471 INFO L93 Difference]: Finished difference Result 624 states and 914 transitions. [2022-02-20 19:57:52,471 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 914 transitions. [2022-02-20 19:57:52,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:52,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:52,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 595 states, 502 states have (on average 1.4800796812749004) internal successors, (743), 510 states have internal predecessors, (743), 59 states have call successors, (59), 28 states have call predecessors, (59), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) Second operand 624 states. [2022-02-20 19:57:52,477 INFO L87 Difference]: Start difference. First operand has 595 states, 502 states have (on average 1.4800796812749004) internal successors, (743), 510 states have internal predecessors, (743), 59 states have call successors, (59), 28 states have call predecessors, (59), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) Second operand 624 states. [2022-02-20 19:57:52,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:52,501 INFO L93 Difference]: Finished difference Result 624 states and 914 transitions. [2022-02-20 19:57:52,501 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 914 transitions. [2022-02-20 19:57:52,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:52,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:52,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:52,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:52,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 502 states have (on average 1.4800796812749004) internal successors, (743), 510 states have internal predecessors, (743), 59 states have call successors, (59), 28 states have call predecessors, (59), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) [2022-02-20 19:57:52,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 873 transitions. [2022-02-20 19:57:52,530 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 873 transitions. Word has length 65 [2022-02-20 19:57:52,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:52,531 INFO L470 AbstractCegarLoop]: Abstraction has 595 states and 873 transitions. [2022-02-20 19:57:52,531 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:52,531 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 873 transitions. [2022-02-20 19:57:52,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:52,534 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:52,534 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:52,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:57:52,535 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:52,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:52,535 INFO L85 PathProgramCache]: Analyzing trace with hash -981023454, now seen corresponding path program 1 times [2022-02-20 19:57:52,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:52,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28565184] [2022-02-20 19:57:52,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:52,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:52,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:52,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {10105#(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); {10066#true} is VALID [2022-02-20 19:57:52,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {10066#true} assume true; {10066#true} is VALID [2022-02-20 19:57:52,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10066#true} {10066#true} #1548#return; {10066#true} is VALID [2022-02-20 19:57:52,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:52,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {10106#(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); {10066#true} is VALID [2022-02-20 19:57:52,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {10066#true} assume !(0 == ~q_write_ev~0); {10066#true} is VALID [2022-02-20 19:57:52,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {10066#true} assume true; {10066#true} is VALID [2022-02-20 19:57:52,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10066#true} {10066#true} #1550#return; {10066#true} is VALID [2022-02-20 19:57:52,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:52,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:52,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {10066#true} havoc ~__retres1~0; {10066#true} is VALID [2022-02-20 19:57:52,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {10066#true} assume !(1 == ~p_dw_pc~0); {10066#true} is VALID [2022-02-20 19:57:52,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {10066#true} ~__retres1~0 := 0; {10066#true} is VALID [2022-02-20 19:57:52,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {10066#true} #res := ~__retres1~0; {10066#true} is VALID [2022-02-20 19:57:52,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {10066#true} assume true; {10066#true} is VALID [2022-02-20 19:57:52,632 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10066#true} {10066#true} #1544#return; {10066#true} is VALID [2022-02-20 19:57:52,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:52,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {10066#true} havoc ~__retres1~1; {10066#true} is VALID [2022-02-20 19:57:52,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {10066#true} assume !(1 == ~c_dr_pc~0); {10066#true} is VALID [2022-02-20 19:57:52,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {10066#true} ~__retres1~1 := 0; {10122#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:52,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {10122#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10123#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:52,662 INFO L290 TraceCheckUtils]: 4: Hoare triple {10123#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10123#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:52,662 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10123#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10066#true} #1546#return; {10120#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:52,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {10107#(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; {10066#true} is VALID [2022-02-20 19:57:52,663 INFO L272 TraceCheckUtils]: 1: Hoare triple {10066#true} call #t~ret8 := is_do_write_p_triggered(); {10066#true} is VALID [2022-02-20 19:57:52,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {10066#true} havoc ~__retres1~0; {10066#true} is VALID [2022-02-20 19:57:52,663 INFO L290 TraceCheckUtils]: 3: Hoare triple {10066#true} assume !(1 == ~p_dw_pc~0); {10066#true} is VALID [2022-02-20 19:57:52,663 INFO L290 TraceCheckUtils]: 4: Hoare triple {10066#true} ~__retres1~0 := 0; {10066#true} is VALID [2022-02-20 19:57:52,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {10066#true} #res := ~__retres1~0; {10066#true} is VALID [2022-02-20 19:57:52,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {10066#true} assume true; {10066#true} is VALID [2022-02-20 19:57:52,664 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10066#true} {10066#true} #1544#return; {10066#true} is VALID [2022-02-20 19:57:52,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {10066#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10066#true} is VALID [2022-02-20 19:57:52,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {10066#true} assume !(0 != ~tmp~1); {10066#true} is VALID [2022-02-20 19:57:52,664 INFO L272 TraceCheckUtils]: 10: Hoare triple {10066#true} call #t~ret9 := is_do_read_c_triggered(); {10066#true} is VALID [2022-02-20 19:57:52,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {10066#true} havoc ~__retres1~1; {10066#true} is VALID [2022-02-20 19:57:52,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {10066#true} assume !(1 == ~c_dr_pc~0); {10066#true} is VALID [2022-02-20 19:57:52,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {10066#true} ~__retres1~1 := 0; {10122#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:52,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {10122#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10123#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:52,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {10123#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10123#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:52,666 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10123#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10066#true} #1546#return; {10120#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:52,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {10120#(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; {10121#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:52,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {10121#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10067#false} is VALID [2022-02-20 19:57:52,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {10067#false} assume true; {10067#false} is VALID [2022-02-20 19:57:52,668 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10067#false} {10066#true} #1552#return; {10067#false} is VALID [2022-02-20 19:57:52,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:52,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {10106#(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); {10066#true} is VALID [2022-02-20 19:57:52,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {10066#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10066#true} is VALID [2022-02-20 19:57:52,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {10066#true} assume true; {10066#true} is VALID [2022-02-20 19:57:52,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10066#true} {10067#false} #1554#return; {10067#false} is VALID [2022-02-20 19:57:52,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:52,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {10066#true} havoc ~__retres1~2; {10066#true} is VALID [2022-02-20 19:57:52,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {10066#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10066#true} is VALID [2022-02-20 19:57:52,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {10066#true} #res := ~__retres1~2; {10066#true} is VALID [2022-02-20 19:57:52,676 INFO L290 TraceCheckUtils]: 3: Hoare triple {10066#true} assume true; {10066#true} is VALID [2022-02-20 19:57:52,676 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10066#true} {10067#false} #1556#return; {10067#false} is VALID [2022-02-20 19:57:52,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {10066#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {10066#true} is VALID [2022-02-20 19:57:52,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {10066#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1;assume -2147483648 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 2147483647; {10066#true} is VALID [2022-02-20 19:57:52,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {10066#true} assume 0 != main_#t~nondet44#1;havoc main_#t~nondet44#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; {10066#true} is VALID [2022-02-20 19:57:52,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {10066#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; {10066#true} is VALID [2022-02-20 19:57:52,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {10066#true} call update_channels1(); {10105#(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:52,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {10105#(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); {10066#true} is VALID [2022-02-20 19:57:52,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {10066#true} assume true; {10066#true} is VALID [2022-02-20 19:57:52,678 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10066#true} {10066#true} #1548#return; {10066#true} is VALID [2022-02-20 19:57:52,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {10066#true} assume { :begin_inline_init_threads1 } true; {10066#true} is VALID [2022-02-20 19:57:52,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {10066#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10066#true} is VALID [2022-02-20 19:57:52,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {10066#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10066#true} is VALID [2022-02-20 19:57:52,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {10066#true} assume { :end_inline_init_threads1 } true; {10066#true} is VALID [2022-02-20 19:57:52,679 INFO L272 TraceCheckUtils]: 12: Hoare triple {10066#true} call fire_delta_events1(); {10106#(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:52,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {10106#(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); {10066#true} is VALID [2022-02-20 19:57:52,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {10066#true} assume !(0 == ~q_write_ev~0); {10066#true} is VALID [2022-02-20 19:57:52,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {10066#true} assume true; {10066#true} is VALID [2022-02-20 19:57:52,680 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10066#true} {10066#true} #1550#return; {10066#true} is VALID [2022-02-20 19:57:52,680 INFO L272 TraceCheckUtils]: 17: Hoare triple {10066#true} call activate_threads1(); {10107#(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:52,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {10107#(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; {10066#true} is VALID [2022-02-20 19:57:52,680 INFO L272 TraceCheckUtils]: 19: Hoare triple {10066#true} call #t~ret8 := is_do_write_p_triggered(); {10066#true} is VALID [2022-02-20 19:57:52,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {10066#true} havoc ~__retres1~0; {10066#true} is VALID [2022-02-20 19:57:52,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {10066#true} assume !(1 == ~p_dw_pc~0); {10066#true} is VALID [2022-02-20 19:57:52,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {10066#true} ~__retres1~0 := 0; {10066#true} is VALID [2022-02-20 19:57:52,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {10066#true} #res := ~__retres1~0; {10066#true} is VALID [2022-02-20 19:57:52,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {10066#true} assume true; {10066#true} is VALID [2022-02-20 19:57:52,681 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10066#true} {10066#true} #1544#return; {10066#true} is VALID [2022-02-20 19:57:52,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {10066#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10066#true} is VALID [2022-02-20 19:57:52,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {10066#true} assume !(0 != ~tmp~1); {10066#true} is VALID [2022-02-20 19:57:52,682 INFO L272 TraceCheckUtils]: 28: Hoare triple {10066#true} call #t~ret9 := is_do_read_c_triggered(); {10066#true} is VALID [2022-02-20 19:57:52,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {10066#true} havoc ~__retres1~1; {10066#true} is VALID [2022-02-20 19:57:52,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {10066#true} assume !(1 == ~c_dr_pc~0); {10066#true} is VALID [2022-02-20 19:57:52,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {10066#true} ~__retres1~1 := 0; {10122#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:52,683 INFO L290 TraceCheckUtils]: 32: Hoare triple {10122#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10123#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:52,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {10123#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10123#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:52,684 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10123#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10066#true} #1546#return; {10120#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:52,685 INFO L290 TraceCheckUtils]: 35: Hoare triple {10120#(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; {10121#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:52,685 INFO L290 TraceCheckUtils]: 36: Hoare triple {10121#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10067#false} is VALID [2022-02-20 19:57:52,685 INFO L290 TraceCheckUtils]: 37: Hoare triple {10067#false} assume true; {10067#false} is VALID [2022-02-20 19:57:52,685 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10067#false} {10066#true} #1552#return; {10067#false} is VALID [2022-02-20 19:57:52,686 INFO L272 TraceCheckUtils]: 39: Hoare triple {10067#false} call reset_delta_events1(); {10106#(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:52,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {10106#(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); {10066#true} is VALID [2022-02-20 19:57:52,686 INFO L290 TraceCheckUtils]: 41: Hoare triple {10066#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10066#true} is VALID [2022-02-20 19:57:52,686 INFO L290 TraceCheckUtils]: 42: Hoare triple {10066#true} assume true; {10066#true} is VALID [2022-02-20 19:57:52,686 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10066#true} {10067#false} #1554#return; {10067#false} is VALID [2022-02-20 19:57:52,686 INFO L290 TraceCheckUtils]: 44: Hoare triple {10067#false} assume !false; {10067#false} is VALID [2022-02-20 19:57:52,686 INFO L290 TraceCheckUtils]: 45: Hoare triple {10067#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; {10067#false} is VALID [2022-02-20 19:57:52,687 INFO L290 TraceCheckUtils]: 46: Hoare triple {10067#false} assume !false; {10067#false} is VALID [2022-02-20 19:57:52,687 INFO L272 TraceCheckUtils]: 47: Hoare triple {10067#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10066#true} is VALID [2022-02-20 19:57:52,687 INFO L290 TraceCheckUtils]: 48: Hoare triple {10066#true} havoc ~__retres1~2; {10066#true} is VALID [2022-02-20 19:57:52,687 INFO L290 TraceCheckUtils]: 49: Hoare triple {10066#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10066#true} is VALID [2022-02-20 19:57:52,687 INFO L290 TraceCheckUtils]: 50: Hoare triple {10066#true} #res := ~__retres1~2; {10066#true} is VALID [2022-02-20 19:57:52,687 INFO L290 TraceCheckUtils]: 51: Hoare triple {10066#true} assume true; {10066#true} is VALID [2022-02-20 19:57:52,688 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10066#true} {10067#false} #1556#return; {10067#false} is VALID [2022-02-20 19:57:52,688 INFO L290 TraceCheckUtils]: 53: Hoare triple {10067#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; {10067#false} is VALID [2022-02-20 19:57:52,688 INFO L290 TraceCheckUtils]: 54: Hoare triple {10067#false} assume 0 != eval1_~tmp___1~0#1; {10067#false} is VALID [2022-02-20 19:57:52,688 INFO L290 TraceCheckUtils]: 55: Hoare triple {10067#false} assume !(0 == ~p_dw_st~0); {10067#false} is VALID [2022-02-20 19:57:52,688 INFO L290 TraceCheckUtils]: 56: Hoare triple {10067#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; {10067#false} is VALID [2022-02-20 19:57:52,688 INFO L290 TraceCheckUtils]: 57: Hoare triple {10067#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; {10067#false} is VALID [2022-02-20 19:57:52,689 INFO L290 TraceCheckUtils]: 58: Hoare triple {10067#false} assume 0 == ~c_dr_pc~0; {10067#false} is VALID [2022-02-20 19:57:52,689 INFO L290 TraceCheckUtils]: 59: Hoare triple {10067#false} assume !false; {10067#false} is VALID [2022-02-20 19:57:52,689 INFO L290 TraceCheckUtils]: 60: Hoare triple {10067#false} assume !(1 == ~q_free~0); {10067#false} is VALID [2022-02-20 19:57:52,689 INFO L290 TraceCheckUtils]: 61: Hoare triple {10067#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; {10067#false} is VALID [2022-02-20 19:57:52,689 INFO L290 TraceCheckUtils]: 62: Hoare triple {10067#false} assume !(~p_last_write~0 == ~c_last_read~0); {10067#false} is VALID [2022-02-20 19:57:52,689 INFO L272 TraceCheckUtils]: 63: Hoare triple {10067#false} call error1(); {10067#false} is VALID [2022-02-20 19:57:52,690 INFO L290 TraceCheckUtils]: 64: Hoare triple {10067#false} assume !false; {10067#false} is VALID [2022-02-20 19:57:52,690 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:52,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:52,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28565184] [2022-02-20 19:57:52,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28565184] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:52,690 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:52,691 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:52,691 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442819523] [2022-02-20 19:57:52,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:52,691 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:52,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:52,692 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:52,730 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:52,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:52,730 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:52,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:52,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:52,731 INFO L87 Difference]: Start difference. First operand 595 states and 873 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:55,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:55,990 INFO L93 Difference]: Finished difference Result 913 states and 1306 transitions. [2022-02-20 19:57:55,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:57:55,990 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:55,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:55,991 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:55,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 764 transitions. [2022-02-20 19:57:55,997 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:56,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 764 transitions. [2022-02-20 19:57:56,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 764 transitions. [2022-02-20 19:57:56,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 764 edges. 764 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:56,625 INFO L225 Difference]: With dead ends: 913 [2022-02-20 19:57:56,625 INFO L226 Difference]: Without dead ends: 641 [2022-02-20 19:57:56,626 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:56,627 INFO L933 BasicCegarLoop]: 590 mSDtfsCounter, 789 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 2349 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:56,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [791 Valid, 2349 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:57:56,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-02-20 19:57:56,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 610. [2022-02-20 19:57:56,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:56,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 641 states. Second operand has 610 states, 514 states have (on average 1.4688715953307394) internal successors, (755), 522 states have internal predecessors, (755), 59 states have call successors, (59), 28 states have call predecessors, (59), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) [2022-02-20 19:57:56,656 INFO L74 IsIncluded]: Start isIncluded. First operand 641 states. Second operand has 610 states, 514 states have (on average 1.4688715953307394) internal successors, (755), 522 states have internal predecessors, (755), 59 states have call successors, (59), 28 states have call predecessors, (59), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) [2022-02-20 19:57:56,657 INFO L87 Difference]: Start difference. First operand 641 states. Second operand has 610 states, 514 states have (on average 1.4688715953307394) internal successors, (755), 522 states have internal predecessors, (755), 59 states have call successors, (59), 28 states have call predecessors, (59), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) [2022-02-20 19:57:56,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:56,681 INFO L93 Difference]: Finished difference Result 641 states and 932 transitions. [2022-02-20 19:57:56,682 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 932 transitions. [2022-02-20 19:57:56,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:56,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:56,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 610 states, 514 states have (on average 1.4688715953307394) internal successors, (755), 522 states have internal predecessors, (755), 59 states have call successors, (59), 28 states have call predecessors, (59), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) Second operand 641 states. [2022-02-20 19:57:56,686 INFO L87 Difference]: Start difference. First operand has 610 states, 514 states have (on average 1.4688715953307394) internal successors, (755), 522 states have internal predecessors, (755), 59 states have call successors, (59), 28 states have call predecessors, (59), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) Second operand 641 states. [2022-02-20 19:57:56,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:56,711 INFO L93 Difference]: Finished difference Result 641 states and 932 transitions. [2022-02-20 19:57:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 932 transitions. [2022-02-20 19:57:56,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:56,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:56,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:56,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:56,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 514 states have (on average 1.4688715953307394) internal successors, (755), 522 states have internal predecessors, (755), 59 states have call successors, (59), 28 states have call predecessors, (59), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) [2022-02-20 19:57:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 888 transitions. [2022-02-20 19:57:56,741 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 888 transitions. Word has length 65 [2022-02-20 19:57:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:56,742 INFO L470 AbstractCegarLoop]: Abstraction has 610 states and 888 transitions. [2022-02-20 19:57:56,742 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:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 888 transitions. [2022-02-20 19:57:56,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:56,743 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:56,743 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:56,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:57:56,744 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:56,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:56,744 INFO L85 PathProgramCache]: Analyzing trace with hash 405179940, now seen corresponding path program 1 times [2022-02-20 19:57:56,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:56,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347192953] [2022-02-20 19:57:56,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:56,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:56,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:56,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {13492#(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); {13493#(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:56,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {13493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13493#(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:56,828 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13454#(= ~q_write_ev~0 ~q_read_ev~0)} #1548#return; {13454#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:56,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:56,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {13493#(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); {13493#(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:56,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {13493#(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); {13493#(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:56,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {13493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13493#(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:56,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13454#(= ~q_write_ev~0 ~q_read_ev~0)} #1550#return; {13454#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:56,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:56,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:56,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {13452#true} havoc ~__retres1~0; {13452#true} is VALID [2022-02-20 19:57:56,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {13452#true} assume !(1 == ~p_dw_pc~0); {13452#true} is VALID [2022-02-20 19:57:56,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {13452#true} ~__retres1~0 := 0; {13452#true} is VALID [2022-02-20 19:57:56,862 INFO L290 TraceCheckUtils]: 3: Hoare triple {13452#true} #res := ~__retres1~0; {13452#true} is VALID [2022-02-20 19:57:56,862 INFO L290 TraceCheckUtils]: 4: Hoare triple {13452#true} assume true; {13452#true} is VALID [2022-02-20 19:57:56,862 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13452#true} {13452#true} #1544#return; {13452#true} is VALID [2022-02-20 19:57:56,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:56,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {13452#true} havoc ~__retres1~1; {13452#true} is VALID [2022-02-20 19:57:56,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {13452#true} assume !(1 == ~c_dr_pc~0); {13452#true} is VALID [2022-02-20 19:57:56,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {13452#true} ~__retres1~1 := 0; {13452#true} is VALID [2022-02-20 19:57:56,866 INFO L290 TraceCheckUtils]: 3: Hoare triple {13452#true} #res := ~__retres1~1; {13452#true} is VALID [2022-02-20 19:57:56,866 INFO L290 TraceCheckUtils]: 4: Hoare triple {13452#true} assume true; {13452#true} is VALID [2022-02-20 19:57:56,866 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13452#true} {13452#true} #1546#return; {13452#true} is VALID [2022-02-20 19:57:56,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {13494#(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; {13452#true} is VALID [2022-02-20 19:57:56,867 INFO L272 TraceCheckUtils]: 1: Hoare triple {13452#true} call #t~ret8 := is_do_write_p_triggered(); {13452#true} is VALID [2022-02-20 19:57:56,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {13452#true} havoc ~__retres1~0; {13452#true} is VALID [2022-02-20 19:57:56,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {13452#true} assume !(1 == ~p_dw_pc~0); {13452#true} is VALID [2022-02-20 19:57:56,867 INFO L290 TraceCheckUtils]: 4: Hoare triple {13452#true} ~__retres1~0 := 0; {13452#true} is VALID [2022-02-20 19:57:56,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {13452#true} #res := ~__retres1~0; {13452#true} is VALID [2022-02-20 19:57:56,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {13452#true} assume true; {13452#true} is VALID [2022-02-20 19:57:56,868 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13452#true} {13452#true} #1544#return; {13452#true} is VALID [2022-02-20 19:57:56,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {13452#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13452#true} is VALID [2022-02-20 19:57:56,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {13452#true} assume !(0 != ~tmp~1); {13452#true} is VALID [2022-02-20 19:57:56,868 INFO L272 TraceCheckUtils]: 10: Hoare triple {13452#true} call #t~ret9 := is_do_read_c_triggered(); {13452#true} is VALID [2022-02-20 19:57:56,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {13452#true} havoc ~__retres1~1; {13452#true} is VALID [2022-02-20 19:57:56,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {13452#true} assume !(1 == ~c_dr_pc~0); {13452#true} is VALID [2022-02-20 19:57:56,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {13452#true} ~__retres1~1 := 0; {13452#true} is VALID [2022-02-20 19:57:56,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {13452#true} #res := ~__retres1~1; {13452#true} is VALID [2022-02-20 19:57:56,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {13452#true} assume true; {13452#true} is VALID [2022-02-20 19:57:56,869 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13452#true} {13452#true} #1546#return; {13452#true} is VALID [2022-02-20 19:57:56,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {13452#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13452#true} is VALID [2022-02-20 19:57:56,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {13452#true} assume !(0 != ~tmp___0~1); {13452#true} is VALID [2022-02-20 19:57:56,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {13452#true} assume true; {13452#true} is VALID [2022-02-20 19:57:56,870 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {13452#true} {13454#(= ~q_write_ev~0 ~q_read_ev~0)} #1552#return; {13454#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:56,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:56,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {13493#(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); {13507#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:57:56,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {13507#(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; {13508#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:56,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {13508#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {13508#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:56,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13508#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {13454#(= ~q_write_ev~0 ~q_read_ev~0)} #1554#return; {13453#false} is VALID [2022-02-20 19:57:56,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:56,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {13452#true} havoc ~__retres1~2; {13452#true} is VALID [2022-02-20 19:57:56,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {13452#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13452#true} is VALID [2022-02-20 19:57:56,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {13452#true} #res := ~__retres1~2; {13452#true} is VALID [2022-02-20 19:57:56,900 INFO L290 TraceCheckUtils]: 3: Hoare triple {13452#true} assume true; {13452#true} is VALID [2022-02-20 19:57:56,901 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13452#true} {13453#false} #1556#return; {13453#false} is VALID [2022-02-20 19:57:56,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {13452#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {13452#true} is VALID [2022-02-20 19:57:56,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {13452#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1;assume -2147483648 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 2147483647; {13452#true} is VALID [2022-02-20 19:57:56,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {13452#true} assume 0 != main_#t~nondet44#1;havoc main_#t~nondet44#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; {13454#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:56,905 INFO L290 TraceCheckUtils]: 3: Hoare triple {13454#(= ~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; {13454#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:56,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {13454#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {13492#(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:56,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {13492#(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); {13493#(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:56,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {13493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13493#(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:56,908 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13454#(= ~q_write_ev~0 ~q_read_ev~0)} #1548#return; {13454#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:56,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {13454#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {13454#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:56,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {13454#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {13454#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:56,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {13454#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {13454#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:56,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {13454#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {13454#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:56,911 INFO L272 TraceCheckUtils]: 12: Hoare triple {13454#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {13493#(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:56,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {13493#(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); {13493#(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:56,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {13493#(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); {13493#(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:56,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {13493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {13493#(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:56,913 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13493#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {13454#(= ~q_write_ev~0 ~q_read_ev~0)} #1550#return; {13454#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:56,913 INFO L272 TraceCheckUtils]: 17: Hoare triple {13454#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {13494#(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:56,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {13494#(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; {13452#true} is VALID [2022-02-20 19:57:56,914 INFO L272 TraceCheckUtils]: 19: Hoare triple {13452#true} call #t~ret8 := is_do_write_p_triggered(); {13452#true} is VALID [2022-02-20 19:57:56,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {13452#true} havoc ~__retres1~0; {13452#true} is VALID [2022-02-20 19:57:56,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {13452#true} assume !(1 == ~p_dw_pc~0); {13452#true} is VALID [2022-02-20 19:57:56,914 INFO L290 TraceCheckUtils]: 22: Hoare triple {13452#true} ~__retres1~0 := 0; {13452#true} is VALID [2022-02-20 19:57:56,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {13452#true} #res := ~__retres1~0; {13452#true} is VALID [2022-02-20 19:57:56,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {13452#true} assume true; {13452#true} is VALID [2022-02-20 19:57:56,915 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13452#true} {13452#true} #1544#return; {13452#true} is VALID [2022-02-20 19:57:56,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {13452#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {13452#true} is VALID [2022-02-20 19:57:56,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {13452#true} assume !(0 != ~tmp~1); {13452#true} is VALID [2022-02-20 19:57:56,915 INFO L272 TraceCheckUtils]: 28: Hoare triple {13452#true} call #t~ret9 := is_do_read_c_triggered(); {13452#true} is VALID [2022-02-20 19:57:56,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {13452#true} havoc ~__retres1~1; {13452#true} is VALID [2022-02-20 19:57:56,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {13452#true} assume !(1 == ~c_dr_pc~0); {13452#true} is VALID [2022-02-20 19:57:56,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {13452#true} ~__retres1~1 := 0; {13452#true} is VALID [2022-02-20 19:57:56,916 INFO L290 TraceCheckUtils]: 32: Hoare triple {13452#true} #res := ~__retres1~1; {13452#true} is VALID [2022-02-20 19:57:56,916 INFO L290 TraceCheckUtils]: 33: Hoare triple {13452#true} assume true; {13452#true} is VALID [2022-02-20 19:57:56,916 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {13452#true} {13452#true} #1546#return; {13452#true} is VALID [2022-02-20 19:57:56,916 INFO L290 TraceCheckUtils]: 35: Hoare triple {13452#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {13452#true} is VALID [2022-02-20 19:57:56,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {13452#true} assume !(0 != ~tmp___0~1); {13452#true} is VALID [2022-02-20 19:57:56,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {13452#true} assume true; {13452#true} is VALID [2022-02-20 19:57:56,917 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {13452#true} {13454#(= ~q_write_ev~0 ~q_read_ev~0)} #1552#return; {13454#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:56,917 INFO L272 TraceCheckUtils]: 39: Hoare triple {13454#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {13493#(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:56,918 INFO L290 TraceCheckUtils]: 40: Hoare triple {13493#(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); {13507#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:57:56,918 INFO L290 TraceCheckUtils]: 41: Hoare triple {13507#(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; {13508#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:56,919 INFO L290 TraceCheckUtils]: 42: Hoare triple {13508#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {13508#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:56,919 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {13508#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {13454#(= ~q_write_ev~0 ~q_read_ev~0)} #1554#return; {13453#false} is VALID [2022-02-20 19:57:56,919 INFO L290 TraceCheckUtils]: 44: Hoare triple {13453#false} assume !false; {13453#false} is VALID [2022-02-20 19:57:56,919 INFO L290 TraceCheckUtils]: 45: Hoare triple {13453#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; {13453#false} is VALID [2022-02-20 19:57:56,919 INFO L290 TraceCheckUtils]: 46: Hoare triple {13453#false} assume !false; {13453#false} is VALID [2022-02-20 19:57:56,920 INFO L272 TraceCheckUtils]: 47: Hoare triple {13453#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {13452#true} is VALID [2022-02-20 19:57:56,920 INFO L290 TraceCheckUtils]: 48: Hoare triple {13452#true} havoc ~__retres1~2; {13452#true} is VALID [2022-02-20 19:57:56,920 INFO L290 TraceCheckUtils]: 49: Hoare triple {13452#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {13452#true} is VALID [2022-02-20 19:57:56,920 INFO L290 TraceCheckUtils]: 50: Hoare triple {13452#true} #res := ~__retres1~2; {13452#true} is VALID [2022-02-20 19:57:56,920 INFO L290 TraceCheckUtils]: 51: Hoare triple {13452#true} assume true; {13452#true} is VALID [2022-02-20 19:57:56,920 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13452#true} {13453#false} #1556#return; {13453#false} is VALID [2022-02-20 19:57:56,920 INFO L290 TraceCheckUtils]: 53: Hoare triple {13453#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; {13453#false} is VALID [2022-02-20 19:57:56,921 INFO L290 TraceCheckUtils]: 54: Hoare triple {13453#false} assume 0 != eval1_~tmp___1~0#1; {13453#false} is VALID [2022-02-20 19:57:56,921 INFO L290 TraceCheckUtils]: 55: Hoare triple {13453#false} assume !(0 == ~p_dw_st~0); {13453#false} is VALID [2022-02-20 19:57:56,921 INFO L290 TraceCheckUtils]: 56: Hoare triple {13453#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; {13453#false} is VALID [2022-02-20 19:57:56,921 INFO L290 TraceCheckUtils]: 57: Hoare triple {13453#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; {13453#false} is VALID [2022-02-20 19:57:56,921 INFO L290 TraceCheckUtils]: 58: Hoare triple {13453#false} assume 0 == ~c_dr_pc~0; {13453#false} is VALID [2022-02-20 19:57:56,921 INFO L290 TraceCheckUtils]: 59: Hoare triple {13453#false} assume !false; {13453#false} is VALID [2022-02-20 19:57:56,921 INFO L290 TraceCheckUtils]: 60: Hoare triple {13453#false} assume !(1 == ~q_free~0); {13453#false} is VALID [2022-02-20 19:57:56,922 INFO L290 TraceCheckUtils]: 61: Hoare triple {13453#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; {13453#false} is VALID [2022-02-20 19:57:56,922 INFO L290 TraceCheckUtils]: 62: Hoare triple {13453#false} assume !(~p_last_write~0 == ~c_last_read~0); {13453#false} is VALID [2022-02-20 19:57:56,922 INFO L272 TraceCheckUtils]: 63: Hoare triple {13453#false} call error1(); {13453#false} is VALID [2022-02-20 19:57:56,922 INFO L290 TraceCheckUtils]: 64: Hoare triple {13453#false} assume !false; {13453#false} is VALID [2022-02-20 19:57:56,922 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:56,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:56,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347192953] [2022-02-20 19:57:56,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347192953] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:56,924 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:56,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:56,924 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135270414] [2022-02-20 19:57:56,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:56,925 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:56,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:56,926 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:56,965 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:56,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:56,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:56,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:56,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:56,966 INFO L87 Difference]: Start difference. First operand 610 states and 888 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:00,037 INFO L93 Difference]: Finished difference Result 1002 states and 1399 transitions. [2022-02-20 19:58:00,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:00,038 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:00,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 943 transitions. [2022-02-20 19:58:00,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:00,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 943 transitions. [2022-02-20 19:58:00,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 943 transitions. [2022-02-20 19:58:00,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 943 edges. 943 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:00,849 INFO L225 Difference]: With dead ends: 1002 [2022-02-20 19:58:00,849 INFO L226 Difference]: Without dead ends: 717 [2022-02-20 19:58:00,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-02-20 19:58:00,851 INFO L933 BasicCegarLoop]: 615 mSDtfsCounter, 1472 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:00,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1499 Valid, 1785 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:58:00,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-02-20 19:58:00,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 622. [2022-02-20 19:58:00,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:00,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 717 states. Second operand has 622 states, 524 states have (on average 1.4599236641221374) internal successors, (765), 532 states have internal predecessors, (765), 60 states have call successors, (60), 29 states have call predecessors, (60), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) [2022-02-20 19:58:00,883 INFO L74 IsIncluded]: Start isIncluded. First operand 717 states. Second operand has 622 states, 524 states have (on average 1.4599236641221374) internal successors, (765), 532 states have internal predecessors, (765), 60 states have call successors, (60), 29 states have call predecessors, (60), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) [2022-02-20 19:58:00,884 INFO L87 Difference]: Start difference. First operand 717 states. Second operand has 622 states, 524 states have (on average 1.4599236641221374) internal successors, (765), 532 states have internal predecessors, (765), 60 states have call successors, (60), 29 states have call predecessors, (60), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) [2022-02-20 19:58:00,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:00,913 INFO L93 Difference]: Finished difference Result 717 states and 1019 transitions. [2022-02-20 19:58:00,913 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1019 transitions. [2022-02-20 19:58:00,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:00,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:00,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 622 states, 524 states have (on average 1.4599236641221374) internal successors, (765), 532 states have internal predecessors, (765), 60 states have call successors, (60), 29 states have call predecessors, (60), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) Second operand 717 states. [2022-02-20 19:58:00,918 INFO L87 Difference]: Start difference. First operand has 622 states, 524 states have (on average 1.4599236641221374) internal successors, (765), 532 states have internal predecessors, (765), 60 states have call successors, (60), 29 states have call predecessors, (60), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) Second operand 717 states. [2022-02-20 19:58:00,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:00,946 INFO L93 Difference]: Finished difference Result 717 states and 1019 transitions. [2022-02-20 19:58:00,946 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1019 transitions. [2022-02-20 19:58:00,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:00,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:00,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:00,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 524 states have (on average 1.4599236641221374) internal successors, (765), 532 states have internal predecessors, (765), 60 states have call successors, (60), 29 states have call predecessors, (60), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) [2022-02-20 19:58:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 898 transitions. [2022-02-20 19:58:00,977 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 898 transitions. Word has length 65 [2022-02-20 19:58:00,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:00,977 INFO L470 AbstractCegarLoop]: Abstraction has 622 states and 898 transitions. [2022-02-20 19:58:00,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:00,978 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 898 transitions. [2022-02-20 19:58:00,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:00,979 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:00,979 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:00,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:58:00,979 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:00,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:00,980 INFO L85 PathProgramCache]: Analyzing trace with hash 271166434, now seen corresponding path program 1 times [2022-02-20 19:58:00,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:00,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540161709] [2022-02-20 19:58:00,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:00,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {17163#(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); {17123#true} is VALID [2022-02-20 19:58:01,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {17123#true} assume true; {17123#true} is VALID [2022-02-20 19:58:01,037 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17123#true} {17123#true} #1548#return; {17123#true} is VALID [2022-02-20 19:58:01,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {17164#(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); {17123#true} is VALID [2022-02-20 19:58:01,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {17123#true} assume !(0 == ~q_write_ev~0); {17123#true} is VALID [2022-02-20 19:58:01,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {17123#true} assume true; {17123#true} is VALID [2022-02-20 19:58:01,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17123#true} {17128#(= ~p_dw_st~0 0)} #1550#return; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {17123#true} havoc ~__retres1~0; {17123#true} is VALID [2022-02-20 19:58:01,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {17123#true} assume !(1 == ~p_dw_pc~0); {17123#true} is VALID [2022-02-20 19:58:01,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {17123#true} ~__retres1~0 := 0; {17123#true} is VALID [2022-02-20 19:58:01,073 INFO L290 TraceCheckUtils]: 3: Hoare triple {17123#true} #res := ~__retres1~0; {17123#true} is VALID [2022-02-20 19:58:01,073 INFO L290 TraceCheckUtils]: 4: Hoare triple {17123#true} assume true; {17123#true} is VALID [2022-02-20 19:58:01,074 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {17123#true} {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1544#return; {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:01,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {17123#true} havoc ~__retres1~1; {17123#true} is VALID [2022-02-20 19:58:01,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {17123#true} assume !(1 == ~c_dr_pc~0); {17123#true} is VALID [2022-02-20 19:58:01,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {17123#true} ~__retres1~1 := 0; {17123#true} is VALID [2022-02-20 19:58:01,079 INFO L290 TraceCheckUtils]: 3: Hoare triple {17123#true} #res := ~__retres1~1; {17123#true} is VALID [2022-02-20 19:58:01,079 INFO L290 TraceCheckUtils]: 4: Hoare triple {17123#true} assume true; {17123#true} is VALID [2022-02-20 19:58:01,080 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {17123#true} {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1546#return; {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:01,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {17165#(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; {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:01,081 INFO L272 TraceCheckUtils]: 1: Hoare triple {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {17123#true} is VALID [2022-02-20 19:58:01,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {17123#true} havoc ~__retres1~0; {17123#true} is VALID [2022-02-20 19:58:01,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {17123#true} assume !(1 == ~p_dw_pc~0); {17123#true} is VALID [2022-02-20 19:58:01,081 INFO L290 TraceCheckUtils]: 4: Hoare triple {17123#true} ~__retres1~0 := 0; {17123#true} is VALID [2022-02-20 19:58:01,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {17123#true} #res := ~__retres1~0; {17123#true} is VALID [2022-02-20 19:58:01,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {17123#true} assume true; {17123#true} is VALID [2022-02-20 19:58:01,082 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17123#true} {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1544#return; {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:01,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:01,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:01,083 INFO L272 TraceCheckUtils]: 10: Hoare triple {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {17123#true} is VALID [2022-02-20 19:58:01,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {17123#true} havoc ~__retres1~1; {17123#true} is VALID [2022-02-20 19:58:01,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {17123#true} assume !(1 == ~c_dr_pc~0); {17123#true} is VALID [2022-02-20 19:58:01,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {17123#true} ~__retres1~1 := 0; {17123#true} is VALID [2022-02-20 19:58:01,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {17123#true} #res := ~__retres1~1; {17123#true} is VALID [2022-02-20 19:58:01,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {17123#true} assume true; {17123#true} is VALID [2022-02-20 19:58:01,087 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17123#true} {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1546#return; {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:01,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:01,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:01,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:01,089 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {17128#(= ~p_dw_st~0 0)} #1552#return; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {17164#(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); {17123#true} is VALID [2022-02-20 19:58:01,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {17123#true} assume !(1 == ~q_write_ev~0); {17123#true} is VALID [2022-02-20 19:58:01,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {17123#true} assume true; {17123#true} is VALID [2022-02-20 19:58:01,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17123#true} {17128#(= ~p_dw_st~0 0)} #1554#return; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {17123#true} havoc ~__retres1~2; {17123#true} is VALID [2022-02-20 19:58:01,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {17123#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {17128#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,101 INFO L290 TraceCheckUtils]: 3: Hoare triple {17128#(= ~p_dw_st~0 0)} assume true; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,101 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17128#(= ~p_dw_st~0 0)} {17128#(= ~p_dw_st~0 0)} #1556#return; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {17123#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {17123#true} is VALID [2022-02-20 19:58:01,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {17123#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1;assume -2147483648 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 2147483647; {17123#true} is VALID [2022-02-20 19:58:01,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {17123#true} assume 0 != main_#t~nondet44#1;havoc main_#t~nondet44#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; {17123#true} is VALID [2022-02-20 19:58:01,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {17123#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; {17123#true} is VALID [2022-02-20 19:58:01,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {17123#true} call update_channels1(); {17163#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:01,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {17163#(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); {17123#true} is VALID [2022-02-20 19:58:01,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {17123#true} assume true; {17123#true} is VALID [2022-02-20 19:58:01,102 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17123#true} {17123#true} #1548#return; {17123#true} is VALID [2022-02-20 19:58:01,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {17123#true} assume { :begin_inline_init_threads1 } true; {17123#true} is VALID [2022-02-20 19:58:01,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {17123#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {17128#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {17128#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,107 INFO L272 TraceCheckUtils]: 12: Hoare triple {17128#(= ~p_dw_st~0 0)} call fire_delta_events1(); {17164#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:01,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {17164#(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); {17123#true} is VALID [2022-02-20 19:58:01,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {17123#true} assume !(0 == ~q_write_ev~0); {17123#true} is VALID [2022-02-20 19:58:01,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {17123#true} assume true; {17123#true} is VALID [2022-02-20 19:58:01,107 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17123#true} {17128#(= ~p_dw_st~0 0)} #1550#return; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,108 INFO L272 TraceCheckUtils]: 17: Hoare triple {17128#(= ~p_dw_st~0 0)} call activate_threads1(); {17165#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:01,108 INFO L290 TraceCheckUtils]: 18: Hoare triple {17165#(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; {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:01,108 INFO L272 TraceCheckUtils]: 19: Hoare triple {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {17123#true} is VALID [2022-02-20 19:58:01,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {17123#true} havoc ~__retres1~0; {17123#true} is VALID [2022-02-20 19:58:01,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {17123#true} assume !(1 == ~p_dw_pc~0); {17123#true} is VALID [2022-02-20 19:58:01,108 INFO L290 TraceCheckUtils]: 22: Hoare triple {17123#true} ~__retres1~0 := 0; {17123#true} is VALID [2022-02-20 19:58:01,108 INFO L290 TraceCheckUtils]: 23: Hoare triple {17123#true} #res := ~__retres1~0; {17123#true} is VALID [2022-02-20 19:58:01,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {17123#true} assume true; {17123#true} is VALID [2022-02-20 19:58:01,109 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {17123#true} {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1544#return; {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:01,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:01,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:01,110 INFO L272 TraceCheckUtils]: 28: Hoare triple {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {17123#true} is VALID [2022-02-20 19:58:01,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {17123#true} havoc ~__retres1~1; {17123#true} is VALID [2022-02-20 19:58:01,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {17123#true} assume !(1 == ~c_dr_pc~0); {17123#true} is VALID [2022-02-20 19:58:01,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {17123#true} ~__retres1~1 := 0; {17123#true} is VALID [2022-02-20 19:58:01,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {17123#true} #res := ~__retres1~1; {17123#true} is VALID [2022-02-20 19:58:01,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {17123#true} assume true; {17123#true} is VALID [2022-02-20 19:58:01,110 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17123#true} {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1546#return; {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:01,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:01,111 INFO L290 TraceCheckUtils]: 36: Hoare triple {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:01,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:01,112 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {17166#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {17128#(= ~p_dw_st~0 0)} #1552#return; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,114 INFO L272 TraceCheckUtils]: 39: Hoare triple {17128#(= ~p_dw_st~0 0)} call reset_delta_events1(); {17164#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:01,114 INFO L290 TraceCheckUtils]: 40: Hoare triple {17164#(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); {17123#true} is VALID [2022-02-20 19:58:01,114 INFO L290 TraceCheckUtils]: 41: Hoare triple {17123#true} assume !(1 == ~q_write_ev~0); {17123#true} is VALID [2022-02-20 19:58:01,114 INFO L290 TraceCheckUtils]: 42: Hoare triple {17123#true} assume true; {17123#true} is VALID [2022-02-20 19:58:01,115 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {17123#true} {17128#(= ~p_dw_st~0 0)} #1554#return; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,115 INFO L290 TraceCheckUtils]: 44: Hoare triple {17128#(= ~p_dw_st~0 0)} assume !false; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,115 INFO L290 TraceCheckUtils]: 45: Hoare triple {17128#(= ~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; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,116 INFO L290 TraceCheckUtils]: 46: Hoare triple {17128#(= ~p_dw_st~0 0)} assume !false; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,116 INFO L272 TraceCheckUtils]: 47: Hoare triple {17128#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {17123#true} is VALID [2022-02-20 19:58:01,116 INFO L290 TraceCheckUtils]: 48: Hoare triple {17123#true} havoc ~__retres1~2; {17123#true} is VALID [2022-02-20 19:58:01,117 INFO L290 TraceCheckUtils]: 49: Hoare triple {17123#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,117 INFO L290 TraceCheckUtils]: 50: Hoare triple {17128#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,117 INFO L290 TraceCheckUtils]: 51: Hoare triple {17128#(= ~p_dw_st~0 0)} assume true; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,118 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17128#(= ~p_dw_st~0 0)} {17128#(= ~p_dw_st~0 0)} #1556#return; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,118 INFO L290 TraceCheckUtils]: 53: Hoare triple {17128#(= ~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; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,118 INFO L290 TraceCheckUtils]: 54: Hoare triple {17128#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {17128#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:01,119 INFO L290 TraceCheckUtils]: 55: Hoare triple {17128#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {17124#false} is VALID [2022-02-20 19:58:01,119 INFO L290 TraceCheckUtils]: 56: Hoare triple {17124#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; {17124#false} is VALID [2022-02-20 19:58:01,119 INFO L290 TraceCheckUtils]: 57: Hoare triple {17124#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; {17124#false} is VALID [2022-02-20 19:58:01,119 INFO L290 TraceCheckUtils]: 58: Hoare triple {17124#false} assume 0 == ~c_dr_pc~0; {17124#false} is VALID [2022-02-20 19:58:01,119 INFO L290 TraceCheckUtils]: 59: Hoare triple {17124#false} assume !false; {17124#false} is VALID [2022-02-20 19:58:01,119 INFO L290 TraceCheckUtils]: 60: Hoare triple {17124#false} assume !(1 == ~q_free~0); {17124#false} is VALID [2022-02-20 19:58:01,119 INFO L290 TraceCheckUtils]: 61: Hoare triple {17124#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; {17124#false} is VALID [2022-02-20 19:58:01,120 INFO L290 TraceCheckUtils]: 62: Hoare triple {17124#false} assume !(~p_last_write~0 == ~c_last_read~0); {17124#false} is VALID [2022-02-20 19:58:01,120 INFO L272 TraceCheckUtils]: 63: Hoare triple {17124#false} call error1(); {17124#false} is VALID [2022-02-20 19:58:01,120 INFO L290 TraceCheckUtils]: 64: Hoare triple {17124#false} assume !false; {17124#false} is VALID [2022-02-20 19:58:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:01,121 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:01,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540161709] [2022-02-20 19:58:01,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540161709] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:01,122 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:01,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:01,122 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847953339] [2022-02-20 19:58:01,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:01,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:01,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:01,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:01,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:01,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:01,165 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:01,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:01,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:01,166 INFO L87 Difference]: Start difference. First operand 622 states and 898 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:02,917 INFO L93 Difference]: Finished difference Result 1264 states and 1745 transitions. [2022-02-20 19:58:02,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:02,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:58:02,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:02,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 886 transitions. [2022-02-20 19:58:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 886 transitions. [2022-02-20 19:58:02,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 886 transitions. [2022-02-20 19:58:03,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 886 edges. 886 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:03,593 INFO L225 Difference]: With dead ends: 1264 [2022-02-20 19:58:03,593 INFO L226 Difference]: Without dead ends: 968 [2022-02-20 19:58:03,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:58:03,595 INFO L933 BasicCegarLoop]: 573 mSDtfsCounter, 1754 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1784 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:03,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1784 Valid, 1168 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:58:03,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2022-02-20 19:58:03,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 912. [2022-02-20 19:58:03,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:03,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 968 states. Second operand has 912 states, 748 states have (on average 1.4064171122994653) internal successors, (1052), 763 states have internal predecessors, (1052), 95 states have call successors, (95), 51 states have call predecessors, (95), 67 states have return successors, (130), 104 states have call predecessors, (130), 93 states have call successors, (130) [2022-02-20 19:58:03,698 INFO L74 IsIncluded]: Start isIncluded. First operand 968 states. Second operand has 912 states, 748 states have (on average 1.4064171122994653) internal successors, (1052), 763 states have internal predecessors, (1052), 95 states have call successors, (95), 51 states have call predecessors, (95), 67 states have return successors, (130), 104 states have call predecessors, (130), 93 states have call successors, (130) [2022-02-20 19:58:03,700 INFO L87 Difference]: Start difference. First operand 968 states. Second operand has 912 states, 748 states have (on average 1.4064171122994653) internal successors, (1052), 763 states have internal predecessors, (1052), 95 states have call successors, (95), 51 states have call predecessors, (95), 67 states have return successors, (130), 104 states have call predecessors, (130), 93 states have call successors, (130) [2022-02-20 19:58:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:03,746 INFO L93 Difference]: Finished difference Result 968 states and 1351 transitions. [2022-02-20 19:58:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1351 transitions. [2022-02-20 19:58:03,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:03,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:03,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 912 states, 748 states have (on average 1.4064171122994653) internal successors, (1052), 763 states have internal predecessors, (1052), 95 states have call successors, (95), 51 states have call predecessors, (95), 67 states have return successors, (130), 104 states have call predecessors, (130), 93 states have call successors, (130) Second operand 968 states. [2022-02-20 19:58:03,766 INFO L87 Difference]: Start difference. First operand has 912 states, 748 states have (on average 1.4064171122994653) internal successors, (1052), 763 states have internal predecessors, (1052), 95 states have call successors, (95), 51 states have call predecessors, (95), 67 states have return successors, (130), 104 states have call predecessors, (130), 93 states have call successors, (130) Second operand 968 states. [2022-02-20 19:58:03,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:03,814 INFO L93 Difference]: Finished difference Result 968 states and 1351 transitions. [2022-02-20 19:58:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1351 transitions. [2022-02-20 19:58:03,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:03,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:03,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:03,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:03,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 748 states have (on average 1.4064171122994653) internal successors, (1052), 763 states have internal predecessors, (1052), 95 states have call successors, (95), 51 states have call predecessors, (95), 67 states have return successors, (130), 104 states have call predecessors, (130), 93 states have call successors, (130) [2022-02-20 19:58:03,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1277 transitions. [2022-02-20 19:58:03,869 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1277 transitions. Word has length 65 [2022-02-20 19:58:03,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:03,870 INFO L470 AbstractCegarLoop]: Abstraction has 912 states and 1277 transitions. [2022-02-20 19:58:03,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1277 transitions. [2022-02-20 19:58:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:58:03,872 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:03,872 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:03,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:58:03,872 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:03,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:03,873 INFO L85 PathProgramCache]: Analyzing trace with hash 498977079, now seen corresponding path program 1 times [2022-02-20 19:58:03,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:03,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042221524] [2022-02-20 19:58:03,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:03,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {22080#(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); {22040#true} is VALID [2022-02-20 19:58:03,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {22040#true} assume true; {22040#true} is VALID [2022-02-20 19:58:03,927 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22040#true} {22042#(= ~q_free~0 1)} #1548#return; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:03,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {22081#(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); {22040#true} is VALID [2022-02-20 19:58:03,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {22040#true} assume !(0 == ~q_write_ev~0); {22040#true} is VALID [2022-02-20 19:58:03,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {22040#true} assume true; {22040#true} is VALID [2022-02-20 19:58:03,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22040#true} {22042#(= ~q_free~0 1)} #1550#return; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:03,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {22040#true} havoc ~__retres1~0; {22040#true} is VALID [2022-02-20 19:58:03,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {22040#true} assume !(1 == ~p_dw_pc~0); {22040#true} is VALID [2022-02-20 19:58:03,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {22040#true} ~__retres1~0 := 0; {22040#true} is VALID [2022-02-20 19:58:03,954 INFO L290 TraceCheckUtils]: 3: Hoare triple {22040#true} #res := ~__retres1~0; {22040#true} is VALID [2022-02-20 19:58:03,954 INFO L290 TraceCheckUtils]: 4: Hoare triple {22040#true} assume true; {22040#true} is VALID [2022-02-20 19:58:03,955 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22040#true} {22040#true} #1544#return; {22040#true} is VALID [2022-02-20 19:58:03,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {22040#true} havoc ~__retres1~1; {22040#true} is VALID [2022-02-20 19:58:03,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {22040#true} assume !(1 == ~c_dr_pc~0); {22040#true} is VALID [2022-02-20 19:58:03,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {22040#true} ~__retres1~1 := 0; {22040#true} is VALID [2022-02-20 19:58:03,959 INFO L290 TraceCheckUtils]: 3: Hoare triple {22040#true} #res := ~__retres1~1; {22040#true} is VALID [2022-02-20 19:58:03,959 INFO L290 TraceCheckUtils]: 4: Hoare triple {22040#true} assume true; {22040#true} is VALID [2022-02-20 19:58:03,959 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22040#true} {22040#true} #1546#return; {22040#true} is VALID [2022-02-20 19:58:03,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {22082#(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; {22040#true} is VALID [2022-02-20 19:58:03,959 INFO L272 TraceCheckUtils]: 1: Hoare triple {22040#true} call #t~ret8 := is_do_write_p_triggered(); {22040#true} is VALID [2022-02-20 19:58:03,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {22040#true} havoc ~__retres1~0; {22040#true} is VALID [2022-02-20 19:58:03,961 INFO L290 TraceCheckUtils]: 3: Hoare triple {22040#true} assume !(1 == ~p_dw_pc~0); {22040#true} is VALID [2022-02-20 19:58:03,961 INFO L290 TraceCheckUtils]: 4: Hoare triple {22040#true} ~__retres1~0 := 0; {22040#true} is VALID [2022-02-20 19:58:03,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {22040#true} #res := ~__retres1~0; {22040#true} is VALID [2022-02-20 19:58:03,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {22040#true} assume true; {22040#true} is VALID [2022-02-20 19:58:03,961 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22040#true} {22040#true} #1544#return; {22040#true} is VALID [2022-02-20 19:58:03,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {22040#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22040#true} is VALID [2022-02-20 19:58:03,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {22040#true} assume !(0 != ~tmp~1); {22040#true} is VALID [2022-02-20 19:58:03,962 INFO L272 TraceCheckUtils]: 10: Hoare triple {22040#true} call #t~ret9 := is_do_read_c_triggered(); {22040#true} is VALID [2022-02-20 19:58:03,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {22040#true} havoc ~__retres1~1; {22040#true} is VALID [2022-02-20 19:58:03,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {22040#true} assume !(1 == ~c_dr_pc~0); {22040#true} is VALID [2022-02-20 19:58:03,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {22040#true} ~__retres1~1 := 0; {22040#true} is VALID [2022-02-20 19:58:03,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {22040#true} #res := ~__retres1~1; {22040#true} is VALID [2022-02-20 19:58:03,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {22040#true} assume true; {22040#true} is VALID [2022-02-20 19:58:03,962 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22040#true} {22040#true} #1546#return; {22040#true} is VALID [2022-02-20 19:58:03,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {22040#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22040#true} is VALID [2022-02-20 19:58:03,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {22040#true} assume !(0 != ~tmp___0~1); {22040#true} is VALID [2022-02-20 19:58:03,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {22040#true} assume true; {22040#true} is VALID [2022-02-20 19:58:03,963 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {22040#true} {22042#(= ~q_free~0 1)} #1552#return; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:03,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {22081#(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); {22040#true} is VALID [2022-02-20 19:58:03,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {22040#true} assume !(1 == ~q_write_ev~0); {22040#true} is VALID [2022-02-20 19:58:03,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {22040#true} assume true; {22040#true} is VALID [2022-02-20 19:58:03,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22040#true} {22042#(= ~q_free~0 1)} #1554#return; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:03,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:03,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {22040#true} havoc ~__retres1~2; {22040#true} is VALID [2022-02-20 19:58:03,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {22040#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22040#true} is VALID [2022-02-20 19:58:03,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {22040#true} #res := ~__retres1~2; {22040#true} is VALID [2022-02-20 19:58:03,993 INFO L290 TraceCheckUtils]: 3: Hoare triple {22040#true} assume true; {22040#true} is VALID [2022-02-20 19:58:03,993 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22040#true} {22042#(= ~q_free~0 1)} #1556#return; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:03,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {22040#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {22040#true} is VALID [2022-02-20 19:58:03,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {22040#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1;assume -2147483648 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 2147483647; {22040#true} is VALID [2022-02-20 19:58:03,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {22040#true} assume 0 != main_#t~nondet44#1;havoc main_#t~nondet44#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; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:03,994 INFO L290 TraceCheckUtils]: 3: Hoare triple {22042#(= ~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; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:03,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {22042#(= ~q_free~0 1)} call update_channels1(); {22080#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:03,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {22080#(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); {22040#true} is VALID [2022-02-20 19:58:03,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {22040#true} assume true; {22040#true} is VALID [2022-02-20 19:58:03,996 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22040#true} {22042#(= ~q_free~0 1)} #1548#return; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:03,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {22042#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:03,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {22042#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:03,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {22042#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:03,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {22042#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:03,997 INFO L272 TraceCheckUtils]: 12: Hoare triple {22042#(= ~q_free~0 1)} call fire_delta_events1(); {22081#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:03,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {22081#(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); {22040#true} is VALID [2022-02-20 19:58:03,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {22040#true} assume !(0 == ~q_write_ev~0); {22040#true} is VALID [2022-02-20 19:58:03,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {22040#true} assume true; {22040#true} is VALID [2022-02-20 19:58:03,998 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22040#true} {22042#(= ~q_free~0 1)} #1550#return; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:03,999 INFO L272 TraceCheckUtils]: 17: Hoare triple {22042#(= ~q_free~0 1)} call activate_threads1(); {22082#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:03,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {22082#(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; {22040#true} is VALID [2022-02-20 19:58:03,999 INFO L272 TraceCheckUtils]: 19: Hoare triple {22040#true} call #t~ret8 := is_do_write_p_triggered(); {22040#true} is VALID [2022-02-20 19:58:03,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {22040#true} havoc ~__retres1~0; {22040#true} is VALID [2022-02-20 19:58:03,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {22040#true} assume !(1 == ~p_dw_pc~0); {22040#true} is VALID [2022-02-20 19:58:03,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {22040#true} ~__retres1~0 := 0; {22040#true} is VALID [2022-02-20 19:58:04,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {22040#true} #res := ~__retres1~0; {22040#true} is VALID [2022-02-20 19:58:04,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {22040#true} assume true; {22040#true} is VALID [2022-02-20 19:58:04,000 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22040#true} {22040#true} #1544#return; {22040#true} is VALID [2022-02-20 19:58:04,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {22040#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22040#true} is VALID [2022-02-20 19:58:04,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {22040#true} assume !(0 != ~tmp~1); {22040#true} is VALID [2022-02-20 19:58:04,000 INFO L272 TraceCheckUtils]: 28: Hoare triple {22040#true} call #t~ret9 := is_do_read_c_triggered(); {22040#true} is VALID [2022-02-20 19:58:04,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {22040#true} havoc ~__retres1~1; {22040#true} is VALID [2022-02-20 19:58:04,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {22040#true} assume !(1 == ~c_dr_pc~0); {22040#true} is VALID [2022-02-20 19:58:04,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {22040#true} ~__retres1~1 := 0; {22040#true} is VALID [2022-02-20 19:58:04,001 INFO L290 TraceCheckUtils]: 32: Hoare triple {22040#true} #res := ~__retres1~1; {22040#true} is VALID [2022-02-20 19:58:04,002 INFO L290 TraceCheckUtils]: 33: Hoare triple {22040#true} assume true; {22040#true} is VALID [2022-02-20 19:58:04,002 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {22040#true} {22040#true} #1546#return; {22040#true} is VALID [2022-02-20 19:58:04,002 INFO L290 TraceCheckUtils]: 35: Hoare triple {22040#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22040#true} is VALID [2022-02-20 19:58:04,002 INFO L290 TraceCheckUtils]: 36: Hoare triple {22040#true} assume !(0 != ~tmp___0~1); {22040#true} is VALID [2022-02-20 19:58:04,002 INFO L290 TraceCheckUtils]: 37: Hoare triple {22040#true} assume true; {22040#true} is VALID [2022-02-20 19:58:04,003 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22040#true} {22042#(= ~q_free~0 1)} #1552#return; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:04,003 INFO L272 TraceCheckUtils]: 39: Hoare triple {22042#(= ~q_free~0 1)} call reset_delta_events1(); {22081#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:04,003 INFO L290 TraceCheckUtils]: 40: Hoare triple {22081#(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); {22040#true} is VALID [2022-02-20 19:58:04,003 INFO L290 TraceCheckUtils]: 41: Hoare triple {22040#true} assume !(1 == ~q_write_ev~0); {22040#true} is VALID [2022-02-20 19:58:04,003 INFO L290 TraceCheckUtils]: 42: Hoare triple {22040#true} assume true; {22040#true} is VALID [2022-02-20 19:58:04,004 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {22040#true} {22042#(= ~q_free~0 1)} #1554#return; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:04,004 INFO L290 TraceCheckUtils]: 44: Hoare triple {22042#(= ~q_free~0 1)} assume !false; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:04,004 INFO L290 TraceCheckUtils]: 45: Hoare triple {22042#(= ~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; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:04,005 INFO L290 TraceCheckUtils]: 46: Hoare triple {22042#(= ~q_free~0 1)} assume !false; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:04,005 INFO L272 TraceCheckUtils]: 47: Hoare triple {22042#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {22040#true} is VALID [2022-02-20 19:58:04,005 INFO L290 TraceCheckUtils]: 48: Hoare triple {22040#true} havoc ~__retres1~2; {22040#true} is VALID [2022-02-20 19:58:04,005 INFO L290 TraceCheckUtils]: 49: Hoare triple {22040#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22040#true} is VALID [2022-02-20 19:58:04,005 INFO L290 TraceCheckUtils]: 50: Hoare triple {22040#true} #res := ~__retres1~2; {22040#true} is VALID [2022-02-20 19:58:04,006 INFO L290 TraceCheckUtils]: 51: Hoare triple {22040#true} assume true; {22040#true} is VALID [2022-02-20 19:58:04,006 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {22040#true} {22042#(= ~q_free~0 1)} #1556#return; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:04,006 INFO L290 TraceCheckUtils]: 53: Hoare triple {22042#(= ~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; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:04,007 INFO L290 TraceCheckUtils]: 54: Hoare triple {22042#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:04,007 INFO L290 TraceCheckUtils]: 55: Hoare triple {22042#(= ~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; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:04,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {22042#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:04,008 INFO L290 TraceCheckUtils]: 57: Hoare triple {22042#(= ~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; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:04,008 INFO L290 TraceCheckUtils]: 58: Hoare triple {22042#(= ~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; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:04,008 INFO L290 TraceCheckUtils]: 59: Hoare triple {22042#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:04,009 INFO L290 TraceCheckUtils]: 60: Hoare triple {22042#(= ~q_free~0 1)} assume !false; {22042#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:04,009 INFO L290 TraceCheckUtils]: 61: Hoare triple {22042#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {22041#false} is VALID [2022-02-20 19:58:04,009 INFO L290 TraceCheckUtils]: 62: Hoare triple {22041#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; {22041#false} is VALID [2022-02-20 19:58:04,013 INFO L290 TraceCheckUtils]: 63: Hoare triple {22041#false} assume !(~p_last_write~0 == ~c_last_read~0); {22041#false} is VALID [2022-02-20 19:58:04,016 INFO L272 TraceCheckUtils]: 64: Hoare triple {22041#false} call error1(); {22041#false} is VALID [2022-02-20 19:58:04,016 INFO L290 TraceCheckUtils]: 65: Hoare triple {22041#false} assume !false; {22041#false} is VALID [2022-02-20 19:58:04,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:04,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:04,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042221524] [2022-02-20 19:58:04,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042221524] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:04,017 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:04,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:04,018 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289725794] [2022-02-20 19:58:04,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:04,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:04,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:04,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:04,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:04,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:04,067 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:04,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:04,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:04,068 INFO L87 Difference]: Start difference. First operand 912 states and 1277 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:05,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:05,927 INFO L93 Difference]: Finished difference Result 2115 states and 2848 transitions. [2022-02-20 19:58:05,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:05,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:05,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 884 transitions. [2022-02-20 19:58:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:05,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 884 transitions. [2022-02-20 19:58:05,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 884 transitions. [2022-02-20 19:58:06,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 884 edges. 884 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:06,641 INFO L225 Difference]: With dead ends: 2115 [2022-02-20 19:58:06,641 INFO L226 Difference]: Without dead ends: 1508 [2022-02-20 19:58:06,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:58:06,643 INFO L933 BasicCegarLoop]: 593 mSDtfsCounter, 710 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:06,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [718 Valid, 1669 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:58:06,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2022-02-20 19:58:06,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1393. [2022-02-20 19:58:06,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:06,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1508 states. Second operand has 1393 states, 1127 states have (on average 1.360248447204969) internal successors, (1533), 1145 states have internal predecessors, (1533), 140 states have call successors, (140), 95 states have call predecessors, (140), 124 states have return successors, (202), 159 states have call predecessors, (202), 138 states have call successors, (202) [2022-02-20 19:58:06,733 INFO L74 IsIncluded]: Start isIncluded. First operand 1508 states. Second operand has 1393 states, 1127 states have (on average 1.360248447204969) internal successors, (1533), 1145 states have internal predecessors, (1533), 140 states have call successors, (140), 95 states have call predecessors, (140), 124 states have return successors, (202), 159 states have call predecessors, (202), 138 states have call successors, (202) [2022-02-20 19:58:06,734 INFO L87 Difference]: Start difference. First operand 1508 states. Second operand has 1393 states, 1127 states have (on average 1.360248447204969) internal successors, (1533), 1145 states have internal predecessors, (1533), 140 states have call successors, (140), 95 states have call predecessors, (140), 124 states have return successors, (202), 159 states have call predecessors, (202), 138 states have call successors, (202) [2022-02-20 19:58:06,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:06,832 INFO L93 Difference]: Finished difference Result 1508 states and 2010 transitions. [2022-02-20 19:58:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2010 transitions. [2022-02-20 19:58:06,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:06,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:06,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 1393 states, 1127 states have (on average 1.360248447204969) internal successors, (1533), 1145 states have internal predecessors, (1533), 140 states have call successors, (140), 95 states have call predecessors, (140), 124 states have return successors, (202), 159 states have call predecessors, (202), 138 states have call successors, (202) Second operand 1508 states. [2022-02-20 19:58:06,839 INFO L87 Difference]: Start difference. First operand has 1393 states, 1127 states have (on average 1.360248447204969) internal successors, (1533), 1145 states have internal predecessors, (1533), 140 states have call successors, (140), 95 states have call predecessors, (140), 124 states have return successors, (202), 159 states have call predecessors, (202), 138 states have call successors, (202) Second operand 1508 states. [2022-02-20 19:58:06,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:06,938 INFO L93 Difference]: Finished difference Result 1508 states and 2010 transitions. [2022-02-20 19:58:06,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2010 transitions. [2022-02-20 19:58:06,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:06,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:06,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:06,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1127 states have (on average 1.360248447204969) internal successors, (1533), 1145 states have internal predecessors, (1533), 140 states have call successors, (140), 95 states have call predecessors, (140), 124 states have return successors, (202), 159 states have call predecessors, (202), 138 states have call successors, (202) [2022-02-20 19:58:07,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1875 transitions. [2022-02-20 19:58:07,037 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1875 transitions. Word has length 66 [2022-02-20 19:58:07,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:07,038 INFO L470 AbstractCegarLoop]: Abstraction has 1393 states and 1875 transitions. [2022-02-20 19:58:07,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:07,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1875 transitions. [2022-02-20 19:58:07,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:58:07,040 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:07,040 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:07,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:58:07,040 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:07,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:07,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1957216738, now seen corresponding path program 1 times [2022-02-20 19:58:07,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:07,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599309433] [2022-02-20 19:58:07,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:07,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:07,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:07,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {29838#(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); {29798#true} is VALID [2022-02-20 19:58:07,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {29798#true} assume true; {29798#true} is VALID [2022-02-20 19:58:07,079 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29798#true} {29800#(= ~c_dr_pc~0 0)} #1548#return; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:07,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {29839#(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); {29798#true} is VALID [2022-02-20 19:58:07,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {29798#true} assume !(0 == ~q_write_ev~0); {29798#true} is VALID [2022-02-20 19:58:07,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {29798#true} assume true; {29798#true} is VALID [2022-02-20 19:58:07,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29798#true} {29800#(= ~c_dr_pc~0 0)} #1550#return; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:07,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:07,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {29798#true} havoc ~__retres1~0; {29798#true} is VALID [2022-02-20 19:58:07,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {29798#true} assume !(1 == ~p_dw_pc~0); {29798#true} is VALID [2022-02-20 19:58:07,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {29798#true} ~__retres1~0 := 0; {29798#true} is VALID [2022-02-20 19:58:07,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {29798#true} #res := ~__retres1~0; {29798#true} is VALID [2022-02-20 19:58:07,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {29798#true} assume true; {29798#true} is VALID [2022-02-20 19:58:07,100 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {29798#true} {29798#true} #1544#return; {29798#true} is VALID [2022-02-20 19:58:07,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:07,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {29798#true} havoc ~__retres1~1; {29798#true} is VALID [2022-02-20 19:58:07,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {29798#true} assume !(1 == ~c_dr_pc~0); {29798#true} is VALID [2022-02-20 19:58:07,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {29798#true} ~__retres1~1 := 0; {29798#true} is VALID [2022-02-20 19:58:07,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {29798#true} #res := ~__retres1~1; {29798#true} is VALID [2022-02-20 19:58:07,106 INFO L290 TraceCheckUtils]: 4: Hoare triple {29798#true} assume true; {29798#true} is VALID [2022-02-20 19:58:07,106 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {29798#true} {29798#true} #1546#return; {29798#true} is VALID [2022-02-20 19:58:07,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {29840#(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; {29798#true} is VALID [2022-02-20 19:58:07,106 INFO L272 TraceCheckUtils]: 1: Hoare triple {29798#true} call #t~ret8 := is_do_write_p_triggered(); {29798#true} is VALID [2022-02-20 19:58:07,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {29798#true} havoc ~__retres1~0; {29798#true} is VALID [2022-02-20 19:58:07,106 INFO L290 TraceCheckUtils]: 3: Hoare triple {29798#true} assume !(1 == ~p_dw_pc~0); {29798#true} is VALID [2022-02-20 19:58:07,106 INFO L290 TraceCheckUtils]: 4: Hoare triple {29798#true} ~__retres1~0 := 0; {29798#true} is VALID [2022-02-20 19:58:07,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {29798#true} #res := ~__retres1~0; {29798#true} is VALID [2022-02-20 19:58:07,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {29798#true} assume true; {29798#true} is VALID [2022-02-20 19:58:07,107 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29798#true} {29798#true} #1544#return; {29798#true} is VALID [2022-02-20 19:58:07,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {29798#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {29798#true} is VALID [2022-02-20 19:58:07,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {29798#true} assume !(0 != ~tmp~1); {29798#true} is VALID [2022-02-20 19:58:07,107 INFO L272 TraceCheckUtils]: 10: Hoare triple {29798#true} call #t~ret9 := is_do_read_c_triggered(); {29798#true} is VALID [2022-02-20 19:58:07,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {29798#true} havoc ~__retres1~1; {29798#true} is VALID [2022-02-20 19:58:07,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {29798#true} assume !(1 == ~c_dr_pc~0); {29798#true} is VALID [2022-02-20 19:58:07,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {29798#true} ~__retres1~1 := 0; {29798#true} is VALID [2022-02-20 19:58:07,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {29798#true} #res := ~__retres1~1; {29798#true} is VALID [2022-02-20 19:58:07,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {29798#true} assume true; {29798#true} is VALID [2022-02-20 19:58:07,108 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {29798#true} {29798#true} #1546#return; {29798#true} is VALID [2022-02-20 19:58:07,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {29798#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {29798#true} is VALID [2022-02-20 19:58:07,108 INFO L290 TraceCheckUtils]: 18: Hoare triple {29798#true} assume !(0 != ~tmp___0~1); {29798#true} is VALID [2022-02-20 19:58:07,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {29798#true} assume true; {29798#true} is VALID [2022-02-20 19:58:07,109 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {29798#true} {29800#(= ~c_dr_pc~0 0)} #1552#return; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:07,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {29839#(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); {29798#true} is VALID [2022-02-20 19:58:07,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {29798#true} assume !(1 == ~q_write_ev~0); {29798#true} is VALID [2022-02-20 19:58:07,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {29798#true} assume true; {29798#true} is VALID [2022-02-20 19:58:07,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29798#true} {29800#(= ~c_dr_pc~0 0)} #1554#return; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:07,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {29798#true} havoc ~__retres1~2; {29798#true} is VALID [2022-02-20 19:58:07,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {29798#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {29798#true} is VALID [2022-02-20 19:58:07,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {29798#true} #res := ~__retres1~2; {29798#true} is VALID [2022-02-20 19:58:07,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {29798#true} assume true; {29798#true} is VALID [2022-02-20 19:58:07,119 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {29798#true} {29800#(= ~c_dr_pc~0 0)} #1556#return; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {29798#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {29798#true} is VALID [2022-02-20 19:58:07,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {29798#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1;assume -2147483648 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 2147483647; {29798#true} is VALID [2022-02-20 19:58:07,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {29798#true} assume 0 != main_#t~nondet44#1;havoc main_#t~nondet44#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; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,120 INFO L290 TraceCheckUtils]: 3: Hoare triple {29800#(= ~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; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {29800#(= ~c_dr_pc~0 0)} call update_channels1(); {29838#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:07,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {29838#(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); {29798#true} is VALID [2022-02-20 19:58:07,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {29798#true} assume true; {29798#true} is VALID [2022-02-20 19:58:07,121 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29798#true} {29800#(= ~c_dr_pc~0 0)} #1548#return; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {29800#(= ~c_dr_pc~0 0)} assume { :begin_inline_init_threads1 } true; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {29800#(= ~c_dr_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {29800#(= ~c_dr_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {29800#(= ~c_dr_pc~0 0)} assume { :end_inline_init_threads1 } true; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,122 INFO L272 TraceCheckUtils]: 12: Hoare triple {29800#(= ~c_dr_pc~0 0)} call fire_delta_events1(); {29839#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:07,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {29839#(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); {29798#true} is VALID [2022-02-20 19:58:07,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {29798#true} assume !(0 == ~q_write_ev~0); {29798#true} is VALID [2022-02-20 19:58:07,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {29798#true} assume true; {29798#true} is VALID [2022-02-20 19:58:07,123 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {29798#true} {29800#(= ~c_dr_pc~0 0)} #1550#return; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,124 INFO L272 TraceCheckUtils]: 17: Hoare triple {29800#(= ~c_dr_pc~0 0)} call activate_threads1(); {29840#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:07,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {29840#(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; {29798#true} is VALID [2022-02-20 19:58:07,124 INFO L272 TraceCheckUtils]: 19: Hoare triple {29798#true} call #t~ret8 := is_do_write_p_triggered(); {29798#true} is VALID [2022-02-20 19:58:07,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {29798#true} havoc ~__retres1~0; {29798#true} is VALID [2022-02-20 19:58:07,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {29798#true} assume !(1 == ~p_dw_pc~0); {29798#true} is VALID [2022-02-20 19:58:07,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {29798#true} ~__retres1~0 := 0; {29798#true} is VALID [2022-02-20 19:58:07,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {29798#true} #res := ~__retres1~0; {29798#true} is VALID [2022-02-20 19:58:07,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {29798#true} assume true; {29798#true} is VALID [2022-02-20 19:58:07,125 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {29798#true} {29798#true} #1544#return; {29798#true} is VALID [2022-02-20 19:58:07,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {29798#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {29798#true} is VALID [2022-02-20 19:58:07,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {29798#true} assume !(0 != ~tmp~1); {29798#true} is VALID [2022-02-20 19:58:07,125 INFO L272 TraceCheckUtils]: 28: Hoare triple {29798#true} call #t~ret9 := is_do_read_c_triggered(); {29798#true} is VALID [2022-02-20 19:58:07,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {29798#true} havoc ~__retres1~1; {29798#true} is VALID [2022-02-20 19:58:07,126 INFO L290 TraceCheckUtils]: 30: Hoare triple {29798#true} assume !(1 == ~c_dr_pc~0); {29798#true} is VALID [2022-02-20 19:58:07,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {29798#true} ~__retres1~1 := 0; {29798#true} is VALID [2022-02-20 19:58:07,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {29798#true} #res := ~__retres1~1; {29798#true} is VALID [2022-02-20 19:58:07,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {29798#true} assume true; {29798#true} is VALID [2022-02-20 19:58:07,126 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {29798#true} {29798#true} #1546#return; {29798#true} is VALID [2022-02-20 19:58:07,126 INFO L290 TraceCheckUtils]: 35: Hoare triple {29798#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {29798#true} is VALID [2022-02-20 19:58:07,126 INFO L290 TraceCheckUtils]: 36: Hoare triple {29798#true} assume !(0 != ~tmp___0~1); {29798#true} is VALID [2022-02-20 19:58:07,126 INFO L290 TraceCheckUtils]: 37: Hoare triple {29798#true} assume true; {29798#true} is VALID [2022-02-20 19:58:07,127 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {29798#true} {29800#(= ~c_dr_pc~0 0)} #1552#return; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,127 INFO L272 TraceCheckUtils]: 39: Hoare triple {29800#(= ~c_dr_pc~0 0)} call reset_delta_events1(); {29839#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:07,127 INFO L290 TraceCheckUtils]: 40: Hoare triple {29839#(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); {29798#true} is VALID [2022-02-20 19:58:07,128 INFO L290 TraceCheckUtils]: 41: Hoare triple {29798#true} assume !(1 == ~q_write_ev~0); {29798#true} is VALID [2022-02-20 19:58:07,128 INFO L290 TraceCheckUtils]: 42: Hoare triple {29798#true} assume true; {29798#true} is VALID [2022-02-20 19:58:07,128 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {29798#true} {29800#(= ~c_dr_pc~0 0)} #1554#return; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,128 INFO L290 TraceCheckUtils]: 44: Hoare triple {29800#(= ~c_dr_pc~0 0)} assume !false; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,129 INFO L290 TraceCheckUtils]: 45: Hoare triple {29800#(= ~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; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,129 INFO L290 TraceCheckUtils]: 46: Hoare triple {29800#(= ~c_dr_pc~0 0)} assume !false; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,129 INFO L272 TraceCheckUtils]: 47: Hoare triple {29800#(= ~c_dr_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {29798#true} is VALID [2022-02-20 19:58:07,129 INFO L290 TraceCheckUtils]: 48: Hoare triple {29798#true} havoc ~__retres1~2; {29798#true} is VALID [2022-02-20 19:58:07,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {29798#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {29798#true} is VALID [2022-02-20 19:58:07,130 INFO L290 TraceCheckUtils]: 50: Hoare triple {29798#true} #res := ~__retres1~2; {29798#true} is VALID [2022-02-20 19:58:07,130 INFO L290 TraceCheckUtils]: 51: Hoare triple {29798#true} assume true; {29798#true} is VALID [2022-02-20 19:58:07,130 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {29798#true} {29800#(= ~c_dr_pc~0 0)} #1556#return; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {29800#(= ~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; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,131 INFO L290 TraceCheckUtils]: 54: Hoare triple {29800#(= ~c_dr_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,131 INFO L290 TraceCheckUtils]: 55: Hoare triple {29800#(= ~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; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,131 INFO L290 TraceCheckUtils]: 56: Hoare triple {29800#(= ~c_dr_pc~0 0)} assume !(0 != eval1_~tmp~2#1); {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,132 INFO L290 TraceCheckUtils]: 57: Hoare triple {29800#(= ~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; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,132 INFO L290 TraceCheckUtils]: 58: Hoare triple {29800#(= ~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; {29800#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:07,132 INFO L290 TraceCheckUtils]: 59: Hoare triple {29800#(= ~c_dr_pc~0 0)} assume !(0 == ~c_dr_pc~0); {29799#false} is VALID [2022-02-20 19:58:07,132 INFO L290 TraceCheckUtils]: 60: Hoare triple {29799#false} assume 1 == ~c_dr_pc~0; {29799#false} is VALID [2022-02-20 19:58:07,133 INFO L290 TraceCheckUtils]: 61: Hoare triple {29799#false} do_read_c_~a~0#1 := ~a_t~0; {29799#false} is VALID [2022-02-20 19:58:07,133 INFO L290 TraceCheckUtils]: 62: Hoare triple {29799#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; {29799#false} is VALID [2022-02-20 19:58:07,133 INFO L290 TraceCheckUtils]: 63: Hoare triple {29799#false} assume !(~p_last_write~0 == ~c_last_read~0); {29799#false} is VALID [2022-02-20 19:58:07,133 INFO L272 TraceCheckUtils]: 64: Hoare triple {29799#false} call error1(); {29799#false} is VALID [2022-02-20 19:58:07,133 INFO L290 TraceCheckUtils]: 65: Hoare triple {29799#false} assume !false; {29799#false} is VALID [2022-02-20 19:58:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:07,134 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:07,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599309433] [2022-02-20 19:58:07,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599309433] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:07,134 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:07,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:07,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187935150] [2022-02-20 19:58:07,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:07,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:07,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:07,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:07,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:07,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:07,176 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:07,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:07,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:07,177 INFO L87 Difference]: Start difference. First operand 1393 states and 1875 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:09,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:09,361 INFO L93 Difference]: Finished difference Result 3581 states and 4681 transitions. [2022-02-20 19:58:09,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:09,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:09,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 882 transitions. [2022-02-20 19:58:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 882 transitions. [2022-02-20 19:58:09,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 882 transitions. [2022-02-20 19:58:09,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 882 edges. 882 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:10,264 INFO L225 Difference]: With dead ends: 3581 [2022-02-20 19:58:10,264 INFO L226 Difference]: Without dead ends: 2513 [2022-02-20 19:58:10,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-02-20 19:58:10,267 INFO L933 BasicCegarLoop]: 594 mSDtfsCounter, 1161 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:10,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1191 Valid, 1440 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:58:10,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2022-02-20 19:58:10,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2255. [2022-02-20 19:58:10,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:10,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2513 states. Second operand has 2255 states, 1793 states have (on average 1.3162297824874511) internal successors, (2360), 1821 states have internal predecessors, (2360), 238 states have call successors, (238), 179 states have call predecessors, (238), 222 states have return successors, (338), 261 states have call predecessors, (338), 236 states have call successors, (338) [2022-02-20 19:58:10,424 INFO L74 IsIncluded]: Start isIncluded. First operand 2513 states. Second operand has 2255 states, 1793 states have (on average 1.3162297824874511) internal successors, (2360), 1821 states have internal predecessors, (2360), 238 states have call successors, (238), 179 states have call predecessors, (238), 222 states have return successors, (338), 261 states have call predecessors, (338), 236 states have call successors, (338) [2022-02-20 19:58:10,427 INFO L87 Difference]: Start difference. First operand 2513 states. Second operand has 2255 states, 1793 states have (on average 1.3162297824874511) internal successors, (2360), 1821 states have internal predecessors, (2360), 238 states have call successors, (238), 179 states have call predecessors, (238), 222 states have return successors, (338), 261 states have call predecessors, (338), 236 states have call successors, (338) [2022-02-20 19:58:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:10,689 INFO L93 Difference]: Finished difference Result 2513 states and 3236 transitions. [2022-02-20 19:58:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3236 transitions. [2022-02-20 19:58:10,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:10,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:10,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 2255 states, 1793 states have (on average 1.3162297824874511) internal successors, (2360), 1821 states have internal predecessors, (2360), 238 states have call successors, (238), 179 states have call predecessors, (238), 222 states have return successors, (338), 261 states have call predecessors, (338), 236 states have call successors, (338) Second operand 2513 states. [2022-02-20 19:58:10,700 INFO L87 Difference]: Start difference. First operand has 2255 states, 1793 states have (on average 1.3162297824874511) internal successors, (2360), 1821 states have internal predecessors, (2360), 238 states have call successors, (238), 179 states have call predecessors, (238), 222 states have return successors, (338), 261 states have call predecessors, (338), 236 states have call successors, (338) Second operand 2513 states. [2022-02-20 19:58:10,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:10,970 INFO L93 Difference]: Finished difference Result 2513 states and 3236 transitions. [2022-02-20 19:58:10,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3236 transitions. [2022-02-20 19:58:10,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:10,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:10,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:10,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:10,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2255 states, 1793 states have (on average 1.3162297824874511) internal successors, (2360), 1821 states have internal predecessors, (2360), 238 states have call successors, (238), 179 states have call predecessors, (238), 222 states have return successors, (338), 261 states have call predecessors, (338), 236 states have call successors, (338) [2022-02-20 19:58:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 2936 transitions. [2022-02-20 19:58:11,241 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 2936 transitions. Word has length 66 [2022-02-20 19:58:11,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:11,242 INFO L470 AbstractCegarLoop]: Abstraction has 2255 states and 2936 transitions. [2022-02-20 19:58:11,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2936 transitions. [2022-02-20 19:58:11,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:58:11,243 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:11,244 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:11,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:58:11,244 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:11,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:11,244 INFO L85 PathProgramCache]: Analyzing trace with hash 388589846, now seen corresponding path program 1 times [2022-02-20 19:58:11,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:11,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501134970] [2022-02-20 19:58:11,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:11,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {42715#(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); {42675#true} is VALID [2022-02-20 19:58:11,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {42675#true} assume true; {42675#true} is VALID [2022-02-20 19:58:11,290 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42675#true} {42677#(= ~p_dw_pc~0 0)} #1548#return; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {42716#(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); {42675#true} is VALID [2022-02-20 19:58:11,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {42675#true} assume !(0 == ~q_write_ev~0); {42675#true} is VALID [2022-02-20 19:58:11,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {42675#true} assume true; {42675#true} is VALID [2022-02-20 19:58:11,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42675#true} {42677#(= ~p_dw_pc~0 0)} #1550#return; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {42675#true} havoc ~__retres1~0; {42675#true} is VALID [2022-02-20 19:58:11,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {42675#true} assume !(1 == ~p_dw_pc~0); {42675#true} is VALID [2022-02-20 19:58:11,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {42675#true} ~__retres1~0 := 0; {42675#true} is VALID [2022-02-20 19:58:11,313 INFO L290 TraceCheckUtils]: 3: Hoare triple {42675#true} #res := ~__retres1~0; {42675#true} is VALID [2022-02-20 19:58:11,313 INFO L290 TraceCheckUtils]: 4: Hoare triple {42675#true} assume true; {42675#true} is VALID [2022-02-20 19:58:11,313 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {42675#true} {42675#true} #1544#return; {42675#true} is VALID [2022-02-20 19:58:11,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {42675#true} havoc ~__retres1~1; {42675#true} is VALID [2022-02-20 19:58:11,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {42675#true} assume !(1 == ~c_dr_pc~0); {42675#true} is VALID [2022-02-20 19:58:11,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {42675#true} ~__retres1~1 := 0; {42675#true} is VALID [2022-02-20 19:58:11,316 INFO L290 TraceCheckUtils]: 3: Hoare triple {42675#true} #res := ~__retres1~1; {42675#true} is VALID [2022-02-20 19:58:11,316 INFO L290 TraceCheckUtils]: 4: Hoare triple {42675#true} assume true; {42675#true} is VALID [2022-02-20 19:58:11,316 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {42675#true} {42675#true} #1546#return; {42675#true} is VALID [2022-02-20 19:58:11,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {42717#(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; {42675#true} is VALID [2022-02-20 19:58:11,316 INFO L272 TraceCheckUtils]: 1: Hoare triple {42675#true} call #t~ret8 := is_do_write_p_triggered(); {42675#true} is VALID [2022-02-20 19:58:11,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {42675#true} havoc ~__retres1~0; {42675#true} is VALID [2022-02-20 19:58:11,317 INFO L290 TraceCheckUtils]: 3: Hoare triple {42675#true} assume !(1 == ~p_dw_pc~0); {42675#true} is VALID [2022-02-20 19:58:11,317 INFO L290 TraceCheckUtils]: 4: Hoare triple {42675#true} ~__retres1~0 := 0; {42675#true} is VALID [2022-02-20 19:58:11,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {42675#true} #res := ~__retres1~0; {42675#true} is VALID [2022-02-20 19:58:11,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {42675#true} assume true; {42675#true} is VALID [2022-02-20 19:58:11,317 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {42675#true} {42675#true} #1544#return; {42675#true} is VALID [2022-02-20 19:58:11,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {42675#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {42675#true} is VALID [2022-02-20 19:58:11,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {42675#true} assume !(0 != ~tmp~1); {42675#true} is VALID [2022-02-20 19:58:11,318 INFO L272 TraceCheckUtils]: 10: Hoare triple {42675#true} call #t~ret9 := is_do_read_c_triggered(); {42675#true} is VALID [2022-02-20 19:58:11,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {42675#true} havoc ~__retres1~1; {42675#true} is VALID [2022-02-20 19:58:11,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {42675#true} assume !(1 == ~c_dr_pc~0); {42675#true} is VALID [2022-02-20 19:58:11,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {42675#true} ~__retres1~1 := 0; {42675#true} is VALID [2022-02-20 19:58:11,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {42675#true} #res := ~__retres1~1; {42675#true} is VALID [2022-02-20 19:58:11,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {42675#true} assume true; {42675#true} is VALID [2022-02-20 19:58:11,319 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {42675#true} {42675#true} #1546#return; {42675#true} is VALID [2022-02-20 19:58:11,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {42675#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {42675#true} is VALID [2022-02-20 19:58:11,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {42675#true} assume !(0 != ~tmp___0~1); {42675#true} is VALID [2022-02-20 19:58:11,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {42675#true} assume true; {42675#true} is VALID [2022-02-20 19:58:11,319 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {42675#true} {42677#(= ~p_dw_pc~0 0)} #1552#return; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {42716#(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); {42675#true} is VALID [2022-02-20 19:58:11,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {42675#true} assume !(1 == ~q_write_ev~0); {42675#true} is VALID [2022-02-20 19:58:11,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {42675#true} assume true; {42675#true} is VALID [2022-02-20 19:58:11,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42675#true} {42677#(= ~p_dw_pc~0 0)} #1554#return; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:11,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {42675#true} havoc ~__retres1~2; {42675#true} is VALID [2022-02-20 19:58:11,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {42675#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {42675#true} is VALID [2022-02-20 19:58:11,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {42675#true} #res := ~__retres1~2; {42675#true} is VALID [2022-02-20 19:58:11,327 INFO L290 TraceCheckUtils]: 3: Hoare triple {42675#true} assume true; {42675#true} is VALID [2022-02-20 19:58:11,327 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {42675#true} {42677#(= ~p_dw_pc~0 0)} #1556#return; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {42675#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {42675#true} is VALID [2022-02-20 19:58:11,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {42675#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1;assume -2147483648 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 2147483647; {42675#true} is VALID [2022-02-20 19:58:11,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {42675#true} assume 0 != main_#t~nondet44#1;havoc main_#t~nondet44#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; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,328 INFO L290 TraceCheckUtils]: 3: Hoare triple {42677#(= ~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; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {42677#(= ~p_dw_pc~0 0)} call update_channels1(); {42715#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:11,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {42715#(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); {42675#true} is VALID [2022-02-20 19:58:11,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {42675#true} assume true; {42675#true} is VALID [2022-02-20 19:58:11,330 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {42675#true} {42677#(= ~p_dw_pc~0 0)} #1548#return; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {42677#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {42677#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {42677#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {42677#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,331 INFO L272 TraceCheckUtils]: 12: Hoare triple {42677#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {42716#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:11,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {42716#(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); {42675#true} is VALID [2022-02-20 19:58:11,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {42675#true} assume !(0 == ~q_write_ev~0); {42675#true} is VALID [2022-02-20 19:58:11,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {42675#true} assume true; {42675#true} is VALID [2022-02-20 19:58:11,332 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {42675#true} {42677#(= ~p_dw_pc~0 0)} #1550#return; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,333 INFO L272 TraceCheckUtils]: 17: Hoare triple {42677#(= ~p_dw_pc~0 0)} call activate_threads1(); {42717#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:11,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {42717#(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; {42675#true} is VALID [2022-02-20 19:58:11,333 INFO L272 TraceCheckUtils]: 19: Hoare triple {42675#true} call #t~ret8 := is_do_write_p_triggered(); {42675#true} is VALID [2022-02-20 19:58:11,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {42675#true} havoc ~__retres1~0; {42675#true} is VALID [2022-02-20 19:58:11,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {42675#true} assume !(1 == ~p_dw_pc~0); {42675#true} is VALID [2022-02-20 19:58:11,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {42675#true} ~__retres1~0 := 0; {42675#true} is VALID [2022-02-20 19:58:11,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {42675#true} #res := ~__retres1~0; {42675#true} is VALID [2022-02-20 19:58:11,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {42675#true} assume true; {42675#true} is VALID [2022-02-20 19:58:11,334 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {42675#true} {42675#true} #1544#return; {42675#true} is VALID [2022-02-20 19:58:11,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {42675#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {42675#true} is VALID [2022-02-20 19:58:11,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {42675#true} assume !(0 != ~tmp~1); {42675#true} is VALID [2022-02-20 19:58:11,334 INFO L272 TraceCheckUtils]: 28: Hoare triple {42675#true} call #t~ret9 := is_do_read_c_triggered(); {42675#true} is VALID [2022-02-20 19:58:11,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {42675#true} havoc ~__retres1~1; {42675#true} is VALID [2022-02-20 19:58:11,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {42675#true} assume !(1 == ~c_dr_pc~0); {42675#true} is VALID [2022-02-20 19:58:11,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {42675#true} ~__retres1~1 := 0; {42675#true} is VALID [2022-02-20 19:58:11,335 INFO L290 TraceCheckUtils]: 32: Hoare triple {42675#true} #res := ~__retres1~1; {42675#true} is VALID [2022-02-20 19:58:11,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {42675#true} assume true; {42675#true} is VALID [2022-02-20 19:58:11,335 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {42675#true} {42675#true} #1546#return; {42675#true} is VALID [2022-02-20 19:58:11,335 INFO L290 TraceCheckUtils]: 35: Hoare triple {42675#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {42675#true} is VALID [2022-02-20 19:58:11,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {42675#true} assume !(0 != ~tmp___0~1); {42675#true} is VALID [2022-02-20 19:58:11,335 INFO L290 TraceCheckUtils]: 37: Hoare triple {42675#true} assume true; {42675#true} is VALID [2022-02-20 19:58:11,336 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {42675#true} {42677#(= ~p_dw_pc~0 0)} #1552#return; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,336 INFO L272 TraceCheckUtils]: 39: Hoare triple {42677#(= ~p_dw_pc~0 0)} call reset_delta_events1(); {42716#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:11,336 INFO L290 TraceCheckUtils]: 40: Hoare triple {42716#(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); {42675#true} is VALID [2022-02-20 19:58:11,336 INFO L290 TraceCheckUtils]: 41: Hoare triple {42675#true} assume !(1 == ~q_write_ev~0); {42675#true} is VALID [2022-02-20 19:58:11,337 INFO L290 TraceCheckUtils]: 42: Hoare triple {42675#true} assume true; {42675#true} is VALID [2022-02-20 19:58:11,337 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {42675#true} {42677#(= ~p_dw_pc~0 0)} #1554#return; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,337 INFO L290 TraceCheckUtils]: 44: Hoare triple {42677#(= ~p_dw_pc~0 0)} assume !false; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,338 INFO L290 TraceCheckUtils]: 45: Hoare triple {42677#(= ~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; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,338 INFO L290 TraceCheckUtils]: 46: Hoare triple {42677#(= ~p_dw_pc~0 0)} assume !false; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,338 INFO L272 TraceCheckUtils]: 47: Hoare triple {42677#(= ~p_dw_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {42675#true} is VALID [2022-02-20 19:58:11,338 INFO L290 TraceCheckUtils]: 48: Hoare triple {42675#true} havoc ~__retres1~2; {42675#true} is VALID [2022-02-20 19:58:11,338 INFO L290 TraceCheckUtils]: 49: Hoare triple {42675#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {42675#true} is VALID [2022-02-20 19:58:11,338 INFO L290 TraceCheckUtils]: 50: Hoare triple {42675#true} #res := ~__retres1~2; {42675#true} is VALID [2022-02-20 19:58:11,339 INFO L290 TraceCheckUtils]: 51: Hoare triple {42675#true} assume true; {42675#true} is VALID [2022-02-20 19:58:11,339 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {42675#true} {42677#(= ~p_dw_pc~0 0)} #1556#return; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,339 INFO L290 TraceCheckUtils]: 53: Hoare triple {42677#(= ~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; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,340 INFO L290 TraceCheckUtils]: 54: Hoare triple {42677#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,340 INFO L290 TraceCheckUtils]: 55: Hoare triple {42677#(= ~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; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,340 INFO L290 TraceCheckUtils]: 56: Hoare triple {42677#(= ~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; {42677#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:11,341 INFO L290 TraceCheckUtils]: 57: Hoare triple {42677#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {42676#false} is VALID [2022-02-20 19:58:11,341 INFO L290 TraceCheckUtils]: 58: Hoare triple {42676#false} assume 1 == ~p_dw_pc~0; {42676#false} is VALID [2022-02-20 19:58:11,341 INFO L290 TraceCheckUtils]: 59: Hoare triple {42676#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; {42676#false} is VALID [2022-02-20 19:58:11,341 INFO L290 TraceCheckUtils]: 60: Hoare triple {42676#false} assume !false; {42676#false} is VALID [2022-02-20 19:58:11,341 INFO L290 TraceCheckUtils]: 61: Hoare triple {42676#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {42676#false} is VALID [2022-02-20 19:58:11,341 INFO L290 TraceCheckUtils]: 62: Hoare triple {42676#false} assume { :end_inline_do_write_p } true; {42676#false} is VALID [2022-02-20 19:58:11,341 INFO L290 TraceCheckUtils]: 63: Hoare triple {42676#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; {42676#false} is VALID [2022-02-20 19:58:11,342 INFO L290 TraceCheckUtils]: 64: Hoare triple {42676#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; {42676#false} is VALID [2022-02-20 19:58:11,342 INFO L290 TraceCheckUtils]: 65: Hoare triple {42676#false} assume 0 == ~c_dr_pc~0; {42676#false} is VALID [2022-02-20 19:58:11,342 INFO L290 TraceCheckUtils]: 66: Hoare triple {42676#false} assume !false; {42676#false} is VALID [2022-02-20 19:58:11,342 INFO L290 TraceCheckUtils]: 67: Hoare triple {42676#false} assume !(1 == ~q_free~0); {42676#false} is VALID [2022-02-20 19:58:11,342 INFO L290 TraceCheckUtils]: 68: Hoare triple {42676#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; {42676#false} is VALID [2022-02-20 19:58:11,342 INFO L290 TraceCheckUtils]: 69: Hoare triple {42676#false} assume !(~p_last_write~0 == ~c_last_read~0); {42676#false} is VALID [2022-02-20 19:58:11,342 INFO L272 TraceCheckUtils]: 70: Hoare triple {42676#false} call error1(); {42676#false} is VALID [2022-02-20 19:58:11,343 INFO L290 TraceCheckUtils]: 71: Hoare triple {42676#false} assume !false; {42676#false} is VALID [2022-02-20 19:58:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:11,343 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:11,343 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501134970] [2022-02-20 19:58:11,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501134970] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:11,343 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:11,344 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:11,344 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625096504] [2022-02-20 19:58:11,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:11,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:58:11,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:11,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:11,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:11,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:11,390 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:11,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:11,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:11,391 INFO L87 Difference]: Start difference. First operand 2255 states and 2936 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:13,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:13,991 INFO L93 Difference]: Finished difference Result 5165 states and 6586 transitions. [2022-02-20 19:58:13,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:13,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:58:13,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 868 transitions. [2022-02-20 19:58:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 868 transitions. [2022-02-20 19:58:14,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 868 transitions. [2022-02-20 19:58:14,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 868 edges. 868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:15,106 INFO L225 Difference]: With dead ends: 5165 [2022-02-20 19:58:15,106 INFO L226 Difference]: Without dead ends: 3235 [2022-02-20 19:58:15,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:58:15,111 INFO L933 BasicCegarLoop]: 608 mSDtfsCounter, 1439 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:15,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1469 Valid, 1208 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:58:15,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2022-02-20 19:58:15,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 2987. [2022-02-20 19:58:15,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:15,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3235 states. Second operand has 2987 states, 2361 states have (on average 1.2977551884794578) internal successors, (3064), 2397 states have internal predecessors, (3064), 318 states have call successors, (318), 249 states have call predecessors, (318), 306 states have return successors, (447), 347 states have call predecessors, (447), 316 states have call successors, (447) [2022-02-20 19:58:15,338 INFO L74 IsIncluded]: Start isIncluded. First operand 3235 states. Second operand has 2987 states, 2361 states have (on average 1.2977551884794578) internal successors, (3064), 2397 states have internal predecessors, (3064), 318 states have call successors, (318), 249 states have call predecessors, (318), 306 states have return successors, (447), 347 states have call predecessors, (447), 316 states have call successors, (447) [2022-02-20 19:58:15,341 INFO L87 Difference]: Start difference. First operand 3235 states. Second operand has 2987 states, 2361 states have (on average 1.2977551884794578) internal successors, (3064), 2397 states have internal predecessors, (3064), 318 states have call successors, (318), 249 states have call predecessors, (318), 306 states have return successors, (447), 347 states have call predecessors, (447), 316 states have call successors, (447) [2022-02-20 19:58:15,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:15,778 INFO L93 Difference]: Finished difference Result 3235 states and 4110 transitions. [2022-02-20 19:58:15,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3235 states and 4110 transitions. [2022-02-20 19:58:15,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:15,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:15,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 2987 states, 2361 states have (on average 1.2977551884794578) internal successors, (3064), 2397 states have internal predecessors, (3064), 318 states have call successors, (318), 249 states have call predecessors, (318), 306 states have return successors, (447), 347 states have call predecessors, (447), 316 states have call successors, (447) Second operand 3235 states. [2022-02-20 19:58:15,793 INFO L87 Difference]: Start difference. First operand has 2987 states, 2361 states have (on average 1.2977551884794578) internal successors, (3064), 2397 states have internal predecessors, (3064), 318 states have call successors, (318), 249 states have call predecessors, (318), 306 states have return successors, (447), 347 states have call predecessors, (447), 316 states have call successors, (447) Second operand 3235 states. [2022-02-20 19:58:16,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:16,268 INFO L93 Difference]: Finished difference Result 3235 states and 4110 transitions. [2022-02-20 19:58:16,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3235 states and 4110 transitions. [2022-02-20 19:58:16,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:16,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:16,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:16,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:16,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2987 states, 2361 states have (on average 1.2977551884794578) internal successors, (3064), 2397 states have internal predecessors, (3064), 318 states have call successors, (318), 249 states have call predecessors, (318), 306 states have return successors, (447), 347 states have call predecessors, (447), 316 states have call successors, (447) [2022-02-20 19:58:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 3829 transitions. [2022-02-20 19:58:16,728 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 3829 transitions. Word has length 72 [2022-02-20 19:58:16,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:16,728 INFO L470 AbstractCegarLoop]: Abstraction has 2987 states and 3829 transitions. [2022-02-20 19:58:16,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:16,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 3829 transitions. [2022-02-20 19:58:16,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:58:16,730 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:16,730 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:16,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:58:16,731 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:16,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:16,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1355326336, now seen corresponding path program 1 times [2022-02-20 19:58:16,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:16,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346725667] [2022-02-20 19:58:16,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:16,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:16,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:16,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {60161#(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); {60120#true} is VALID [2022-02-20 19:58:16,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {60120#true} assume true; {60120#true} is VALID [2022-02-20 19:58:16,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60120#true} {60120#true} #1548#return; {60120#true} is VALID [2022-02-20 19:58:16,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:16,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {60162#(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); {60120#true} is VALID [2022-02-20 19:58:16,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {60120#true} assume !(0 == ~q_write_ev~0); {60120#true} is VALID [2022-02-20 19:58:16,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {60120#true} assume true; {60120#true} is VALID [2022-02-20 19:58:16,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60120#true} {60120#true} #1550#return; {60120#true} is VALID [2022-02-20 19:58:16,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:16,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:16,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {60120#true} havoc ~__retres1~0; {60120#true} is VALID [2022-02-20 19:58:16,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {60120#true} assume !(1 == ~p_dw_pc~0); {60120#true} is VALID [2022-02-20 19:58:16,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {60120#true} ~__retres1~0 := 0; {60120#true} is VALID [2022-02-20 19:58:16,799 INFO L290 TraceCheckUtils]: 3: Hoare triple {60120#true} #res := ~__retres1~0; {60120#true} is VALID [2022-02-20 19:58:16,799 INFO L290 TraceCheckUtils]: 4: Hoare triple {60120#true} assume true; {60120#true} is VALID [2022-02-20 19:58:16,799 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {60120#true} {60120#true} #1544#return; {60120#true} is VALID [2022-02-20 19:58:16,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:16,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {60120#true} havoc ~__retres1~1; {60120#true} is VALID [2022-02-20 19:58:16,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {60120#true} assume !(1 == ~c_dr_pc~0); {60120#true} is VALID [2022-02-20 19:58:16,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {60120#true} ~__retres1~1 := 0; {60120#true} is VALID [2022-02-20 19:58:16,802 INFO L290 TraceCheckUtils]: 3: Hoare triple {60120#true} #res := ~__retres1~1; {60120#true} is VALID [2022-02-20 19:58:16,802 INFO L290 TraceCheckUtils]: 4: Hoare triple {60120#true} assume true; {60120#true} is VALID [2022-02-20 19:58:16,802 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {60120#true} {60120#true} #1546#return; {60120#true} is VALID [2022-02-20 19:58:16,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {60163#(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; {60120#true} is VALID [2022-02-20 19:58:16,802 INFO L272 TraceCheckUtils]: 1: Hoare triple {60120#true} call #t~ret8 := is_do_write_p_triggered(); {60120#true} is VALID [2022-02-20 19:58:16,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {60120#true} havoc ~__retres1~0; {60120#true} is VALID [2022-02-20 19:58:16,802 INFO L290 TraceCheckUtils]: 3: Hoare triple {60120#true} assume !(1 == ~p_dw_pc~0); {60120#true} is VALID [2022-02-20 19:58:16,803 INFO L290 TraceCheckUtils]: 4: Hoare triple {60120#true} ~__retres1~0 := 0; {60120#true} is VALID [2022-02-20 19:58:16,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {60120#true} #res := ~__retres1~0; {60120#true} is VALID [2022-02-20 19:58:16,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {60120#true} assume true; {60120#true} is VALID [2022-02-20 19:58:16,803 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {60120#true} {60120#true} #1544#return; {60120#true} is VALID [2022-02-20 19:58:16,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {60120#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {60120#true} is VALID [2022-02-20 19:58:16,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {60120#true} assume !(0 != ~tmp~1); {60120#true} is VALID [2022-02-20 19:58:16,804 INFO L272 TraceCheckUtils]: 10: Hoare triple {60120#true} call #t~ret9 := is_do_read_c_triggered(); {60120#true} is VALID [2022-02-20 19:58:16,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {60120#true} havoc ~__retres1~1; {60120#true} is VALID [2022-02-20 19:58:16,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {60120#true} assume !(1 == ~c_dr_pc~0); {60120#true} is VALID [2022-02-20 19:58:16,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {60120#true} ~__retres1~1 := 0; {60120#true} is VALID [2022-02-20 19:58:16,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {60120#true} #res := ~__retres1~1; {60120#true} is VALID [2022-02-20 19:58:16,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {60120#true} assume true; {60120#true} is VALID [2022-02-20 19:58:16,804 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {60120#true} {60120#true} #1546#return; {60120#true} is VALID [2022-02-20 19:58:16,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {60120#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {60120#true} is VALID [2022-02-20 19:58:16,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {60120#true} assume !(0 != ~tmp___0~1); {60120#true} is VALID [2022-02-20 19:58:16,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {60120#true} assume true; {60120#true} is VALID [2022-02-20 19:58:16,805 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {60120#true} {60120#true} #1552#return; {60120#true} is VALID [2022-02-20 19:58:16,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:16,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {60162#(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); {60120#true} is VALID [2022-02-20 19:58:16,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {60120#true} assume !(1 == ~q_write_ev~0); {60120#true} is VALID [2022-02-20 19:58:16,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {60120#true} assume true; {60120#true} is VALID [2022-02-20 19:58:16,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60120#true} {60120#true} #1554#return; {60120#true} is VALID [2022-02-20 19:58:16,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:16,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {60120#true} havoc ~__retres1~2; {60120#true} is VALID [2022-02-20 19:58:16,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {60120#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {60120#true} is VALID [2022-02-20 19:58:16,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {60120#true} #res := ~__retres1~2; {60120#true} is VALID [2022-02-20 19:58:16,812 INFO L290 TraceCheckUtils]: 3: Hoare triple {60120#true} assume true; {60120#true} is VALID [2022-02-20 19:58:16,812 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {60120#true} {60120#true} #1556#return; {60120#true} is VALID [2022-02-20 19:58:16,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {60120#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {60120#true} is VALID [2022-02-20 19:58:16,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {60120#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1;assume -2147483648 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 2147483647; {60120#true} is VALID [2022-02-20 19:58:16,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {60120#true} assume 0 != main_#t~nondet44#1;havoc main_#t~nondet44#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; {60120#true} is VALID [2022-02-20 19:58:16,812 INFO L290 TraceCheckUtils]: 3: Hoare triple {60120#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; {60120#true} is VALID [2022-02-20 19:58:16,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {60120#true} call update_channels1(); {60161#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:16,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {60161#(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); {60120#true} is VALID [2022-02-20 19:58:16,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {60120#true} assume true; {60120#true} is VALID [2022-02-20 19:58:16,813 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {60120#true} {60120#true} #1548#return; {60120#true} is VALID [2022-02-20 19:58:16,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {60120#true} assume { :begin_inline_init_threads1 } true; {60120#true} is VALID [2022-02-20 19:58:16,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {60120#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {60120#true} is VALID [2022-02-20 19:58:16,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {60120#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {60120#true} is VALID [2022-02-20 19:58:16,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {60120#true} assume { :end_inline_init_threads1 } true; {60120#true} is VALID [2022-02-20 19:58:16,814 INFO L272 TraceCheckUtils]: 12: Hoare triple {60120#true} call fire_delta_events1(); {60162#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:16,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {60162#(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); {60120#true} is VALID [2022-02-20 19:58:16,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {60120#true} assume !(0 == ~q_write_ev~0); {60120#true} is VALID [2022-02-20 19:58:16,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {60120#true} assume true; {60120#true} is VALID [2022-02-20 19:58:16,815 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {60120#true} {60120#true} #1550#return; {60120#true} is VALID [2022-02-20 19:58:16,815 INFO L272 TraceCheckUtils]: 17: Hoare triple {60120#true} call activate_threads1(); {60163#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:16,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {60163#(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; {60120#true} is VALID [2022-02-20 19:58:16,816 INFO L272 TraceCheckUtils]: 19: Hoare triple {60120#true} call #t~ret8 := is_do_write_p_triggered(); {60120#true} is VALID [2022-02-20 19:58:16,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {60120#true} havoc ~__retres1~0; {60120#true} is VALID [2022-02-20 19:58:16,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {60120#true} assume !(1 == ~p_dw_pc~0); {60120#true} is VALID [2022-02-20 19:58:16,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {60120#true} ~__retres1~0 := 0; {60120#true} is VALID [2022-02-20 19:58:16,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {60120#true} #res := ~__retres1~0; {60120#true} is VALID [2022-02-20 19:58:16,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {60120#true} assume true; {60120#true} is VALID [2022-02-20 19:58:16,816 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {60120#true} {60120#true} #1544#return; {60120#true} is VALID [2022-02-20 19:58:16,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {60120#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {60120#true} is VALID [2022-02-20 19:58:16,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {60120#true} assume !(0 != ~tmp~1); {60120#true} is VALID [2022-02-20 19:58:16,817 INFO L272 TraceCheckUtils]: 28: Hoare triple {60120#true} call #t~ret9 := is_do_read_c_triggered(); {60120#true} is VALID [2022-02-20 19:58:16,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {60120#true} havoc ~__retres1~1; {60120#true} is VALID [2022-02-20 19:58:16,817 INFO L290 TraceCheckUtils]: 30: Hoare triple {60120#true} assume !(1 == ~c_dr_pc~0); {60120#true} is VALID [2022-02-20 19:58:16,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {60120#true} ~__retres1~1 := 0; {60120#true} is VALID [2022-02-20 19:58:16,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {60120#true} #res := ~__retres1~1; {60120#true} is VALID [2022-02-20 19:58:16,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {60120#true} assume true; {60120#true} is VALID [2022-02-20 19:58:16,818 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {60120#true} {60120#true} #1546#return; {60120#true} is VALID [2022-02-20 19:58:16,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {60120#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {60120#true} is VALID [2022-02-20 19:58:16,818 INFO L290 TraceCheckUtils]: 36: Hoare triple {60120#true} assume !(0 != ~tmp___0~1); {60120#true} is VALID [2022-02-20 19:58:16,818 INFO L290 TraceCheckUtils]: 37: Hoare triple {60120#true} assume true; {60120#true} is VALID [2022-02-20 19:58:16,818 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {60120#true} {60120#true} #1552#return; {60120#true} is VALID [2022-02-20 19:58:16,818 INFO L272 TraceCheckUtils]: 39: Hoare triple {60120#true} call reset_delta_events1(); {60162#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:16,819 INFO L290 TraceCheckUtils]: 40: Hoare triple {60162#(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); {60120#true} is VALID [2022-02-20 19:58:16,819 INFO L290 TraceCheckUtils]: 41: Hoare triple {60120#true} assume !(1 == ~q_write_ev~0); {60120#true} is VALID [2022-02-20 19:58:16,819 INFO L290 TraceCheckUtils]: 42: Hoare triple {60120#true} assume true; {60120#true} is VALID [2022-02-20 19:58:16,819 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {60120#true} {60120#true} #1554#return; {60120#true} is VALID [2022-02-20 19:58:16,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {60120#true} assume !false; {60120#true} is VALID [2022-02-20 19:58:16,819 INFO L290 TraceCheckUtils]: 45: Hoare triple {60120#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; {60120#true} is VALID [2022-02-20 19:58:16,819 INFO L290 TraceCheckUtils]: 46: Hoare triple {60120#true} assume !false; {60120#true} is VALID [2022-02-20 19:58:16,820 INFO L272 TraceCheckUtils]: 47: Hoare triple {60120#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {60120#true} is VALID [2022-02-20 19:58:16,820 INFO L290 TraceCheckUtils]: 48: Hoare triple {60120#true} havoc ~__retres1~2; {60120#true} is VALID [2022-02-20 19:58:16,820 INFO L290 TraceCheckUtils]: 49: Hoare triple {60120#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {60120#true} is VALID [2022-02-20 19:58:16,820 INFO L290 TraceCheckUtils]: 50: Hoare triple {60120#true} #res := ~__retres1~2; {60120#true} is VALID [2022-02-20 19:58:16,820 INFO L290 TraceCheckUtils]: 51: Hoare triple {60120#true} assume true; {60120#true} is VALID [2022-02-20 19:58:16,820 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {60120#true} {60120#true} #1556#return; {60120#true} is VALID [2022-02-20 19:58:16,820 INFO L290 TraceCheckUtils]: 53: Hoare triple {60120#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; {60120#true} is VALID [2022-02-20 19:58:16,821 INFO L290 TraceCheckUtils]: 54: Hoare triple {60120#true} assume 0 != eval1_~tmp___1~0#1; {60120#true} is VALID [2022-02-20 19:58:16,821 INFO L290 TraceCheckUtils]: 55: Hoare triple {60120#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; {60120#true} is VALID [2022-02-20 19:58:16,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {60120#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; {60120#true} is VALID [2022-02-20 19:58:16,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {60120#true} assume 0 == ~p_dw_pc~0; {60120#true} is VALID [2022-02-20 19:58:16,821 INFO L290 TraceCheckUtils]: 58: Hoare triple {60120#true} assume !false; {60120#true} is VALID [2022-02-20 19:58:16,821 INFO L290 TraceCheckUtils]: 59: Hoare triple {60120#true} assume !(0 == ~q_free~0); {60120#true} is VALID [2022-02-20 19:58:16,822 INFO L290 TraceCheckUtils]: 60: Hoare triple {60120#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; {60159#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:16,822 INFO L290 TraceCheckUtils]: 61: Hoare triple {60159#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {60159#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:16,823 INFO L290 TraceCheckUtils]: 62: Hoare triple {60159#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {60159#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:16,823 INFO L290 TraceCheckUtils]: 63: Hoare triple {60159#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {60159#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:16,823 INFO L290 TraceCheckUtils]: 64: Hoare triple {60159#(= ~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; {60159#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:16,824 INFO L290 TraceCheckUtils]: 65: Hoare triple {60159#(= ~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; {60159#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:16,824 INFO L290 TraceCheckUtils]: 66: Hoare triple {60159#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {60159#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:16,824 INFO L290 TraceCheckUtils]: 67: Hoare triple {60159#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {60159#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:16,825 INFO L290 TraceCheckUtils]: 68: Hoare triple {60159#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {60159#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:16,825 INFO L290 TraceCheckUtils]: 69: Hoare triple {60159#(= ~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; {60160#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:58:16,825 INFO L290 TraceCheckUtils]: 70: Hoare triple {60160#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {60121#false} is VALID [2022-02-20 19:58:16,826 INFO L272 TraceCheckUtils]: 71: Hoare triple {60121#false} call error1(); {60121#false} is VALID [2022-02-20 19:58:16,826 INFO L290 TraceCheckUtils]: 72: Hoare triple {60121#false} assume !false; {60121#false} is VALID [2022-02-20 19:58:16,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:16,826 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:16,826 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346725667] [2022-02-20 19:58:16,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346725667] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:16,827 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:16,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:16,827 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401801812] [2022-02-20 19:58:16,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:16,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:58:16,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:16,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:16,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:16,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:16,875 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:16,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:16,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:16,876 INFO L87 Difference]: Start difference. First operand 2987 states and 3829 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:19,697 INFO L93 Difference]: Finished difference Result 3761 states and 4760 transitions. [2022-02-20 19:58:19,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:19,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:58:19,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:19,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 751 transitions. [2022-02-20 19:58:19,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:19,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 751 transitions. [2022-02-20 19:58:19,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 751 transitions. [2022-02-20 19:58:20,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 751 edges. 751 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:20,848 INFO L225 Difference]: With dead ends: 3761 [2022-02-20 19:58:20,848 INFO L226 Difference]: Without dead ends: 3758 [2022-02-20 19:58:20,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:58:20,849 INFO L933 BasicCegarLoop]: 603 mSDtfsCounter, 1737 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1747 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:20,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1747 Valid, 1462 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 19:58:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2022-02-20 19:58:21,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3481. [2022-02-20 19:58:21,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:21,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3758 states. Second operand has 3481 states, 2746 states have (on average 1.2876911871813548) internal successors, (3536), 2787 states have internal predecessors, (3536), 368 states have call successors, (368), 293 states have call predecessors, (368), 365 states have return successors, (526), 407 states have call predecessors, (526), 367 states have call successors, (526) [2022-02-20 19:58:21,127 INFO L74 IsIncluded]: Start isIncluded. First operand 3758 states. Second operand has 3481 states, 2746 states have (on average 1.2876911871813548) internal successors, (3536), 2787 states have internal predecessors, (3536), 368 states have call successors, (368), 293 states have call predecessors, (368), 365 states have return successors, (526), 407 states have call predecessors, (526), 367 states have call successors, (526) [2022-02-20 19:58:21,131 INFO L87 Difference]: Start difference. First operand 3758 states. Second operand has 3481 states, 2746 states have (on average 1.2876911871813548) internal successors, (3536), 2787 states have internal predecessors, (3536), 368 states have call successors, (368), 293 states have call predecessors, (368), 365 states have return successors, (526), 407 states have call predecessors, (526), 367 states have call successors, (526) [2022-02-20 19:58:21,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:21,554 INFO L93 Difference]: Finished difference Result 3758 states and 4746 transitions. [2022-02-20 19:58:21,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 4746 transitions. [2022-02-20 19:58:21,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:21,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:21,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 3481 states, 2746 states have (on average 1.2876911871813548) internal successors, (3536), 2787 states have internal predecessors, (3536), 368 states have call successors, (368), 293 states have call predecessors, (368), 365 states have return successors, (526), 407 states have call predecessors, (526), 367 states have call successors, (526) Second operand 3758 states. [2022-02-20 19:58:21,569 INFO L87 Difference]: Start difference. First operand has 3481 states, 2746 states have (on average 1.2876911871813548) internal successors, (3536), 2787 states have internal predecessors, (3536), 368 states have call successors, (368), 293 states have call predecessors, (368), 365 states have return successors, (526), 407 states have call predecessors, (526), 367 states have call successors, (526) Second operand 3758 states. [2022-02-20 19:58:22,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:22,185 INFO L93 Difference]: Finished difference Result 3758 states and 4746 transitions. [2022-02-20 19:58:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 4746 transitions. [2022-02-20 19:58:22,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:22,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:22,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:22,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3481 states, 2746 states have (on average 1.2876911871813548) internal successors, (3536), 2787 states have internal predecessors, (3536), 368 states have call successors, (368), 293 states have call predecessors, (368), 365 states have return successors, (526), 407 states have call predecessors, (526), 367 states have call successors, (526) [2022-02-20 19:58:22,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3481 states to 3481 states and 4430 transitions. [2022-02-20 19:58:22,752 INFO L78 Accepts]: Start accepts. Automaton has 3481 states and 4430 transitions. Word has length 73 [2022-02-20 19:58:22,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:22,752 INFO L470 AbstractCegarLoop]: Abstraction has 3481 states and 4430 transitions. [2022-02-20 19:58:22,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:58:22,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3481 states and 4430 transitions. [2022-02-20 19:58:22,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 19:58:22,754 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:22,754 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:22,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:58:22,755 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:22,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:22,755 INFO L85 PathProgramCache]: Analyzing trace with hash 933342880, now seen corresponding path program 1 times [2022-02-20 19:58:22,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:22,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452187067] [2022-02-20 19:58:22,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:22,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:22,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:22,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {77420#(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); {77378#true} is VALID [2022-02-20 19:58:22,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:22,831 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77378#true} {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1548#return; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:22,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {77421#(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); {77378#true} is VALID [2022-02-20 19:58:22,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {77378#true} assume !(0 == ~q_write_ev~0); {77378#true} is VALID [2022-02-20 19:58:22,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:22,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77378#true} {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1550#return; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:22,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:22,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {77378#true} havoc ~__retres1~0; {77378#true} is VALID [2022-02-20 19:58:22,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {77378#true} assume !(1 == ~p_dw_pc~0); {77378#true} is VALID [2022-02-20 19:58:22,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {77378#true} ~__retres1~0 := 0; {77378#true} is VALID [2022-02-20 19:58:22,859 INFO L290 TraceCheckUtils]: 3: Hoare triple {77378#true} #res := ~__retres1~0; {77378#true} is VALID [2022-02-20 19:58:22,860 INFO L290 TraceCheckUtils]: 4: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:22,860 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {77378#true} {77378#true} #1544#return; {77378#true} is VALID [2022-02-20 19:58:22,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:22,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {77378#true} havoc ~__retres1~1; {77378#true} is VALID [2022-02-20 19:58:22,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {77378#true} assume !(1 == ~c_dr_pc~0); {77378#true} is VALID [2022-02-20 19:58:22,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {77378#true} ~__retres1~1 := 0; {77378#true} is VALID [2022-02-20 19:58:22,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {77378#true} #res := ~__retres1~1; {77378#true} is VALID [2022-02-20 19:58:22,863 INFO L290 TraceCheckUtils]: 4: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:22,863 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {77378#true} {77378#true} #1546#return; {77378#true} is VALID [2022-02-20 19:58:22,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {77422#(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; {77378#true} is VALID [2022-02-20 19:58:22,863 INFO L272 TraceCheckUtils]: 1: Hoare triple {77378#true} call #t~ret8 := is_do_write_p_triggered(); {77378#true} is VALID [2022-02-20 19:58:22,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {77378#true} havoc ~__retres1~0; {77378#true} is VALID [2022-02-20 19:58:22,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {77378#true} assume !(1 == ~p_dw_pc~0); {77378#true} is VALID [2022-02-20 19:58:22,864 INFO L290 TraceCheckUtils]: 4: Hoare triple {77378#true} ~__retres1~0 := 0; {77378#true} is VALID [2022-02-20 19:58:22,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {77378#true} #res := ~__retres1~0; {77378#true} is VALID [2022-02-20 19:58:22,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:22,864 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {77378#true} {77378#true} #1544#return; {77378#true} is VALID [2022-02-20 19:58:22,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {77378#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {77378#true} is VALID [2022-02-20 19:58:22,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {77378#true} assume !(0 != ~tmp~1); {77378#true} is VALID [2022-02-20 19:58:22,865 INFO L272 TraceCheckUtils]: 10: Hoare triple {77378#true} call #t~ret9 := is_do_read_c_triggered(); {77378#true} is VALID [2022-02-20 19:58:22,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {77378#true} havoc ~__retres1~1; {77378#true} is VALID [2022-02-20 19:58:22,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {77378#true} assume !(1 == ~c_dr_pc~0); {77378#true} is VALID [2022-02-20 19:58:22,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {77378#true} ~__retres1~1 := 0; {77378#true} is VALID [2022-02-20 19:58:22,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {77378#true} #res := ~__retres1~1; {77378#true} is VALID [2022-02-20 19:58:22,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:22,866 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {77378#true} {77378#true} #1546#return; {77378#true} is VALID [2022-02-20 19:58:22,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {77378#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {77378#true} is VALID [2022-02-20 19:58:22,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {77378#true} assume !(0 != ~tmp___0~1); {77378#true} is VALID [2022-02-20 19:58:22,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:22,866 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {77378#true} {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1552#return; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:22,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {77421#(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); {77378#true} is VALID [2022-02-20 19:58:22,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {77378#true} assume !(1 == ~q_write_ev~0); {77378#true} is VALID [2022-02-20 19:58:22,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:22,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77378#true} {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1554#return; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:22,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {77378#true} havoc ~__retres1~2; {77378#true} is VALID [2022-02-20 19:58:22,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {77378#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {77378#true} is VALID [2022-02-20 19:58:22,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {77378#true} #res := ~__retres1~2; {77378#true} is VALID [2022-02-20 19:58:22,875 INFO L290 TraceCheckUtils]: 3: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:22,876 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {77378#true} {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1556#return; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {77378#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {77378#true} is VALID [2022-02-20 19:58:22,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {77378#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1;assume -2147483648 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 2147483647; {77378#true} is VALID [2022-02-20 19:58:22,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {77378#true} assume 0 != main_#t~nondet44#1;havoc main_#t~nondet44#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; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,877 INFO L290 TraceCheckUtils]: 3: Hoare triple {77380#(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; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {77420#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:22,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {77420#(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); {77378#true} is VALID [2022-02-20 19:58:22,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:22,879 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {77378#true} {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1548#return; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,881 INFO L272 TraceCheckUtils]: 12: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {77421#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:22,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {77421#(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); {77378#true} is VALID [2022-02-20 19:58:22,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {77378#true} assume !(0 == ~q_write_ev~0); {77378#true} is VALID [2022-02-20 19:58:22,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:22,882 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {77378#true} {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1550#return; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,882 INFO L272 TraceCheckUtils]: 17: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {77422#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:22,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {77422#(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; {77378#true} is VALID [2022-02-20 19:58:22,883 INFO L272 TraceCheckUtils]: 19: Hoare triple {77378#true} call #t~ret8 := is_do_write_p_triggered(); {77378#true} is VALID [2022-02-20 19:58:22,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {77378#true} havoc ~__retres1~0; {77378#true} is VALID [2022-02-20 19:58:22,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {77378#true} assume !(1 == ~p_dw_pc~0); {77378#true} is VALID [2022-02-20 19:58:22,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {77378#true} ~__retres1~0 := 0; {77378#true} is VALID [2022-02-20 19:58:22,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {77378#true} #res := ~__retres1~0; {77378#true} is VALID [2022-02-20 19:58:22,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:22,883 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {77378#true} {77378#true} #1544#return; {77378#true} is VALID [2022-02-20 19:58:22,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {77378#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {77378#true} is VALID [2022-02-20 19:58:22,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {77378#true} assume !(0 != ~tmp~1); {77378#true} is VALID [2022-02-20 19:58:22,884 INFO L272 TraceCheckUtils]: 28: Hoare triple {77378#true} call #t~ret9 := is_do_read_c_triggered(); {77378#true} is VALID [2022-02-20 19:58:22,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {77378#true} havoc ~__retres1~1; {77378#true} is VALID [2022-02-20 19:58:22,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {77378#true} assume !(1 == ~c_dr_pc~0); {77378#true} is VALID [2022-02-20 19:58:22,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {77378#true} ~__retres1~1 := 0; {77378#true} is VALID [2022-02-20 19:58:22,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {77378#true} #res := ~__retres1~1; {77378#true} is VALID [2022-02-20 19:58:22,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:22,885 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {77378#true} {77378#true} #1546#return; {77378#true} is VALID [2022-02-20 19:58:22,885 INFO L290 TraceCheckUtils]: 35: Hoare triple {77378#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {77378#true} is VALID [2022-02-20 19:58:22,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {77378#true} assume !(0 != ~tmp___0~1); {77378#true} is VALID [2022-02-20 19:58:22,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:22,885 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {77378#true} {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1552#return; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,886 INFO L272 TraceCheckUtils]: 39: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {77421#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:22,886 INFO L290 TraceCheckUtils]: 40: Hoare triple {77421#(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); {77378#true} is VALID [2022-02-20 19:58:22,886 INFO L290 TraceCheckUtils]: 41: Hoare triple {77378#true} assume !(1 == ~q_write_ev~0); {77378#true} is VALID [2022-02-20 19:58:22,886 INFO L290 TraceCheckUtils]: 42: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:22,887 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {77378#true} {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1554#return; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,887 INFO L290 TraceCheckUtils]: 44: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,888 INFO L290 TraceCheckUtils]: 45: Hoare triple {77380#(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; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,888 INFO L290 TraceCheckUtils]: 46: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,888 INFO L272 TraceCheckUtils]: 47: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {77378#true} is VALID [2022-02-20 19:58:22,888 INFO L290 TraceCheckUtils]: 48: Hoare triple {77378#true} havoc ~__retres1~2; {77378#true} is VALID [2022-02-20 19:58:22,888 INFO L290 TraceCheckUtils]: 49: Hoare triple {77378#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {77378#true} is VALID [2022-02-20 19:58:22,889 INFO L290 TraceCheckUtils]: 50: Hoare triple {77378#true} #res := ~__retres1~2; {77378#true} is VALID [2022-02-20 19:58:22,889 INFO L290 TraceCheckUtils]: 51: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:22,889 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {77378#true} {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1556#return; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,890 INFO L290 TraceCheckUtils]: 53: Hoare triple {77380#(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; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,890 INFO L290 TraceCheckUtils]: 54: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,891 INFO L290 TraceCheckUtils]: 55: Hoare triple {77380#(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; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,891 INFO L290 TraceCheckUtils]: 56: Hoare triple {77380#(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; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,892 INFO L290 TraceCheckUtils]: 57: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,892 INFO L290 TraceCheckUtils]: 58: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,892 INFO L290 TraceCheckUtils]: 59: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:22,893 INFO L290 TraceCheckUtils]: 60: Hoare triple {77380#(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; {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:22,893 INFO L290 TraceCheckUtils]: 61: Hoare triple {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:22,894 INFO L290 TraceCheckUtils]: 62: Hoare triple {77418#(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; {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:22,894 INFO L290 TraceCheckUtils]: 63: Hoare triple {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:22,895 INFO L290 TraceCheckUtils]: 64: Hoare triple {77418#(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; {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:22,895 INFO L290 TraceCheckUtils]: 65: Hoare triple {77418#(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; {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:22,896 INFO L290 TraceCheckUtils]: 66: Hoare triple {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:22,896 INFO L290 TraceCheckUtils]: 67: Hoare triple {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:22,896 INFO L290 TraceCheckUtils]: 68: Hoare triple {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:22,897 INFO L290 TraceCheckUtils]: 69: Hoare triple {77418#(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; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:22,898 INFO L290 TraceCheckUtils]: 70: Hoare triple {77419#(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; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:22,898 INFO L290 TraceCheckUtils]: 71: Hoare triple {77419#(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); {77379#false} is VALID [2022-02-20 19:58:22,898 INFO L272 TraceCheckUtils]: 72: Hoare triple {77379#false} call error1(); {77379#false} is VALID [2022-02-20 19:58:22,898 INFO L290 TraceCheckUtils]: 73: Hoare triple {77379#false} assume !false; {77379#false} is VALID [2022-02-20 19:58:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:22,899 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:22,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452187067] [2022-02-20 19:58:22,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452187067] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:58:22,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810183325] [2022-02-20 19:58:22,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:22,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:58:22,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:22,907 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:58:22,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 19:58:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:23,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:58:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:23,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:58:23,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {77378#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {77378#true} is VALID [2022-02-20 19:58:23,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {77378#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1;assume -2147483648 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 2147483647; {77378#true} is VALID [2022-02-20 19:58:23,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {77378#true} assume 0 != main_#t~nondet44#1;havoc main_#t~nondet44#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; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,687 INFO L290 TraceCheckUtils]: 3: Hoare triple {77380#(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; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_req_up~0); {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,689 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1548#return; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,691 INFO L272 TraceCheckUtils]: 12: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_read_ev~0); {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_write_ev~0); {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,694 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1550#return; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,694 INFO L272 TraceCheckUtils]: 17: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~tmp~1;havoc ~tmp___0~1; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,695 INFO L272 TraceCheckUtils]: 19: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret8 := is_do_write_p_triggered(); {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~0; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~p_dw_pc~0); {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~0 := 0; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~0; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,698 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1544#return; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {77380#(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; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp~1); {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,699 INFO L272 TraceCheckUtils]: 28: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret9 := is_do_read_c_triggered(); {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~1; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,700 INFO L290 TraceCheckUtils]: 30: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~c_dr_pc~0); {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~1 := 0; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,701 INFO L290 TraceCheckUtils]: 32: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~1; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,701 INFO L290 TraceCheckUtils]: 33: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,702 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1546#return; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {77380#(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; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,703 INFO L290 TraceCheckUtils]: 36: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp___0~1); {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,703 INFO L290 TraceCheckUtils]: 37: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,703 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1552#return; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,704 INFO L272 TraceCheckUtils]: 39: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,704 INFO L290 TraceCheckUtils]: 40: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_read_ev~0); {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,705 INFO L290 TraceCheckUtils]: 41: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_write_ev~0); {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,705 INFO L290 TraceCheckUtils]: 42: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,705 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1554#return; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,706 INFO L290 TraceCheckUtils]: 44: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,706 INFO L290 TraceCheckUtils]: 45: Hoare triple {77380#(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; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,707 INFO L290 TraceCheckUtils]: 46: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,707 INFO L272 TraceCheckUtils]: 47: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,708 INFO L290 TraceCheckUtils]: 48: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,708 INFO L290 TraceCheckUtils]: 49: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,708 INFO L290 TraceCheckUtils]: 50: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,709 INFO L290 TraceCheckUtils]: 51: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,709 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1556#return; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,710 INFO L290 TraceCheckUtils]: 53: Hoare triple {77380#(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; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,710 INFO L290 TraceCheckUtils]: 54: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,711 INFO L290 TraceCheckUtils]: 55: Hoare triple {77380#(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; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,711 INFO L290 TraceCheckUtils]: 56: Hoare triple {77380#(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; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,712 INFO L290 TraceCheckUtils]: 57: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,712 INFO L290 TraceCheckUtils]: 58: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,712 INFO L290 TraceCheckUtils]: 59: Hoare triple {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {77380#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:23,713 INFO L290 TraceCheckUtils]: 60: Hoare triple {77380#(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; {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:23,713 INFO L290 TraceCheckUtils]: 61: Hoare triple {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:23,714 INFO L290 TraceCheckUtils]: 62: Hoare triple {77418#(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; {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:23,714 INFO L290 TraceCheckUtils]: 63: Hoare triple {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:23,715 INFO L290 TraceCheckUtils]: 64: Hoare triple {77418#(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; {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:23,715 INFO L290 TraceCheckUtils]: 65: Hoare triple {77418#(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; {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:23,716 INFO L290 TraceCheckUtils]: 66: Hoare triple {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:23,716 INFO L290 TraceCheckUtils]: 67: Hoare triple {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:23,717 INFO L290 TraceCheckUtils]: 68: Hoare triple {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {77418#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:23,717 INFO L290 TraceCheckUtils]: 69: Hoare triple {77418#(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; {77645#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:23,718 INFO L290 TraceCheckUtils]: 70: Hoare triple {77645#(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; {77645#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:23,718 INFO L290 TraceCheckUtils]: 71: Hoare triple {77645#(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); {77379#false} is VALID [2022-02-20 19:58:23,718 INFO L272 TraceCheckUtils]: 72: Hoare triple {77379#false} call error1(); {77379#false} is VALID [2022-02-20 19:58:23,719 INFO L290 TraceCheckUtils]: 73: Hoare triple {77379#false} assume !false; {77379#false} is VALID [2022-02-20 19:58:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:23,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:58:24,199 INFO L290 TraceCheckUtils]: 73: Hoare triple {77379#false} assume !false; {77379#false} is VALID [2022-02-20 19:58:24,199 INFO L272 TraceCheckUtils]: 72: Hoare triple {77379#false} call error1(); {77379#false} is VALID [2022-02-20 19:58:24,200 INFO L290 TraceCheckUtils]: 71: Hoare triple {77419#(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); {77379#false} is VALID [2022-02-20 19:58:24,200 INFO L290 TraceCheckUtils]: 70: Hoare triple {77419#(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; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,201 INFO L290 TraceCheckUtils]: 69: Hoare triple {77670#(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; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,202 INFO L290 TraceCheckUtils]: 68: Hoare triple {77670#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !(1 == ~q_free~0); {77670#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:24,202 INFO L290 TraceCheckUtils]: 67: Hoare triple {77670#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {77670#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:24,203 INFO L290 TraceCheckUtils]: 66: Hoare triple {77670#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_pc~0; {77670#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:24,203 INFO L290 TraceCheckUtils]: 65: Hoare triple {77670#(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; {77670#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:24,204 INFO L290 TraceCheckUtils]: 64: Hoare triple {77670#(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; {77670#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:24,204 INFO L290 TraceCheckUtils]: 63: Hoare triple {77670#(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; {77670#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:24,205 INFO L290 TraceCheckUtils]: 62: Hoare triple {77670#(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; {77670#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:24,205 INFO L290 TraceCheckUtils]: 61: Hoare triple {77670#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {77670#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:24,206 INFO L290 TraceCheckUtils]: 60: Hoare triple {77419#(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; {77670#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:58:24,206 INFO L290 TraceCheckUtils]: 59: Hoare triple {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(0 == ~q_free~0); {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,207 INFO L290 TraceCheckUtils]: 58: Hoare triple {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,207 INFO L290 TraceCheckUtils]: 57: Hoare triple {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_pc~0; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,208 INFO L290 TraceCheckUtils]: 56: Hoare triple {77419#(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; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,208 INFO L290 TraceCheckUtils]: 55: Hoare triple {77419#(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; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,209 INFO L290 TraceCheckUtils]: 54: Hoare triple {77419#(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; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,209 INFO L290 TraceCheckUtils]: 53: Hoare triple {77419#(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; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,210 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {77378#true} {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1556#return; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,210 INFO L290 TraceCheckUtils]: 51: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:24,210 INFO L290 TraceCheckUtils]: 50: Hoare triple {77378#true} #res := ~__retres1~2; {77378#true} is VALID [2022-02-20 19:58:24,211 INFO L290 TraceCheckUtils]: 49: Hoare triple {77378#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {77378#true} is VALID [2022-02-20 19:58:24,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {77378#true} havoc ~__retres1~2; {77378#true} is VALID [2022-02-20 19:58:24,211 INFO L272 TraceCheckUtils]: 47: Hoare triple {77419#(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(); {77378#true} is VALID [2022-02-20 19:58:24,211 INFO L290 TraceCheckUtils]: 46: Hoare triple {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,212 INFO L290 TraceCheckUtils]: 45: Hoare triple {77419#(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; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,213 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {77378#true} {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1554#return; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,213 INFO L290 TraceCheckUtils]: 42: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:24,213 INFO L290 TraceCheckUtils]: 41: Hoare triple {77378#true} assume !(1 == ~q_write_ev~0); {77378#true} is VALID [2022-02-20 19:58:24,213 INFO L290 TraceCheckUtils]: 40: Hoare triple {77378#true} assume !(1 == ~q_read_ev~0); {77378#true} is VALID [2022-02-20 19:58:24,214 INFO L272 TraceCheckUtils]: 39: Hoare triple {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call reset_delta_events1(); {77378#true} is VALID [2022-02-20 19:58:24,214 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {77378#true} {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1552#return; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:24,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {77378#true} assume !(0 != ~tmp___0~1); {77378#true} is VALID [2022-02-20 19:58:24,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {77378#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {77378#true} is VALID [2022-02-20 19:58:24,215 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {77378#true} {77378#true} #1546#return; {77378#true} is VALID [2022-02-20 19:58:24,215 INFO L290 TraceCheckUtils]: 33: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:24,215 INFO L290 TraceCheckUtils]: 32: Hoare triple {77378#true} #res := ~__retres1~1; {77378#true} is VALID [2022-02-20 19:58:24,215 INFO L290 TraceCheckUtils]: 31: Hoare triple {77378#true} ~__retres1~1 := 0; {77378#true} is VALID [2022-02-20 19:58:24,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {77378#true} assume !(1 == ~c_dr_pc~0); {77378#true} is VALID [2022-02-20 19:58:24,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {77378#true} havoc ~__retres1~1; {77378#true} is VALID [2022-02-20 19:58:24,216 INFO L272 TraceCheckUtils]: 28: Hoare triple {77378#true} call #t~ret9 := is_do_read_c_triggered(); {77378#true} is VALID [2022-02-20 19:58:24,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {77378#true} assume !(0 != ~tmp~1); {77378#true} is VALID [2022-02-20 19:58:24,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {77378#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {77378#true} is VALID [2022-02-20 19:58:24,216 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {77378#true} {77378#true} #1544#return; {77378#true} is VALID [2022-02-20 19:58:24,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:24,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {77378#true} #res := ~__retres1~0; {77378#true} is VALID [2022-02-20 19:58:24,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {77378#true} ~__retres1~0 := 0; {77378#true} is VALID [2022-02-20 19:58:24,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {77378#true} assume !(1 == ~p_dw_pc~0); {77378#true} is VALID [2022-02-20 19:58:24,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {77378#true} havoc ~__retres1~0; {77378#true} is VALID [2022-02-20 19:58:24,217 INFO L272 TraceCheckUtils]: 19: Hoare triple {77378#true} call #t~ret8 := is_do_write_p_triggered(); {77378#true} is VALID [2022-02-20 19:58:24,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {77378#true} havoc ~tmp~1;havoc ~tmp___0~1; {77378#true} is VALID [2022-02-20 19:58:24,218 INFO L272 TraceCheckUtils]: 17: Hoare triple {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call activate_threads1(); {77378#true} is VALID [2022-02-20 19:58:24,218 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {77378#true} {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1550#return; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:24,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {77378#true} assume !(0 == ~q_write_ev~0); {77378#true} is VALID [2022-02-20 19:58:24,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {77378#true} assume !(0 == ~q_read_ev~0); {77378#true} is VALID [2022-02-20 19:58:24,219 INFO L272 TraceCheckUtils]: 12: Hoare triple {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call fire_delta_events1(); {77378#true} is VALID [2022-02-20 19:58:24,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_threads1 } true; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {77419#(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; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {77419#(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; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :begin_inline_init_threads1 } true; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,234 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {77378#true} {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1548#return; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {77378#true} assume true; {77378#true} is VALID [2022-02-20 19:58:24,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {77378#true} assume !(1 == ~q_req_up~0); {77378#true} is VALID [2022-02-20 19:58:24,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call update_channels1(); {77378#true} is VALID [2022-02-20 19:58:24,235 INFO L290 TraceCheckUtils]: 3: Hoare triple {77419#(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; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {77378#true} assume 0 != main_#t~nondet44#1;havoc main_#t~nondet44#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; {77419#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:58:24,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {77378#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1;assume -2147483648 <= main_#t~nondet44#1 && main_#t~nondet44#1 <= 2147483647; {77378#true} is VALID [2022-02-20 19:58:24,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {77378#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~token~0 := 0;~local~0 := 0; {77378#true} is VALID [2022-02-20 19:58:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:24,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810183325] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:58:24,237 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:58:24,237 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-02-20 19:58:24,237 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954833051] [2022-02-20 19:58:24,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:58:24,238 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-02-20 19:58:24,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:24,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:58:24,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:24,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:58:24,365 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:24,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:58:24,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:58:24,366 INFO L87 Difference]: Start difference. First operand 3481 states and 4430 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)