./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.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.10.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 6d6da8f3ee43e0b2f144002fad1e1be3bc4062b8e0f7b0d6768d1ce0f0c5101f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:57:41,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:57:41,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:57:41,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:57:41,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:57:41,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:57:41,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:57:41,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:57:41,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:57:41,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:57:41,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:57:41,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:57:41,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:57:41,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:57:41,389 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:57:41,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:57:41,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:57:41,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:57:41,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:57:41,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:57:41,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:57:41,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:57:41,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:57:41,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:57:41,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:57:41,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:57:41,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:57:41,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:57:41,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:57:41,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:57:41,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:57:41,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:57:41,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:57:41,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:57:41,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:57:41,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:57:41,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:57:41,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:57:41,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:57:41,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:57:41,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:57:41,408 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:41,427 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:57:41,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:57:41,443 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:57:41,443 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:57:41,444 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:57:41,444 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:57:41,444 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:57:41,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:57:41,445 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:57:41,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:57:41,445 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:57:41,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:57:41,445 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:57:41,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:57:41,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:57:41,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:57:41,445 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:57:41,445 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:57:41,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:57:41,446 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:57:41,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:57:41,446 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:57:41,446 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:57:41,446 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:57:41,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:57:41,446 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:57:41,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:57:41,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:57:41,447 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:57:41,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:57:41,447 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:57:41,447 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:57:41,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:57:41,447 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 -> 6d6da8f3ee43e0b2f144002fad1e1be3bc4062b8e0f7b0d6768d1ce0f0c5101f [2022-02-20 19:57:41,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:57:41,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:57:41,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:57:41,643 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:57:41,643 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:57:41,644 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-1.c [2022-02-20 19:57:41,712 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/958154845/480c0a23eb46463494a4bf8365c86461/FLAG4cb51a017 [2022-02-20 19:57:42,139 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:57:42,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-1.c [2022-02-20 19:57:42,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/958154845/480c0a23eb46463494a4bf8365c86461/FLAG4cb51a017 [2022-02-20 19:57:42,166 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/958154845/480c0a23eb46463494a4bf8365c86461 [2022-02-20 19:57:42,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:57:42,172 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:57:42,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:57:42,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:57:42,175 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:57:42,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:57:42" (1/1) ... [2022-02-20 19:57:42,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a252ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:42, skipping insertion in model container [2022-02-20 19:57:42,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:57:42" (1/1) ... [2022-02-20 19:57:42,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:57:42,220 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:57:42,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-1.c[914,927] [2022-02-20 19:57:42,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-1.c[7115,7128] [2022-02-20 19:57:42,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:57:42,509 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:57:42,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-1.c[914,927] [2022-02-20 19:57:42,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.10.cil-1.c[7115,7128] [2022-02-20 19:57:42,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:57:42,582 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:57:42,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:42 WrapperNode [2022-02-20 19:57:42,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:57:42,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:57:42,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:57:42,584 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:57:42,589 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:42" (1/1) ... [2022-02-20 19:57:42,611 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:42" (1/1) ... [2022-02-20 19:57:42,659 INFO L137 Inliner]: procedures = 73, calls = 88, calls flagged for inlining = 41, calls inlined = 41, statements flattened = 929 [2022-02-20 19:57:42,659 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:57:42,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:57:42,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:57:42,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:57:42,666 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:42" (1/1) ... [2022-02-20 19:57:42,666 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:42" (1/1) ... [2022-02-20 19:57:42,669 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:42" (1/1) ... [2022-02-20 19:57:42,670 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:42" (1/1) ... [2022-02-20 19:57:42,686 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:42" (1/1) ... [2022-02-20 19:57:42,696 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:42" (1/1) ... [2022-02-20 19:57:42,699 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:42" (1/1) ... [2022-02-20 19:57:42,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:57:42,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:57:42,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:57:42,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:57:42,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:42" (1/1) ... [2022-02-20 19:57:42,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:57:42,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:57:42,749 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:42,750 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:42,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:57:42,772 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:57:42,772 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:57:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:57:42,773 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:57:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:57:42,773 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:57:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:57:42,773 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:57:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:57:42,774 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:57:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:57:42,774 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:57:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:57:42,774 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:57:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:57:42,774 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:57:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:57:42,774 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:57:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:57:42,775 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:57:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:57:42,775 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:57:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:57:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:57:42,775 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:57:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:57:42,776 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:57:42,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:57:42,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:57:42,776 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:57:42,776 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:57:42,776 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-02-20 19:57:42,776 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-02-20 19:57:42,856 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:57:42,857 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:57:43,561 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:57:43,570 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:57:43,570 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2022-02-20 19:57:43,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:57:43 BoogieIcfgContainer [2022-02-20 19:57:43,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:57:43,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:57:43,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:57:43,575 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:57:43,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:57:42" (1/3) ... [2022-02-20 19:57:43,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c82eb37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:57:43, skipping insertion in model container [2022-02-20 19:57:43,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:42" (2/3) ... [2022-02-20 19:57:43,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c82eb37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:57:43, skipping insertion in model container [2022-02-20 19:57:43,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:57:43" (3/3) ... [2022-02-20 19:57:43,578 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.10.cil-1.c [2022-02-20 19:57:43,581 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:57:43,581 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:57:43,612 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:57:43,616 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:43,616 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:57:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 441 states, 383 states have (on average 1.6370757180156659) internal successors, (627), 391 states have internal predecessors, (627), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2022-02-20 19:57:43,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:43,644 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:43,645 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,645 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:43,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:43,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1192357691, now seen corresponding path program 1 times [2022-02-20 19:57:43,655 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:43,655 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623447472] [2022-02-20 19:57:43,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:43,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {484#(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); {485#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:43,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {485#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:43,904 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {485#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {446#(= ~q_read_ev~0 2)} #1689#return; {446#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:43,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {486#(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; {487#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:43,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {487#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {487#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:43,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#(= |old(~q_read_ev~0)| 0)} assume true; {487#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:43,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {487#(= |old(~q_read_ev~0)| 0)} {446#(= ~q_read_ev~0 2)} #1691#return; {445#false} is VALID [2022-02-20 19:57:43,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {444#true} havoc ~__retres1~0; {444#true} is VALID [2022-02-20 19:57:43,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {444#true} assume 1 == ~p_dw_pc~0; {444#true} is VALID [2022-02-20 19:57:43,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {444#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {444#true} is VALID [2022-02-20 19:57:43,970 INFO L290 TraceCheckUtils]: 3: Hoare triple {444#true} #res := ~__retres1~0; {444#true} is VALID [2022-02-20 19:57:43,970 INFO L290 TraceCheckUtils]: 4: Hoare triple {444#true} assume true; {444#true} is VALID [2022-02-20 19:57:43,971 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {444#true} {444#true} #1685#return; {444#true} is VALID [2022-02-20 19:57:43,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:43,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {444#true} havoc ~__retres1~1; {444#true} is VALID [2022-02-20 19:57:43,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {444#true} assume !(1 == ~c_dr_pc~0); {444#true} is VALID [2022-02-20 19:57:43,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {444#true} ~__retres1~1 := 0; {444#true} is VALID [2022-02-20 19:57:43,987 INFO L290 TraceCheckUtils]: 3: Hoare triple {444#true} #res := ~__retres1~1; {444#true} is VALID [2022-02-20 19:57:43,988 INFO L290 TraceCheckUtils]: 4: Hoare triple {444#true} assume true; {444#true} is VALID [2022-02-20 19:57:43,988 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {444#true} {444#true} #1687#return; {444#true} is VALID [2022-02-20 19:57:43,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {488#(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; {444#true} is VALID [2022-02-20 19:57:43,989 INFO L272 TraceCheckUtils]: 1: Hoare triple {444#true} call #t~ret8 := is_do_write_p_triggered(); {444#true} is VALID [2022-02-20 19:57:43,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {444#true} havoc ~__retres1~0; {444#true} is VALID [2022-02-20 19:57:43,989 INFO L290 TraceCheckUtils]: 3: Hoare triple {444#true} assume 1 == ~p_dw_pc~0; {444#true} is VALID [2022-02-20 19:57:43,989 INFO L290 TraceCheckUtils]: 4: Hoare triple {444#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {444#true} is VALID [2022-02-20 19:57:43,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {444#true} #res := ~__retres1~0; {444#true} is VALID [2022-02-20 19:57:43,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {444#true} assume true; {444#true} is VALID [2022-02-20 19:57:43,991 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {444#true} {444#true} #1685#return; {444#true} is VALID [2022-02-20 19:57:43,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {444#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {444#true} is VALID [2022-02-20 19:57:43,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {444#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {444#true} is VALID [2022-02-20 19:57:43,992 INFO L272 TraceCheckUtils]: 10: Hoare triple {444#true} call #t~ret9 := is_do_read_c_triggered(); {444#true} is VALID [2022-02-20 19:57:43,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {444#true} havoc ~__retres1~1; {444#true} is VALID [2022-02-20 19:57:43,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {444#true} assume !(1 == ~c_dr_pc~0); {444#true} is VALID [2022-02-20 19:57:43,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {444#true} ~__retres1~1 := 0; {444#true} is VALID [2022-02-20 19:57:43,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {444#true} #res := ~__retres1~1; {444#true} is VALID [2022-02-20 19:57:43,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {444#true} assume true; {444#true} is VALID [2022-02-20 19:57:43,993 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {444#true} {444#true} #1687#return; {444#true} is VALID [2022-02-20 19:57:43,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {444#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {444#true} is VALID [2022-02-20 19:57:43,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {444#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {444#true} is VALID [2022-02-20 19:57:43,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {444#true} assume true; {444#true} is VALID [2022-02-20 19:57:43,995 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {444#true} {445#false} #1693#return; {445#false} is VALID [2022-02-20 19:57:43,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {486#(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); {444#true} is VALID [2022-02-20 19:57:44,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {444#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {444#true} is VALID [2022-02-20 19:57:44,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {444#true} assume true; {444#true} is VALID [2022-02-20 19:57:44,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {444#true} {445#false} #1695#return; {445#false} is VALID [2022-02-20 19:57:44,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {444#true} havoc ~__retres1~2; {444#true} is VALID [2022-02-20 19:57:44,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {444#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {444#true} is VALID [2022-02-20 19:57:44,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {444#true} #res := ~__retres1~2; {444#true} is VALID [2022-02-20 19:57:44,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {444#true} assume true; {444#true} is VALID [2022-02-20 19:57:44,016 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {444#true} {445#false} #1697#return; {445#false} is VALID [2022-02-20 19:57:44,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {444#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {444#true} is VALID [2022-02-20 19:57:44,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {444#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {444#true} is VALID [2022-02-20 19:57:44,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {444#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#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; {446#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:44,018 INFO L290 TraceCheckUtils]: 3: Hoare triple {446#(= ~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; {446#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:44,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {446#(= ~q_read_ev~0 2)} call update_channels1(); {484#(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:44,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {484#(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); {485#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:44,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {485#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {485#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:44,020 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {485#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {446#(= ~q_read_ev~0 2)} #1689#return; {446#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:44,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {446#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {446#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:44,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {446#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {446#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:44,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {446#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {446#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:44,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {446#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {446#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:44,022 INFO L272 TraceCheckUtils]: 12: Hoare triple {446#(= ~q_read_ev~0 2)} call fire_delta_events1(); {486#(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:44,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {486#(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; {487#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:44,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {487#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {487#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:44,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {487#(= |old(~q_read_ev~0)| 0)} assume true; {487#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:44,023 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {487#(= |old(~q_read_ev~0)| 0)} {446#(= ~q_read_ev~0 2)} #1691#return; {445#false} is VALID [2022-02-20 19:57:44,023 INFO L272 TraceCheckUtils]: 17: Hoare triple {445#false} call activate_threads1(); {488#(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:44,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {488#(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; {444#true} is VALID [2022-02-20 19:57:44,024 INFO L272 TraceCheckUtils]: 19: Hoare triple {444#true} call #t~ret8 := is_do_write_p_triggered(); {444#true} is VALID [2022-02-20 19:57:44,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {444#true} havoc ~__retres1~0; {444#true} is VALID [2022-02-20 19:57:44,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {444#true} assume 1 == ~p_dw_pc~0; {444#true} is VALID [2022-02-20 19:57:44,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {444#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {444#true} is VALID [2022-02-20 19:57:44,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {444#true} #res := ~__retres1~0; {444#true} is VALID [2022-02-20 19:57:44,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {444#true} assume true; {444#true} is VALID [2022-02-20 19:57:44,025 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {444#true} {444#true} #1685#return; {444#true} is VALID [2022-02-20 19:57:44,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {444#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {444#true} is VALID [2022-02-20 19:57:44,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {444#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {444#true} is VALID [2022-02-20 19:57:44,025 INFO L272 TraceCheckUtils]: 28: Hoare triple {444#true} call #t~ret9 := is_do_read_c_triggered(); {444#true} is VALID [2022-02-20 19:57:44,026 INFO L290 TraceCheckUtils]: 29: Hoare triple {444#true} havoc ~__retres1~1; {444#true} is VALID [2022-02-20 19:57:44,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {444#true} assume !(1 == ~c_dr_pc~0); {444#true} is VALID [2022-02-20 19:57:44,026 INFO L290 TraceCheckUtils]: 31: Hoare triple {444#true} ~__retres1~1 := 0; {444#true} is VALID [2022-02-20 19:57:44,026 INFO L290 TraceCheckUtils]: 32: Hoare triple {444#true} #res := ~__retres1~1; {444#true} is VALID [2022-02-20 19:57:44,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {444#true} assume true; {444#true} is VALID [2022-02-20 19:57:44,027 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {444#true} {444#true} #1687#return; {444#true} is VALID [2022-02-20 19:57:44,027 INFO L290 TraceCheckUtils]: 35: Hoare triple {444#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {444#true} is VALID [2022-02-20 19:57:44,027 INFO L290 TraceCheckUtils]: 36: Hoare triple {444#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {444#true} is VALID [2022-02-20 19:57:44,027 INFO L290 TraceCheckUtils]: 37: Hoare triple {444#true} assume true; {444#true} is VALID [2022-02-20 19:57:44,027 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {444#true} {445#false} #1693#return; {445#false} is VALID [2022-02-20 19:57:44,027 INFO L272 TraceCheckUtils]: 39: Hoare triple {445#false} call reset_delta_events1(); {486#(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:44,028 INFO L290 TraceCheckUtils]: 40: Hoare triple {486#(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); {444#true} is VALID [2022-02-20 19:57:44,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {444#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {444#true} is VALID [2022-02-20 19:57:44,028 INFO L290 TraceCheckUtils]: 42: Hoare triple {444#true} assume true; {444#true} is VALID [2022-02-20 19:57:44,028 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {444#true} {445#false} #1695#return; {445#false} is VALID [2022-02-20 19:57:44,028 INFO L290 TraceCheckUtils]: 44: Hoare triple {445#false} assume !false; {445#false} is VALID [2022-02-20 19:57:44,029 INFO L290 TraceCheckUtils]: 45: Hoare triple {445#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; {445#false} is VALID [2022-02-20 19:57:44,029 INFO L290 TraceCheckUtils]: 46: Hoare triple {445#false} assume !false; {445#false} is VALID [2022-02-20 19:57:44,029 INFO L272 TraceCheckUtils]: 47: Hoare triple {445#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {444#true} is VALID [2022-02-20 19:57:44,029 INFO L290 TraceCheckUtils]: 48: Hoare triple {444#true} havoc ~__retres1~2; {444#true} is VALID [2022-02-20 19:57:44,029 INFO L290 TraceCheckUtils]: 49: Hoare triple {444#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {444#true} is VALID [2022-02-20 19:57:44,030 INFO L290 TraceCheckUtils]: 50: Hoare triple {444#true} #res := ~__retres1~2; {444#true} is VALID [2022-02-20 19:57:44,030 INFO L290 TraceCheckUtils]: 51: Hoare triple {444#true} assume true; {444#true} is VALID [2022-02-20 19:57:44,033 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {444#true} {445#false} #1697#return; {445#false} is VALID [2022-02-20 19:57:44,035 INFO L290 TraceCheckUtils]: 53: Hoare triple {445#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; {445#false} is VALID [2022-02-20 19:57:44,035 INFO L290 TraceCheckUtils]: 54: Hoare triple {445#false} assume 0 != eval1_~tmp___1~0#1; {445#false} is VALID [2022-02-20 19:57:44,036 INFO L290 TraceCheckUtils]: 55: Hoare triple {445#false} assume !(0 == ~p_dw_st~0); {445#false} is VALID [2022-02-20 19:57:44,036 INFO L290 TraceCheckUtils]: 56: Hoare triple {445#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; {445#false} is VALID [2022-02-20 19:57:44,036 INFO L290 TraceCheckUtils]: 57: Hoare triple {445#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; {445#false} is VALID [2022-02-20 19:57:44,036 INFO L290 TraceCheckUtils]: 58: Hoare triple {445#false} assume 0 == ~c_dr_pc~0; {445#false} is VALID [2022-02-20 19:57:44,036 INFO L290 TraceCheckUtils]: 59: Hoare triple {445#false} assume !false; {445#false} is VALID [2022-02-20 19:57:44,036 INFO L290 TraceCheckUtils]: 60: Hoare triple {445#false} assume !(1 == ~q_free~0); {445#false} is VALID [2022-02-20 19:57:44,037 INFO L290 TraceCheckUtils]: 61: Hoare triple {445#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; {445#false} is VALID [2022-02-20 19:57:44,037 INFO L290 TraceCheckUtils]: 62: Hoare triple {445#false} assume !(~p_last_write~0 == ~c_last_read~0); {445#false} is VALID [2022-02-20 19:57:44,037 INFO L272 TraceCheckUtils]: 63: Hoare triple {445#false} call error1(); {445#false} is VALID [2022-02-20 19:57:44,037 INFO L290 TraceCheckUtils]: 64: Hoare triple {445#false} assume !false; {445#false} is VALID [2022-02-20 19:57:44,040 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:44,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:44,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623447472] [2022-02-20 19:57:44,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623447472] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:44,042 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:44,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:44,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464988746] [2022-02-20 19:57:44,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:44,049 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:44,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:44,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 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:44,105 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:44,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:44,106 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:44,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:44,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:44,130 INFO L87 Difference]: Start difference. First operand has 441 states, 383 states have (on average 1.6370757180156659) internal successors, (627), 391 states have internal predecessors, (627), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:47,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:47,379 INFO L93 Difference]: Finished difference Result 990 states and 1576 transitions. [2022-02-20 19:57:47,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:57:47,379 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:47,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:47,380 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:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1576 transitions. [2022-02-20 19:57:47,406 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:47,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1576 transitions. [2022-02-20 19:57:47,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1576 transitions. [2022-02-20 19:57:48,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1576 edges. 1576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:48,475 INFO L225 Difference]: With dead ends: 990 [2022-02-20 19:57:48,475 INFO L226 Difference]: Without dead ends: 565 [2022-02-20 19:57:48,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:57:48,482 INFO L933 BasicCegarLoop]: 686 mSDtfsCounter, 1083 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:48,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1088 Valid, 2299 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:57:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-02-20 19:57:48,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 526. [2022-02-20 19:57:48,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:48,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 565 states. Second operand has 526 states, 451 states have (on average 1.5210643015521064) internal successors, (686), 458 states have internal predecessors, (686), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:57:48,537 INFO L74 IsIncluded]: Start isIncluded. First operand 565 states. Second operand has 526 states, 451 states have (on average 1.5210643015521064) internal successors, (686), 458 states have internal predecessors, (686), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:57:48,538 INFO L87 Difference]: Start difference. First operand 565 states. Second operand has 526 states, 451 states have (on average 1.5210643015521064) internal successors, (686), 458 states have internal predecessors, (686), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:57:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:48,563 INFO L93 Difference]: Finished difference Result 565 states and 843 transitions. [2022-02-20 19:57:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 843 transitions. [2022-02-20 19:57:48,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:48,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:48,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 526 states, 451 states have (on average 1.5210643015521064) internal successors, (686), 458 states have internal predecessors, (686), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) Second operand 565 states. [2022-02-20 19:57:48,570 INFO L87 Difference]: Start difference. First operand has 526 states, 451 states have (on average 1.5210643015521064) internal successors, (686), 458 states have internal predecessors, (686), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) Second operand 565 states. [2022-02-20 19:57:48,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:48,591 INFO L93 Difference]: Finished difference Result 565 states and 843 transitions. [2022-02-20 19:57:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 843 transitions. [2022-02-20 19:57:48,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:48,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:48,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:48,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 451 states have (on average 1.5210643015521064) internal successors, (686), 458 states have internal predecessors, (686), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-02-20 19:57:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 789 transitions. [2022-02-20 19:57:48,623 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 789 transitions. Word has length 65 [2022-02-20 19:57:48,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:48,624 INFO L470 AbstractCegarLoop]: Abstraction has 526 states and 789 transitions. [2022-02-20 19:57:48,624 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:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 789 transitions. [2022-02-20 19:57:48,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:48,627 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:48,627 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,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:57:48,628 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:48,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:48,628 INFO L85 PathProgramCache]: Analyzing trace with hash -929120350, now seen corresponding path program 1 times [2022-02-20 19:57:48,628 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:48,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538514544] [2022-02-20 19:57:48,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:48,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {3698#(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); {3699#(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,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {3699#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3699#(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,709 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3699#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3660#(= ~q_write_ev~0 ~q_read_ev~0)} #1689#return; {3660#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:48,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {3699#(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); {3700#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:48,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {3700#(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; {3701#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:48,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {3701#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3701#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:48,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3701#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3660#(= ~q_write_ev~0 ~q_read_ev~0)} #1691#return; {3659#false} is VALID [2022-02-20 19:57:48,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {3658#true} havoc ~__retres1~0; {3658#true} is VALID [2022-02-20 19:57:48,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {3658#true} assume !(1 == ~p_dw_pc~0); {3658#true} is VALID [2022-02-20 19:57:48,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {3658#true} ~__retres1~0 := 0; {3658#true} is VALID [2022-02-20 19:57:48,763 INFO L290 TraceCheckUtils]: 3: Hoare triple {3658#true} #res := ~__retres1~0; {3658#true} is VALID [2022-02-20 19:57:48,763 INFO L290 TraceCheckUtils]: 4: Hoare triple {3658#true} assume true; {3658#true} is VALID [2022-02-20 19:57:48,763 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3658#true} {3658#true} #1685#return; {3658#true} is VALID [2022-02-20 19:57:48,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {3658#true} havoc ~__retres1~1; {3658#true} is VALID [2022-02-20 19:57:48,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {3658#true} assume !(1 == ~c_dr_pc~0); {3658#true} is VALID [2022-02-20 19:57:48,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {3658#true} ~__retres1~1 := 0; {3658#true} is VALID [2022-02-20 19:57:48,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {3658#true} #res := ~__retres1~1; {3658#true} is VALID [2022-02-20 19:57:48,766 INFO L290 TraceCheckUtils]: 4: Hoare triple {3658#true} assume true; {3658#true} is VALID [2022-02-20 19:57:48,767 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3658#true} {3658#true} #1687#return; {3658#true} is VALID [2022-02-20 19:57:48,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {3702#(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; {3658#true} is VALID [2022-02-20 19:57:48,767 INFO L272 TraceCheckUtils]: 1: Hoare triple {3658#true} call #t~ret8 := is_do_write_p_triggered(); {3658#true} is VALID [2022-02-20 19:57:48,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {3658#true} havoc ~__retres1~0; {3658#true} is VALID [2022-02-20 19:57:48,767 INFO L290 TraceCheckUtils]: 3: Hoare triple {3658#true} assume !(1 == ~p_dw_pc~0); {3658#true} is VALID [2022-02-20 19:57:48,767 INFO L290 TraceCheckUtils]: 4: Hoare triple {3658#true} ~__retres1~0 := 0; {3658#true} is VALID [2022-02-20 19:57:48,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {3658#true} #res := ~__retres1~0; {3658#true} is VALID [2022-02-20 19:57:48,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {3658#true} assume true; {3658#true} is VALID [2022-02-20 19:57:48,768 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3658#true} {3658#true} #1685#return; {3658#true} is VALID [2022-02-20 19:57:48,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {3658#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3658#true} is VALID [2022-02-20 19:57:48,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {3658#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3658#true} is VALID [2022-02-20 19:57:48,768 INFO L272 TraceCheckUtils]: 10: Hoare triple {3658#true} call #t~ret9 := is_do_read_c_triggered(); {3658#true} is VALID [2022-02-20 19:57:48,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {3658#true} havoc ~__retres1~1; {3658#true} is VALID [2022-02-20 19:57:48,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {3658#true} assume !(1 == ~c_dr_pc~0); {3658#true} is VALID [2022-02-20 19:57:48,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {3658#true} ~__retres1~1 := 0; {3658#true} is VALID [2022-02-20 19:57:48,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {3658#true} #res := ~__retres1~1; {3658#true} is VALID [2022-02-20 19:57:48,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {3658#true} assume true; {3658#true} is VALID [2022-02-20 19:57:48,769 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3658#true} {3658#true} #1687#return; {3658#true} is VALID [2022-02-20 19:57:48,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {3658#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3658#true} is VALID [2022-02-20 19:57:48,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {3658#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3658#true} is VALID [2022-02-20 19:57:48,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {3658#true} assume true; {3658#true} is VALID [2022-02-20 19:57:48,770 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3658#true} {3659#false} #1693#return; {3659#false} is VALID [2022-02-20 19:57:48,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {3699#(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); {3658#true} is VALID [2022-02-20 19:57:48,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {3658#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3658#true} is VALID [2022-02-20 19:57:48,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {3658#true} assume true; {3658#true} is VALID [2022-02-20 19:57:48,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3658#true} {3659#false} #1695#return; {3659#false} is VALID [2022-02-20 19:57:48,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:48,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {3658#true} havoc ~__retres1~2; {3658#true} is VALID [2022-02-20 19:57:48,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {3658#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3658#true} is VALID [2022-02-20 19:57:48,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {3658#true} #res := ~__retres1~2; {3658#true} is VALID [2022-02-20 19:57:48,778 INFO L290 TraceCheckUtils]: 3: Hoare triple {3658#true} assume true; {3658#true} is VALID [2022-02-20 19:57:48,778 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3658#true} {3659#false} #1697#return; {3659#false} is VALID [2022-02-20 19:57:48,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {3658#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {3658#true} is VALID [2022-02-20 19:57:48,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {3658#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {3658#true} is VALID [2022-02-20 19:57:48,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {3658#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#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; {3660#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:48,779 INFO L290 TraceCheckUtils]: 3: Hoare triple {3660#(= ~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; {3660#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:48,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {3660#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {3698#(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,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {3698#(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); {3699#(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,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {3699#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {3699#(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,781 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3699#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {3660#(= ~q_write_ev~0 ~q_read_ev~0)} #1689#return; {3660#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:48,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {3660#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {3660#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:48,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {3660#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {3660#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:48,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {3660#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {3660#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:48,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {3660#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {3660#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:48,793 INFO L272 TraceCheckUtils]: 12: Hoare triple {3660#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {3699#(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,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {3699#(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); {3700#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:48,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {3700#(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; {3701#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:48,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {3701#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {3701#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:48,794 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3701#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {3660#(= ~q_write_ev~0 ~q_read_ev~0)} #1691#return; {3659#false} is VALID [2022-02-20 19:57:48,794 INFO L272 TraceCheckUtils]: 17: Hoare triple {3659#false} call activate_threads1(); {3702#(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,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {3702#(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; {3658#true} is VALID [2022-02-20 19:57:48,795 INFO L272 TraceCheckUtils]: 19: Hoare triple {3658#true} call #t~ret8 := is_do_write_p_triggered(); {3658#true} is VALID [2022-02-20 19:57:48,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {3658#true} havoc ~__retres1~0; {3658#true} is VALID [2022-02-20 19:57:48,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {3658#true} assume !(1 == ~p_dw_pc~0); {3658#true} is VALID [2022-02-20 19:57:48,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {3658#true} ~__retres1~0 := 0; {3658#true} is VALID [2022-02-20 19:57:48,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {3658#true} #res := ~__retres1~0; {3658#true} is VALID [2022-02-20 19:57:48,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {3658#true} assume true; {3658#true} is VALID [2022-02-20 19:57:48,796 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3658#true} {3658#true} #1685#return; {3658#true} is VALID [2022-02-20 19:57:48,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {3658#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {3658#true} is VALID [2022-02-20 19:57:48,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {3658#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {3658#true} is VALID [2022-02-20 19:57:48,796 INFO L272 TraceCheckUtils]: 28: Hoare triple {3658#true} call #t~ret9 := is_do_read_c_triggered(); {3658#true} is VALID [2022-02-20 19:57:48,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {3658#true} havoc ~__retres1~1; {3658#true} is VALID [2022-02-20 19:57:48,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {3658#true} assume !(1 == ~c_dr_pc~0); {3658#true} is VALID [2022-02-20 19:57:48,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {3658#true} ~__retres1~1 := 0; {3658#true} is VALID [2022-02-20 19:57:48,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {3658#true} #res := ~__retres1~1; {3658#true} is VALID [2022-02-20 19:57:48,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {3658#true} assume true; {3658#true} is VALID [2022-02-20 19:57:48,797 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3658#true} {3658#true} #1687#return; {3658#true} is VALID [2022-02-20 19:57:48,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {3658#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {3658#true} is VALID [2022-02-20 19:57:48,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {3658#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {3658#true} is VALID [2022-02-20 19:57:48,798 INFO L290 TraceCheckUtils]: 37: Hoare triple {3658#true} assume true; {3658#true} is VALID [2022-02-20 19:57:48,798 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3658#true} {3659#false} #1693#return; {3659#false} is VALID [2022-02-20 19:57:48,798 INFO L272 TraceCheckUtils]: 39: Hoare triple {3659#false} call reset_delta_events1(); {3699#(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,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {3699#(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); {3658#true} is VALID [2022-02-20 19:57:48,798 INFO L290 TraceCheckUtils]: 41: Hoare triple {3658#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {3658#true} is VALID [2022-02-20 19:57:48,798 INFO L290 TraceCheckUtils]: 42: Hoare triple {3658#true} assume true; {3658#true} is VALID [2022-02-20 19:57:48,799 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {3658#true} {3659#false} #1695#return; {3659#false} is VALID [2022-02-20 19:57:48,799 INFO L290 TraceCheckUtils]: 44: Hoare triple {3659#false} assume !false; {3659#false} is VALID [2022-02-20 19:57:48,799 INFO L290 TraceCheckUtils]: 45: Hoare triple {3659#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; {3659#false} is VALID [2022-02-20 19:57:48,799 INFO L290 TraceCheckUtils]: 46: Hoare triple {3659#false} assume !false; {3659#false} is VALID [2022-02-20 19:57:48,799 INFO L272 TraceCheckUtils]: 47: Hoare triple {3659#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {3658#true} is VALID [2022-02-20 19:57:48,799 INFO L290 TraceCheckUtils]: 48: Hoare triple {3658#true} havoc ~__retres1~2; {3658#true} is VALID [2022-02-20 19:57:48,800 INFO L290 TraceCheckUtils]: 49: Hoare triple {3658#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {3658#true} is VALID [2022-02-20 19:57:48,800 INFO L290 TraceCheckUtils]: 50: Hoare triple {3658#true} #res := ~__retres1~2; {3658#true} is VALID [2022-02-20 19:57:48,800 INFO L290 TraceCheckUtils]: 51: Hoare triple {3658#true} assume true; {3658#true} is VALID [2022-02-20 19:57:48,800 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3658#true} {3659#false} #1697#return; {3659#false} is VALID [2022-02-20 19:57:48,800 INFO L290 TraceCheckUtils]: 53: Hoare triple {3659#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; {3659#false} is VALID [2022-02-20 19:57:48,800 INFO L290 TraceCheckUtils]: 54: Hoare triple {3659#false} assume 0 != eval1_~tmp___1~0#1; {3659#false} is VALID [2022-02-20 19:57:48,801 INFO L290 TraceCheckUtils]: 55: Hoare triple {3659#false} assume !(0 == ~p_dw_st~0); {3659#false} is VALID [2022-02-20 19:57:48,801 INFO L290 TraceCheckUtils]: 56: Hoare triple {3659#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; {3659#false} is VALID [2022-02-20 19:57:48,801 INFO L290 TraceCheckUtils]: 57: Hoare triple {3659#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; {3659#false} is VALID [2022-02-20 19:57:48,801 INFO L290 TraceCheckUtils]: 58: Hoare triple {3659#false} assume 0 == ~c_dr_pc~0; {3659#false} is VALID [2022-02-20 19:57:48,801 INFO L290 TraceCheckUtils]: 59: Hoare triple {3659#false} assume !false; {3659#false} is VALID [2022-02-20 19:57:48,801 INFO L290 TraceCheckUtils]: 60: Hoare triple {3659#false} assume !(1 == ~q_free~0); {3659#false} is VALID [2022-02-20 19:57:48,802 INFO L290 TraceCheckUtils]: 61: Hoare triple {3659#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; {3659#false} is VALID [2022-02-20 19:57:48,802 INFO L290 TraceCheckUtils]: 62: Hoare triple {3659#false} assume !(~p_last_write~0 == ~c_last_read~0); {3659#false} is VALID [2022-02-20 19:57:48,802 INFO L272 TraceCheckUtils]: 63: Hoare triple {3659#false} call error1(); {3659#false} is VALID [2022-02-20 19:57:48,802 INFO L290 TraceCheckUtils]: 64: Hoare triple {3659#false} assume !false; {3659#false} is VALID [2022-02-20 19:57:48,802 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,803 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:48,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538514544] [2022-02-20 19:57:48,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538514544] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:48,803 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:48,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:48,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50626784] [2022-02-20 19:57:48,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:48,805 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:48,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:48,805 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:48,842 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,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:48,842 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:48,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:48,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:48,843 INFO L87 Difference]: Start difference. First operand 526 states and 789 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:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:52,217 INFO L93 Difference]: Finished difference Result 873 states and 1266 transitions. [2022-02-20 19:57:52,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:57:52,218 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:52,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:52,218 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:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 995 transitions. [2022-02-20 19:57:52,226 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:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 995 transitions. [2022-02-20 19:57:52,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 995 transitions. [2022-02-20 19:57:52,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 995 edges. 995 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:52,955 INFO L225 Difference]: With dead ends: 873 [2022-02-20 19:57:52,955 INFO L226 Difference]: Without dead ends: 696 [2022-02-20 19:57:52,959 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:52,961 INFO L933 BasicCegarLoop]: 717 mSDtfsCounter, 1292 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:52,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1321 Valid, 2484 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:57:52,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-02-20 19:57:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 622. [2022-02-20 19:57:52,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:52,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 696 states. Second operand has 622 states, 527 states have (on average 1.4990512333965844) internal successors, (790), 536 states have internal predecessors, (790), 62 states have call successors, (62), 29 states have call predecessors, (62), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) [2022-02-20 19:57:53,001 INFO L74 IsIncluded]: Start isIncluded. First operand 696 states. Second operand has 622 states, 527 states have (on average 1.4990512333965844) internal successors, (790), 536 states have internal predecessors, (790), 62 states have call successors, (62), 29 states have call predecessors, (62), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) [2022-02-20 19:57:53,003 INFO L87 Difference]: Start difference. First operand 696 states. Second operand has 622 states, 527 states have (on average 1.4990512333965844) internal successors, (790), 536 states have internal predecessors, (790), 62 states have call successors, (62), 29 states have call predecessors, (62), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) [2022-02-20 19:57:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:53,026 INFO L93 Difference]: Finished difference Result 696 states and 1026 transitions. [2022-02-20 19:57:53,026 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1026 transitions. [2022-02-20 19:57:53,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:53,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:53,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 622 states, 527 states have (on average 1.4990512333965844) internal successors, (790), 536 states have internal predecessors, (790), 62 states have call successors, (62), 29 states have call predecessors, (62), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) Second operand 696 states. [2022-02-20 19:57:53,032 INFO L87 Difference]: Start difference. First operand has 622 states, 527 states have (on average 1.4990512333965844) internal successors, (790), 536 states have internal predecessors, (790), 62 states have call successors, (62), 29 states have call predecessors, (62), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) Second operand 696 states. [2022-02-20 19:57:53,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:53,055 INFO L93 Difference]: Finished difference Result 696 states and 1026 transitions. [2022-02-20 19:57:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1026 transitions. [2022-02-20 19:57:53,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:53,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:53,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:53,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:53,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 527 states have (on average 1.4990512333965844) internal successors, (790), 536 states have internal predecessors, (790), 62 states have call successors, (62), 29 states have call predecessors, (62), 31 states have return successors, (71), 60 states have call predecessors, (71), 58 states have call successors, (71) [2022-02-20 19:57:53,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 923 transitions. [2022-02-20 19:57:53,082 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 923 transitions. Word has length 65 [2022-02-20 19:57:53,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:53,083 INFO L470 AbstractCegarLoop]: Abstraction has 622 states and 923 transitions. [2022-02-20 19:57:53,083 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:53,084 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 923 transitions. [2022-02-20 19:57:53,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:53,085 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:53,085 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:53,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:57:53,085 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:53,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:53,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1337260836, now seen corresponding path program 1 times [2022-02-20 19:57:53,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:53,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854279701] [2022-02-20 19:57:53,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:53,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:53,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:53,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {7164#(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); {7125#true} is VALID [2022-02-20 19:57:53,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {7125#true} assume true; {7125#true} is VALID [2022-02-20 19:57:53,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7125#true} {7125#true} #1689#return; {7125#true} is VALID [2022-02-20 19:57:53,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:53,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {7165#(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); {7125#true} is VALID [2022-02-20 19:57:53,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {7125#true} assume !(0 == ~q_write_ev~0); {7125#true} is VALID [2022-02-20 19:57:53,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {7125#true} assume true; {7125#true} is VALID [2022-02-20 19:57:53,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7125#true} {7125#true} #1691#return; {7125#true} is VALID [2022-02-20 19:57:53,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:53,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:53,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {7125#true} havoc ~__retres1~0; {7125#true} is VALID [2022-02-20 19:57:53,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {7125#true} assume !(1 == ~p_dw_pc~0); {7125#true} is VALID [2022-02-20 19:57:53,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {7125#true} ~__retres1~0 := 0; {7181#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:53,249 INFO L290 TraceCheckUtils]: 3: Hoare triple {7181#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7182#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:53,249 INFO L290 TraceCheckUtils]: 4: Hoare triple {7182#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7182#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:53,250 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7182#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7125#true} #1685#return; {7173#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:53,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:53,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {7125#true} havoc ~__retres1~1; {7125#true} is VALID [2022-02-20 19:57:53,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {7125#true} assume !(1 == ~c_dr_pc~0); {7125#true} is VALID [2022-02-20 19:57:53,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {7125#true} ~__retres1~1 := 0; {7125#true} is VALID [2022-02-20 19:57:53,258 INFO L290 TraceCheckUtils]: 3: Hoare triple {7125#true} #res := ~__retres1~1; {7125#true} is VALID [2022-02-20 19:57:53,260 INFO L290 TraceCheckUtils]: 4: Hoare triple {7125#true} assume true; {7125#true} is VALID [2022-02-20 19:57:53,262 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7125#true} {7126#false} #1687#return; {7126#false} is VALID [2022-02-20 19:57:53,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {7166#(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; {7125#true} is VALID [2022-02-20 19:57:53,263 INFO L272 TraceCheckUtils]: 1: Hoare triple {7125#true} call #t~ret8 := is_do_write_p_triggered(); {7125#true} is VALID [2022-02-20 19:57:53,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {7125#true} havoc ~__retres1~0; {7125#true} is VALID [2022-02-20 19:57:53,265 INFO L290 TraceCheckUtils]: 3: Hoare triple {7125#true} assume !(1 == ~p_dw_pc~0); {7125#true} is VALID [2022-02-20 19:57:53,266 INFO L290 TraceCheckUtils]: 4: Hoare triple {7125#true} ~__retres1~0 := 0; {7181#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:53,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {7181#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7182#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:53,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {7182#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7182#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:53,267 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7182#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7125#true} #1685#return; {7173#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:53,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {7173#(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; {7174#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:53,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {7174#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7126#false} is VALID [2022-02-20 19:57:53,268 INFO L272 TraceCheckUtils]: 10: Hoare triple {7126#false} call #t~ret9 := is_do_read_c_triggered(); {7125#true} is VALID [2022-02-20 19:57:53,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {7125#true} havoc ~__retres1~1; {7125#true} is VALID [2022-02-20 19:57:53,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {7125#true} assume !(1 == ~c_dr_pc~0); {7125#true} is VALID [2022-02-20 19:57:53,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {7125#true} ~__retres1~1 := 0; {7125#true} is VALID [2022-02-20 19:57:53,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {7125#true} #res := ~__retres1~1; {7125#true} is VALID [2022-02-20 19:57:53,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {7125#true} assume true; {7125#true} is VALID [2022-02-20 19:57:53,269 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7125#true} {7126#false} #1687#return; {7126#false} is VALID [2022-02-20 19:57:53,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {7126#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7126#false} is VALID [2022-02-20 19:57:53,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {7126#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7126#false} is VALID [2022-02-20 19:57:53,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {7126#false} assume true; {7126#false} is VALID [2022-02-20 19:57:53,269 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7126#false} {7125#true} #1693#return; {7126#false} is VALID [2022-02-20 19:57:53,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:53,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {7165#(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); {7125#true} is VALID [2022-02-20 19:57:53,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {7125#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7125#true} is VALID [2022-02-20 19:57:53,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {7125#true} assume true; {7125#true} is VALID [2022-02-20 19:57:53,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7125#true} {7126#false} #1695#return; {7126#false} is VALID [2022-02-20 19:57:53,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:53,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {7125#true} havoc ~__retres1~2; {7125#true} is VALID [2022-02-20 19:57:53,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {7125#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7125#true} is VALID [2022-02-20 19:57:53,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {7125#true} #res := ~__retres1~2; {7125#true} is VALID [2022-02-20 19:57:53,276 INFO L290 TraceCheckUtils]: 3: Hoare triple {7125#true} assume true; {7125#true} is VALID [2022-02-20 19:57:53,276 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7125#true} {7126#false} #1697#return; {7126#false} is VALID [2022-02-20 19:57:53,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {7125#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {7125#true} is VALID [2022-02-20 19:57:53,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {7125#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {7125#true} is VALID [2022-02-20 19:57:53,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {7125#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#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; {7125#true} is VALID [2022-02-20 19:57:53,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {7125#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; {7125#true} is VALID [2022-02-20 19:57:53,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {7125#true} call update_channels1(); {7164#(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:53,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {7164#(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); {7125#true} is VALID [2022-02-20 19:57:53,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {7125#true} assume true; {7125#true} is VALID [2022-02-20 19:57:53,278 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7125#true} {7125#true} #1689#return; {7125#true} is VALID [2022-02-20 19:57:53,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {7125#true} assume { :begin_inline_init_threads1 } true; {7125#true} is VALID [2022-02-20 19:57:53,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {7125#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7125#true} is VALID [2022-02-20 19:57:53,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {7125#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7125#true} is VALID [2022-02-20 19:57:53,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {7125#true} assume { :end_inline_init_threads1 } true; {7125#true} is VALID [2022-02-20 19:57:53,278 INFO L272 TraceCheckUtils]: 12: Hoare triple {7125#true} call fire_delta_events1(); {7165#(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:53,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {7165#(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); {7125#true} is VALID [2022-02-20 19:57:53,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {7125#true} assume !(0 == ~q_write_ev~0); {7125#true} is VALID [2022-02-20 19:57:53,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {7125#true} assume true; {7125#true} is VALID [2022-02-20 19:57:53,279 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7125#true} {7125#true} #1691#return; {7125#true} is VALID [2022-02-20 19:57:53,279 INFO L272 TraceCheckUtils]: 17: Hoare triple {7125#true} call activate_threads1(); {7166#(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:53,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {7166#(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; {7125#true} is VALID [2022-02-20 19:57:53,280 INFO L272 TraceCheckUtils]: 19: Hoare triple {7125#true} call #t~ret8 := is_do_write_p_triggered(); {7125#true} is VALID [2022-02-20 19:57:53,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {7125#true} havoc ~__retres1~0; {7125#true} is VALID [2022-02-20 19:57:53,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {7125#true} assume !(1 == ~p_dw_pc~0); {7125#true} is VALID [2022-02-20 19:57:53,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {7125#true} ~__retres1~0 := 0; {7181#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:53,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {7181#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {7182#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:53,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {7182#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {7182#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:53,281 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7182#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {7125#true} #1685#return; {7173#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:53,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {7173#(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; {7174#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:53,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {7174#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {7126#false} is VALID [2022-02-20 19:57:53,282 INFO L272 TraceCheckUtils]: 28: Hoare triple {7126#false} call #t~ret9 := is_do_read_c_triggered(); {7125#true} is VALID [2022-02-20 19:57:53,283 INFO L290 TraceCheckUtils]: 29: Hoare triple {7125#true} havoc ~__retres1~1; {7125#true} is VALID [2022-02-20 19:57:53,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {7125#true} assume !(1 == ~c_dr_pc~0); {7125#true} is VALID [2022-02-20 19:57:53,283 INFO L290 TraceCheckUtils]: 31: Hoare triple {7125#true} ~__retres1~1 := 0; {7125#true} is VALID [2022-02-20 19:57:53,283 INFO L290 TraceCheckUtils]: 32: Hoare triple {7125#true} #res := ~__retres1~1; {7125#true} is VALID [2022-02-20 19:57:53,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {7125#true} assume true; {7125#true} is VALID [2022-02-20 19:57:53,283 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7125#true} {7126#false} #1687#return; {7126#false} is VALID [2022-02-20 19:57:53,283 INFO L290 TraceCheckUtils]: 35: Hoare triple {7126#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7126#false} is VALID [2022-02-20 19:57:53,283 INFO L290 TraceCheckUtils]: 36: Hoare triple {7126#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7126#false} is VALID [2022-02-20 19:57:53,284 INFO L290 TraceCheckUtils]: 37: Hoare triple {7126#false} assume true; {7126#false} is VALID [2022-02-20 19:57:53,284 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7126#false} {7125#true} #1693#return; {7126#false} is VALID [2022-02-20 19:57:53,284 INFO L272 TraceCheckUtils]: 39: Hoare triple {7126#false} call reset_delta_events1(); {7165#(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:53,284 INFO L290 TraceCheckUtils]: 40: Hoare triple {7165#(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); {7125#true} is VALID [2022-02-20 19:57:53,284 INFO L290 TraceCheckUtils]: 41: Hoare triple {7125#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {7125#true} is VALID [2022-02-20 19:57:53,284 INFO L290 TraceCheckUtils]: 42: Hoare triple {7125#true} assume true; {7125#true} is VALID [2022-02-20 19:57:53,284 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7125#true} {7126#false} #1695#return; {7126#false} is VALID [2022-02-20 19:57:53,284 INFO L290 TraceCheckUtils]: 44: Hoare triple {7126#false} assume !false; {7126#false} is VALID [2022-02-20 19:57:53,285 INFO L290 TraceCheckUtils]: 45: Hoare triple {7126#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; {7126#false} is VALID [2022-02-20 19:57:53,285 INFO L290 TraceCheckUtils]: 46: Hoare triple {7126#false} assume !false; {7126#false} is VALID [2022-02-20 19:57:53,285 INFO L272 TraceCheckUtils]: 47: Hoare triple {7126#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7125#true} is VALID [2022-02-20 19:57:53,285 INFO L290 TraceCheckUtils]: 48: Hoare triple {7125#true} havoc ~__retres1~2; {7125#true} is VALID [2022-02-20 19:57:53,285 INFO L290 TraceCheckUtils]: 49: Hoare triple {7125#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7125#true} is VALID [2022-02-20 19:57:53,285 INFO L290 TraceCheckUtils]: 50: Hoare triple {7125#true} #res := ~__retres1~2; {7125#true} is VALID [2022-02-20 19:57:53,285 INFO L290 TraceCheckUtils]: 51: Hoare triple {7125#true} assume true; {7125#true} is VALID [2022-02-20 19:57:53,285 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7125#true} {7126#false} #1697#return; {7126#false} is VALID [2022-02-20 19:57:53,286 INFO L290 TraceCheckUtils]: 53: Hoare triple {7126#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; {7126#false} is VALID [2022-02-20 19:57:53,286 INFO L290 TraceCheckUtils]: 54: Hoare triple {7126#false} assume 0 != eval1_~tmp___1~0#1; {7126#false} is VALID [2022-02-20 19:57:53,286 INFO L290 TraceCheckUtils]: 55: Hoare triple {7126#false} assume !(0 == ~p_dw_st~0); {7126#false} is VALID [2022-02-20 19:57:53,286 INFO L290 TraceCheckUtils]: 56: Hoare triple {7126#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; {7126#false} is VALID [2022-02-20 19:57:53,286 INFO L290 TraceCheckUtils]: 57: Hoare triple {7126#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; {7126#false} is VALID [2022-02-20 19:57:53,286 INFO L290 TraceCheckUtils]: 58: Hoare triple {7126#false} assume 0 == ~c_dr_pc~0; {7126#false} is VALID [2022-02-20 19:57:53,286 INFO L290 TraceCheckUtils]: 59: Hoare triple {7126#false} assume !false; {7126#false} is VALID [2022-02-20 19:57:53,286 INFO L290 TraceCheckUtils]: 60: Hoare triple {7126#false} assume !(1 == ~q_free~0); {7126#false} is VALID [2022-02-20 19:57:53,287 INFO L290 TraceCheckUtils]: 61: Hoare triple {7126#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; {7126#false} is VALID [2022-02-20 19:57:53,287 INFO L290 TraceCheckUtils]: 62: Hoare triple {7126#false} assume !(~p_last_write~0 == ~c_last_read~0); {7126#false} is VALID [2022-02-20 19:57:53,287 INFO L272 TraceCheckUtils]: 63: Hoare triple {7126#false} call error1(); {7126#false} is VALID [2022-02-20 19:57:53,287 INFO L290 TraceCheckUtils]: 64: Hoare triple {7126#false} assume !false; {7126#false} is VALID [2022-02-20 19:57:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:53,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:53,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854279701] [2022-02-20 19:57:53,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854279701] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:53,288 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:53,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:53,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585804428] [2022-02-20 19:57:53,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:53,289 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:53,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:53,289 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:53,320 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:53,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:53,321 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:53,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:53,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:53,321 INFO L87 Difference]: Start difference. First operand 622 states and 923 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:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:56,515 INFO L93 Difference]: Finished difference Result 923 states and 1337 transitions. [2022-02-20 19:57:56,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:56,516 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:56,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:56,516 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,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 813 transitions. [2022-02-20 19:57:56,521 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,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 813 transitions. [2022-02-20 19:57:56,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 813 transitions. [2022-02-20 19:57:57,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 813 edges. 813 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:57,065 INFO L225 Difference]: With dead ends: 923 [2022-02-20 19:57:57,065 INFO L226 Difference]: Without dead ends: 656 [2022-02-20 19:57:57,066 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:57,067 INFO L933 BasicCegarLoop]: 645 mSDtfsCounter, 851 mSDsluCounter, 1939 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:57,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [852 Valid, 2584 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:57:57,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2022-02-20 19:57:57,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 627. [2022-02-20 19:57:57,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:57,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 656 states. Second operand has 627 states, 531 states have (on average 1.4915254237288136) internal successors, (792), 540 states have internal predecessors, (792), 62 states have call successors, (62), 29 states have call predecessors, (62), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) [2022-02-20 19:57:57,089 INFO L74 IsIncluded]: Start isIncluded. First operand 656 states. Second operand has 627 states, 531 states have (on average 1.4915254237288136) internal successors, (792), 540 states have internal predecessors, (792), 62 states have call successors, (62), 29 states have call predecessors, (62), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) [2022-02-20 19:57:57,090 INFO L87 Difference]: Start difference. First operand 656 states. Second operand has 627 states, 531 states have (on average 1.4915254237288136) internal successors, (792), 540 states have internal predecessors, (792), 62 states have call successors, (62), 29 states have call predecessors, (62), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) [2022-02-20 19:57:57,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:57,107 INFO L93 Difference]: Finished difference Result 656 states and 967 transitions. [2022-02-20 19:57:57,107 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 967 transitions. [2022-02-20 19:57:57,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:57,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:57,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 627 states, 531 states have (on average 1.4915254237288136) internal successors, (792), 540 states have internal predecessors, (792), 62 states have call successors, (62), 29 states have call predecessors, (62), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) Second operand 656 states. [2022-02-20 19:57:57,110 INFO L87 Difference]: Start difference. First operand has 627 states, 531 states have (on average 1.4915254237288136) internal successors, (792), 540 states have internal predecessors, (792), 62 states have call successors, (62), 29 states have call predecessors, (62), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) Second operand 656 states. [2022-02-20 19:57:57,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:57,127 INFO L93 Difference]: Finished difference Result 656 states and 967 transitions. [2022-02-20 19:57:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 967 transitions. [2022-02-20 19:57:57,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:57,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:57,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:57,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:57,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 531 states have (on average 1.4915254237288136) internal successors, (792), 540 states have internal predecessors, (792), 62 states have call successors, (62), 29 states have call predecessors, (62), 32 states have return successors, (72), 61 states have call predecessors, (72), 58 states have call successors, (72) [2022-02-20 19:57:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 926 transitions. [2022-02-20 19:57:57,149 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 926 transitions. Word has length 65 [2022-02-20 19:57:57,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:57,149 INFO L470 AbstractCegarLoop]: Abstraction has 627 states and 926 transitions. [2022-02-20 19:57:57,149 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:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 926 transitions. [2022-02-20 19:57:57,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:57,150 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:57,150 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:57,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:57:57,151 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:57,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:57,151 INFO L85 PathProgramCache]: Analyzing trace with hash 307901538, now seen corresponding path program 1 times [2022-02-20 19:57:57,151 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:57,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331683670] [2022-02-20 19:57:57,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:57,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {10616#(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); {10577#true} is VALID [2022-02-20 19:57:57,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {10577#true} assume true; {10577#true} is VALID [2022-02-20 19:57:57,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10577#true} {10577#true} #1689#return; {10577#true} is VALID [2022-02-20 19:57:57,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {10617#(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); {10577#true} is VALID [2022-02-20 19:57:57,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {10577#true} assume !(0 == ~q_write_ev~0); {10577#true} is VALID [2022-02-20 19:57:57,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {10577#true} assume true; {10577#true} is VALID [2022-02-20 19:57:57,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10577#true} {10577#true} #1691#return; {10577#true} is VALID [2022-02-20 19:57:57,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {10577#true} havoc ~__retres1~0; {10577#true} is VALID [2022-02-20 19:57:57,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {10577#true} assume !(1 == ~p_dw_pc~0); {10577#true} is VALID [2022-02-20 19:57:57,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {10577#true} ~__retres1~0 := 0; {10577#true} is VALID [2022-02-20 19:57:57,260 INFO L290 TraceCheckUtils]: 3: Hoare triple {10577#true} #res := ~__retres1~0; {10577#true} is VALID [2022-02-20 19:57:57,260 INFO L290 TraceCheckUtils]: 4: Hoare triple {10577#true} assume true; {10577#true} is VALID [2022-02-20 19:57:57,260 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10577#true} {10577#true} #1685#return; {10577#true} is VALID [2022-02-20 19:57:57,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {10577#true} havoc ~__retres1~1; {10577#true} is VALID [2022-02-20 19:57:57,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {10577#true} assume !(1 == ~c_dr_pc~0); {10577#true} is VALID [2022-02-20 19:57:57,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {10577#true} ~__retres1~1 := 0; {10633#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:57,293 INFO L290 TraceCheckUtils]: 3: Hoare triple {10633#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10634#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:57,293 INFO L290 TraceCheckUtils]: 4: Hoare triple {10634#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10634#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:57,293 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10634#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10577#true} #1687#return; {10631#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:57,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {10618#(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; {10577#true} is VALID [2022-02-20 19:57:57,294 INFO L272 TraceCheckUtils]: 1: Hoare triple {10577#true} call #t~ret8 := is_do_write_p_triggered(); {10577#true} is VALID [2022-02-20 19:57:57,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {10577#true} havoc ~__retres1~0; {10577#true} is VALID [2022-02-20 19:57:57,294 INFO L290 TraceCheckUtils]: 3: Hoare triple {10577#true} assume !(1 == ~p_dw_pc~0); {10577#true} is VALID [2022-02-20 19:57:57,294 INFO L290 TraceCheckUtils]: 4: Hoare triple {10577#true} ~__retres1~0 := 0; {10577#true} is VALID [2022-02-20 19:57:57,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {10577#true} #res := ~__retres1~0; {10577#true} is VALID [2022-02-20 19:57:57,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {10577#true} assume true; {10577#true} is VALID [2022-02-20 19:57:57,294 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10577#true} {10577#true} #1685#return; {10577#true} is VALID [2022-02-20 19:57:57,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {10577#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10577#true} is VALID [2022-02-20 19:57:57,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {10577#true} assume !(0 != ~tmp~1); {10577#true} is VALID [2022-02-20 19:57:57,296 INFO L272 TraceCheckUtils]: 10: Hoare triple {10577#true} call #t~ret9 := is_do_read_c_triggered(); {10577#true} is VALID [2022-02-20 19:57:57,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {10577#true} havoc ~__retres1~1; {10577#true} is VALID [2022-02-20 19:57:57,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {10577#true} assume !(1 == ~c_dr_pc~0); {10577#true} is VALID [2022-02-20 19:57:57,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {10577#true} ~__retres1~1 := 0; {10633#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:57,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {10633#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10634#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:57,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {10634#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10634#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:57,316 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10634#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10577#true} #1687#return; {10631#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:57,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {10631#(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; {10632#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:57,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {10632#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10578#false} is VALID [2022-02-20 19:57:57,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {10578#false} assume true; {10578#false} is VALID [2022-02-20 19:57:57,317 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10578#false} {10577#true} #1693#return; {10578#false} is VALID [2022-02-20 19:57:57,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {10617#(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); {10577#true} is VALID [2022-02-20 19:57:57,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {10577#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10577#true} is VALID [2022-02-20 19:57:57,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {10577#true} assume true; {10577#true} is VALID [2022-02-20 19:57:57,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10577#true} {10578#false} #1695#return; {10578#false} is VALID [2022-02-20 19:57:57,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:57,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {10577#true} havoc ~__retres1~2; {10577#true} is VALID [2022-02-20 19:57:57,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {10577#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10577#true} is VALID [2022-02-20 19:57:57,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {10577#true} #res := ~__retres1~2; {10577#true} is VALID [2022-02-20 19:57:57,326 INFO L290 TraceCheckUtils]: 3: Hoare triple {10577#true} assume true; {10577#true} is VALID [2022-02-20 19:57:57,326 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10577#true} {10578#false} #1697#return; {10578#false} is VALID [2022-02-20 19:57:57,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {10577#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {10577#true} is VALID [2022-02-20 19:57:57,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {10577#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {10577#true} is VALID [2022-02-20 19:57:57,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {10577#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#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; {10577#true} is VALID [2022-02-20 19:57:57,326 INFO L290 TraceCheckUtils]: 3: Hoare triple {10577#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; {10577#true} is VALID [2022-02-20 19:57:57,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {10577#true} call update_channels1(); {10616#(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:57,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {10616#(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); {10577#true} is VALID [2022-02-20 19:57:57,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {10577#true} assume true; {10577#true} is VALID [2022-02-20 19:57:57,327 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10577#true} {10577#true} #1689#return; {10577#true} is VALID [2022-02-20 19:57:57,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {10577#true} assume { :begin_inline_init_threads1 } true; {10577#true} is VALID [2022-02-20 19:57:57,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {10577#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10577#true} is VALID [2022-02-20 19:57:57,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {10577#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10577#true} is VALID [2022-02-20 19:57:57,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {10577#true} assume { :end_inline_init_threads1 } true; {10577#true} is VALID [2022-02-20 19:57:57,328 INFO L272 TraceCheckUtils]: 12: Hoare triple {10577#true} call fire_delta_events1(); {10617#(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:57,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {10617#(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); {10577#true} is VALID [2022-02-20 19:57:57,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {10577#true} assume !(0 == ~q_write_ev~0); {10577#true} is VALID [2022-02-20 19:57:57,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {10577#true} assume true; {10577#true} is VALID [2022-02-20 19:57:57,328 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10577#true} {10577#true} #1691#return; {10577#true} is VALID [2022-02-20 19:57:57,328 INFO L272 TraceCheckUtils]: 17: Hoare triple {10577#true} call activate_threads1(); {10618#(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:57,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {10618#(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; {10577#true} is VALID [2022-02-20 19:57:57,328 INFO L272 TraceCheckUtils]: 19: Hoare triple {10577#true} call #t~ret8 := is_do_write_p_triggered(); {10577#true} is VALID [2022-02-20 19:57:57,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {10577#true} havoc ~__retres1~0; {10577#true} is VALID [2022-02-20 19:57:57,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {10577#true} assume !(1 == ~p_dw_pc~0); {10577#true} is VALID [2022-02-20 19:57:57,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {10577#true} ~__retres1~0 := 0; {10577#true} is VALID [2022-02-20 19:57:57,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {10577#true} #res := ~__retres1~0; {10577#true} is VALID [2022-02-20 19:57:57,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {10577#true} assume true; {10577#true} is VALID [2022-02-20 19:57:57,329 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10577#true} {10577#true} #1685#return; {10577#true} is VALID [2022-02-20 19:57:57,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {10577#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10577#true} is VALID [2022-02-20 19:57:57,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {10577#true} assume !(0 != ~tmp~1); {10577#true} is VALID [2022-02-20 19:57:57,329 INFO L272 TraceCheckUtils]: 28: Hoare triple {10577#true} call #t~ret9 := is_do_read_c_triggered(); {10577#true} is VALID [2022-02-20 19:57:57,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {10577#true} havoc ~__retres1~1; {10577#true} is VALID [2022-02-20 19:57:57,329 INFO L290 TraceCheckUtils]: 30: Hoare triple {10577#true} assume !(1 == ~c_dr_pc~0); {10577#true} is VALID [2022-02-20 19:57:57,329 INFO L290 TraceCheckUtils]: 31: Hoare triple {10577#true} ~__retres1~1 := 0; {10633#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:57:57,329 INFO L290 TraceCheckUtils]: 32: Hoare triple {10633#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {10634#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:57,330 INFO L290 TraceCheckUtils]: 33: Hoare triple {10634#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {10634#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:57:57,330 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10634#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {10577#true} #1687#return; {10631#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:57:57,331 INFO L290 TraceCheckUtils]: 35: Hoare triple {10631#(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; {10632#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:57:57,331 INFO L290 TraceCheckUtils]: 36: Hoare triple {10632#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {10578#false} is VALID [2022-02-20 19:57:57,331 INFO L290 TraceCheckUtils]: 37: Hoare triple {10578#false} assume true; {10578#false} is VALID [2022-02-20 19:57:57,331 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10578#false} {10577#true} #1693#return; {10578#false} is VALID [2022-02-20 19:57:57,331 INFO L272 TraceCheckUtils]: 39: Hoare triple {10578#false} call reset_delta_events1(); {10617#(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:57,331 INFO L290 TraceCheckUtils]: 40: Hoare triple {10617#(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); {10577#true} is VALID [2022-02-20 19:57:57,331 INFO L290 TraceCheckUtils]: 41: Hoare triple {10577#true} assume 1 == ~q_write_ev~0;~q_write_ev~0 := 2; {10577#true} is VALID [2022-02-20 19:57:57,331 INFO L290 TraceCheckUtils]: 42: Hoare triple {10577#true} assume true; {10577#true} is VALID [2022-02-20 19:57:57,331 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10577#true} {10578#false} #1695#return; {10578#false} is VALID [2022-02-20 19:57:57,331 INFO L290 TraceCheckUtils]: 44: Hoare triple {10578#false} assume !false; {10578#false} is VALID [2022-02-20 19:57:57,331 INFO L290 TraceCheckUtils]: 45: Hoare triple {10578#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; {10578#false} is VALID [2022-02-20 19:57:57,331 INFO L290 TraceCheckUtils]: 46: Hoare triple {10578#false} assume !false; {10578#false} is VALID [2022-02-20 19:57:57,332 INFO L272 TraceCheckUtils]: 47: Hoare triple {10578#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10577#true} is VALID [2022-02-20 19:57:57,332 INFO L290 TraceCheckUtils]: 48: Hoare triple {10577#true} havoc ~__retres1~2; {10577#true} is VALID [2022-02-20 19:57:57,332 INFO L290 TraceCheckUtils]: 49: Hoare triple {10577#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10577#true} is VALID [2022-02-20 19:57:57,332 INFO L290 TraceCheckUtils]: 50: Hoare triple {10577#true} #res := ~__retres1~2; {10577#true} is VALID [2022-02-20 19:57:57,332 INFO L290 TraceCheckUtils]: 51: Hoare triple {10577#true} assume true; {10577#true} is VALID [2022-02-20 19:57:57,332 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10577#true} {10578#false} #1697#return; {10578#false} is VALID [2022-02-20 19:57:57,332 INFO L290 TraceCheckUtils]: 53: Hoare triple {10578#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; {10578#false} is VALID [2022-02-20 19:57:57,332 INFO L290 TraceCheckUtils]: 54: Hoare triple {10578#false} assume 0 != eval1_~tmp___1~0#1; {10578#false} is VALID [2022-02-20 19:57:57,332 INFO L290 TraceCheckUtils]: 55: Hoare triple {10578#false} assume !(0 == ~p_dw_st~0); {10578#false} is VALID [2022-02-20 19:57:57,332 INFO L290 TraceCheckUtils]: 56: Hoare triple {10578#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; {10578#false} is VALID [2022-02-20 19:57:57,332 INFO L290 TraceCheckUtils]: 57: Hoare triple {10578#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; {10578#false} is VALID [2022-02-20 19:57:57,332 INFO L290 TraceCheckUtils]: 58: Hoare triple {10578#false} assume 0 == ~c_dr_pc~0; {10578#false} is VALID [2022-02-20 19:57:57,332 INFO L290 TraceCheckUtils]: 59: Hoare triple {10578#false} assume !false; {10578#false} is VALID [2022-02-20 19:57:57,332 INFO L290 TraceCheckUtils]: 60: Hoare triple {10578#false} assume !(1 == ~q_free~0); {10578#false} is VALID [2022-02-20 19:57:57,332 INFO L290 TraceCheckUtils]: 61: Hoare triple {10578#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; {10578#false} is VALID [2022-02-20 19:57:57,332 INFO L290 TraceCheckUtils]: 62: Hoare triple {10578#false} assume !(~p_last_write~0 == ~c_last_read~0); {10578#false} is VALID [2022-02-20 19:57:57,332 INFO L272 TraceCheckUtils]: 63: Hoare triple {10578#false} call error1(); {10578#false} is VALID [2022-02-20 19:57:57,332 INFO L290 TraceCheckUtils]: 64: Hoare triple {10578#false} assume !false; {10578#false} is VALID [2022-02-20 19:57:57,333 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:57,333 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:57,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331683670] [2022-02-20 19:57:57,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331683670] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:57,333 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:57,333 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:57,333 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195604154] [2022-02-20 19:57:57,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:57,333 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:57,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:57,334 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:57,366 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:57,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:57,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:57,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:57,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:57,367 INFO L87 Difference]: Start difference. First operand 627 states and 926 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:00,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:00,513 INFO L93 Difference]: Finished difference Result 945 states and 1359 transitions. [2022-02-20 19:58:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:00,514 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-02-20 19:58:00,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:00,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:00,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 817 transitions. [2022-02-20 19:58:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 817 transitions. [2022-02-20 19:58:00,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 817 transitions. [2022-02-20 19:58:01,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 817 edges. 817 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:01,063 INFO L225 Difference]: With dead ends: 945 [2022-02-20 19:58:01,063 INFO L226 Difference]: Without dead ends: 673 [2022-02-20 19:58:01,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:58:01,070 INFO L933 BasicCegarLoop]: 643 mSDtfsCounter, 572 mSDsluCounter, 2236 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:01,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [574 Valid, 2879 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 19:58:01,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-02-20 19:58:01,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 642. [2022-02-20 19:58:01,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:01,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 673 states. Second operand has 642 states, 543 states have (on average 1.4806629834254144) internal successors, (804), 552 states have internal predecessors, (804), 62 states have call successors, (62), 29 states have call predecessors, (62), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) [2022-02-20 19:58:01,092 INFO L74 IsIncluded]: Start isIncluded. First operand 673 states. Second operand has 642 states, 543 states have (on average 1.4806629834254144) internal successors, (804), 552 states have internal predecessors, (804), 62 states have call successors, (62), 29 states have call predecessors, (62), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) [2022-02-20 19:58:01,093 INFO L87 Difference]: Start difference. First operand 673 states. Second operand has 642 states, 543 states have (on average 1.4806629834254144) internal successors, (804), 552 states have internal predecessors, (804), 62 states have call successors, (62), 29 states have call predecessors, (62), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) [2022-02-20 19:58:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:01,110 INFO L93 Difference]: Finished difference Result 673 states and 985 transitions. [2022-02-20 19:58:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 985 transitions. [2022-02-20 19:58:01,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:01,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:01,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 642 states, 543 states have (on average 1.4806629834254144) internal successors, (804), 552 states have internal predecessors, (804), 62 states have call successors, (62), 29 states have call predecessors, (62), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) Second operand 673 states. [2022-02-20 19:58:01,113 INFO L87 Difference]: Start difference. First operand has 642 states, 543 states have (on average 1.4806629834254144) internal successors, (804), 552 states have internal predecessors, (804), 62 states have call successors, (62), 29 states have call predecessors, (62), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) Second operand 673 states. [2022-02-20 19:58:01,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:01,130 INFO L93 Difference]: Finished difference Result 673 states and 985 transitions. [2022-02-20 19:58:01,130 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 985 transitions. [2022-02-20 19:58:01,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:01,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:01,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:01,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 543 states have (on average 1.4806629834254144) internal successors, (804), 552 states have internal predecessors, (804), 62 states have call successors, (62), 29 states have call predecessors, (62), 35 states have return successors, (75), 64 states have call predecessors, (75), 58 states have call successors, (75) [2022-02-20 19:58:01,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 941 transitions. [2022-02-20 19:58:01,152 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 941 transitions. Word has length 65 [2022-02-20 19:58:01,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:01,153 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 941 transitions. [2022-02-20 19:58:01,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:58:01,153 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 941 transitions. [2022-02-20 19:58:01,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:01,154 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:01,154 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:01,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:58:01,154 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:01,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:01,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1694104932, now seen corresponding path program 1 times [2022-02-20 19:58:01,155 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:01,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118952993] [2022-02-20 19:58:01,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:01,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {14149#(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); {14150#(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,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {14150#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {14150#(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,208 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14150#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {14111#(= ~q_write_ev~0 ~q_read_ev~0)} #1689#return; {14111#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:01,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {14150#(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); {14150#(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,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {14150#(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); {14150#(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,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {14150#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {14150#(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,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14150#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {14111#(= ~q_write_ev~0 ~q_read_ev~0)} #1691#return; {14111#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:01,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {14109#true} havoc ~__retres1~0; {14109#true} is VALID [2022-02-20 19:58:01,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {14109#true} assume !(1 == ~p_dw_pc~0); {14109#true} is VALID [2022-02-20 19:58:01,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {14109#true} ~__retres1~0 := 0; {14109#true} is VALID [2022-02-20 19:58:01,236 INFO L290 TraceCheckUtils]: 3: Hoare triple {14109#true} #res := ~__retres1~0; {14109#true} is VALID [2022-02-20 19:58:01,236 INFO L290 TraceCheckUtils]: 4: Hoare triple {14109#true} assume true; {14109#true} is VALID [2022-02-20 19:58:01,236 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14109#true} {14109#true} #1685#return; {14109#true} is VALID [2022-02-20 19:58:01,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {14109#true} havoc ~__retres1~1; {14109#true} is VALID [2022-02-20 19:58:01,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {14109#true} assume !(1 == ~c_dr_pc~0); {14109#true} is VALID [2022-02-20 19:58:01,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {14109#true} ~__retres1~1 := 0; {14109#true} is VALID [2022-02-20 19:58:01,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {14109#true} #res := ~__retres1~1; {14109#true} is VALID [2022-02-20 19:58:01,239 INFO L290 TraceCheckUtils]: 4: Hoare triple {14109#true} assume true; {14109#true} is VALID [2022-02-20 19:58:01,239 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14109#true} {14109#true} #1687#return; {14109#true} is VALID [2022-02-20 19:58:01,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {14151#(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; {14109#true} is VALID [2022-02-20 19:58:01,240 INFO L272 TraceCheckUtils]: 1: Hoare triple {14109#true} call #t~ret8 := is_do_write_p_triggered(); {14109#true} is VALID [2022-02-20 19:58:01,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {14109#true} havoc ~__retres1~0; {14109#true} is VALID [2022-02-20 19:58:01,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {14109#true} assume !(1 == ~p_dw_pc~0); {14109#true} is VALID [2022-02-20 19:58:01,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {14109#true} ~__retres1~0 := 0; {14109#true} is VALID [2022-02-20 19:58:01,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {14109#true} #res := ~__retres1~0; {14109#true} is VALID [2022-02-20 19:58:01,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {14109#true} assume true; {14109#true} is VALID [2022-02-20 19:58:01,241 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14109#true} {14109#true} #1685#return; {14109#true} is VALID [2022-02-20 19:58:01,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {14109#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {14109#true} is VALID [2022-02-20 19:58:01,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {14109#true} assume !(0 != ~tmp~1); {14109#true} is VALID [2022-02-20 19:58:01,241 INFO L272 TraceCheckUtils]: 10: Hoare triple {14109#true} call #t~ret9 := is_do_read_c_triggered(); {14109#true} is VALID [2022-02-20 19:58:01,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {14109#true} havoc ~__retres1~1; {14109#true} is VALID [2022-02-20 19:58:01,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {14109#true} assume !(1 == ~c_dr_pc~0); {14109#true} is VALID [2022-02-20 19:58:01,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {14109#true} ~__retres1~1 := 0; {14109#true} is VALID [2022-02-20 19:58:01,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {14109#true} #res := ~__retres1~1; {14109#true} is VALID [2022-02-20 19:58:01,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {14109#true} assume true; {14109#true} is VALID [2022-02-20 19:58:01,242 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14109#true} {14109#true} #1687#return; {14109#true} is VALID [2022-02-20 19:58:01,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {14109#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {14109#true} is VALID [2022-02-20 19:58:01,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {14109#true} assume !(0 != ~tmp___0~1); {14109#true} is VALID [2022-02-20 19:58:01,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {14109#true} assume true; {14109#true} is VALID [2022-02-20 19:58:01,243 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14109#true} {14111#(= ~q_write_ev~0 ~q_read_ev~0)} #1693#return; {14111#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:01,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {14150#(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); {14164#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:01,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {14164#(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; {14165#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:01,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {14165#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {14165#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:01,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14165#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {14111#(= ~q_write_ev~0 ~q_read_ev~0)} #1695#return; {14110#false} is VALID [2022-02-20 19:58:01,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:01,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {14109#true} havoc ~__retres1~2; {14109#true} is VALID [2022-02-20 19:58:01,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {14109#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14109#true} is VALID [2022-02-20 19:58:01,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {14109#true} #res := ~__retres1~2; {14109#true} is VALID [2022-02-20 19:58:01,264 INFO L290 TraceCheckUtils]: 3: Hoare triple {14109#true} assume true; {14109#true} is VALID [2022-02-20 19:58:01,264 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14109#true} {14110#false} #1697#return; {14110#false} is VALID [2022-02-20 19:58:01,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {14109#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {14109#true} is VALID [2022-02-20 19:58:01,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {14109#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {14109#true} is VALID [2022-02-20 19:58:01,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {14109#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#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; {14111#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:01,265 INFO L290 TraceCheckUtils]: 3: Hoare triple {14111#(= ~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; {14111#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:01,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {14111#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {14149#(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,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {14149#(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); {14150#(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,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {14150#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {14150#(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,266 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14150#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {14111#(= ~q_write_ev~0 ~q_read_ev~0)} #1689#return; {14111#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:01,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {14111#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {14111#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:01,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {14111#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {14111#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:01,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {14111#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {14111#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:01,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {14111#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {14111#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:01,267 INFO L272 TraceCheckUtils]: 12: Hoare triple {14111#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {14150#(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,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {14150#(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); {14150#(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,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {14150#(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); {14150#(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,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {14150#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {14150#(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,269 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14150#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {14111#(= ~q_write_ev~0 ~q_read_ev~0)} #1691#return; {14111#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:01,269 INFO L272 TraceCheckUtils]: 17: Hoare triple {14111#(= ~q_write_ev~0 ~q_read_ev~0)} call activate_threads1(); {14151#(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,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {14151#(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; {14109#true} is VALID [2022-02-20 19:58:01,269 INFO L272 TraceCheckUtils]: 19: Hoare triple {14109#true} call #t~ret8 := is_do_write_p_triggered(); {14109#true} is VALID [2022-02-20 19:58:01,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {14109#true} havoc ~__retres1~0; {14109#true} is VALID [2022-02-20 19:58:01,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {14109#true} assume !(1 == ~p_dw_pc~0); {14109#true} is VALID [2022-02-20 19:58:01,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {14109#true} ~__retres1~0 := 0; {14109#true} is VALID [2022-02-20 19:58:01,270 INFO L290 TraceCheckUtils]: 23: Hoare triple {14109#true} #res := ~__retres1~0; {14109#true} is VALID [2022-02-20 19:58:01,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {14109#true} assume true; {14109#true} is VALID [2022-02-20 19:58:01,270 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14109#true} {14109#true} #1685#return; {14109#true} is VALID [2022-02-20 19:58:01,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {14109#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {14109#true} is VALID [2022-02-20 19:58:01,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {14109#true} assume !(0 != ~tmp~1); {14109#true} is VALID [2022-02-20 19:58:01,270 INFO L272 TraceCheckUtils]: 28: Hoare triple {14109#true} call #t~ret9 := is_do_read_c_triggered(); {14109#true} is VALID [2022-02-20 19:58:01,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {14109#true} havoc ~__retres1~1; {14109#true} is VALID [2022-02-20 19:58:01,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {14109#true} assume !(1 == ~c_dr_pc~0); {14109#true} is VALID [2022-02-20 19:58:01,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {14109#true} ~__retres1~1 := 0; {14109#true} is VALID [2022-02-20 19:58:01,271 INFO L290 TraceCheckUtils]: 32: Hoare triple {14109#true} #res := ~__retres1~1; {14109#true} is VALID [2022-02-20 19:58:01,271 INFO L290 TraceCheckUtils]: 33: Hoare triple {14109#true} assume true; {14109#true} is VALID [2022-02-20 19:58:01,271 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14109#true} {14109#true} #1687#return; {14109#true} is VALID [2022-02-20 19:58:01,271 INFO L290 TraceCheckUtils]: 35: Hoare triple {14109#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {14109#true} is VALID [2022-02-20 19:58:01,271 INFO L290 TraceCheckUtils]: 36: Hoare triple {14109#true} assume !(0 != ~tmp___0~1); {14109#true} is VALID [2022-02-20 19:58:01,271 INFO L290 TraceCheckUtils]: 37: Hoare triple {14109#true} assume true; {14109#true} is VALID [2022-02-20 19:58:01,272 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14109#true} {14111#(= ~q_write_ev~0 ~q_read_ev~0)} #1693#return; {14111#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:58:01,272 INFO L272 TraceCheckUtils]: 39: Hoare triple {14111#(= ~q_write_ev~0 ~q_read_ev~0)} call reset_delta_events1(); {14150#(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,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {14150#(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); {14164#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (not (= |old(~q_read_ev~0)| 1)))} is VALID [2022-02-20 19:58:01,273 INFO L290 TraceCheckUtils]: 41: Hoare triple {14164#(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; {14165#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:01,273 INFO L290 TraceCheckUtils]: 42: Hoare triple {14165#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {14165#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:58:01,273 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {14165#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {14111#(= ~q_write_ev~0 ~q_read_ev~0)} #1695#return; {14110#false} is VALID [2022-02-20 19:58:01,273 INFO L290 TraceCheckUtils]: 44: Hoare triple {14110#false} assume !false; {14110#false} is VALID [2022-02-20 19:58:01,273 INFO L290 TraceCheckUtils]: 45: Hoare triple {14110#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; {14110#false} is VALID [2022-02-20 19:58:01,274 INFO L290 TraceCheckUtils]: 46: Hoare triple {14110#false} assume !false; {14110#false} is VALID [2022-02-20 19:58:01,274 INFO L272 TraceCheckUtils]: 47: Hoare triple {14110#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {14109#true} is VALID [2022-02-20 19:58:01,274 INFO L290 TraceCheckUtils]: 48: Hoare triple {14109#true} havoc ~__retres1~2; {14109#true} is VALID [2022-02-20 19:58:01,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {14109#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14109#true} is VALID [2022-02-20 19:58:01,274 INFO L290 TraceCheckUtils]: 50: Hoare triple {14109#true} #res := ~__retres1~2; {14109#true} is VALID [2022-02-20 19:58:01,274 INFO L290 TraceCheckUtils]: 51: Hoare triple {14109#true} assume true; {14109#true} is VALID [2022-02-20 19:58:01,274 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14109#true} {14110#false} #1697#return; {14110#false} is VALID [2022-02-20 19:58:01,274 INFO L290 TraceCheckUtils]: 53: Hoare triple {14110#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; {14110#false} is VALID [2022-02-20 19:58:01,274 INFO L290 TraceCheckUtils]: 54: Hoare triple {14110#false} assume 0 != eval1_~tmp___1~0#1; {14110#false} is VALID [2022-02-20 19:58:01,275 INFO L290 TraceCheckUtils]: 55: Hoare triple {14110#false} assume !(0 == ~p_dw_st~0); {14110#false} is VALID [2022-02-20 19:58:01,275 INFO L290 TraceCheckUtils]: 56: Hoare triple {14110#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; {14110#false} is VALID [2022-02-20 19:58:01,275 INFO L290 TraceCheckUtils]: 57: Hoare triple {14110#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; {14110#false} is VALID [2022-02-20 19:58:01,275 INFO L290 TraceCheckUtils]: 58: Hoare triple {14110#false} assume 0 == ~c_dr_pc~0; {14110#false} is VALID [2022-02-20 19:58:01,275 INFO L290 TraceCheckUtils]: 59: Hoare triple {14110#false} assume !false; {14110#false} is VALID [2022-02-20 19:58:01,275 INFO L290 TraceCheckUtils]: 60: Hoare triple {14110#false} assume !(1 == ~q_free~0); {14110#false} is VALID [2022-02-20 19:58:01,275 INFO L290 TraceCheckUtils]: 61: Hoare triple {14110#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; {14110#false} is VALID [2022-02-20 19:58:01,275 INFO L290 TraceCheckUtils]: 62: Hoare triple {14110#false} assume !(~p_last_write~0 == ~c_last_read~0); {14110#false} is VALID [2022-02-20 19:58:01,275 INFO L272 TraceCheckUtils]: 63: Hoare triple {14110#false} call error1(); {14110#false} is VALID [2022-02-20 19:58:01,276 INFO L290 TraceCheckUtils]: 64: Hoare triple {14110#false} assume !false; {14110#false} is VALID [2022-02-20 19:58:01,276 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,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:01,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118952993] [2022-02-20 19:58:01,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118952993] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:01,276 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:01,276 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:58:01,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502816726] [2022-02-20 19:58:01,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:01,277 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:01,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:01,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:58:01,308 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,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:58:01,309 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:01,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:58:01,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:58:01,309 INFO L87 Difference]: Start difference. First operand 642 states and 941 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:04,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:04,312 INFO L93 Difference]: Finished difference Result 1034 states and 1452 transitions. [2022-02-20 19:58:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:58:04,312 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:04,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:04,314 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:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 996 transitions. [2022-02-20 19:58:04,320 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:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 996 transitions. [2022-02-20 19:58:04,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 996 transitions. [2022-02-20 19:58:04,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 996 edges. 996 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:04,986 INFO L225 Difference]: With dead ends: 1034 [2022-02-20 19:58:04,986 INFO L226 Difference]: Without dead ends: 749 [2022-02-20 19:58:04,987 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:04,988 INFO L933 BasicCegarLoop]: 665 mSDtfsCounter, 1286 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:04,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1314 Valid, 2252 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 19:58:04,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2022-02-20 19:58:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 654. [2022-02-20 19:58:05,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:05,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 749 states. Second operand has 654 states, 553 states have (on average 1.4719710669077757) internal successors, (814), 562 states have internal predecessors, (814), 63 states have call successors, (63), 30 states have call predecessors, (63), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) [2022-02-20 19:58:05,018 INFO L74 IsIncluded]: Start isIncluded. First operand 749 states. Second operand has 654 states, 553 states have (on average 1.4719710669077757) internal successors, (814), 562 states have internal predecessors, (814), 63 states have call successors, (63), 30 states have call predecessors, (63), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) [2022-02-20 19:58:05,019 INFO L87 Difference]: Start difference. First operand 749 states. Second operand has 654 states, 553 states have (on average 1.4719710669077757) internal successors, (814), 562 states have internal predecessors, (814), 63 states have call successors, (63), 30 states have call predecessors, (63), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) [2022-02-20 19:58:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:05,038 INFO L93 Difference]: Finished difference Result 749 states and 1072 transitions. [2022-02-20 19:58:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1072 transitions. [2022-02-20 19:58:05,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:05,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:05,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 654 states, 553 states have (on average 1.4719710669077757) internal successors, (814), 562 states have internal predecessors, (814), 63 states have call successors, (63), 30 states have call predecessors, (63), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) Second operand 749 states. [2022-02-20 19:58:05,043 INFO L87 Difference]: Start difference. First operand has 654 states, 553 states have (on average 1.4719710669077757) internal successors, (814), 562 states have internal predecessors, (814), 63 states have call successors, (63), 30 states have call predecessors, (63), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) Second operand 749 states. [2022-02-20 19:58:05,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:05,063 INFO L93 Difference]: Finished difference Result 749 states and 1072 transitions. [2022-02-20 19:58:05,063 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1072 transitions. [2022-02-20 19:58:05,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:05,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:05,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:05,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:05,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 553 states have (on average 1.4719710669077757) internal successors, (814), 562 states have internal predecessors, (814), 63 states have call successors, (63), 30 states have call predecessors, (63), 36 states have return successors, (74), 65 states have call predecessors, (74), 59 states have call successors, (74) [2022-02-20 19:58:05,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 951 transitions. [2022-02-20 19:58:05,087 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 951 transitions. Word has length 65 [2022-02-20 19:58:05,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:05,088 INFO L470 AbstractCegarLoop]: Abstraction has 654 states and 951 transitions. [2022-02-20 19:58:05,088 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:05,088 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 951 transitions. [2022-02-20 19:58:05,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:58:05,089 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:05,089 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:05,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:58:05,090 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:05,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:05,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1560091426, now seen corresponding path program 1 times [2022-02-20 19:58:05,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:05,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846560053] [2022-02-20 19:58:05,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:05,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:05,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:05,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {17966#(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); {17926#true} is VALID [2022-02-20 19:58:05,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {17926#true} assume true; {17926#true} is VALID [2022-02-20 19:58:05,141 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17926#true} {17926#true} #1689#return; {17926#true} is VALID [2022-02-20 19:58:05,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:05,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {17967#(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); {17926#true} is VALID [2022-02-20 19:58:05,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {17926#true} assume !(0 == ~q_write_ev~0); {17926#true} is VALID [2022-02-20 19:58:05,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {17926#true} assume true; {17926#true} is VALID [2022-02-20 19:58:05,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17926#true} {17931#(= ~p_dw_st~0 0)} #1691#return; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:05,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:05,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {17926#true} havoc ~__retres1~0; {17926#true} is VALID [2022-02-20 19:58:05,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {17926#true} assume !(1 == ~p_dw_pc~0); {17926#true} is VALID [2022-02-20 19:58:05,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {17926#true} ~__retres1~0 := 0; {17926#true} is VALID [2022-02-20 19:58:05,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {17926#true} #res := ~__retres1~0; {17926#true} is VALID [2022-02-20 19:58:05,171 INFO L290 TraceCheckUtils]: 4: Hoare triple {17926#true} assume true; {17926#true} is VALID [2022-02-20 19:58:05,171 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {17926#true} {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1685#return; {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:05,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:05,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {17926#true} havoc ~__retres1~1; {17926#true} is VALID [2022-02-20 19:58:05,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {17926#true} assume !(1 == ~c_dr_pc~0); {17926#true} is VALID [2022-02-20 19:58:05,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {17926#true} ~__retres1~1 := 0; {17926#true} is VALID [2022-02-20 19:58:05,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {17926#true} #res := ~__retres1~1; {17926#true} is VALID [2022-02-20 19:58:05,176 INFO L290 TraceCheckUtils]: 4: Hoare triple {17926#true} assume true; {17926#true} is VALID [2022-02-20 19:58:05,176 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {17926#true} {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1687#return; {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:05,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {17968#(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; {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:05,177 INFO L272 TraceCheckUtils]: 1: Hoare triple {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {17926#true} is VALID [2022-02-20 19:58:05,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {17926#true} havoc ~__retres1~0; {17926#true} is VALID [2022-02-20 19:58:05,177 INFO L290 TraceCheckUtils]: 3: Hoare triple {17926#true} assume !(1 == ~p_dw_pc~0); {17926#true} is VALID [2022-02-20 19:58:05,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {17926#true} ~__retres1~0 := 0; {17926#true} is VALID [2022-02-20 19:58:05,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {17926#true} #res := ~__retres1~0; {17926#true} is VALID [2022-02-20 19:58:05,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {17926#true} assume true; {17926#true} is VALID [2022-02-20 19:58:05,177 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17926#true} {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1685#return; {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:05,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:05,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:05,178 INFO L272 TraceCheckUtils]: 10: Hoare triple {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {17926#true} is VALID [2022-02-20 19:58:05,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {17926#true} havoc ~__retres1~1; {17926#true} is VALID [2022-02-20 19:58:05,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {17926#true} assume !(1 == ~c_dr_pc~0); {17926#true} is VALID [2022-02-20 19:58:05,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {17926#true} ~__retres1~1 := 0; {17926#true} is VALID [2022-02-20 19:58:05,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {17926#true} #res := ~__retres1~1; {17926#true} is VALID [2022-02-20 19:58:05,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {17926#true} assume true; {17926#true} is VALID [2022-02-20 19:58:05,179 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17926#true} {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1687#return; {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:05,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:05,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:05,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:05,180 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {17931#(= ~p_dw_st~0 0)} #1693#return; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:05,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {17967#(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); {17926#true} is VALID [2022-02-20 19:58:05,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {17926#true} assume !(1 == ~q_write_ev~0); {17926#true} is VALID [2022-02-20 19:58:05,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {17926#true} assume true; {17926#true} is VALID [2022-02-20 19:58:05,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17926#true} {17931#(= ~p_dw_st~0 0)} #1695#return; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:05,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {17926#true} havoc ~__retres1~2; {17926#true} is VALID [2022-02-20 19:58:05,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {17926#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {17931#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {17931#(= ~p_dw_st~0 0)} assume true; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,190 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17931#(= ~p_dw_st~0 0)} {17931#(= ~p_dw_st~0 0)} #1697#return; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {17926#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {17926#true} is VALID [2022-02-20 19:58:05,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {17926#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {17926#true} is VALID [2022-02-20 19:58:05,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {17926#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#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; {17926#true} is VALID [2022-02-20 19:58:05,191 INFO L290 TraceCheckUtils]: 3: Hoare triple {17926#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; {17926#true} is VALID [2022-02-20 19:58:05,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {17926#true} call update_channels1(); {17966#(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:05,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {17966#(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); {17926#true} is VALID [2022-02-20 19:58:05,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {17926#true} assume true; {17926#true} is VALID [2022-02-20 19:58:05,192 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17926#true} {17926#true} #1689#return; {17926#true} is VALID [2022-02-20 19:58:05,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {17926#true} assume { :begin_inline_init_threads1 } true; {17926#true} is VALID [2022-02-20 19:58:05,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {17926#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {17931#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {17931#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,193 INFO L272 TraceCheckUtils]: 12: Hoare triple {17931#(= ~p_dw_st~0 0)} call fire_delta_events1(); {17967#(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:05,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {17967#(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); {17926#true} is VALID [2022-02-20 19:58:05,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {17926#true} assume !(0 == ~q_write_ev~0); {17926#true} is VALID [2022-02-20 19:58:05,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {17926#true} assume true; {17926#true} is VALID [2022-02-20 19:58:05,194 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17926#true} {17931#(= ~p_dw_st~0 0)} #1691#return; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,194 INFO L272 TraceCheckUtils]: 17: Hoare triple {17931#(= ~p_dw_st~0 0)} call activate_threads1(); {17968#(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:05,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {17968#(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; {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:05,194 INFO L272 TraceCheckUtils]: 19: Hoare triple {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {17926#true} is VALID [2022-02-20 19:58:05,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {17926#true} havoc ~__retres1~0; {17926#true} is VALID [2022-02-20 19:58:05,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {17926#true} assume !(1 == ~p_dw_pc~0); {17926#true} is VALID [2022-02-20 19:58:05,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {17926#true} ~__retres1~0 := 0; {17926#true} is VALID [2022-02-20 19:58:05,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {17926#true} #res := ~__retres1~0; {17926#true} is VALID [2022-02-20 19:58:05,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {17926#true} assume true; {17926#true} is VALID [2022-02-20 19:58:05,195 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {17926#true} {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1685#return; {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:05,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:05,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:05,196 INFO L272 TraceCheckUtils]: 28: Hoare triple {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {17926#true} is VALID [2022-02-20 19:58:05,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {17926#true} havoc ~__retres1~1; {17926#true} is VALID [2022-02-20 19:58:05,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {17926#true} assume !(1 == ~c_dr_pc~0); {17926#true} is VALID [2022-02-20 19:58:05,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {17926#true} ~__retres1~1 := 0; {17926#true} is VALID [2022-02-20 19:58:05,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {17926#true} #res := ~__retres1~1; {17926#true} is VALID [2022-02-20 19:58:05,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {17926#true} assume true; {17926#true} is VALID [2022-02-20 19:58:05,197 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {17926#true} {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1687#return; {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:05,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:05,197 INFO L290 TraceCheckUtils]: 36: Hoare triple {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:05,198 INFO L290 TraceCheckUtils]: 37: Hoare triple {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:58:05,198 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {17969#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {17931#(= ~p_dw_st~0 0)} #1693#return; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,198 INFO L272 TraceCheckUtils]: 39: Hoare triple {17931#(= ~p_dw_st~0 0)} call reset_delta_events1(); {17967#(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:05,198 INFO L290 TraceCheckUtils]: 40: Hoare triple {17967#(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); {17926#true} is VALID [2022-02-20 19:58:05,199 INFO L290 TraceCheckUtils]: 41: Hoare triple {17926#true} assume !(1 == ~q_write_ev~0); {17926#true} is VALID [2022-02-20 19:58:05,199 INFO L290 TraceCheckUtils]: 42: Hoare triple {17926#true} assume true; {17926#true} is VALID [2022-02-20 19:58:05,199 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {17926#true} {17931#(= ~p_dw_st~0 0)} #1695#return; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,199 INFO L290 TraceCheckUtils]: 44: Hoare triple {17931#(= ~p_dw_st~0 0)} assume !false; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,199 INFO L290 TraceCheckUtils]: 45: Hoare triple {17931#(= ~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; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,200 INFO L290 TraceCheckUtils]: 46: Hoare triple {17931#(= ~p_dw_st~0 0)} assume !false; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,200 INFO L272 TraceCheckUtils]: 47: Hoare triple {17931#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {17926#true} is VALID [2022-02-20 19:58:05,200 INFO L290 TraceCheckUtils]: 48: Hoare triple {17926#true} havoc ~__retres1~2; {17926#true} is VALID [2022-02-20 19:58:05,200 INFO L290 TraceCheckUtils]: 49: Hoare triple {17926#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,200 INFO L290 TraceCheckUtils]: 50: Hoare triple {17931#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,201 INFO L290 TraceCheckUtils]: 51: Hoare triple {17931#(= ~p_dw_st~0 0)} assume true; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,201 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17931#(= ~p_dw_st~0 0)} {17931#(= ~p_dw_st~0 0)} #1697#return; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,201 INFO L290 TraceCheckUtils]: 53: Hoare triple {17931#(= ~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; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,202 INFO L290 TraceCheckUtils]: 54: Hoare triple {17931#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {17931#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:58:05,202 INFO L290 TraceCheckUtils]: 55: Hoare triple {17931#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {17927#false} is VALID [2022-02-20 19:58:05,202 INFO L290 TraceCheckUtils]: 56: Hoare triple {17927#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; {17927#false} is VALID [2022-02-20 19:58:05,202 INFO L290 TraceCheckUtils]: 57: Hoare triple {17927#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; {17927#false} is VALID [2022-02-20 19:58:05,202 INFO L290 TraceCheckUtils]: 58: Hoare triple {17927#false} assume 0 == ~c_dr_pc~0; {17927#false} is VALID [2022-02-20 19:58:05,202 INFO L290 TraceCheckUtils]: 59: Hoare triple {17927#false} assume !false; {17927#false} is VALID [2022-02-20 19:58:05,202 INFO L290 TraceCheckUtils]: 60: Hoare triple {17927#false} assume !(1 == ~q_free~0); {17927#false} is VALID [2022-02-20 19:58:05,202 INFO L290 TraceCheckUtils]: 61: Hoare triple {17927#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; {17927#false} is VALID [2022-02-20 19:58:05,203 INFO L290 TraceCheckUtils]: 62: Hoare triple {17927#false} assume !(~p_last_write~0 == ~c_last_read~0); {17927#false} is VALID [2022-02-20 19:58:05,203 INFO L272 TraceCheckUtils]: 63: Hoare triple {17927#false} call error1(); {17927#false} is VALID [2022-02-20 19:58:05,203 INFO L290 TraceCheckUtils]: 64: Hoare triple {17927#false} assume !false; {17927#false} is VALID [2022-02-20 19:58:05,203 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:05,203 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:05,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846560053] [2022-02-20 19:58:05,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846560053] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:05,204 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:05,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:05,204 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834972586] [2022-02-20 19:58:05,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:05,206 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:05,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:05,206 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:05,237 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:05,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:05,237 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:05,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:05,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:05,238 INFO L87 Difference]: Start difference. First operand 654 states and 951 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:06,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:06,972 INFO L93 Difference]: Finished difference Result 1296 states and 1798 transitions. [2022-02-20 19:58:06,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:58:06,972 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:06,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:06,973 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:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 939 transitions. [2022-02-20 19:58:06,978 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:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 939 transitions. [2022-02-20 19:58:06,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 939 transitions. [2022-02-20 19:58:07,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 939 edges. 939 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:07,626 INFO L225 Difference]: With dead ends: 1296 [2022-02-20 19:58:07,627 INFO L226 Difference]: Without dead ends: 1000 [2022-02-20 19:58:07,627 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:07,628 INFO L933 BasicCegarLoop]: 624 mSDtfsCounter, 1572 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1602 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:07,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1602 Valid, 1565 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:58:07,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-02-20 19:58:07,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 944. [2022-02-20 19:58:07,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:07,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1000 states. Second operand has 944 states, 777 states have (on average 1.416988416988417) internal successors, (1101), 793 states have internal predecessors, (1101), 98 states have call successors, (98), 52 states have call predecessors, (98), 67 states have return successors, (131), 105 states have call predecessors, (131), 94 states have call successors, (131) [2022-02-20 19:58:07,673 INFO L74 IsIncluded]: Start isIncluded. First operand 1000 states. Second operand has 944 states, 777 states have (on average 1.416988416988417) internal successors, (1101), 793 states have internal predecessors, (1101), 98 states have call successors, (98), 52 states have call predecessors, (98), 67 states have return successors, (131), 105 states have call predecessors, (131), 94 states have call successors, (131) [2022-02-20 19:58:07,674 INFO L87 Difference]: Start difference. First operand 1000 states. Second operand has 944 states, 777 states have (on average 1.416988416988417) internal successors, (1101), 793 states have internal predecessors, (1101), 98 states have call successors, (98), 52 states have call predecessors, (98), 67 states have return successors, (131), 105 states have call predecessors, (131), 94 states have call successors, (131) [2022-02-20 19:58:07,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:07,708 INFO L93 Difference]: Finished difference Result 1000 states and 1404 transitions. [2022-02-20 19:58:07,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1404 transitions. [2022-02-20 19:58:07,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:07,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:07,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 944 states, 777 states have (on average 1.416988416988417) internal successors, (1101), 793 states have internal predecessors, (1101), 98 states have call successors, (98), 52 states have call predecessors, (98), 67 states have return successors, (131), 105 states have call predecessors, (131), 94 states have call successors, (131) Second operand 1000 states. [2022-02-20 19:58:07,713 INFO L87 Difference]: Start difference. First operand has 944 states, 777 states have (on average 1.416988416988417) internal successors, (1101), 793 states have internal predecessors, (1101), 98 states have call successors, (98), 52 states have call predecessors, (98), 67 states have return successors, (131), 105 states have call predecessors, (131), 94 states have call successors, (131) Second operand 1000 states. [2022-02-20 19:58:07,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:07,749 INFO L93 Difference]: Finished difference Result 1000 states and 1404 transitions. [2022-02-20 19:58:07,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1404 transitions. [2022-02-20 19:58:07,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:07,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:07,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:07,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 777 states have (on average 1.416988416988417) internal successors, (1101), 793 states have internal predecessors, (1101), 98 states have call successors, (98), 52 states have call predecessors, (98), 67 states have return successors, (131), 105 states have call predecessors, (131), 94 states have call successors, (131) [2022-02-20 19:58:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1330 transitions. [2022-02-20 19:58:07,793 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1330 transitions. Word has length 65 [2022-02-20 19:58:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:07,794 INFO L470 AbstractCegarLoop]: Abstraction has 944 states and 1330 transitions. [2022-02-20 19:58:07,794 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:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1330 transitions. [2022-02-20 19:58:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:58:07,795 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:07,795 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,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:58:07,796 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:07,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:07,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1800845042, now seen corresponding path program 1 times [2022-02-20 19:58:07,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:07,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410074286] [2022-02-20 19:58:07,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:07,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:07,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:07,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {23029#(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); {22989#true} is VALID [2022-02-20 19:58:07,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {22989#true} assume true; {22989#true} is VALID [2022-02-20 19:58:07,832 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22989#true} {22991#(= ~q_free~0 1)} #1689#return; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:07,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {23030#(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); {22989#true} is VALID [2022-02-20 19:58:07,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {22989#true} assume !(0 == ~q_write_ev~0); {22989#true} is VALID [2022-02-20 19:58:07,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {22989#true} assume true; {22989#true} is VALID [2022-02-20 19:58:07,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22989#true} {22991#(= ~q_free~0 1)} #1691#return; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:07,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:07,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {22989#true} havoc ~__retres1~0; {22989#true} is VALID [2022-02-20 19:58:07,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {22989#true} assume !(1 == ~p_dw_pc~0); {22989#true} is VALID [2022-02-20 19:58:07,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {22989#true} ~__retres1~0 := 0; {22989#true} is VALID [2022-02-20 19:58:07,856 INFO L290 TraceCheckUtils]: 3: Hoare triple {22989#true} #res := ~__retres1~0; {22989#true} is VALID [2022-02-20 19:58:07,856 INFO L290 TraceCheckUtils]: 4: Hoare triple {22989#true} assume true; {22989#true} is VALID [2022-02-20 19:58:07,856 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22989#true} {22989#true} #1685#return; {22989#true} is VALID [2022-02-20 19:58:07,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:07,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {22989#true} havoc ~__retres1~1; {22989#true} is VALID [2022-02-20 19:58:07,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {22989#true} assume !(1 == ~c_dr_pc~0); {22989#true} is VALID [2022-02-20 19:58:07,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {22989#true} ~__retres1~1 := 0; {22989#true} is VALID [2022-02-20 19:58:07,859 INFO L290 TraceCheckUtils]: 3: Hoare triple {22989#true} #res := ~__retres1~1; {22989#true} is VALID [2022-02-20 19:58:07,859 INFO L290 TraceCheckUtils]: 4: Hoare triple {22989#true} assume true; {22989#true} is VALID [2022-02-20 19:58:07,859 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22989#true} {22989#true} #1687#return; {22989#true} is VALID [2022-02-20 19:58:07,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {23031#(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; {22989#true} is VALID [2022-02-20 19:58:07,860 INFO L272 TraceCheckUtils]: 1: Hoare triple {22989#true} call #t~ret8 := is_do_write_p_triggered(); {22989#true} is VALID [2022-02-20 19:58:07,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {22989#true} havoc ~__retres1~0; {22989#true} is VALID [2022-02-20 19:58:07,860 INFO L290 TraceCheckUtils]: 3: Hoare triple {22989#true} assume !(1 == ~p_dw_pc~0); {22989#true} is VALID [2022-02-20 19:58:07,860 INFO L290 TraceCheckUtils]: 4: Hoare triple {22989#true} ~__retres1~0 := 0; {22989#true} is VALID [2022-02-20 19:58:07,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {22989#true} #res := ~__retres1~0; {22989#true} is VALID [2022-02-20 19:58:07,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {22989#true} assume true; {22989#true} is VALID [2022-02-20 19:58:07,860 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22989#true} {22989#true} #1685#return; {22989#true} is VALID [2022-02-20 19:58:07,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {22989#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22989#true} is VALID [2022-02-20 19:58:07,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {22989#true} assume !(0 != ~tmp~1); {22989#true} is VALID [2022-02-20 19:58:07,861 INFO L272 TraceCheckUtils]: 10: Hoare triple {22989#true} call #t~ret9 := is_do_read_c_triggered(); {22989#true} is VALID [2022-02-20 19:58:07,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {22989#true} havoc ~__retres1~1; {22989#true} is VALID [2022-02-20 19:58:07,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {22989#true} assume !(1 == ~c_dr_pc~0); {22989#true} is VALID [2022-02-20 19:58:07,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {22989#true} ~__retres1~1 := 0; {22989#true} is VALID [2022-02-20 19:58:07,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {22989#true} #res := ~__retres1~1; {22989#true} is VALID [2022-02-20 19:58:07,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {22989#true} assume true; {22989#true} is VALID [2022-02-20 19:58:07,861 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22989#true} {22989#true} #1687#return; {22989#true} is VALID [2022-02-20 19:58:07,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {22989#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22989#true} is VALID [2022-02-20 19:58:07,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {22989#true} assume !(0 != ~tmp___0~1); {22989#true} is VALID [2022-02-20 19:58:07,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {22989#true} assume true; {22989#true} is VALID [2022-02-20 19:58:07,862 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {22989#true} {22991#(= ~q_free~0 1)} #1693#return; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:07,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {23030#(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); {22989#true} is VALID [2022-02-20 19:58:07,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {22989#true} assume !(1 == ~q_write_ev~0); {22989#true} is VALID [2022-02-20 19:58:07,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {22989#true} assume true; {22989#true} is VALID [2022-02-20 19:58:07,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22989#true} {22991#(= ~q_free~0 1)} #1695#return; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:07,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {22989#true} havoc ~__retres1~2; {22989#true} is VALID [2022-02-20 19:58:07,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {22989#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22989#true} is VALID [2022-02-20 19:58:07,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {22989#true} #res := ~__retres1~2; {22989#true} is VALID [2022-02-20 19:58:07,871 INFO L290 TraceCheckUtils]: 3: Hoare triple {22989#true} assume true; {22989#true} is VALID [2022-02-20 19:58:07,871 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22989#true} {22991#(= ~q_free~0 1)} #1697#return; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {22989#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {22989#true} is VALID [2022-02-20 19:58:07,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {22989#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {22989#true} is VALID [2022-02-20 19:58:07,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {22989#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#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; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,872 INFO L290 TraceCheckUtils]: 3: Hoare triple {22991#(= ~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; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {22991#(= ~q_free~0 1)} call update_channels1(); {23029#(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,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {23029#(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); {22989#true} is VALID [2022-02-20 19:58:07,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {22989#true} assume true; {22989#true} is VALID [2022-02-20 19:58:07,873 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22989#true} {22991#(= ~q_free~0 1)} #1689#return; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {22991#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {22991#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {22991#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {22991#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,874 INFO L272 TraceCheckUtils]: 12: Hoare triple {22991#(= ~q_free~0 1)} call fire_delta_events1(); {23030#(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,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {23030#(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); {22989#true} is VALID [2022-02-20 19:58:07,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {22989#true} assume !(0 == ~q_write_ev~0); {22989#true} is VALID [2022-02-20 19:58:07,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {22989#true} assume true; {22989#true} is VALID [2022-02-20 19:58:07,875 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22989#true} {22991#(= ~q_free~0 1)} #1691#return; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,875 INFO L272 TraceCheckUtils]: 17: Hoare triple {22991#(= ~q_free~0 1)} call activate_threads1(); {23031#(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,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {23031#(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; {22989#true} is VALID [2022-02-20 19:58:07,876 INFO L272 TraceCheckUtils]: 19: Hoare triple {22989#true} call #t~ret8 := is_do_write_p_triggered(); {22989#true} is VALID [2022-02-20 19:58:07,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {22989#true} havoc ~__retres1~0; {22989#true} is VALID [2022-02-20 19:58:07,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {22989#true} assume !(1 == ~p_dw_pc~0); {22989#true} is VALID [2022-02-20 19:58:07,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {22989#true} ~__retres1~0 := 0; {22989#true} is VALID [2022-02-20 19:58:07,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {22989#true} #res := ~__retres1~0; {22989#true} is VALID [2022-02-20 19:58:07,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {22989#true} assume true; {22989#true} is VALID [2022-02-20 19:58:07,876 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22989#true} {22989#true} #1685#return; {22989#true} is VALID [2022-02-20 19:58:07,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {22989#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22989#true} is VALID [2022-02-20 19:58:07,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {22989#true} assume !(0 != ~tmp~1); {22989#true} is VALID [2022-02-20 19:58:07,878 INFO L272 TraceCheckUtils]: 28: Hoare triple {22989#true} call #t~ret9 := is_do_read_c_triggered(); {22989#true} is VALID [2022-02-20 19:58:07,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {22989#true} havoc ~__retres1~1; {22989#true} is VALID [2022-02-20 19:58:07,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {22989#true} assume !(1 == ~c_dr_pc~0); {22989#true} is VALID [2022-02-20 19:58:07,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {22989#true} ~__retres1~1 := 0; {22989#true} is VALID [2022-02-20 19:58:07,878 INFO L290 TraceCheckUtils]: 32: Hoare triple {22989#true} #res := ~__retres1~1; {22989#true} is VALID [2022-02-20 19:58:07,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {22989#true} assume true; {22989#true} is VALID [2022-02-20 19:58:07,878 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {22989#true} {22989#true} #1687#return; {22989#true} is VALID [2022-02-20 19:58:07,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {22989#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22989#true} is VALID [2022-02-20 19:58:07,878 INFO L290 TraceCheckUtils]: 36: Hoare triple {22989#true} assume !(0 != ~tmp___0~1); {22989#true} is VALID [2022-02-20 19:58:07,878 INFO L290 TraceCheckUtils]: 37: Hoare triple {22989#true} assume true; {22989#true} is VALID [2022-02-20 19:58:07,879 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22989#true} {22991#(= ~q_free~0 1)} #1693#return; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,879 INFO L272 TraceCheckUtils]: 39: Hoare triple {22991#(= ~q_free~0 1)} call reset_delta_events1(); {23030#(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,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {23030#(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); {22989#true} is VALID [2022-02-20 19:58:07,879 INFO L290 TraceCheckUtils]: 41: Hoare triple {22989#true} assume !(1 == ~q_write_ev~0); {22989#true} is VALID [2022-02-20 19:58:07,879 INFO L290 TraceCheckUtils]: 42: Hoare triple {22989#true} assume true; {22989#true} is VALID [2022-02-20 19:58:07,880 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {22989#true} {22991#(= ~q_free~0 1)} #1695#return; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,880 INFO L290 TraceCheckUtils]: 44: Hoare triple {22991#(= ~q_free~0 1)} assume !false; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,880 INFO L290 TraceCheckUtils]: 45: Hoare triple {22991#(= ~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; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,880 INFO L290 TraceCheckUtils]: 46: Hoare triple {22991#(= ~q_free~0 1)} assume !false; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,881 INFO L272 TraceCheckUtils]: 47: Hoare triple {22991#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {22989#true} is VALID [2022-02-20 19:58:07,881 INFO L290 TraceCheckUtils]: 48: Hoare triple {22989#true} havoc ~__retres1~2; {22989#true} is VALID [2022-02-20 19:58:07,881 INFO L290 TraceCheckUtils]: 49: Hoare triple {22989#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22989#true} is VALID [2022-02-20 19:58:07,881 INFO L290 TraceCheckUtils]: 50: Hoare triple {22989#true} #res := ~__retres1~2; {22989#true} is VALID [2022-02-20 19:58:07,881 INFO L290 TraceCheckUtils]: 51: Hoare triple {22989#true} assume true; {22989#true} is VALID [2022-02-20 19:58:07,881 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {22989#true} {22991#(= ~q_free~0 1)} #1697#return; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,882 INFO L290 TraceCheckUtils]: 53: Hoare triple {22991#(= ~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; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,882 INFO L290 TraceCheckUtils]: 54: Hoare triple {22991#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,882 INFO L290 TraceCheckUtils]: 55: Hoare triple {22991#(= ~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; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,882 INFO L290 TraceCheckUtils]: 56: Hoare triple {22991#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,883 INFO L290 TraceCheckUtils]: 57: Hoare triple {22991#(= ~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; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,883 INFO L290 TraceCheckUtils]: 58: Hoare triple {22991#(= ~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; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,883 INFO L290 TraceCheckUtils]: 59: Hoare triple {22991#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,883 INFO L290 TraceCheckUtils]: 60: Hoare triple {22991#(= ~q_free~0 1)} assume !false; {22991#(= ~q_free~0 1)} is VALID [2022-02-20 19:58:07,883 INFO L290 TraceCheckUtils]: 61: Hoare triple {22991#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {22990#false} is VALID [2022-02-20 19:58:07,884 INFO L290 TraceCheckUtils]: 62: Hoare triple {22990#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; {22990#false} is VALID [2022-02-20 19:58:07,884 INFO L290 TraceCheckUtils]: 63: Hoare triple {22990#false} assume !(~p_last_write~0 == ~c_last_read~0); {22990#false} is VALID [2022-02-20 19:58:07,884 INFO L272 TraceCheckUtils]: 64: Hoare triple {22990#false} call error1(); {22990#false} is VALID [2022-02-20 19:58:07,884 INFO L290 TraceCheckUtils]: 65: Hoare triple {22990#false} assume !false; {22990#false} is VALID [2022-02-20 19:58:07,884 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,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:07,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410074286] [2022-02-20 19:58:07,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410074286] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:07,885 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:07,885 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:07,885 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626080058] [2022-02-20 19:58:07,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:07,885 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,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:07,886 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,917 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,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:07,917 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:07,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:07,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:07,918 INFO L87 Difference]: Start difference. First operand 944 states and 1330 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,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:09,790 INFO L93 Difference]: Finished difference Result 2147 states and 2901 transitions. [2022-02-20 19:58:09,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:09,790 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,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:09,791 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,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 937 transitions. [2022-02-20 19:58:09,795 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,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 937 transitions. [2022-02-20 19:58:09,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 937 transitions. [2022-02-20 19:58:10,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 937 edges. 937 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:10,551 INFO L225 Difference]: With dead ends: 2147 [2022-02-20 19:58:10,551 INFO L226 Difference]: Without dead ends: 1540 [2022-02-20 19:58:10,552 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:10,553 INFO L933 BasicCegarLoop]: 645 mSDtfsCounter, 752 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:10,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [760 Valid, 1836 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:58:10,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2022-02-20 19:58:10,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1425. [2022-02-20 19:58:10,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:10,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1540 states. Second operand has 1425 states, 1156 states have (on average 1.3685121107266436) internal successors, (1582), 1175 states have internal predecessors, (1582), 143 states have call successors, (143), 96 states have call predecessors, (143), 124 states have return successors, (203), 160 states have call predecessors, (203), 139 states have call successors, (203) [2022-02-20 19:58:10,624 INFO L74 IsIncluded]: Start isIncluded. First operand 1540 states. Second operand has 1425 states, 1156 states have (on average 1.3685121107266436) internal successors, (1582), 1175 states have internal predecessors, (1582), 143 states have call successors, (143), 96 states have call predecessors, (143), 124 states have return successors, (203), 160 states have call predecessors, (203), 139 states have call successors, (203) [2022-02-20 19:58:10,626 INFO L87 Difference]: Start difference. First operand 1540 states. Second operand has 1425 states, 1156 states have (on average 1.3685121107266436) internal successors, (1582), 1175 states have internal predecessors, (1582), 143 states have call successors, (143), 96 states have call predecessors, (143), 124 states have return successors, (203), 160 states have call predecessors, (203), 139 states have call successors, (203) [2022-02-20 19:58:10,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:10,702 INFO L93 Difference]: Finished difference Result 1540 states and 2063 transitions. [2022-02-20 19:58:10,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2063 transitions. [2022-02-20 19:58:10,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:10,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:10,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 1425 states, 1156 states have (on average 1.3685121107266436) internal successors, (1582), 1175 states have internal predecessors, (1582), 143 states have call successors, (143), 96 states have call predecessors, (143), 124 states have return successors, (203), 160 states have call predecessors, (203), 139 states have call successors, (203) Second operand 1540 states. [2022-02-20 19:58:10,708 INFO L87 Difference]: Start difference. First operand has 1425 states, 1156 states have (on average 1.3685121107266436) internal successors, (1582), 1175 states have internal predecessors, (1582), 143 states have call successors, (143), 96 states have call predecessors, (143), 124 states have return successors, (203), 160 states have call predecessors, (203), 139 states have call successors, (203) Second operand 1540 states. [2022-02-20 19:58:10,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:10,783 INFO L93 Difference]: Finished difference Result 1540 states and 2063 transitions. [2022-02-20 19:58:10,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2063 transitions. [2022-02-20 19:58:10,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:10,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:10,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:10,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 1156 states have (on average 1.3685121107266436) internal successors, (1582), 1175 states have internal predecessors, (1582), 143 states have call successors, (143), 96 states have call predecessors, (143), 124 states have return successors, (203), 160 states have call predecessors, (203), 139 states have call successors, (203) [2022-02-20 19:58:10,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 1928 transitions. [2022-02-20 19:58:10,864 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 1928 transitions. Word has length 66 [2022-02-20 19:58:10,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:10,864 INFO L470 AbstractCegarLoop]: Abstraction has 1425 states and 1928 transitions. [2022-02-20 19:58:10,865 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:10,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1928 transitions. [2022-02-20 19:58:10,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:58:10,866 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:10,866 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:10,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:58:10,866 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:10,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:10,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1035882595, now seen corresponding path program 1 times [2022-02-20 19:58:10,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:10,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881146207] [2022-02-20 19:58:10,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:10,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {30933#(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); {30893#true} is VALID [2022-02-20 19:58:10,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {30893#true} assume true; {30893#true} is VALID [2022-02-20 19:58:10,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30893#true} {30895#(= ~c_dr_pc~0 0)} #1689#return; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {30934#(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); {30893#true} is VALID [2022-02-20 19:58:10,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {30893#true} assume !(0 == ~q_write_ev~0); {30893#true} is VALID [2022-02-20 19:58:10,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {30893#true} assume true; {30893#true} is VALID [2022-02-20 19:58:10,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30893#true} {30895#(= ~c_dr_pc~0 0)} #1691#return; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {30893#true} havoc ~__retres1~0; {30893#true} is VALID [2022-02-20 19:58:10,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {30893#true} assume !(1 == ~p_dw_pc~0); {30893#true} is VALID [2022-02-20 19:58:10,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {30893#true} ~__retres1~0 := 0; {30893#true} is VALID [2022-02-20 19:58:10,915 INFO L290 TraceCheckUtils]: 3: Hoare triple {30893#true} #res := ~__retres1~0; {30893#true} is VALID [2022-02-20 19:58:10,915 INFO L290 TraceCheckUtils]: 4: Hoare triple {30893#true} assume true; {30893#true} is VALID [2022-02-20 19:58:10,915 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {30893#true} {30893#true} #1685#return; {30893#true} is VALID [2022-02-20 19:58:10,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {30893#true} havoc ~__retres1~1; {30893#true} is VALID [2022-02-20 19:58:10,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {30893#true} assume !(1 == ~c_dr_pc~0); {30893#true} is VALID [2022-02-20 19:58:10,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {30893#true} ~__retres1~1 := 0; {30893#true} is VALID [2022-02-20 19:58:10,920 INFO L290 TraceCheckUtils]: 3: Hoare triple {30893#true} #res := ~__retres1~1; {30893#true} is VALID [2022-02-20 19:58:10,920 INFO L290 TraceCheckUtils]: 4: Hoare triple {30893#true} assume true; {30893#true} is VALID [2022-02-20 19:58:10,920 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {30893#true} {30893#true} #1687#return; {30893#true} is VALID [2022-02-20 19:58:10,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {30935#(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; {30893#true} is VALID [2022-02-20 19:58:10,920 INFO L272 TraceCheckUtils]: 1: Hoare triple {30893#true} call #t~ret8 := is_do_write_p_triggered(); {30893#true} is VALID [2022-02-20 19:58:10,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {30893#true} havoc ~__retres1~0; {30893#true} is VALID [2022-02-20 19:58:10,921 INFO L290 TraceCheckUtils]: 3: Hoare triple {30893#true} assume !(1 == ~p_dw_pc~0); {30893#true} is VALID [2022-02-20 19:58:10,921 INFO L290 TraceCheckUtils]: 4: Hoare triple {30893#true} ~__retres1~0 := 0; {30893#true} is VALID [2022-02-20 19:58:10,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {30893#true} #res := ~__retres1~0; {30893#true} is VALID [2022-02-20 19:58:10,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {30893#true} assume true; {30893#true} is VALID [2022-02-20 19:58:10,921 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30893#true} {30893#true} #1685#return; {30893#true} is VALID [2022-02-20 19:58:10,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {30893#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30893#true} is VALID [2022-02-20 19:58:10,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {30893#true} assume !(0 != ~tmp~1); {30893#true} is VALID [2022-02-20 19:58:10,921 INFO L272 TraceCheckUtils]: 10: Hoare triple {30893#true} call #t~ret9 := is_do_read_c_triggered(); {30893#true} is VALID [2022-02-20 19:58:10,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {30893#true} havoc ~__retres1~1; {30893#true} is VALID [2022-02-20 19:58:10,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {30893#true} assume !(1 == ~c_dr_pc~0); {30893#true} is VALID [2022-02-20 19:58:10,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {30893#true} ~__retres1~1 := 0; {30893#true} is VALID [2022-02-20 19:58:10,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {30893#true} #res := ~__retres1~1; {30893#true} is VALID [2022-02-20 19:58:10,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {30893#true} assume true; {30893#true} is VALID [2022-02-20 19:58:10,922 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30893#true} {30893#true} #1687#return; {30893#true} is VALID [2022-02-20 19:58:10,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {30893#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30893#true} is VALID [2022-02-20 19:58:10,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {30893#true} assume !(0 != ~tmp___0~1); {30893#true} is VALID [2022-02-20 19:58:10,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {30893#true} assume true; {30893#true} is VALID [2022-02-20 19:58:10,923 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {30893#true} {30895#(= ~c_dr_pc~0 0)} #1693#return; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {30934#(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); {30893#true} is VALID [2022-02-20 19:58:10,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {30893#true} assume !(1 == ~q_write_ev~0); {30893#true} is VALID [2022-02-20 19:58:10,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {30893#true} assume true; {30893#true} is VALID [2022-02-20 19:58:10,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30893#true} {30895#(= ~c_dr_pc~0 0)} #1695#return; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:10,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {30893#true} havoc ~__retres1~2; {30893#true} is VALID [2022-02-20 19:58:10,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {30893#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30893#true} is VALID [2022-02-20 19:58:10,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {30893#true} #res := ~__retres1~2; {30893#true} is VALID [2022-02-20 19:58:10,930 INFO L290 TraceCheckUtils]: 3: Hoare triple {30893#true} assume true; {30893#true} is VALID [2022-02-20 19:58:10,931 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {30893#true} {30895#(= ~c_dr_pc~0 0)} #1697#return; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {30893#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {30893#true} is VALID [2022-02-20 19:58:10,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {30893#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {30893#true} is VALID [2022-02-20 19:58:10,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {30893#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#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; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {30895#(= ~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; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {30895#(= ~c_dr_pc~0 0)} call update_channels1(); {30933#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:10,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {30933#(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); {30893#true} is VALID [2022-02-20 19:58:10,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {30893#true} assume true; {30893#true} is VALID [2022-02-20 19:58:10,932 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30893#true} {30895#(= ~c_dr_pc~0 0)} #1689#return; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {30895#(= ~c_dr_pc~0 0)} assume { :begin_inline_init_threads1 } true; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {30895#(= ~c_dr_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {30895#(= ~c_dr_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {30895#(= ~c_dr_pc~0 0)} assume { :end_inline_init_threads1 } true; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,934 INFO L272 TraceCheckUtils]: 12: Hoare triple {30895#(= ~c_dr_pc~0 0)} call fire_delta_events1(); {30934#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:10,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {30934#(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); {30893#true} is VALID [2022-02-20 19:58:10,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {30893#true} assume !(0 == ~q_write_ev~0); {30893#true} is VALID [2022-02-20 19:58:10,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {30893#true} assume true; {30893#true} is VALID [2022-02-20 19:58:10,934 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {30893#true} {30895#(= ~c_dr_pc~0 0)} #1691#return; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,935 INFO L272 TraceCheckUtils]: 17: Hoare triple {30895#(= ~c_dr_pc~0 0)} call activate_threads1(); {30935#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:10,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {30935#(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; {30893#true} is VALID [2022-02-20 19:58:10,935 INFO L272 TraceCheckUtils]: 19: Hoare triple {30893#true} call #t~ret8 := is_do_write_p_triggered(); {30893#true} is VALID [2022-02-20 19:58:10,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {30893#true} havoc ~__retres1~0; {30893#true} is VALID [2022-02-20 19:58:10,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {30893#true} assume !(1 == ~p_dw_pc~0); {30893#true} is VALID [2022-02-20 19:58:10,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {30893#true} ~__retres1~0 := 0; {30893#true} is VALID [2022-02-20 19:58:10,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {30893#true} #res := ~__retres1~0; {30893#true} is VALID [2022-02-20 19:58:10,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {30893#true} assume true; {30893#true} is VALID [2022-02-20 19:58:10,935 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {30893#true} {30893#true} #1685#return; {30893#true} is VALID [2022-02-20 19:58:10,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {30893#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {30893#true} is VALID [2022-02-20 19:58:10,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {30893#true} assume !(0 != ~tmp~1); {30893#true} is VALID [2022-02-20 19:58:10,936 INFO L272 TraceCheckUtils]: 28: Hoare triple {30893#true} call #t~ret9 := is_do_read_c_triggered(); {30893#true} is VALID [2022-02-20 19:58:10,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {30893#true} havoc ~__retres1~1; {30893#true} is VALID [2022-02-20 19:58:10,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {30893#true} assume !(1 == ~c_dr_pc~0); {30893#true} is VALID [2022-02-20 19:58:10,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {30893#true} ~__retres1~1 := 0; {30893#true} is VALID [2022-02-20 19:58:10,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {30893#true} #res := ~__retres1~1; {30893#true} is VALID [2022-02-20 19:58:10,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {30893#true} assume true; {30893#true} is VALID [2022-02-20 19:58:10,936 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {30893#true} {30893#true} #1687#return; {30893#true} is VALID [2022-02-20 19:58:10,936 INFO L290 TraceCheckUtils]: 35: Hoare triple {30893#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {30893#true} is VALID [2022-02-20 19:58:10,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {30893#true} assume !(0 != ~tmp___0~1); {30893#true} is VALID [2022-02-20 19:58:10,937 INFO L290 TraceCheckUtils]: 37: Hoare triple {30893#true} assume true; {30893#true} is VALID [2022-02-20 19:58:10,937 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {30893#true} {30895#(= ~c_dr_pc~0 0)} #1693#return; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,937 INFO L272 TraceCheckUtils]: 39: Hoare triple {30895#(= ~c_dr_pc~0 0)} call reset_delta_events1(); {30934#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:10,937 INFO L290 TraceCheckUtils]: 40: Hoare triple {30934#(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); {30893#true} is VALID [2022-02-20 19:58:10,938 INFO L290 TraceCheckUtils]: 41: Hoare triple {30893#true} assume !(1 == ~q_write_ev~0); {30893#true} is VALID [2022-02-20 19:58:10,938 INFO L290 TraceCheckUtils]: 42: Hoare triple {30893#true} assume true; {30893#true} is VALID [2022-02-20 19:58:10,938 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {30893#true} {30895#(= ~c_dr_pc~0 0)} #1695#return; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {30895#(= ~c_dr_pc~0 0)} assume !false; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {30895#(= ~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; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,939 INFO L290 TraceCheckUtils]: 46: Hoare triple {30895#(= ~c_dr_pc~0 0)} assume !false; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,939 INFO L272 TraceCheckUtils]: 47: Hoare triple {30895#(= ~c_dr_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {30893#true} is VALID [2022-02-20 19:58:10,939 INFO L290 TraceCheckUtils]: 48: Hoare triple {30893#true} havoc ~__retres1~2; {30893#true} is VALID [2022-02-20 19:58:10,939 INFO L290 TraceCheckUtils]: 49: Hoare triple {30893#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {30893#true} is VALID [2022-02-20 19:58:10,939 INFO L290 TraceCheckUtils]: 50: Hoare triple {30893#true} #res := ~__retres1~2; {30893#true} is VALID [2022-02-20 19:58:10,939 INFO L290 TraceCheckUtils]: 51: Hoare triple {30893#true} assume true; {30893#true} is VALID [2022-02-20 19:58:10,940 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {30893#true} {30895#(= ~c_dr_pc~0 0)} #1697#return; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,940 INFO L290 TraceCheckUtils]: 53: Hoare triple {30895#(= ~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; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,940 INFO L290 TraceCheckUtils]: 54: Hoare triple {30895#(= ~c_dr_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,940 INFO L290 TraceCheckUtils]: 55: Hoare triple {30895#(= ~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; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,941 INFO L290 TraceCheckUtils]: 56: Hoare triple {30895#(= ~c_dr_pc~0 0)} assume !(0 != eval1_~tmp~2#1); {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,941 INFO L290 TraceCheckUtils]: 57: Hoare triple {30895#(= ~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; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,941 INFO L290 TraceCheckUtils]: 58: Hoare triple {30895#(= ~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; {30895#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:58:10,941 INFO L290 TraceCheckUtils]: 59: Hoare triple {30895#(= ~c_dr_pc~0 0)} assume !(0 == ~c_dr_pc~0); {30894#false} is VALID [2022-02-20 19:58:10,941 INFO L290 TraceCheckUtils]: 60: Hoare triple {30894#false} assume 1 == ~c_dr_pc~0; {30894#false} is VALID [2022-02-20 19:58:10,942 INFO L290 TraceCheckUtils]: 61: Hoare triple {30894#false} do_read_c_~a~0#1 := ~a_t~0; {30894#false} is VALID [2022-02-20 19:58:10,942 INFO L290 TraceCheckUtils]: 62: Hoare triple {30894#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; {30894#false} is VALID [2022-02-20 19:58:10,942 INFO L290 TraceCheckUtils]: 63: Hoare triple {30894#false} assume !(~p_last_write~0 == ~c_last_read~0); {30894#false} is VALID [2022-02-20 19:58:10,942 INFO L272 TraceCheckUtils]: 64: Hoare triple {30894#false} call error1(); {30894#false} is VALID [2022-02-20 19:58:10,942 INFO L290 TraceCheckUtils]: 65: Hoare triple {30894#false} assume !false; {30894#false} is VALID [2022-02-20 19:58:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:58:10,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:10,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881146207] [2022-02-20 19:58:10,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881146207] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:10,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:10,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:10,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321526254] [2022-02-20 19:58:10,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:10,943 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:10,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:10,944 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:10,981 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:10,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:10,981 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:10,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:10,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:10,982 INFO L87 Difference]: Start difference. First operand 1425 states and 1928 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:13,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:13,040 INFO L93 Difference]: Finished difference Result 3613 states and 4734 transitions. [2022-02-20 19:58:13,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:13,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:58:13,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:13,040 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:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 935 transitions. [2022-02-20 19:58:13,045 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:13,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 935 transitions. [2022-02-20 19:58:13,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 935 transitions. [2022-02-20 19:58:13,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 935 edges. 935 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:13,886 INFO L225 Difference]: With dead ends: 3613 [2022-02-20 19:58:13,887 INFO L226 Difference]: Without dead ends: 2545 [2022-02-20 19:58:13,888 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:13,889 INFO L933 BasicCegarLoop]: 646 mSDtfsCounter, 1255 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:13,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1286 Valid, 1576 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:58:13,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2545 states. [2022-02-20 19:58:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2545 to 2287. [2022-02-20 19:58:14,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:14,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2545 states. Second operand has 2287 states, 1822 states have (on average 1.3221734357848518) internal successors, (2409), 1851 states have internal predecessors, (2409), 241 states have call successors, (241), 180 states have call predecessors, (241), 222 states have return successors, (339), 262 states have call predecessors, (339), 237 states have call successors, (339) [2022-02-20 19:58:14,033 INFO L74 IsIncluded]: Start isIncluded. First operand 2545 states. Second operand has 2287 states, 1822 states have (on average 1.3221734357848518) internal successors, (2409), 1851 states have internal predecessors, (2409), 241 states have call successors, (241), 180 states have call predecessors, (241), 222 states have return successors, (339), 262 states have call predecessors, (339), 237 states have call successors, (339) [2022-02-20 19:58:14,035 INFO L87 Difference]: Start difference. First operand 2545 states. Second operand has 2287 states, 1822 states have (on average 1.3221734357848518) internal successors, (2409), 1851 states have internal predecessors, (2409), 241 states have call successors, (241), 180 states have call predecessors, (241), 222 states have return successors, (339), 262 states have call predecessors, (339), 237 states have call successors, (339) [2022-02-20 19:58:14,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:14,208 INFO L93 Difference]: Finished difference Result 2545 states and 3289 transitions. [2022-02-20 19:58:14,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 3289 transitions. [2022-02-20 19:58:14,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:14,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:14,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 2287 states, 1822 states have (on average 1.3221734357848518) internal successors, (2409), 1851 states have internal predecessors, (2409), 241 states have call successors, (241), 180 states have call predecessors, (241), 222 states have return successors, (339), 262 states have call predecessors, (339), 237 states have call successors, (339) Second operand 2545 states. [2022-02-20 19:58:14,218 INFO L87 Difference]: Start difference. First operand has 2287 states, 1822 states have (on average 1.3221734357848518) internal successors, (2409), 1851 states have internal predecessors, (2409), 241 states have call successors, (241), 180 states have call predecessors, (241), 222 states have return successors, (339), 262 states have call predecessors, (339), 237 states have call successors, (339) Second operand 2545 states. [2022-02-20 19:58:14,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:14,408 INFO L93 Difference]: Finished difference Result 2545 states and 3289 transitions. [2022-02-20 19:58:14,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 3289 transitions. [2022-02-20 19:58:14,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:14,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:14,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:14,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2287 states, 1822 states have (on average 1.3221734357848518) internal successors, (2409), 1851 states have internal predecessors, (2409), 241 states have call successors, (241), 180 states have call predecessors, (241), 222 states have return successors, (339), 262 states have call predecessors, (339), 237 states have call successors, (339) [2022-02-20 19:58:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 2989 transitions. [2022-02-20 19:58:14,622 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 2989 transitions. Word has length 66 [2022-02-20 19:58:14,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:14,623 INFO L470 AbstractCegarLoop]: Abstraction has 2287 states and 2989 transitions. [2022-02-20 19:58:14,623 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:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 2989 transitions. [2022-02-20 19:58:14,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:58:14,624 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:14,624 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:14,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:58:14,625 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:14,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:14,625 INFO L85 PathProgramCache]: Analyzing trace with hash 283948209, now seen corresponding path program 1 times [2022-02-20 19:58:14,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:14,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677868233] [2022-02-20 19:58:14,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:14,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:14,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:14,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {43956#(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); {43916#true} is VALID [2022-02-20 19:58:14,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {43916#true} assume true; {43916#true} is VALID [2022-02-20 19:58:14,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43916#true} {43918#(= ~p_dw_pc~0 0)} #1689#return; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:14,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {43957#(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); {43916#true} is VALID [2022-02-20 19:58:14,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {43916#true} assume !(0 == ~q_write_ev~0); {43916#true} is VALID [2022-02-20 19:58:14,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {43916#true} assume true; {43916#true} is VALID [2022-02-20 19:58:14,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43916#true} {43918#(= ~p_dw_pc~0 0)} #1691#return; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:14,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:14,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {43916#true} havoc ~__retres1~0; {43916#true} is VALID [2022-02-20 19:58:14,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {43916#true} assume !(1 == ~p_dw_pc~0); {43916#true} is VALID [2022-02-20 19:58:14,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {43916#true} ~__retres1~0 := 0; {43916#true} is VALID [2022-02-20 19:58:14,680 INFO L290 TraceCheckUtils]: 3: Hoare triple {43916#true} #res := ~__retres1~0; {43916#true} is VALID [2022-02-20 19:58:14,680 INFO L290 TraceCheckUtils]: 4: Hoare triple {43916#true} assume true; {43916#true} is VALID [2022-02-20 19:58:14,680 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {43916#true} {43916#true} #1685#return; {43916#true} is VALID [2022-02-20 19:58:14,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:14,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {43916#true} havoc ~__retres1~1; {43916#true} is VALID [2022-02-20 19:58:14,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {43916#true} assume !(1 == ~c_dr_pc~0); {43916#true} is VALID [2022-02-20 19:58:14,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {43916#true} ~__retres1~1 := 0; {43916#true} is VALID [2022-02-20 19:58:14,682 INFO L290 TraceCheckUtils]: 3: Hoare triple {43916#true} #res := ~__retres1~1; {43916#true} is VALID [2022-02-20 19:58:14,682 INFO L290 TraceCheckUtils]: 4: Hoare triple {43916#true} assume true; {43916#true} is VALID [2022-02-20 19:58:14,682 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {43916#true} {43916#true} #1687#return; {43916#true} is VALID [2022-02-20 19:58:14,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {43958#(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; {43916#true} is VALID [2022-02-20 19:58:14,682 INFO L272 TraceCheckUtils]: 1: Hoare triple {43916#true} call #t~ret8 := is_do_write_p_triggered(); {43916#true} is VALID [2022-02-20 19:58:14,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {43916#true} havoc ~__retres1~0; {43916#true} is VALID [2022-02-20 19:58:14,683 INFO L290 TraceCheckUtils]: 3: Hoare triple {43916#true} assume !(1 == ~p_dw_pc~0); {43916#true} is VALID [2022-02-20 19:58:14,683 INFO L290 TraceCheckUtils]: 4: Hoare triple {43916#true} ~__retres1~0 := 0; {43916#true} is VALID [2022-02-20 19:58:14,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {43916#true} #res := ~__retres1~0; {43916#true} is VALID [2022-02-20 19:58:14,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {43916#true} assume true; {43916#true} is VALID [2022-02-20 19:58:14,683 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {43916#true} {43916#true} #1685#return; {43916#true} is VALID [2022-02-20 19:58:14,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {43916#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {43916#true} is VALID [2022-02-20 19:58:14,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {43916#true} assume !(0 != ~tmp~1); {43916#true} is VALID [2022-02-20 19:58:14,683 INFO L272 TraceCheckUtils]: 10: Hoare triple {43916#true} call #t~ret9 := is_do_read_c_triggered(); {43916#true} is VALID [2022-02-20 19:58:14,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {43916#true} havoc ~__retres1~1; {43916#true} is VALID [2022-02-20 19:58:14,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {43916#true} assume !(1 == ~c_dr_pc~0); {43916#true} is VALID [2022-02-20 19:58:14,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {43916#true} ~__retres1~1 := 0; {43916#true} is VALID [2022-02-20 19:58:14,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {43916#true} #res := ~__retres1~1; {43916#true} is VALID [2022-02-20 19:58:14,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {43916#true} assume true; {43916#true} is VALID [2022-02-20 19:58:14,684 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {43916#true} {43916#true} #1687#return; {43916#true} is VALID [2022-02-20 19:58:14,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {43916#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {43916#true} is VALID [2022-02-20 19:58:14,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {43916#true} assume !(0 != ~tmp___0~1); {43916#true} is VALID [2022-02-20 19:58:14,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {43916#true} assume true; {43916#true} is VALID [2022-02-20 19:58:14,685 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {43916#true} {43918#(= ~p_dw_pc~0 0)} #1693#return; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:14,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {43957#(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); {43916#true} is VALID [2022-02-20 19:58:14,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {43916#true} assume !(1 == ~q_write_ev~0); {43916#true} is VALID [2022-02-20 19:58:14,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {43916#true} assume true; {43916#true} is VALID [2022-02-20 19:58:14,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43916#true} {43918#(= ~p_dw_pc~0 0)} #1695#return; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:14,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {43916#true} havoc ~__retres1~2; {43916#true} is VALID [2022-02-20 19:58:14,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {43916#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {43916#true} is VALID [2022-02-20 19:58:14,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {43916#true} #res := ~__retres1~2; {43916#true} is VALID [2022-02-20 19:58:14,691 INFO L290 TraceCheckUtils]: 3: Hoare triple {43916#true} assume true; {43916#true} is VALID [2022-02-20 19:58:14,691 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {43916#true} {43918#(= ~p_dw_pc~0 0)} #1697#return; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {43916#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {43916#true} is VALID [2022-02-20 19:58:14,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {43916#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {43916#true} is VALID [2022-02-20 19:58:14,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {43916#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#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; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,692 INFO L290 TraceCheckUtils]: 3: Hoare triple {43918#(= ~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; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {43918#(= ~p_dw_pc~0 0)} call update_channels1(); {43956#(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:14,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {43956#(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); {43916#true} is VALID [2022-02-20 19:58:14,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {43916#true} assume true; {43916#true} is VALID [2022-02-20 19:58:14,693 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {43916#true} {43918#(= ~p_dw_pc~0 0)} #1689#return; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {43918#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {43918#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {43918#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {43918#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,694 INFO L272 TraceCheckUtils]: 12: Hoare triple {43918#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {43957#(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:14,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {43957#(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); {43916#true} is VALID [2022-02-20 19:58:14,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {43916#true} assume !(0 == ~q_write_ev~0); {43916#true} is VALID [2022-02-20 19:58:14,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {43916#true} assume true; {43916#true} is VALID [2022-02-20 19:58:14,695 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {43916#true} {43918#(= ~p_dw_pc~0 0)} #1691#return; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,695 INFO L272 TraceCheckUtils]: 17: Hoare triple {43918#(= ~p_dw_pc~0 0)} call activate_threads1(); {43958#(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:14,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {43958#(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; {43916#true} is VALID [2022-02-20 19:58:14,696 INFO L272 TraceCheckUtils]: 19: Hoare triple {43916#true} call #t~ret8 := is_do_write_p_triggered(); {43916#true} is VALID [2022-02-20 19:58:14,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {43916#true} havoc ~__retres1~0; {43916#true} is VALID [2022-02-20 19:58:14,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {43916#true} assume !(1 == ~p_dw_pc~0); {43916#true} is VALID [2022-02-20 19:58:14,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {43916#true} ~__retres1~0 := 0; {43916#true} is VALID [2022-02-20 19:58:14,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {43916#true} #res := ~__retres1~0; {43916#true} is VALID [2022-02-20 19:58:14,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {43916#true} assume true; {43916#true} is VALID [2022-02-20 19:58:14,696 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {43916#true} {43916#true} #1685#return; {43916#true} is VALID [2022-02-20 19:58:14,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {43916#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {43916#true} is VALID [2022-02-20 19:58:14,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {43916#true} assume !(0 != ~tmp~1); {43916#true} is VALID [2022-02-20 19:58:14,696 INFO L272 TraceCheckUtils]: 28: Hoare triple {43916#true} call #t~ret9 := is_do_read_c_triggered(); {43916#true} is VALID [2022-02-20 19:58:14,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {43916#true} havoc ~__retres1~1; {43916#true} is VALID [2022-02-20 19:58:14,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {43916#true} assume !(1 == ~c_dr_pc~0); {43916#true} is VALID [2022-02-20 19:58:14,697 INFO L290 TraceCheckUtils]: 31: Hoare triple {43916#true} ~__retres1~1 := 0; {43916#true} is VALID [2022-02-20 19:58:14,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {43916#true} #res := ~__retres1~1; {43916#true} is VALID [2022-02-20 19:58:14,697 INFO L290 TraceCheckUtils]: 33: Hoare triple {43916#true} assume true; {43916#true} is VALID [2022-02-20 19:58:14,697 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {43916#true} {43916#true} #1687#return; {43916#true} is VALID [2022-02-20 19:58:14,697 INFO L290 TraceCheckUtils]: 35: Hoare triple {43916#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {43916#true} is VALID [2022-02-20 19:58:14,697 INFO L290 TraceCheckUtils]: 36: Hoare triple {43916#true} assume !(0 != ~tmp___0~1); {43916#true} is VALID [2022-02-20 19:58:14,697 INFO L290 TraceCheckUtils]: 37: Hoare triple {43916#true} assume true; {43916#true} is VALID [2022-02-20 19:58:14,698 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {43916#true} {43918#(= ~p_dw_pc~0 0)} #1693#return; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,698 INFO L272 TraceCheckUtils]: 39: Hoare triple {43918#(= ~p_dw_pc~0 0)} call reset_delta_events1(); {43957#(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:14,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {43957#(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); {43916#true} is VALID [2022-02-20 19:58:14,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {43916#true} assume !(1 == ~q_write_ev~0); {43916#true} is VALID [2022-02-20 19:58:14,698 INFO L290 TraceCheckUtils]: 42: Hoare triple {43916#true} assume true; {43916#true} is VALID [2022-02-20 19:58:14,699 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {43916#true} {43918#(= ~p_dw_pc~0 0)} #1695#return; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {43918#(= ~p_dw_pc~0 0)} assume !false; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {43918#(= ~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; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,699 INFO L290 TraceCheckUtils]: 46: Hoare triple {43918#(= ~p_dw_pc~0 0)} assume !false; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,700 INFO L272 TraceCheckUtils]: 47: Hoare triple {43918#(= ~p_dw_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {43916#true} is VALID [2022-02-20 19:58:14,700 INFO L290 TraceCheckUtils]: 48: Hoare triple {43916#true} havoc ~__retres1~2; {43916#true} is VALID [2022-02-20 19:58:14,700 INFO L290 TraceCheckUtils]: 49: Hoare triple {43916#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {43916#true} is VALID [2022-02-20 19:58:14,700 INFO L290 TraceCheckUtils]: 50: Hoare triple {43916#true} #res := ~__retres1~2; {43916#true} is VALID [2022-02-20 19:58:14,700 INFO L290 TraceCheckUtils]: 51: Hoare triple {43916#true} assume true; {43916#true} is VALID [2022-02-20 19:58:14,700 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {43916#true} {43918#(= ~p_dw_pc~0 0)} #1697#return; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,701 INFO L290 TraceCheckUtils]: 53: Hoare triple {43918#(= ~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; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,701 INFO L290 TraceCheckUtils]: 54: Hoare triple {43918#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,701 INFO L290 TraceCheckUtils]: 55: Hoare triple {43918#(= ~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; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,701 INFO L290 TraceCheckUtils]: 56: Hoare triple {43918#(= ~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; {43918#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:58:14,702 INFO L290 TraceCheckUtils]: 57: Hoare triple {43918#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {43917#false} is VALID [2022-02-20 19:58:14,702 INFO L290 TraceCheckUtils]: 58: Hoare triple {43917#false} assume 1 == ~p_dw_pc~0; {43917#false} is VALID [2022-02-20 19:58:14,702 INFO L290 TraceCheckUtils]: 59: Hoare triple {43917#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; {43917#false} is VALID [2022-02-20 19:58:14,702 INFO L290 TraceCheckUtils]: 60: Hoare triple {43917#false} assume !false; {43917#false} is VALID [2022-02-20 19:58:14,702 INFO L290 TraceCheckUtils]: 61: Hoare triple {43917#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {43917#false} is VALID [2022-02-20 19:58:14,702 INFO L290 TraceCheckUtils]: 62: Hoare triple {43917#false} assume { :end_inline_do_write_p } true; {43917#false} is VALID [2022-02-20 19:58:14,702 INFO L290 TraceCheckUtils]: 63: Hoare triple {43917#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; {43917#false} is VALID [2022-02-20 19:58:14,702 INFO L290 TraceCheckUtils]: 64: Hoare triple {43917#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; {43917#false} is VALID [2022-02-20 19:58:14,703 INFO L290 TraceCheckUtils]: 65: Hoare triple {43917#false} assume 0 == ~c_dr_pc~0; {43917#false} is VALID [2022-02-20 19:58:14,703 INFO L290 TraceCheckUtils]: 66: Hoare triple {43917#false} assume !false; {43917#false} is VALID [2022-02-20 19:58:14,703 INFO L290 TraceCheckUtils]: 67: Hoare triple {43917#false} assume !(1 == ~q_free~0); {43917#false} is VALID [2022-02-20 19:58:14,703 INFO L290 TraceCheckUtils]: 68: Hoare triple {43917#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; {43917#false} is VALID [2022-02-20 19:58:14,703 INFO L290 TraceCheckUtils]: 69: Hoare triple {43917#false} assume !(~p_last_write~0 == ~c_last_read~0); {43917#false} is VALID [2022-02-20 19:58:14,703 INFO L272 TraceCheckUtils]: 70: Hoare triple {43917#false} call error1(); {43917#false} is VALID [2022-02-20 19:58:14,703 INFO L290 TraceCheckUtils]: 71: Hoare triple {43917#false} assume !false; {43917#false} is VALID [2022-02-20 19:58:14,703 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:14,704 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:14,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677868233] [2022-02-20 19:58:14,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677868233] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:14,704 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:14,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:58:14,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148242089] [2022-02-20 19:58:14,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:14,705 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:14,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:14,705 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:14,745 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:14,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:58:14,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:14,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:58:14,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:58:14,746 INFO L87 Difference]: Start difference. First operand 2287 states and 2989 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:17,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:17,262 INFO L93 Difference]: Finished difference Result 5197 states and 6639 transitions. [2022-02-20 19:58:17,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:58:17,262 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:17,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:17,262 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:17,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 921 transitions. [2022-02-20 19:58:17,267 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:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 921 transitions. [2022-02-20 19:58:17,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 921 transitions. [2022-02-20 19:58:17,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 921 edges. 921 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:18,354 INFO L225 Difference]: With dead ends: 5197 [2022-02-20 19:58:18,354 INFO L226 Difference]: Without dead ends: 3267 [2022-02-20 19:58:18,357 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:18,357 INFO L933 BasicCegarLoop]: 660 mSDtfsCounter, 1240 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:18,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1271 Valid, 1622 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:58:18,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3267 states. [2022-02-20 19:58:18,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3267 to 3019. [2022-02-20 19:58:18,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:18,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3267 states. Second operand has 3019 states, 2390 states have (on average 1.302510460251046) internal successors, (3113), 2427 states have internal predecessors, (3113), 321 states have call successors, (321), 250 states have call predecessors, (321), 306 states have return successors, (448), 348 states have call predecessors, (448), 317 states have call successors, (448) [2022-02-20 19:58:18,559 INFO L74 IsIncluded]: Start isIncluded. First operand 3267 states. Second operand has 3019 states, 2390 states have (on average 1.302510460251046) internal successors, (3113), 2427 states have internal predecessors, (3113), 321 states have call successors, (321), 250 states have call predecessors, (321), 306 states have return successors, (448), 348 states have call predecessors, (448), 317 states have call successors, (448) [2022-02-20 19:58:18,564 INFO L87 Difference]: Start difference. First operand 3267 states. Second operand has 3019 states, 2390 states have (on average 1.302510460251046) internal successors, (3113), 2427 states have internal predecessors, (3113), 321 states have call successors, (321), 250 states have call predecessors, (321), 306 states have return successors, (448), 348 states have call predecessors, (448), 317 states have call successors, (448) [2022-02-20 19:58:18,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:18,902 INFO L93 Difference]: Finished difference Result 3267 states and 4163 transitions. [2022-02-20 19:58:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3267 states and 4163 transitions. [2022-02-20 19:58:18,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:18,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:18,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 3019 states, 2390 states have (on average 1.302510460251046) internal successors, (3113), 2427 states have internal predecessors, (3113), 321 states have call successors, (321), 250 states have call predecessors, (321), 306 states have return successors, (448), 348 states have call predecessors, (448), 317 states have call successors, (448) Second operand 3267 states. [2022-02-20 19:58:18,914 INFO L87 Difference]: Start difference. First operand has 3019 states, 2390 states have (on average 1.302510460251046) internal successors, (3113), 2427 states have internal predecessors, (3113), 321 states have call successors, (321), 250 states have call predecessors, (321), 306 states have return successors, (448), 348 states have call predecessors, (448), 317 states have call successors, (448) Second operand 3267 states. [2022-02-20 19:58:19,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:19,233 INFO L93 Difference]: Finished difference Result 3267 states and 4163 transitions. [2022-02-20 19:58:19,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3267 states and 4163 transitions. [2022-02-20 19:58:19,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:19,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:19,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:19,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:19,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 2390 states have (on average 1.302510460251046) internal successors, (3113), 2427 states have internal predecessors, (3113), 321 states have call successors, (321), 250 states have call predecessors, (321), 306 states have return successors, (448), 348 states have call predecessors, (448), 317 states have call successors, (448) [2022-02-20 19:58:19,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 3882 transitions. [2022-02-20 19:58:19,602 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 3882 transitions. Word has length 72 [2022-02-20 19:58:19,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:19,602 INFO L470 AbstractCegarLoop]: Abstraction has 3019 states and 3882 transitions. [2022-02-20 19:58:19,602 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:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3882 transitions. [2022-02-20 19:58:19,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:58:19,603 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:19,604 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:19,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:58:19,604 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:19,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:19,604 INFO L85 PathProgramCache]: Analyzing trace with hash -304350912, now seen corresponding path program 1 times [2022-02-20 19:58:19,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:19,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573811969] [2022-02-20 19:58:19,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:19,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {61548#(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); {61507#true} is VALID [2022-02-20 19:58:19,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {61507#true} assume true; {61507#true} is VALID [2022-02-20 19:58:19,653 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61507#true} {61507#true} #1689#return; {61507#true} is VALID [2022-02-20 19:58:19,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {61549#(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); {61507#true} is VALID [2022-02-20 19:58:19,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {61507#true} assume !(0 == ~q_write_ev~0); {61507#true} is VALID [2022-02-20 19:58:19,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {61507#true} assume true; {61507#true} is VALID [2022-02-20 19:58:19,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61507#true} {61507#true} #1691#return; {61507#true} is VALID [2022-02-20 19:58:19,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {61507#true} havoc ~__retres1~0; {61507#true} is VALID [2022-02-20 19:58:19,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {61507#true} assume !(1 == ~p_dw_pc~0); {61507#true} is VALID [2022-02-20 19:58:19,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {61507#true} ~__retres1~0 := 0; {61507#true} is VALID [2022-02-20 19:58:19,672 INFO L290 TraceCheckUtils]: 3: Hoare triple {61507#true} #res := ~__retres1~0; {61507#true} is VALID [2022-02-20 19:58:19,672 INFO L290 TraceCheckUtils]: 4: Hoare triple {61507#true} assume true; {61507#true} is VALID [2022-02-20 19:58:19,672 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {61507#true} {61507#true} #1685#return; {61507#true} is VALID [2022-02-20 19:58:19,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {61507#true} havoc ~__retres1~1; {61507#true} is VALID [2022-02-20 19:58:19,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {61507#true} assume !(1 == ~c_dr_pc~0); {61507#true} is VALID [2022-02-20 19:58:19,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {61507#true} ~__retres1~1 := 0; {61507#true} is VALID [2022-02-20 19:58:19,674 INFO L290 TraceCheckUtils]: 3: Hoare triple {61507#true} #res := ~__retres1~1; {61507#true} is VALID [2022-02-20 19:58:19,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {61507#true} assume true; {61507#true} is VALID [2022-02-20 19:58:19,675 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {61507#true} {61507#true} #1687#return; {61507#true} is VALID [2022-02-20 19:58:19,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {61550#(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; {61507#true} is VALID [2022-02-20 19:58:19,675 INFO L272 TraceCheckUtils]: 1: Hoare triple {61507#true} call #t~ret8 := is_do_write_p_triggered(); {61507#true} is VALID [2022-02-20 19:58:19,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {61507#true} havoc ~__retres1~0; {61507#true} is VALID [2022-02-20 19:58:19,675 INFO L290 TraceCheckUtils]: 3: Hoare triple {61507#true} assume !(1 == ~p_dw_pc~0); {61507#true} is VALID [2022-02-20 19:58:19,675 INFO L290 TraceCheckUtils]: 4: Hoare triple {61507#true} ~__retres1~0 := 0; {61507#true} is VALID [2022-02-20 19:58:19,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {61507#true} #res := ~__retres1~0; {61507#true} is VALID [2022-02-20 19:58:19,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {61507#true} assume true; {61507#true} is VALID [2022-02-20 19:58:19,675 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {61507#true} {61507#true} #1685#return; {61507#true} is VALID [2022-02-20 19:58:19,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {61507#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {61507#true} is VALID [2022-02-20 19:58:19,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {61507#true} assume !(0 != ~tmp~1); {61507#true} is VALID [2022-02-20 19:58:19,676 INFO L272 TraceCheckUtils]: 10: Hoare triple {61507#true} call #t~ret9 := is_do_read_c_triggered(); {61507#true} is VALID [2022-02-20 19:58:19,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {61507#true} havoc ~__retres1~1; {61507#true} is VALID [2022-02-20 19:58:19,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {61507#true} assume !(1 == ~c_dr_pc~0); {61507#true} is VALID [2022-02-20 19:58:19,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {61507#true} ~__retres1~1 := 0; {61507#true} is VALID [2022-02-20 19:58:19,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {61507#true} #res := ~__retres1~1; {61507#true} is VALID [2022-02-20 19:58:19,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {61507#true} assume true; {61507#true} is VALID [2022-02-20 19:58:19,676 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {61507#true} {61507#true} #1687#return; {61507#true} is VALID [2022-02-20 19:58:19,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {61507#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {61507#true} is VALID [2022-02-20 19:58:19,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {61507#true} assume !(0 != ~tmp___0~1); {61507#true} is VALID [2022-02-20 19:58:19,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {61507#true} assume true; {61507#true} is VALID [2022-02-20 19:58:19,677 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {61507#true} {61507#true} #1693#return; {61507#true} is VALID [2022-02-20 19:58:19,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {61549#(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); {61507#true} is VALID [2022-02-20 19:58:19,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {61507#true} assume !(1 == ~q_write_ev~0); {61507#true} is VALID [2022-02-20 19:58:19,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {61507#true} assume true; {61507#true} is VALID [2022-02-20 19:58:19,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61507#true} {61507#true} #1695#return; {61507#true} is VALID [2022-02-20 19:58:19,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:19,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {61507#true} havoc ~__retres1~2; {61507#true} is VALID [2022-02-20 19:58:19,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {61507#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {61507#true} is VALID [2022-02-20 19:58:19,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {61507#true} #res := ~__retres1~2; {61507#true} is VALID [2022-02-20 19:58:19,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {61507#true} assume true; {61507#true} is VALID [2022-02-20 19:58:19,685 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {61507#true} {61507#true} #1697#return; {61507#true} is VALID [2022-02-20 19:58:19,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {61507#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {61507#true} is VALID [2022-02-20 19:58:19,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {61507#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {61507#true} is VALID [2022-02-20 19:58:19,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {61507#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#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; {61507#true} is VALID [2022-02-20 19:58:19,686 INFO L290 TraceCheckUtils]: 3: Hoare triple {61507#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; {61507#true} is VALID [2022-02-20 19:58:19,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {61507#true} call update_channels1(); {61548#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:19,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {61548#(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); {61507#true} is VALID [2022-02-20 19:58:19,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {61507#true} assume true; {61507#true} is VALID [2022-02-20 19:58:19,686 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {61507#true} {61507#true} #1689#return; {61507#true} is VALID [2022-02-20 19:58:19,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {61507#true} assume { :begin_inline_init_threads1 } true; {61507#true} is VALID [2022-02-20 19:58:19,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {61507#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {61507#true} is VALID [2022-02-20 19:58:19,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {61507#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {61507#true} is VALID [2022-02-20 19:58:19,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {61507#true} assume { :end_inline_init_threads1 } true; {61507#true} is VALID [2022-02-20 19:58:19,687 INFO L272 TraceCheckUtils]: 12: Hoare triple {61507#true} call fire_delta_events1(); {61549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:19,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {61549#(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); {61507#true} is VALID [2022-02-20 19:58:19,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {61507#true} assume !(0 == ~q_write_ev~0); {61507#true} is VALID [2022-02-20 19:58:19,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {61507#true} assume true; {61507#true} is VALID [2022-02-20 19:58:19,688 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {61507#true} {61507#true} #1691#return; {61507#true} is VALID [2022-02-20 19:58:19,688 INFO L272 TraceCheckUtils]: 17: Hoare triple {61507#true} call activate_threads1(); {61550#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:19,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {61550#(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; {61507#true} is VALID [2022-02-20 19:58:19,688 INFO L272 TraceCheckUtils]: 19: Hoare triple {61507#true} call #t~ret8 := is_do_write_p_triggered(); {61507#true} is VALID [2022-02-20 19:58:19,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {61507#true} havoc ~__retres1~0; {61507#true} is VALID [2022-02-20 19:58:19,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {61507#true} assume !(1 == ~p_dw_pc~0); {61507#true} is VALID [2022-02-20 19:58:19,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {61507#true} ~__retres1~0 := 0; {61507#true} is VALID [2022-02-20 19:58:19,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {61507#true} #res := ~__retres1~0; {61507#true} is VALID [2022-02-20 19:58:19,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {61507#true} assume true; {61507#true} is VALID [2022-02-20 19:58:19,689 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {61507#true} {61507#true} #1685#return; {61507#true} is VALID [2022-02-20 19:58:19,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {61507#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {61507#true} is VALID [2022-02-20 19:58:19,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {61507#true} assume !(0 != ~tmp~1); {61507#true} is VALID [2022-02-20 19:58:19,689 INFO L272 TraceCheckUtils]: 28: Hoare triple {61507#true} call #t~ret9 := is_do_read_c_triggered(); {61507#true} is VALID [2022-02-20 19:58:19,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {61507#true} havoc ~__retres1~1; {61507#true} is VALID [2022-02-20 19:58:19,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {61507#true} assume !(1 == ~c_dr_pc~0); {61507#true} is VALID [2022-02-20 19:58:19,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {61507#true} ~__retres1~1 := 0; {61507#true} is VALID [2022-02-20 19:58:19,689 INFO L290 TraceCheckUtils]: 32: Hoare triple {61507#true} #res := ~__retres1~1; {61507#true} is VALID [2022-02-20 19:58:19,690 INFO L290 TraceCheckUtils]: 33: Hoare triple {61507#true} assume true; {61507#true} is VALID [2022-02-20 19:58:19,690 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {61507#true} {61507#true} #1687#return; {61507#true} is VALID [2022-02-20 19:58:19,690 INFO L290 TraceCheckUtils]: 35: Hoare triple {61507#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {61507#true} is VALID [2022-02-20 19:58:19,690 INFO L290 TraceCheckUtils]: 36: Hoare triple {61507#true} assume !(0 != ~tmp___0~1); {61507#true} is VALID [2022-02-20 19:58:19,690 INFO L290 TraceCheckUtils]: 37: Hoare triple {61507#true} assume true; {61507#true} is VALID [2022-02-20 19:58:19,690 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {61507#true} {61507#true} #1693#return; {61507#true} is VALID [2022-02-20 19:58:19,690 INFO L272 TraceCheckUtils]: 39: Hoare triple {61507#true} call reset_delta_events1(); {61549#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:19,691 INFO L290 TraceCheckUtils]: 40: Hoare triple {61549#(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); {61507#true} is VALID [2022-02-20 19:58:19,691 INFO L290 TraceCheckUtils]: 41: Hoare triple {61507#true} assume !(1 == ~q_write_ev~0); {61507#true} is VALID [2022-02-20 19:58:19,691 INFO L290 TraceCheckUtils]: 42: Hoare triple {61507#true} assume true; {61507#true} is VALID [2022-02-20 19:58:19,691 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {61507#true} {61507#true} #1695#return; {61507#true} is VALID [2022-02-20 19:58:19,691 INFO L290 TraceCheckUtils]: 44: Hoare triple {61507#true} assume !false; {61507#true} is VALID [2022-02-20 19:58:19,691 INFO L290 TraceCheckUtils]: 45: Hoare triple {61507#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; {61507#true} is VALID [2022-02-20 19:58:19,691 INFO L290 TraceCheckUtils]: 46: Hoare triple {61507#true} assume !false; {61507#true} is VALID [2022-02-20 19:58:19,691 INFO L272 TraceCheckUtils]: 47: Hoare triple {61507#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {61507#true} is VALID [2022-02-20 19:58:19,691 INFO L290 TraceCheckUtils]: 48: Hoare triple {61507#true} havoc ~__retres1~2; {61507#true} is VALID [2022-02-20 19:58:19,691 INFO L290 TraceCheckUtils]: 49: Hoare triple {61507#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {61507#true} is VALID [2022-02-20 19:58:19,692 INFO L290 TraceCheckUtils]: 50: Hoare triple {61507#true} #res := ~__retres1~2; {61507#true} is VALID [2022-02-20 19:58:19,692 INFO L290 TraceCheckUtils]: 51: Hoare triple {61507#true} assume true; {61507#true} is VALID [2022-02-20 19:58:19,692 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {61507#true} {61507#true} #1697#return; {61507#true} is VALID [2022-02-20 19:58:19,692 INFO L290 TraceCheckUtils]: 53: Hoare triple {61507#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; {61507#true} is VALID [2022-02-20 19:58:19,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {61507#true} assume 0 != eval1_~tmp___1~0#1; {61507#true} is VALID [2022-02-20 19:58:19,692 INFO L290 TraceCheckUtils]: 55: Hoare triple {61507#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; {61507#true} is VALID [2022-02-20 19:58:19,692 INFO L290 TraceCheckUtils]: 56: Hoare triple {61507#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; {61507#true} is VALID [2022-02-20 19:58:19,692 INFO L290 TraceCheckUtils]: 57: Hoare triple {61507#true} assume 0 == ~p_dw_pc~0; {61507#true} is VALID [2022-02-20 19:58:19,692 INFO L290 TraceCheckUtils]: 58: Hoare triple {61507#true} assume !false; {61507#true} is VALID [2022-02-20 19:58:19,693 INFO L290 TraceCheckUtils]: 59: Hoare triple {61507#true} assume !(0 == ~q_free~0); {61507#true} is VALID [2022-02-20 19:58:19,693 INFO L290 TraceCheckUtils]: 60: Hoare triple {61507#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; {61546#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:19,693 INFO L290 TraceCheckUtils]: 61: Hoare triple {61546#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {61546#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:19,694 INFO L290 TraceCheckUtils]: 62: Hoare triple {61546#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {61546#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:19,694 INFO L290 TraceCheckUtils]: 63: Hoare triple {61546#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {61546#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:19,694 INFO L290 TraceCheckUtils]: 64: Hoare triple {61546#(= ~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; {61546#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:19,694 INFO L290 TraceCheckUtils]: 65: Hoare triple {61546#(= ~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; {61546#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:19,695 INFO L290 TraceCheckUtils]: 66: Hoare triple {61546#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {61546#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:19,695 INFO L290 TraceCheckUtils]: 67: Hoare triple {61546#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {61546#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:19,695 INFO L290 TraceCheckUtils]: 68: Hoare triple {61546#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {61546#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:58:19,696 INFO L290 TraceCheckUtils]: 69: Hoare triple {61546#(= ~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; {61547#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:58:19,696 INFO L290 TraceCheckUtils]: 70: Hoare triple {61547#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {61508#false} is VALID [2022-02-20 19:58:19,696 INFO L272 TraceCheckUtils]: 71: Hoare triple {61508#false} call error1(); {61508#false} is VALID [2022-02-20 19:58:19,696 INFO L290 TraceCheckUtils]: 72: Hoare triple {61508#false} assume !false; {61508#false} is VALID [2022-02-20 19:58:19,696 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:19,697 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:19,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573811969] [2022-02-20 19:58:19,697 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573811969] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:58:19,697 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:58:19,697 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:58:19,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729284990] [2022-02-20 19:58:19,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:58:19,698 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,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:19,698 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:19,739 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:19,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:58:19,740 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:19,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:58:19,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:58:19,741 INFO L87 Difference]: Start difference. First operand 3019 states and 3882 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:22,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:22,307 INFO L93 Difference]: Finished difference Result 3793 states and 4813 transitions. [2022-02-20 19:58:22,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:58:22,307 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:22,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:22,308 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:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 804 transitions. [2022-02-20 19:58:22,312 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:22,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 804 transitions. [2022-02-20 19:58:22,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 804 transitions. [2022-02-20 19:58:22,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 804 edges. 804 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:23,438 INFO L225 Difference]: With dead ends: 3793 [2022-02-20 19:58:23,439 INFO L226 Difference]: Without dead ends: 3790 [2022-02-20 19:58:23,439 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:23,440 INFO L933 BasicCegarLoop]: 655 mSDtfsCounter, 2191 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2201 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:23,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2201 Valid, 1294 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 19:58:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3790 states. [2022-02-20 19:58:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3790 to 3513. [2022-02-20 19:58:23,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:23,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3790 states. Second operand has 3513 states, 2775 states have (on average 1.2918918918918918) internal successors, (3585), 2817 states have internal predecessors, (3585), 371 states have call successors, (371), 294 states have call predecessors, (371), 365 states have return successors, (527), 408 states have call predecessors, (527), 368 states have call successors, (527) [2022-02-20 19:58:23,631 INFO L74 IsIncluded]: Start isIncluded. First operand 3790 states. Second operand has 3513 states, 2775 states have (on average 1.2918918918918918) internal successors, (3585), 2817 states have internal predecessors, (3585), 371 states have call successors, (371), 294 states have call predecessors, (371), 365 states have return successors, (527), 408 states have call predecessors, (527), 368 states have call successors, (527) [2022-02-20 19:58:23,635 INFO L87 Difference]: Start difference. First operand 3790 states. Second operand has 3513 states, 2775 states have (on average 1.2918918918918918) internal successors, (3585), 2817 states have internal predecessors, (3585), 371 states have call successors, (371), 294 states have call predecessors, (371), 365 states have return successors, (527), 408 states have call predecessors, (527), 368 states have call successors, (527) [2022-02-20 19:58:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:24,050 INFO L93 Difference]: Finished difference Result 3790 states and 4799 transitions. [2022-02-20 19:58:24,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 4799 transitions. [2022-02-20 19:58:24,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:24,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:24,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 3513 states, 2775 states have (on average 1.2918918918918918) internal successors, (3585), 2817 states have internal predecessors, (3585), 371 states have call successors, (371), 294 states have call predecessors, (371), 365 states have return successors, (527), 408 states have call predecessors, (527), 368 states have call successors, (527) Second operand 3790 states. [2022-02-20 19:58:24,063 INFO L87 Difference]: Start difference. First operand has 3513 states, 2775 states have (on average 1.2918918918918918) internal successors, (3585), 2817 states have internal predecessors, (3585), 371 states have call successors, (371), 294 states have call predecessors, (371), 365 states have return successors, (527), 408 states have call predecessors, (527), 368 states have call successors, (527) Second operand 3790 states. [2022-02-20 19:58:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:24,468 INFO L93 Difference]: Finished difference Result 3790 states and 4799 transitions. [2022-02-20 19:58:24,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 4799 transitions. [2022-02-20 19:58:24,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:24,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:24,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:24,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3513 states, 2775 states have (on average 1.2918918918918918) internal successors, (3585), 2817 states have internal predecessors, (3585), 371 states have call successors, (371), 294 states have call predecessors, (371), 365 states have return successors, (527), 408 states have call predecessors, (527), 368 states have call successors, (527) [2022-02-20 19:58:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3513 states to 3513 states and 4483 transitions. [2022-02-20 19:58:24,989 INFO L78 Accepts]: Start accepts. Automaton has 3513 states and 4483 transitions. Word has length 73 [2022-02-20 19:58:24,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:24,989 INFO L470 AbstractCegarLoop]: Abstraction has 3513 states and 4483 transitions. [2022-02-20 19:58:24,990 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:24,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3513 states and 4483 transitions. [2022-02-20 19:58:24,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 19:58:24,991 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:24,991 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:24,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:58:24,991 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:24,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:24,992 INFO L85 PathProgramCache]: Analyzing trace with hash -846258469, now seen corresponding path program 1 times [2022-02-20 19:58:24,992 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:24,992 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501969966] [2022-02-20 19:58:24,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:24,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:25,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:25,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {78953#(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); {78911#true} is VALID [2022-02-20 19:58:25,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:25,057 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78911#true} {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1689#return; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:25,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {78954#(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); {78911#true} is VALID [2022-02-20 19:58:25,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {78911#true} assume !(0 == ~q_write_ev~0); {78911#true} is VALID [2022-02-20 19:58:25,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:25,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78911#true} {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1691#return; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:25,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:25,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {78911#true} havoc ~__retres1~0; {78911#true} is VALID [2022-02-20 19:58:25,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {78911#true} assume !(1 == ~p_dw_pc~0); {78911#true} is VALID [2022-02-20 19:58:25,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {78911#true} ~__retres1~0 := 0; {78911#true} is VALID [2022-02-20 19:58:25,080 INFO L290 TraceCheckUtils]: 3: Hoare triple {78911#true} #res := ~__retres1~0; {78911#true} is VALID [2022-02-20 19:58:25,080 INFO L290 TraceCheckUtils]: 4: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:25,080 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {78911#true} {78911#true} #1685#return; {78911#true} is VALID [2022-02-20 19:58:25,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:25,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {78911#true} havoc ~__retres1~1; {78911#true} is VALID [2022-02-20 19:58:25,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {78911#true} assume !(1 == ~c_dr_pc~0); {78911#true} is VALID [2022-02-20 19:58:25,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {78911#true} ~__retres1~1 := 0; {78911#true} is VALID [2022-02-20 19:58:25,083 INFO L290 TraceCheckUtils]: 3: Hoare triple {78911#true} #res := ~__retres1~1; {78911#true} is VALID [2022-02-20 19:58:25,083 INFO L290 TraceCheckUtils]: 4: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:25,083 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {78911#true} {78911#true} #1687#return; {78911#true} is VALID [2022-02-20 19:58:25,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {78955#(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; {78911#true} is VALID [2022-02-20 19:58:25,083 INFO L272 TraceCheckUtils]: 1: Hoare triple {78911#true} call #t~ret8 := is_do_write_p_triggered(); {78911#true} is VALID [2022-02-20 19:58:25,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {78911#true} havoc ~__retres1~0; {78911#true} is VALID [2022-02-20 19:58:25,083 INFO L290 TraceCheckUtils]: 3: Hoare triple {78911#true} assume !(1 == ~p_dw_pc~0); {78911#true} is VALID [2022-02-20 19:58:25,083 INFO L290 TraceCheckUtils]: 4: Hoare triple {78911#true} ~__retres1~0 := 0; {78911#true} is VALID [2022-02-20 19:58:25,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {78911#true} #res := ~__retres1~0; {78911#true} is VALID [2022-02-20 19:58:25,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:25,084 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {78911#true} {78911#true} #1685#return; {78911#true} is VALID [2022-02-20 19:58:25,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {78911#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {78911#true} is VALID [2022-02-20 19:58:25,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {78911#true} assume !(0 != ~tmp~1); {78911#true} is VALID [2022-02-20 19:58:25,084 INFO L272 TraceCheckUtils]: 10: Hoare triple {78911#true} call #t~ret9 := is_do_read_c_triggered(); {78911#true} is VALID [2022-02-20 19:58:25,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {78911#true} havoc ~__retres1~1; {78911#true} is VALID [2022-02-20 19:58:25,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {78911#true} assume !(1 == ~c_dr_pc~0); {78911#true} is VALID [2022-02-20 19:58:25,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {78911#true} ~__retres1~1 := 0; {78911#true} is VALID [2022-02-20 19:58:25,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {78911#true} #res := ~__retres1~1; {78911#true} is VALID [2022-02-20 19:58:25,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:25,085 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {78911#true} {78911#true} #1687#return; {78911#true} is VALID [2022-02-20 19:58:25,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {78911#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {78911#true} is VALID [2022-02-20 19:58:25,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {78911#true} assume !(0 != ~tmp___0~1); {78911#true} is VALID [2022-02-20 19:58:25,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:25,085 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {78911#true} {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1693#return; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:25,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {78954#(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); {78911#true} is VALID [2022-02-20 19:58:25,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {78911#true} assume !(1 == ~q_write_ev~0); {78911#true} is VALID [2022-02-20 19:58:25,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:25,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78911#true} {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1695#return; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:25,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {78911#true} havoc ~__retres1~2; {78911#true} is VALID [2022-02-20 19:58:25,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {78911#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {78911#true} is VALID [2022-02-20 19:58:25,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {78911#true} #res := ~__retres1~2; {78911#true} is VALID [2022-02-20 19:58:25,095 INFO L290 TraceCheckUtils]: 3: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:25,096 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {78911#true} {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1697#return; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {78911#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {78911#true} is VALID [2022-02-20 19:58:25,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {78911#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {78911#true} is VALID [2022-02-20 19:58:25,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {78911#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#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; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,097 INFO L290 TraceCheckUtils]: 3: Hoare triple {78913#(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; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {78953#(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:25,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {78953#(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); {78911#true} is VALID [2022-02-20 19:58:25,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:25,098 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {78911#true} {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1689#return; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,100 INFO L272 TraceCheckUtils]: 12: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {78954#(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:25,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {78954#(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); {78911#true} is VALID [2022-02-20 19:58:25,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {78911#true} assume !(0 == ~q_write_ev~0); {78911#true} is VALID [2022-02-20 19:58:25,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:25,100 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {78911#true} {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1691#return; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,101 INFO L272 TraceCheckUtils]: 17: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {78955#(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:25,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {78955#(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; {78911#true} is VALID [2022-02-20 19:58:25,101 INFO L272 TraceCheckUtils]: 19: Hoare triple {78911#true} call #t~ret8 := is_do_write_p_triggered(); {78911#true} is VALID [2022-02-20 19:58:25,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {78911#true} havoc ~__retres1~0; {78911#true} is VALID [2022-02-20 19:58:25,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {78911#true} assume !(1 == ~p_dw_pc~0); {78911#true} is VALID [2022-02-20 19:58:25,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {78911#true} ~__retres1~0 := 0; {78911#true} is VALID [2022-02-20 19:58:25,101 INFO L290 TraceCheckUtils]: 23: Hoare triple {78911#true} #res := ~__retres1~0; {78911#true} is VALID [2022-02-20 19:58:25,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:25,101 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {78911#true} {78911#true} #1685#return; {78911#true} is VALID [2022-02-20 19:58:25,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {78911#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {78911#true} is VALID [2022-02-20 19:58:25,102 INFO L290 TraceCheckUtils]: 27: Hoare triple {78911#true} assume !(0 != ~tmp~1); {78911#true} is VALID [2022-02-20 19:58:25,102 INFO L272 TraceCheckUtils]: 28: Hoare triple {78911#true} call #t~ret9 := is_do_read_c_triggered(); {78911#true} is VALID [2022-02-20 19:58:25,102 INFO L290 TraceCheckUtils]: 29: Hoare triple {78911#true} havoc ~__retres1~1; {78911#true} is VALID [2022-02-20 19:58:25,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {78911#true} assume !(1 == ~c_dr_pc~0); {78911#true} is VALID [2022-02-20 19:58:25,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {78911#true} ~__retres1~1 := 0; {78911#true} is VALID [2022-02-20 19:58:25,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {78911#true} #res := ~__retres1~1; {78911#true} is VALID [2022-02-20 19:58:25,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:25,102 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {78911#true} {78911#true} #1687#return; {78911#true} is VALID [2022-02-20 19:58:25,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {78911#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {78911#true} is VALID [2022-02-20 19:58:25,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {78911#true} assume !(0 != ~tmp___0~1); {78911#true} is VALID [2022-02-20 19:58:25,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:25,103 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {78911#true} {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1693#return; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,103 INFO L272 TraceCheckUtils]: 39: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {78954#(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:25,104 INFO L290 TraceCheckUtils]: 40: Hoare triple {78954#(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); {78911#true} is VALID [2022-02-20 19:58:25,104 INFO L290 TraceCheckUtils]: 41: Hoare triple {78911#true} assume !(1 == ~q_write_ev~0); {78911#true} is VALID [2022-02-20 19:58:25,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:25,104 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {78911#true} {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1695#return; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,105 INFO L290 TraceCheckUtils]: 45: Hoare triple {78913#(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; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,105 INFO L290 TraceCheckUtils]: 46: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,105 INFO L272 TraceCheckUtils]: 47: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {78911#true} is VALID [2022-02-20 19:58:25,105 INFO L290 TraceCheckUtils]: 48: Hoare triple {78911#true} havoc ~__retres1~2; {78911#true} is VALID [2022-02-20 19:58:25,105 INFO L290 TraceCheckUtils]: 49: Hoare triple {78911#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {78911#true} is VALID [2022-02-20 19:58:25,105 INFO L290 TraceCheckUtils]: 50: Hoare triple {78911#true} #res := ~__retres1~2; {78911#true} is VALID [2022-02-20 19:58:25,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:25,106 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {78911#true} {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1697#return; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,106 INFO L290 TraceCheckUtils]: 53: Hoare triple {78913#(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; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,107 INFO L290 TraceCheckUtils]: 55: Hoare triple {78913#(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; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,107 INFO L290 TraceCheckUtils]: 56: Hoare triple {78913#(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; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,107 INFO L290 TraceCheckUtils]: 57: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,108 INFO L290 TraceCheckUtils]: 58: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,108 INFO L290 TraceCheckUtils]: 59: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,108 INFO L290 TraceCheckUtils]: 60: Hoare triple {78913#(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; {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:25,109 INFO L290 TraceCheckUtils]: 61: Hoare triple {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:25,109 INFO L290 TraceCheckUtils]: 62: Hoare triple {78951#(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; {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:25,109 INFO L290 TraceCheckUtils]: 63: Hoare triple {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:25,110 INFO L290 TraceCheckUtils]: 64: Hoare triple {78951#(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; {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:25,110 INFO L290 TraceCheckUtils]: 65: Hoare triple {78951#(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; {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:25,111 INFO L290 TraceCheckUtils]: 66: Hoare triple {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:25,111 INFO L290 TraceCheckUtils]: 67: Hoare triple {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:25,111 INFO L290 TraceCheckUtils]: 68: Hoare triple {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:25,112 INFO L290 TraceCheckUtils]: 69: Hoare triple {78951#(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; {78952#(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:25,112 INFO L290 TraceCheckUtils]: 70: Hoare triple {78952#(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; {78952#(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:25,112 INFO L290 TraceCheckUtils]: 71: Hoare triple {78952#(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); {78912#false} is VALID [2022-02-20 19:58:25,112 INFO L272 TraceCheckUtils]: 72: Hoare triple {78912#false} call error1(); {78912#false} is VALID [2022-02-20 19:58:25,113 INFO L290 TraceCheckUtils]: 73: Hoare triple {78912#false} assume !false; {78912#false} is VALID [2022-02-20 19:58:25,113 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:25,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:25,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501969966] [2022-02-20 19:58:25,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501969966] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:58:25,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036180641] [2022-02-20 19:58:25,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:25,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:58:25,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:25,136 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:25,139 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:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:25,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:58:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:25,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:58:25,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {78911#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {78911#true} is VALID [2022-02-20 19:58:25,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {78911#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {78911#true} is VALID [2022-02-20 19:58:25,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {78911#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#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; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {78913#(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; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_req_up~0); {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,822 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1689#return; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,824 INFO L272 TraceCheckUtils]: 12: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_read_ev~0); {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_write_ev~0); {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,825 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1691#return; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,825 INFO L272 TraceCheckUtils]: 17: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~tmp~1;havoc ~tmp___0~1; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,826 INFO L272 TraceCheckUtils]: 19: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret8 := is_do_write_p_triggered(); {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~0; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~p_dw_pc~0); {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~0 := 0; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~0; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,828 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1685#return; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {78913#(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; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,829 INFO L290 TraceCheckUtils]: 27: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp~1); {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,829 INFO L272 TraceCheckUtils]: 28: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret9 := is_do_read_c_triggered(); {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~1; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~c_dr_pc~0); {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~1 := 0; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~1; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,831 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1687#return; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {78913#(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; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,832 INFO L290 TraceCheckUtils]: 36: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp___0~1); {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,832 INFO L290 TraceCheckUtils]: 37: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,832 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1693#return; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,832 INFO L272 TraceCheckUtils]: 39: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,833 INFO L290 TraceCheckUtils]: 40: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_read_ev~0); {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,833 INFO L290 TraceCheckUtils]: 41: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_write_ev~0); {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,833 INFO L290 TraceCheckUtils]: 42: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,834 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1695#return; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,834 INFO L290 TraceCheckUtils]: 44: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,834 INFO L290 TraceCheckUtils]: 45: Hoare triple {78913#(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; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,835 INFO L290 TraceCheckUtils]: 46: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,835 INFO L272 TraceCheckUtils]: 47: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,835 INFO L290 TraceCheckUtils]: 48: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,836 INFO L290 TraceCheckUtils]: 49: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,836 INFO L290 TraceCheckUtils]: 50: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,836 INFO L290 TraceCheckUtils]: 51: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,837 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1697#return; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,837 INFO L290 TraceCheckUtils]: 53: Hoare triple {78913#(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; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,837 INFO L290 TraceCheckUtils]: 54: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,838 INFO L290 TraceCheckUtils]: 55: Hoare triple {78913#(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; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,838 INFO L290 TraceCheckUtils]: 56: Hoare triple {78913#(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; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,838 INFO L290 TraceCheckUtils]: 57: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,838 INFO L290 TraceCheckUtils]: 58: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,839 INFO L290 TraceCheckUtils]: 59: Hoare triple {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {78913#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:25,839 INFO L290 TraceCheckUtils]: 60: Hoare triple {78913#(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; {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:25,840 INFO L290 TraceCheckUtils]: 61: Hoare triple {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:25,840 INFO L290 TraceCheckUtils]: 62: Hoare triple {78951#(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; {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:25,840 INFO L290 TraceCheckUtils]: 63: Hoare triple {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:25,841 INFO L290 TraceCheckUtils]: 64: Hoare triple {78951#(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; {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:25,841 INFO L290 TraceCheckUtils]: 65: Hoare triple {78951#(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; {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:25,841 INFO L290 TraceCheckUtils]: 66: Hoare triple {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:25,842 INFO L290 TraceCheckUtils]: 67: Hoare triple {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:25,842 INFO L290 TraceCheckUtils]: 68: Hoare triple {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {78951#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:25,842 INFO L290 TraceCheckUtils]: 69: Hoare triple {78951#(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; {79178#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:25,843 INFO L290 TraceCheckUtils]: 70: Hoare triple {79178#(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; {79178#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:25,843 INFO L290 TraceCheckUtils]: 71: Hoare triple {79178#(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); {78912#false} is VALID [2022-02-20 19:58:25,843 INFO L272 TraceCheckUtils]: 72: Hoare triple {78912#false} call error1(); {78912#false} is VALID [2022-02-20 19:58:25,843 INFO L290 TraceCheckUtils]: 73: Hoare triple {78912#false} assume !false; {78912#false} is VALID [2022-02-20 19:58:25,844 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:25,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:58:26,147 INFO L290 TraceCheckUtils]: 73: Hoare triple {78912#false} assume !false; {78912#false} is VALID [2022-02-20 19:58:26,147 INFO L272 TraceCheckUtils]: 72: Hoare triple {78912#false} call error1(); {78912#false} is VALID [2022-02-20 19:58:26,148 INFO L290 TraceCheckUtils]: 71: Hoare triple {78952#(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); {78912#false} is VALID [2022-02-20 19:58:26,148 INFO L290 TraceCheckUtils]: 70: Hoare triple {78952#(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; {78952#(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:26,149 INFO L290 TraceCheckUtils]: 69: Hoare triple {79203#(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; {78952#(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:26,149 INFO L290 TraceCheckUtils]: 68: Hoare triple {79203#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !(1 == ~q_free~0); {79203#(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:26,149 INFO L290 TraceCheckUtils]: 67: Hoare triple {79203#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {79203#(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:26,150 INFO L290 TraceCheckUtils]: 66: Hoare triple {79203#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_pc~0; {79203#(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:26,150 INFO L290 TraceCheckUtils]: 65: Hoare triple {79203#(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; {79203#(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:26,150 INFO L290 TraceCheckUtils]: 64: Hoare triple {79203#(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; {79203#(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:26,151 INFO L290 TraceCheckUtils]: 63: Hoare triple {79203#(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; {79203#(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:26,151 INFO L290 TraceCheckUtils]: 62: Hoare triple {79203#(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; {79203#(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:26,151 INFO L290 TraceCheckUtils]: 61: Hoare triple {79203#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {79203#(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:26,152 INFO L290 TraceCheckUtils]: 60: Hoare triple {78952#(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; {79203#(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:26,152 INFO L290 TraceCheckUtils]: 59: Hoare triple {78952#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(0 == ~q_free~0); {78952#(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:26,152 INFO L290 TraceCheckUtils]: 58: Hoare triple {78952#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {78952#(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:26,153 INFO L290 TraceCheckUtils]: 57: Hoare triple {78952#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_pc~0; {78952#(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:26,153 INFO L290 TraceCheckUtils]: 56: Hoare triple {78952#(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; {78952#(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:26,153 INFO L290 TraceCheckUtils]: 55: Hoare triple {78952#(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; {78952#(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:26,154 INFO L290 TraceCheckUtils]: 54: Hoare triple {78952#(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; {78952#(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:26,154 INFO L290 TraceCheckUtils]: 53: Hoare triple {78952#(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; {78952#(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:26,154 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {78911#true} {78952#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1697#return; {78952#(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:26,154 INFO L290 TraceCheckUtils]: 51: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:26,154 INFO L290 TraceCheckUtils]: 50: Hoare triple {78911#true} #res := ~__retres1~2; {78911#true} is VALID [2022-02-20 19:58:26,155 INFO L290 TraceCheckUtils]: 49: Hoare triple {78911#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {78911#true} is VALID [2022-02-20 19:58:26,155 INFO L290 TraceCheckUtils]: 48: Hoare triple {78911#true} havoc ~__retres1~2; {78911#true} is VALID [2022-02-20 19:58:26,155 INFO L272 TraceCheckUtils]: 47: Hoare triple {78952#(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(); {78911#true} is VALID [2022-02-20 19:58:26,155 INFO L290 TraceCheckUtils]: 46: Hoare triple {78952#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {78952#(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:26,155 INFO L290 TraceCheckUtils]: 45: Hoare triple {78952#(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; {78952#(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:26,155 INFO L290 TraceCheckUtils]: 44: Hoare triple {78952#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {78952#(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:26,156 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {78911#true} {78952#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1695#return; {78952#(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:26,156 INFO L290 TraceCheckUtils]: 42: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:26,156 INFO L290 TraceCheckUtils]: 41: Hoare triple {78911#true} assume !(1 == ~q_write_ev~0); {78911#true} is VALID [2022-02-20 19:58:26,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {78911#true} assume !(1 == ~q_read_ev~0); {78911#true} is VALID [2022-02-20 19:58:26,156 INFO L272 TraceCheckUtils]: 39: Hoare triple {78952#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call reset_delta_events1(); {78911#true} is VALID [2022-02-20 19:58:26,156 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {78911#true} {78952#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1693#return; {78952#(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:26,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:26,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {78911#true} assume !(0 != ~tmp___0~1); {78911#true} is VALID [2022-02-20 19:58:26,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {78911#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {78911#true} is VALID [2022-02-20 19:58:26,156 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {78911#true} {78911#true} #1687#return; {78911#true} is VALID [2022-02-20 19:58:26,157 INFO L290 TraceCheckUtils]: 33: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:26,157 INFO L290 TraceCheckUtils]: 32: Hoare triple {78911#true} #res := ~__retres1~1; {78911#true} is VALID [2022-02-20 19:58:26,157 INFO L290 TraceCheckUtils]: 31: Hoare triple {78911#true} ~__retres1~1 := 0; {78911#true} is VALID [2022-02-20 19:58:26,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {78911#true} assume !(1 == ~c_dr_pc~0); {78911#true} is VALID [2022-02-20 19:58:26,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {78911#true} havoc ~__retres1~1; {78911#true} is VALID [2022-02-20 19:58:26,157 INFO L272 TraceCheckUtils]: 28: Hoare triple {78911#true} call #t~ret9 := is_do_read_c_triggered(); {78911#true} is VALID [2022-02-20 19:58:26,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {78911#true} assume !(0 != ~tmp~1); {78911#true} is VALID [2022-02-20 19:58:26,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {78911#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {78911#true} is VALID [2022-02-20 19:58:26,157 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {78911#true} {78911#true} #1685#return; {78911#true} is VALID [2022-02-20 19:58:26,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:26,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {78911#true} #res := ~__retres1~0; {78911#true} is VALID [2022-02-20 19:58:26,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {78911#true} ~__retres1~0 := 0; {78911#true} is VALID [2022-02-20 19:58:26,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {78911#true} assume !(1 == ~p_dw_pc~0); {78911#true} is VALID [2022-02-20 19:58:26,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {78911#true} havoc ~__retres1~0; {78911#true} is VALID [2022-02-20 19:58:26,157 INFO L272 TraceCheckUtils]: 19: Hoare triple {78911#true} call #t~ret8 := is_do_write_p_triggered(); {78911#true} is VALID [2022-02-20 19:58:26,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {78911#true} havoc ~tmp~1;havoc ~tmp___0~1; {78911#true} is VALID [2022-02-20 19:58:26,157 INFO L272 TraceCheckUtils]: 17: Hoare triple {78952#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call activate_threads1(); {78911#true} is VALID [2022-02-20 19:58:26,158 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {78911#true} {78952#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1691#return; {78952#(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:26,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:26,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {78911#true} assume !(0 == ~q_write_ev~0); {78911#true} is VALID [2022-02-20 19:58:26,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {78911#true} assume !(0 == ~q_read_ev~0); {78911#true} is VALID [2022-02-20 19:58:26,158 INFO L272 TraceCheckUtils]: 12: Hoare triple {78952#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call fire_delta_events1(); {78911#true} is VALID [2022-02-20 19:58:26,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {78952#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_threads1 } true; {78952#(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:26,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {78952#(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; {78952#(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:26,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {78952#(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; {78952#(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:26,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {78952#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :begin_inline_init_threads1 } true; {78952#(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:26,159 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {78911#true} {78952#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1689#return; {78952#(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:26,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {78911#true} assume true; {78911#true} is VALID [2022-02-20 19:58:26,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {78911#true} assume !(1 == ~q_req_up~0); {78911#true} is VALID [2022-02-20 19:58:26,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {78952#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call update_channels1(); {78911#true} is VALID [2022-02-20 19:58:26,160 INFO L290 TraceCheckUtils]: 3: Hoare triple {78952#(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; {78952#(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:26,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {78911#true} assume 0 != main_#t~nondet47#1;havoc main_#t~nondet47#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; {78952#(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:26,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {78911#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~ret48#1, main_#t~ret49#1;assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647; {78911#true} is VALID [2022-02-20 19:58:26,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {78911#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~q_req_up~0 := 0;~q_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0;~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~t5_pc~0 := 0;~t6_pc~0 := 0;~t7_pc~0 := 0;~t8_pc~0 := 0;~t9_pc~0 := 0;~t10_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~t5_st~0 := 0;~t6_st~0 := 0;~t7_st~0 := 0;~t8_st~0 := 0;~t9_st~0 := 0;~t10_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~t5_i~0 := 0;~t6_i~0 := 0;~t7_i~0 := 0;~t8_i~0 := 0;~t9_i~0 := 0;~t10_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~T5_E~0 := 2;~T6_E~0 := 2;~T7_E~0 := 2;~T8_E~0 := 2;~T9_E~0 := 2;~T10_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2;~E_5~0 := 2;~E_6~0 := 2;~E_7~0 := 2;~E_8~0 := 2;~E_9~0 := 2;~E_10~0 := 2;~token~0 := 0;~local~0 := 0; {78911#true} is VALID [2022-02-20 19:58:26,160 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:26,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036180641] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:58:26,161 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:58:26,161 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-02-20 19:58:26,161 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421279667] [2022-02-20 19:58:26,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:58:26,161 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:26,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:26,162 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:26,262 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:26,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:58:26,262 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:26,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:58:26,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:58:26,263 INFO L87 Difference]: Start difference. First operand 3513 states and 4483 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:58:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:35,214 INFO L93 Difference]: Finished difference Result 7954 states and 9969 transitions. [2022-02-20 19:58:35,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-20 19:58:35,214 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-02-20 19:58:35,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:58:35,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1299 transitions. [2022-02-20 19:58:35,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:58:35,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1299 transitions. [2022-02-20 19:58:35,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 1299 transitions. [2022-02-20 19:58:36,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1299 edges. 1299 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:38,626 INFO L225 Difference]: With dead ends: 7954 [2022-02-20 19:58:38,627 INFO L226 Difference]: Without dead ends: 7951 [2022-02-20 19:58:38,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-02-20 19:58:38,629 INFO L933 BasicCegarLoop]: 815 mSDtfsCounter, 1700 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2143 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1770 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 2347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:38,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1770 Valid, 3058 Invalid, 2347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2143 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-20 19:58:38,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7951 states. [2022-02-20 19:58:40,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7951 to 5303. [2022-02-20 19:58:40,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:40,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7951 states. Second operand has 5303 states, 4179 states have (on average 1.2828427853553481) internal successors, (5361), 4243 states have internal predecessors, (5361), 555 states have call successors, (555), 452 states have call predecessors, (555), 567 states have return successors, (805), 614 states have call predecessors, (805), 552 states have call successors, (805) [2022-02-20 19:58:40,208 INFO L74 IsIncluded]: Start isIncluded. First operand 7951 states. Second operand has 5303 states, 4179 states have (on average 1.2828427853553481) internal successors, (5361), 4243 states have internal predecessors, (5361), 555 states have call successors, (555), 452 states have call predecessors, (555), 567 states have return successors, (805), 614 states have call predecessors, (805), 552 states have call successors, (805) [2022-02-20 19:58:40,214 INFO L87 Difference]: Start difference. First operand 7951 states. Second operand has 5303 states, 4179 states have (on average 1.2828427853553481) internal successors, (5361), 4243 states have internal predecessors, (5361), 555 states have call successors, (555), 452 states have call predecessors, (555), 567 states have return successors, (805), 614 states have call predecessors, (805), 552 states have call successors, (805)