./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.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.07.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 b395f094f2d3990354e9b2c1428e908d883c16492f3b21174dd87f3c0cfda780 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:57:15,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:57:15,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:57:15,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:57:15,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:57:15,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:57:15,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:57:15,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:57:15,942 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:57:15,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:57:15,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:57:15,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:57:15,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:57:15,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:57:15,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:57:15,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:57:15,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:57:15,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:57:15,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:57:15,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:57:15,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:57:15,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:57:15,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:57:15,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:57:15,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:57:15,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:57:15,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:57:15,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:57:15,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:57:15,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:57:15,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:57:15,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:57:15,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:57:15,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:57:15,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:57:15,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:57:15,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:57:15,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:57:15,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:57:15,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:57:15,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:57:15,972 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:15,984 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:57:15,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:57:15,999 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:57:15,999 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:57:16,000 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:57:16,000 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:57:16,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:57:16,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:57:16,001 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:57:16,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:57:16,001 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:57:16,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:57:16,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:57:16,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:57:16,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:57:16,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:57:16,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:57:16,001 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:57:16,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:57:16,001 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:57:16,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:57:16,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:57:16,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:57:16,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:57:16,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:57:16,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:57:16,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:57:16,002 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:57:16,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:57:16,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:57:16,002 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:57:16,002 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:57:16,003 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:57:16,003 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 -> b395f094f2d3990354e9b2c1428e908d883c16492f3b21174dd87f3c0cfda780 [2022-02-20 19:57:16,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:57:16,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:57:16,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:57:16,164 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:57:16,164 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:57:16,165 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.07.cil-1.c [2022-02-20 19:57:16,210 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f605ebb96/0d641674417d47d99cb02a629f585c12/FLAGdb3730f74 [2022-02-20 19:57:16,606 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:57:16,612 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-1.c [2022-02-20 19:57:16,635 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f605ebb96/0d641674417d47d99cb02a629f585c12/FLAGdb3730f74 [2022-02-20 19:57:16,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f605ebb96/0d641674417d47d99cb02a629f585c12 [2022-02-20 19:57:16,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:57:16,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:57:16,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:57:16,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:57:16,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:57:16,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:57:16" (1/1) ... [2022-02-20 19:57:16,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bf6c1d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:16, skipping insertion in model container [2022-02-20 19:57:16,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:57:16" (1/1) ... [2022-02-20 19:57:17,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:57:17,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:57:17,166 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.07.cil-1.c[914,927] [2022-02-20 19:57:17,198 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.07.cil-1.c[7115,7128] [2022-02-20 19:57:17,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:57:17,251 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:57:17,259 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.07.cil-1.c[914,927] [2022-02-20 19:57:17,271 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.07.cil-1.c[7115,7128] [2022-02-20 19:57:17,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:57:17,312 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:57:17,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:17 WrapperNode [2022-02-20 19:57:17,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:57:17,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:57:17,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:57:17,314 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:57:17,319 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:17" (1/1) ... [2022-02-20 19:57:17,327 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:17" (1/1) ... [2022-02-20 19:57:17,374 INFO L137 Inliner]: procedures = 67, calls = 78, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 750 [2022-02-20 19:57:17,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:57:17,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:57:17,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:57:17,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:57:17,381 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:17" (1/1) ... [2022-02-20 19:57:17,382 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:17" (1/1) ... [2022-02-20 19:57:17,384 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:17" (1/1) ... [2022-02-20 19:57:17,384 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:17" (1/1) ... [2022-02-20 19:57:17,392 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:17" (1/1) ... [2022-02-20 19:57:17,404 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:17" (1/1) ... [2022-02-20 19:57:17,407 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:17" (1/1) ... [2022-02-20 19:57:17,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:57:17,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:57:17,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:57:17,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:57:17,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:17" (1/1) ... [2022-02-20 19:57:17,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:57:17,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:57:17,452 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:17,494 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:17,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:57:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:57:17,498 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:57:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:57:17,498 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:57:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:57:17,498 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:57:17,498 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:57:17,499 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:57:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:57:17,499 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:57:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:57:17,499 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:57:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:57:17,499 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:57:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:57:17,500 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:57:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:57:17,500 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:57:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:57:17,500 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:57:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:57:17,500 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:57:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:57:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:57:17,501 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:57:17,501 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:57:17,501 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:57:17,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:57:17,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:57:17,501 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:57:17,501 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:57:17,570 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:57:17,571 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:57:18,156 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:57:18,165 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:57:18,165 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 19:57:18,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:57:18 BoogieIcfgContainer [2022-02-20 19:57:18,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:57:18,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:57:18,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:57:18,170 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:57:18,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:57:16" (1/3) ... [2022-02-20 19:57:18,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96603f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:57:18, skipping insertion in model container [2022-02-20 19:57:18,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:57:17" (2/3) ... [2022-02-20 19:57:18,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96603f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:57:18, skipping insertion in model container [2022-02-20 19:57:18,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:57:18" (3/3) ... [2022-02-20 19:57:18,172 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.07.cil-1.c [2022-02-20 19:57:18,175 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:57:18,175 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:57:18,216 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:57:18,221 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:18,222 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:57:18,256 INFO L276 IsEmpty]: Start isEmpty. Operand has 358 states, 306 states have (on average 1.6143790849673203) internal successors, (494), 312 states have internal predecessors, (494), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-02-20 19:57:18,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:18,268 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:18,269 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:18,269 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:18,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:18,273 INFO L85 PathProgramCache]: Analyzing trace with hash -2006337748, now seen corresponding path program 1 times [2022-02-20 19:57:18,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:18,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723463348] [2022-02-20 19:57:18,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:18,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {401#(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); {361#true} is VALID [2022-02-20 19:57:18,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#true} assume true; {361#true} is VALID [2022-02-20 19:57:18,494 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {361#true} {363#(= ~p_dw_i~0 1)} #1324#return; {363#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:57:18,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {402#(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; {361#true} is VALID [2022-02-20 19:57:18,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {361#true} is VALID [2022-02-20 19:57:18,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} assume true; {361#true} is VALID [2022-02-20 19:57:18,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361#true} {362#false} #1326#return; {362#false} is VALID [2022-02-20 19:57:18,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {361#true} havoc ~__retres1~0; {361#true} is VALID [2022-02-20 19:57:18,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#true} assume !(1 == ~p_dw_pc~0); {361#true} is VALID [2022-02-20 19:57:18,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} ~__retres1~0 := 0; {361#true} is VALID [2022-02-20 19:57:18,560 INFO L290 TraceCheckUtils]: 3: Hoare triple {361#true} #res := ~__retres1~0; {361#true} is VALID [2022-02-20 19:57:18,561 INFO L290 TraceCheckUtils]: 4: Hoare triple {361#true} assume true; {361#true} is VALID [2022-02-20 19:57:18,561 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {361#true} {361#true} #1320#return; {361#true} is VALID [2022-02-20 19:57:18,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {361#true} havoc ~__retres1~1; {361#true} is VALID [2022-02-20 19:57:18,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#true} assume 1 == ~c_dr_pc~0; {361#true} is VALID [2022-02-20 19:57:18,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {361#true} is VALID [2022-02-20 19:57:18,566 INFO L290 TraceCheckUtils]: 3: Hoare triple {361#true} #res := ~__retres1~1; {361#true} is VALID [2022-02-20 19:57:18,566 INFO L290 TraceCheckUtils]: 4: Hoare triple {361#true} assume true; {361#true} is VALID [2022-02-20 19:57:18,567 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {361#true} {361#true} #1322#return; {361#true} is VALID [2022-02-20 19:57:18,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {403#(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; {361#true} is VALID [2022-02-20 19:57:18,567 INFO L272 TraceCheckUtils]: 1: Hoare triple {361#true} call #t~ret8 := is_do_write_p_triggered(); {361#true} is VALID [2022-02-20 19:57:18,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} havoc ~__retres1~0; {361#true} is VALID [2022-02-20 19:57:18,568 INFO L290 TraceCheckUtils]: 3: Hoare triple {361#true} assume !(1 == ~p_dw_pc~0); {361#true} is VALID [2022-02-20 19:57:18,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {361#true} ~__retres1~0 := 0; {361#true} is VALID [2022-02-20 19:57:18,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {361#true} #res := ~__retres1~0; {361#true} is VALID [2022-02-20 19:57:18,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {361#true} assume true; {361#true} is VALID [2022-02-20 19:57:18,569 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {361#true} {361#true} #1320#return; {361#true} is VALID [2022-02-20 19:57:18,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {361#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {361#true} is VALID [2022-02-20 19:57:18,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {361#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {361#true} is VALID [2022-02-20 19:57:18,570 INFO L272 TraceCheckUtils]: 10: Hoare triple {361#true} call #t~ret9 := is_do_read_c_triggered(); {361#true} is VALID [2022-02-20 19:57:18,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {361#true} havoc ~__retres1~1; {361#true} is VALID [2022-02-20 19:57:18,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {361#true} assume 1 == ~c_dr_pc~0; {361#true} is VALID [2022-02-20 19:57:18,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {361#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {361#true} is VALID [2022-02-20 19:57:18,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {361#true} #res := ~__retres1~1; {361#true} is VALID [2022-02-20 19:57:18,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {361#true} assume true; {361#true} is VALID [2022-02-20 19:57:18,571 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {361#true} {361#true} #1322#return; {361#true} is VALID [2022-02-20 19:57:18,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {361#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {361#true} is VALID [2022-02-20 19:57:18,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {361#true} assume !(0 != ~tmp___0~1); {361#true} is VALID [2022-02-20 19:57:18,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {361#true} assume true; {361#true} is VALID [2022-02-20 19:57:18,573 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {361#true} {362#false} #1328#return; {362#false} is VALID [2022-02-20 19:57:18,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {402#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {361#true} is VALID [2022-02-20 19:57:18,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#true} assume !(1 == ~q_write_ev~0); {361#true} is VALID [2022-02-20 19:57:18,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} assume true; {361#true} is VALID [2022-02-20 19:57:18,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361#true} {362#false} #1330#return; {362#false} is VALID [2022-02-20 19:57:18,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:18,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {361#true} havoc ~__retres1~2; {361#true} is VALID [2022-02-20 19:57:18,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {361#true} is VALID [2022-02-20 19:57:18,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} #res := ~__retres1~2; {361#true} is VALID [2022-02-20 19:57:18,598 INFO L290 TraceCheckUtils]: 3: Hoare triple {361#true} assume true; {361#true} is VALID [2022-02-20 19:57:18,598 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {361#true} {362#false} #1332#return; {362#false} is VALID [2022-02-20 19:57:18,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {361#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {361#true} is VALID [2022-02-20 19:57:18,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {361#true} is VALID [2022-02-20 19:57:18,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {363#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:57:18,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {363#(= ~p_dw_i~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; {363#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:57:18,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {363#(= ~p_dw_i~0 1)} call update_channels1(); {401#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:57:18,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {401#(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); {361#true} is VALID [2022-02-20 19:57:18,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {361#true} assume true; {361#true} is VALID [2022-02-20 19:57:18,606 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {361#true} {363#(= ~p_dw_i~0 1)} #1324#return; {363#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:57:18,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {363#(= ~p_dw_i~0 1)} assume { :begin_inline_init_threads1 } true; {363#(= ~p_dw_i~0 1)} is VALID [2022-02-20 19:57:18,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {363#(= ~p_dw_i~0 1)} assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; {362#false} is VALID [2022-02-20 19:57:18,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {362#false} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {362#false} is VALID [2022-02-20 19:57:18,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {362#false} assume { :end_inline_init_threads1 } true; {362#false} is VALID [2022-02-20 19:57:18,608 INFO L272 TraceCheckUtils]: 12: Hoare triple {362#false} call fire_delta_events1(); {402#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:18,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {402#(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; {361#true} is VALID [2022-02-20 19:57:18,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {361#true} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {361#true} is VALID [2022-02-20 19:57:18,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {361#true} assume true; {361#true} is VALID [2022-02-20 19:57:18,608 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {361#true} {362#false} #1326#return; {362#false} is VALID [2022-02-20 19:57:18,609 INFO L272 TraceCheckUtils]: 17: Hoare triple {362#false} call activate_threads1(); {403#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:18,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {403#(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; {361#true} is VALID [2022-02-20 19:57:18,609 INFO L272 TraceCheckUtils]: 19: Hoare triple {361#true} call #t~ret8 := is_do_write_p_triggered(); {361#true} is VALID [2022-02-20 19:57:18,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {361#true} havoc ~__retres1~0; {361#true} is VALID [2022-02-20 19:57:18,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {361#true} assume !(1 == ~p_dw_pc~0); {361#true} is VALID [2022-02-20 19:57:18,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {361#true} ~__retres1~0 := 0; {361#true} is VALID [2022-02-20 19:57:18,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {361#true} #res := ~__retres1~0; {361#true} is VALID [2022-02-20 19:57:18,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {361#true} assume true; {361#true} is VALID [2022-02-20 19:57:18,613 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {361#true} {361#true} #1320#return; {361#true} is VALID [2022-02-20 19:57:18,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {361#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {361#true} is VALID [2022-02-20 19:57:18,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {361#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {361#true} is VALID [2022-02-20 19:57:18,613 INFO L272 TraceCheckUtils]: 28: Hoare triple {361#true} call #t~ret9 := is_do_read_c_triggered(); {361#true} is VALID [2022-02-20 19:57:18,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {361#true} havoc ~__retres1~1; {361#true} is VALID [2022-02-20 19:57:18,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {361#true} assume 1 == ~c_dr_pc~0; {361#true} is VALID [2022-02-20 19:57:18,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {361#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {361#true} is VALID [2022-02-20 19:57:18,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {361#true} #res := ~__retres1~1; {361#true} is VALID [2022-02-20 19:57:18,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {361#true} assume true; {361#true} is VALID [2022-02-20 19:57:18,614 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {361#true} {361#true} #1322#return; {361#true} is VALID [2022-02-20 19:57:18,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {361#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {361#true} is VALID [2022-02-20 19:57:18,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {361#true} assume !(0 != ~tmp___0~1); {361#true} is VALID [2022-02-20 19:57:18,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {361#true} assume true; {361#true} is VALID [2022-02-20 19:57:18,615 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {361#true} {362#false} #1328#return; {362#false} is VALID [2022-02-20 19:57:18,615 INFO L272 TraceCheckUtils]: 39: Hoare triple {362#false} call reset_delta_events1(); {402#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:18,615 INFO L290 TraceCheckUtils]: 40: Hoare triple {402#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {361#true} is VALID [2022-02-20 19:57:18,615 INFO L290 TraceCheckUtils]: 41: Hoare triple {361#true} assume !(1 == ~q_write_ev~0); {361#true} is VALID [2022-02-20 19:57:18,616 INFO L290 TraceCheckUtils]: 42: Hoare triple {361#true} assume true; {361#true} is VALID [2022-02-20 19:57:18,616 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {361#true} {362#false} #1330#return; {362#false} is VALID [2022-02-20 19:57:18,616 INFO L290 TraceCheckUtils]: 44: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-02-20 19:57:18,616 INFO L290 TraceCheckUtils]: 45: Hoare triple {362#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; {362#false} is VALID [2022-02-20 19:57:18,616 INFO L290 TraceCheckUtils]: 46: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-02-20 19:57:18,617 INFO L272 TraceCheckUtils]: 47: Hoare triple {362#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {361#true} is VALID [2022-02-20 19:57:18,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {361#true} havoc ~__retres1~2; {361#true} is VALID [2022-02-20 19:57:18,617 INFO L290 TraceCheckUtils]: 49: Hoare triple {361#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {361#true} is VALID [2022-02-20 19:57:18,617 INFO L290 TraceCheckUtils]: 50: Hoare triple {361#true} #res := ~__retres1~2; {361#true} is VALID [2022-02-20 19:57:18,617 INFO L290 TraceCheckUtils]: 51: Hoare triple {361#true} assume true; {361#true} is VALID [2022-02-20 19:57:18,617 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {361#true} {362#false} #1332#return; {362#false} is VALID [2022-02-20 19:57:18,618 INFO L290 TraceCheckUtils]: 53: Hoare triple {362#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; {362#false} is VALID [2022-02-20 19:57:18,618 INFO L290 TraceCheckUtils]: 54: Hoare triple {362#false} assume 0 != eval1_~tmp___1~0#1; {362#false} is VALID [2022-02-20 19:57:18,618 INFO L290 TraceCheckUtils]: 55: Hoare triple {362#false} assume !(0 == ~p_dw_st~0); {362#false} is VALID [2022-02-20 19:57:18,618 INFO L290 TraceCheckUtils]: 56: Hoare triple {362#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; {362#false} is VALID [2022-02-20 19:57:18,618 INFO L290 TraceCheckUtils]: 57: Hoare triple {362#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; {362#false} is VALID [2022-02-20 19:57:18,619 INFO L290 TraceCheckUtils]: 58: Hoare triple {362#false} assume !(0 == ~c_dr_pc~0); {362#false} is VALID [2022-02-20 19:57:18,619 INFO L290 TraceCheckUtils]: 59: Hoare triple {362#false} assume 1 == ~c_dr_pc~0; {362#false} is VALID [2022-02-20 19:57:18,619 INFO L290 TraceCheckUtils]: 60: Hoare triple {362#false} do_read_c_~a~0#1 := ~a_t~0; {362#false} is VALID [2022-02-20 19:57:18,619 INFO L290 TraceCheckUtils]: 61: Hoare triple {362#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; {362#false} is VALID [2022-02-20 19:57:18,619 INFO L290 TraceCheckUtils]: 62: Hoare triple {362#false} assume !(~p_last_write~0 == ~c_last_read~0); {362#false} is VALID [2022-02-20 19:57:18,619 INFO L272 TraceCheckUtils]: 63: Hoare triple {362#false} call error1(); {362#false} is VALID [2022-02-20 19:57:18,620 INFO L290 TraceCheckUtils]: 64: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-02-20 19:57:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:18,620 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:18,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723463348] [2022-02-20 19:57:18,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723463348] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:18,621 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:18,622 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:18,623 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763910310] [2022-02-20 19:57:18,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:18,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:18,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:18,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:18,680 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:18,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:18,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:18,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:18,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:18,701 INFO L87 Difference]: Start difference. First operand has 358 states, 306 states have (on average 1.6143790849673203) internal successors, (494), 312 states have internal predecessors, (494), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:20,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:20,165 INFO L93 Difference]: Finished difference Result 712 states and 1119 transitions. [2022-02-20 19:57:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 19:57:20,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:20,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:20,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1119 transitions. [2022-02-20 19:57:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:20,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1119 transitions. [2022-02-20 19:57:20,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 1119 transitions. [2022-02-20 19:57:20,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1119 edges. 1119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:20,952 INFO L225 Difference]: With dead ends: 712 [2022-02-20 19:57:20,952 INFO L226 Difference]: Without dead ends: 366 [2022-02-20 19:57:20,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:57:20,957 INFO L933 BasicCegarLoop]: 523 mSDtfsCounter, 770 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:20,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [781 Valid, 1197 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:20,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-02-20 19:57:20,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 348. [2022-02-20 19:57:20,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:20,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 366 states. Second operand has 348 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 302 states have internal predecessors, (453), 35 states have call successors, (35), 14 states have call predecessors, (35), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:57:20,996 INFO L74 IsIncluded]: Start isIncluded. First operand 366 states. Second operand has 348 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 302 states have internal predecessors, (453), 35 states have call successors, (35), 14 states have call predecessors, (35), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:57:20,998 INFO L87 Difference]: Start difference. First operand 366 states. Second operand has 348 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 302 states have internal predecessors, (453), 35 states have call successors, (35), 14 states have call predecessors, (35), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:57:21,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:21,013 INFO L93 Difference]: Finished difference Result 366 states and 549 transitions. [2022-02-20 19:57:21,013 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 549 transitions. [2022-02-20 19:57:21,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:21,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:21,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 348 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 302 states have internal predecessors, (453), 35 states have call successors, (35), 14 states have call predecessors, (35), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 366 states. [2022-02-20 19:57:21,018 INFO L87 Difference]: Start difference. First operand has 348 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 302 states have internal predecessors, (453), 35 states have call successors, (35), 14 states have call predecessors, (35), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand 366 states. [2022-02-20 19:57:21,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:21,031 INFO L93 Difference]: Finished difference Result 366 states and 549 transitions. [2022-02-20 19:57:21,032 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 549 transitions. [2022-02-20 19:57:21,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:21,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:21,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:21,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:21,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 302 states have internal predecessors, (453), 35 states have call successors, (35), 14 states have call predecessors, (35), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-02-20 19:57:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 521 transitions. [2022-02-20 19:57:21,047 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 521 transitions. Word has length 65 [2022-02-20 19:57:21,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:21,048 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 521 transitions. [2022-02-20 19:57:21,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:21,048 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 521 transitions. [2022-02-20 19:57:21,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:21,049 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:21,050 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:21,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:57:21,050 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:21,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:21,051 INFO L85 PathProgramCache]: Analyzing trace with hash -2047012498, now seen corresponding path program 1 times [2022-02-20 19:57:21,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:21,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839663257] [2022-02-20 19:57:21,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:21,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {2612#(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); {2613#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:21,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {2613#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {2613#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:21,108 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2613#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {2574#(= ~q_read_ev~0 2)} #1324#return; {2574#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:21,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {2614#(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; {2615#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:21,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {2615#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2615#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:21,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {2615#(= |old(~q_read_ev~0)| 0)} assume true; {2615#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:21,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2615#(= |old(~q_read_ev~0)| 0)} {2574#(= ~q_read_ev~0 2)} #1326#return; {2573#false} is VALID [2022-02-20 19:57:21,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {2572#true} havoc ~__retres1~0; {2572#true} is VALID [2022-02-20 19:57:21,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume !(1 == ~p_dw_pc~0); {2572#true} is VALID [2022-02-20 19:57:21,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} ~__retres1~0 := 0; {2572#true} is VALID [2022-02-20 19:57:21,154 INFO L290 TraceCheckUtils]: 3: Hoare triple {2572#true} #res := ~__retres1~0; {2572#true} is VALID [2022-02-20 19:57:21,155 INFO L290 TraceCheckUtils]: 4: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-02-20 19:57:21,155 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2572#true} {2572#true} #1320#return; {2572#true} is VALID [2022-02-20 19:57:21,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {2572#true} havoc ~__retres1~1; {2572#true} is VALID [2022-02-20 19:57:21,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume 1 == ~c_dr_pc~0; {2572#true} is VALID [2022-02-20 19:57:21,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2572#true} is VALID [2022-02-20 19:57:21,165 INFO L290 TraceCheckUtils]: 3: Hoare triple {2572#true} #res := ~__retres1~1; {2572#true} is VALID [2022-02-20 19:57:21,166 INFO L290 TraceCheckUtils]: 4: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-02-20 19:57:21,166 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2572#true} {2572#true} #1322#return; {2572#true} is VALID [2022-02-20 19:57:21,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {2616#(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; {2572#true} is VALID [2022-02-20 19:57:21,166 INFO L272 TraceCheckUtils]: 1: Hoare triple {2572#true} call #t~ret8 := is_do_write_p_triggered(); {2572#true} is VALID [2022-02-20 19:57:21,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} havoc ~__retres1~0; {2572#true} is VALID [2022-02-20 19:57:21,166 INFO L290 TraceCheckUtils]: 3: Hoare triple {2572#true} assume !(1 == ~p_dw_pc~0); {2572#true} is VALID [2022-02-20 19:57:21,167 INFO L290 TraceCheckUtils]: 4: Hoare triple {2572#true} ~__retres1~0 := 0; {2572#true} is VALID [2022-02-20 19:57:21,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {2572#true} #res := ~__retres1~0; {2572#true} is VALID [2022-02-20 19:57:21,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-02-20 19:57:21,167 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2572#true} {2572#true} #1320#return; {2572#true} is VALID [2022-02-20 19:57:21,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {2572#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2572#true} is VALID [2022-02-20 19:57:21,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {2572#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2572#true} is VALID [2022-02-20 19:57:21,167 INFO L272 TraceCheckUtils]: 10: Hoare triple {2572#true} call #t~ret9 := is_do_read_c_triggered(); {2572#true} is VALID [2022-02-20 19:57:21,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {2572#true} havoc ~__retres1~1; {2572#true} is VALID [2022-02-20 19:57:21,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {2572#true} assume 1 == ~c_dr_pc~0; {2572#true} is VALID [2022-02-20 19:57:21,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {2572#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2572#true} is VALID [2022-02-20 19:57:21,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {2572#true} #res := ~__retres1~1; {2572#true} is VALID [2022-02-20 19:57:21,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-02-20 19:57:21,168 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2572#true} {2572#true} #1322#return; {2572#true} is VALID [2022-02-20 19:57:21,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {2572#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2572#true} is VALID [2022-02-20 19:57:21,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {2572#true} assume !(0 != ~tmp___0~1); {2572#true} is VALID [2022-02-20 19:57:21,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-02-20 19:57:21,169 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2572#true} {2573#false} #1328#return; {2573#false} is VALID [2022-02-20 19:57:21,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {2614#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {2572#true} is VALID [2022-02-20 19:57:21,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume !(1 == ~q_write_ev~0); {2572#true} is VALID [2022-02-20 19:57:21,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-02-20 19:57:21,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2572#true} {2573#false} #1330#return; {2573#false} is VALID [2022-02-20 19:57:21,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:21,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {2572#true} havoc ~__retres1~2; {2572#true} is VALID [2022-02-20 19:57:21,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2572#true} is VALID [2022-02-20 19:57:21,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} #res := ~__retres1~2; {2572#true} is VALID [2022-02-20 19:57:21,180 INFO L290 TraceCheckUtils]: 3: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-02-20 19:57:21,180 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2572#true} {2573#false} #1332#return; {2573#false} is VALID [2022-02-20 19:57:21,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {2572#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {2572#true} is VALID [2022-02-20 19:57:21,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {2572#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {2572#true} is VALID [2022-02-20 19:57:21,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {2572#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {2574#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:21,181 INFO L290 TraceCheckUtils]: 3: Hoare triple {2574#(= ~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; {2574#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:21,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {2574#(= ~q_read_ev~0 2)} call update_channels1(); {2612#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:57:21,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {2612#(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); {2613#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:21,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {2613#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {2613#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:57:21,183 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2613#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {2574#(= ~q_read_ev~0 2)} #1324#return; {2574#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:21,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {2574#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {2574#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:21,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {2574#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2574#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:21,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {2574#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2574#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:21,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {2574#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {2574#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:57:21,185 INFO L272 TraceCheckUtils]: 12: Hoare triple {2574#(= ~q_read_ev~0 2)} call fire_delta_events1(); {2614#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:21,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {2614#(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; {2615#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:21,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {2615#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {2615#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:21,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {2615#(= |old(~q_read_ev~0)| 0)} assume true; {2615#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:57:21,186 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2615#(= |old(~q_read_ev~0)| 0)} {2574#(= ~q_read_ev~0 2)} #1326#return; {2573#false} is VALID [2022-02-20 19:57:21,186 INFO L272 TraceCheckUtils]: 17: Hoare triple {2573#false} call activate_threads1(); {2616#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:21,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {2616#(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; {2572#true} is VALID [2022-02-20 19:57:21,187 INFO L272 TraceCheckUtils]: 19: Hoare triple {2572#true} call #t~ret8 := is_do_write_p_triggered(); {2572#true} is VALID [2022-02-20 19:57:21,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {2572#true} havoc ~__retres1~0; {2572#true} is VALID [2022-02-20 19:57:21,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {2572#true} assume !(1 == ~p_dw_pc~0); {2572#true} is VALID [2022-02-20 19:57:21,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {2572#true} ~__retres1~0 := 0; {2572#true} is VALID [2022-02-20 19:57:21,187 INFO L290 TraceCheckUtils]: 23: Hoare triple {2572#true} #res := ~__retres1~0; {2572#true} is VALID [2022-02-20 19:57:21,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-02-20 19:57:21,187 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2572#true} {2572#true} #1320#return; {2572#true} is VALID [2022-02-20 19:57:21,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {2572#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2572#true} is VALID [2022-02-20 19:57:21,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {2572#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2572#true} is VALID [2022-02-20 19:57:21,188 INFO L272 TraceCheckUtils]: 28: Hoare triple {2572#true} call #t~ret9 := is_do_read_c_triggered(); {2572#true} is VALID [2022-02-20 19:57:21,188 INFO L290 TraceCheckUtils]: 29: Hoare triple {2572#true} havoc ~__retres1~1; {2572#true} is VALID [2022-02-20 19:57:21,188 INFO L290 TraceCheckUtils]: 30: Hoare triple {2572#true} assume 1 == ~c_dr_pc~0; {2572#true} is VALID [2022-02-20 19:57:21,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {2572#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {2572#true} is VALID [2022-02-20 19:57:21,189 INFO L290 TraceCheckUtils]: 32: Hoare triple {2572#true} #res := ~__retres1~1; {2572#true} is VALID [2022-02-20 19:57:21,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-02-20 19:57:21,189 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2572#true} {2572#true} #1322#return; {2572#true} is VALID [2022-02-20 19:57:21,189 INFO L290 TraceCheckUtils]: 35: Hoare triple {2572#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2572#true} is VALID [2022-02-20 19:57:21,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {2572#true} assume !(0 != ~tmp___0~1); {2572#true} is VALID [2022-02-20 19:57:21,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-02-20 19:57:21,189 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2572#true} {2573#false} #1328#return; {2573#false} is VALID [2022-02-20 19:57:21,190 INFO L272 TraceCheckUtils]: 39: Hoare triple {2573#false} call reset_delta_events1(); {2614#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:21,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {2614#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume 1 == ~q_read_ev~0;~q_read_ev~0 := 2; {2572#true} is VALID [2022-02-20 19:57:21,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {2572#true} assume !(1 == ~q_write_ev~0); {2572#true} is VALID [2022-02-20 19:57:21,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-02-20 19:57:21,190 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2572#true} {2573#false} #1330#return; {2573#false} is VALID [2022-02-20 19:57:21,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {2573#false} assume !false; {2573#false} is VALID [2022-02-20 19:57:21,190 INFO L290 TraceCheckUtils]: 45: Hoare triple {2573#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; {2573#false} is VALID [2022-02-20 19:57:21,191 INFO L290 TraceCheckUtils]: 46: Hoare triple {2573#false} assume !false; {2573#false} is VALID [2022-02-20 19:57:21,191 INFO L272 TraceCheckUtils]: 47: Hoare triple {2573#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2572#true} is VALID [2022-02-20 19:57:21,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {2572#true} havoc ~__retres1~2; {2572#true} is VALID [2022-02-20 19:57:21,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {2572#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2572#true} is VALID [2022-02-20 19:57:21,191 INFO L290 TraceCheckUtils]: 50: Hoare triple {2572#true} #res := ~__retres1~2; {2572#true} is VALID [2022-02-20 19:57:21,191 INFO L290 TraceCheckUtils]: 51: Hoare triple {2572#true} assume true; {2572#true} is VALID [2022-02-20 19:57:21,192 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2572#true} {2573#false} #1332#return; {2573#false} is VALID [2022-02-20 19:57:21,192 INFO L290 TraceCheckUtils]: 53: Hoare triple {2573#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; {2573#false} is VALID [2022-02-20 19:57:21,192 INFO L290 TraceCheckUtils]: 54: Hoare triple {2573#false} assume 0 != eval1_~tmp___1~0#1; {2573#false} is VALID [2022-02-20 19:57:21,192 INFO L290 TraceCheckUtils]: 55: Hoare triple {2573#false} assume !(0 == ~p_dw_st~0); {2573#false} is VALID [2022-02-20 19:57:21,192 INFO L290 TraceCheckUtils]: 56: Hoare triple {2573#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; {2573#false} is VALID [2022-02-20 19:57:21,192 INFO L290 TraceCheckUtils]: 57: Hoare triple {2573#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; {2573#false} is VALID [2022-02-20 19:57:21,192 INFO L290 TraceCheckUtils]: 58: Hoare triple {2573#false} assume !(0 == ~c_dr_pc~0); {2573#false} is VALID [2022-02-20 19:57:21,193 INFO L290 TraceCheckUtils]: 59: Hoare triple {2573#false} assume 1 == ~c_dr_pc~0; {2573#false} is VALID [2022-02-20 19:57:21,193 INFO L290 TraceCheckUtils]: 60: Hoare triple {2573#false} do_read_c_~a~0#1 := ~a_t~0; {2573#false} is VALID [2022-02-20 19:57:21,193 INFO L290 TraceCheckUtils]: 61: Hoare triple {2573#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; {2573#false} is VALID [2022-02-20 19:57:21,193 INFO L290 TraceCheckUtils]: 62: Hoare triple {2573#false} assume !(~p_last_write~0 == ~c_last_read~0); {2573#false} is VALID [2022-02-20 19:57:21,193 INFO L272 TraceCheckUtils]: 63: Hoare triple {2573#false} call error1(); {2573#false} is VALID [2022-02-20 19:57:21,193 INFO L290 TraceCheckUtils]: 64: Hoare triple {2573#false} assume !false; {2573#false} is VALID [2022-02-20 19:57:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:21,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:21,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839663257] [2022-02-20 19:57:21,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839663257] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:21,194 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:21,194 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:21,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378174502] [2022-02-20 19:57:21,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:21,196 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:21,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:21,196 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:21,230 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:21,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:21,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:21,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:21,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:21,232 INFO L87 Difference]: Start difference. First operand 348 states and 521 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:23,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:23,457 INFO L93 Difference]: Finished difference Result 571 states and 835 transitions. [2022-02-20 19:57:23,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:57:23,458 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:23,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:23,458 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:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 835 transitions. [2022-02-20 19:57:23,466 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:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 835 transitions. [2022-02-20 19:57:23,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 835 transitions. [2022-02-20 19:57:24,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 835 edges. 835 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:24,082 INFO L225 Difference]: With dead ends: 571 [2022-02-20 19:57:24,082 INFO L226 Difference]: Without dead ends: 483 [2022-02-20 19:57:24,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:57:24,083 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 648 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:24,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [653 Valid, 1942 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:57:24,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-02-20 19:57:24,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 444. [2022-02-20 19:57:24,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:24,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 483 states. Second operand has 444 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 380 states have internal predecessors, (557), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:57:24,102 INFO L74 IsIncluded]: Start isIncluded. First operand 483 states. Second operand has 444 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 380 states have internal predecessors, (557), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:57:24,103 INFO L87 Difference]: Start difference. First operand 483 states. Second operand has 444 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 380 states have internal predecessors, (557), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:57:24,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:24,120 INFO L93 Difference]: Finished difference Result 483 states and 706 transitions. [2022-02-20 19:57:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 706 transitions. [2022-02-20 19:57:24,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:24,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:24,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 444 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 380 states have internal predecessors, (557), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) Second operand 483 states. [2022-02-20 19:57:24,124 INFO L87 Difference]: Start difference. First operand has 444 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 380 states have internal predecessors, (557), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) Second operand 483 states. [2022-02-20 19:57:24,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:24,139 INFO L93 Difference]: Finished difference Result 483 states and 706 transitions. [2022-02-20 19:57:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 706 transitions. [2022-02-20 19:57:24,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:24,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:24,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:24,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:24,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 380 states have internal predecessors, (557), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2022-02-20 19:57:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 652 transitions. [2022-02-20 19:57:24,154 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 652 transitions. Word has length 65 [2022-02-20 19:57:24,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:24,154 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 652 transitions. [2022-02-20 19:57:24,154 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:24,155 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 652 transitions. [2022-02-20 19:57:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:24,156 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:24,156 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:24,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:57:24,156 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:24,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:24,157 INFO L85 PathProgramCache]: Analyzing trace with hash -368123858, now seen corresponding path program 1 times [2022-02-20 19:57:24,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:24,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536468810] [2022-02-20 19:57:24,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:24,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {5018#(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); {5019#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:24,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {5019#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {5019#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:24,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5019#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {4980#(= ~q_write_ev~0 ~q_read_ev~0)} #1324#return; {4980#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:24,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {5019#(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); {5020#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:24,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {5020#(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; {5021#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:24,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {5021#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {5021#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:24,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5021#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {4980#(= ~q_write_ev~0 ~q_read_ev~0)} #1326#return; {4979#false} is VALID [2022-02-20 19:57:24,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {4978#true} havoc ~__retres1~0; {4978#true} is VALID [2022-02-20 19:57:24,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {4978#true} assume !(1 == ~p_dw_pc~0); {4978#true} is VALID [2022-02-20 19:57:24,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {4978#true} ~__retres1~0 := 0; {4978#true} is VALID [2022-02-20 19:57:24,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {4978#true} #res := ~__retres1~0; {4978#true} is VALID [2022-02-20 19:57:24,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {4978#true} assume true; {4978#true} is VALID [2022-02-20 19:57:24,235 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4978#true} {4978#true} #1320#return; {4978#true} is VALID [2022-02-20 19:57:24,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {4978#true} havoc ~__retres1~1; {4978#true} is VALID [2022-02-20 19:57:24,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {4978#true} assume 1 == ~c_dr_pc~0; {4978#true} is VALID [2022-02-20 19:57:24,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {4978#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4978#true} is VALID [2022-02-20 19:57:24,237 INFO L290 TraceCheckUtils]: 3: Hoare triple {4978#true} #res := ~__retres1~1; {4978#true} is VALID [2022-02-20 19:57:24,238 INFO L290 TraceCheckUtils]: 4: Hoare triple {4978#true} assume true; {4978#true} is VALID [2022-02-20 19:57:24,238 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4978#true} {4978#true} #1322#return; {4978#true} is VALID [2022-02-20 19:57:24,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {5022#(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; {4978#true} is VALID [2022-02-20 19:57:24,238 INFO L272 TraceCheckUtils]: 1: Hoare triple {4978#true} call #t~ret8 := is_do_write_p_triggered(); {4978#true} is VALID [2022-02-20 19:57:24,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {4978#true} havoc ~__retres1~0; {4978#true} is VALID [2022-02-20 19:57:24,238 INFO L290 TraceCheckUtils]: 3: Hoare triple {4978#true} assume !(1 == ~p_dw_pc~0); {4978#true} is VALID [2022-02-20 19:57:24,239 INFO L290 TraceCheckUtils]: 4: Hoare triple {4978#true} ~__retres1~0 := 0; {4978#true} is VALID [2022-02-20 19:57:24,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {4978#true} #res := ~__retres1~0; {4978#true} is VALID [2022-02-20 19:57:24,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {4978#true} assume true; {4978#true} is VALID [2022-02-20 19:57:24,239 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4978#true} {4978#true} #1320#return; {4978#true} is VALID [2022-02-20 19:57:24,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {4978#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {4978#true} is VALID [2022-02-20 19:57:24,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {4978#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4978#true} is VALID [2022-02-20 19:57:24,239 INFO L272 TraceCheckUtils]: 10: Hoare triple {4978#true} call #t~ret9 := is_do_read_c_triggered(); {4978#true} is VALID [2022-02-20 19:57:24,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {4978#true} havoc ~__retres1~1; {4978#true} is VALID [2022-02-20 19:57:24,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {4978#true} assume 1 == ~c_dr_pc~0; {4978#true} is VALID [2022-02-20 19:57:24,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {4978#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4978#true} is VALID [2022-02-20 19:57:24,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {4978#true} #res := ~__retres1~1; {4978#true} is VALID [2022-02-20 19:57:24,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {4978#true} assume true; {4978#true} is VALID [2022-02-20 19:57:24,240 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4978#true} {4978#true} #1322#return; {4978#true} is VALID [2022-02-20 19:57:24,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {4978#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {4978#true} is VALID [2022-02-20 19:57:24,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {4978#true} assume !(0 != ~tmp___0~1); {4978#true} is VALID [2022-02-20 19:57:24,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {4978#true} assume true; {4978#true} is VALID [2022-02-20 19:57:24,241 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {4978#true} {4979#false} #1328#return; {4979#false} is VALID [2022-02-20 19:57:24,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {5019#(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); {4978#true} is VALID [2022-02-20 19:57:24,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {4978#true} assume !(1 == ~q_write_ev~0); {4978#true} is VALID [2022-02-20 19:57:24,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {4978#true} assume true; {4978#true} is VALID [2022-02-20 19:57:24,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4978#true} {4979#false} #1330#return; {4979#false} is VALID [2022-02-20 19:57:24,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:24,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {4978#true} havoc ~__retres1~2; {4978#true} is VALID [2022-02-20 19:57:24,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {4978#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4978#true} is VALID [2022-02-20 19:57:24,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {4978#true} #res := ~__retres1~2; {4978#true} is VALID [2022-02-20 19:57:24,247 INFO L290 TraceCheckUtils]: 3: Hoare triple {4978#true} assume true; {4978#true} is VALID [2022-02-20 19:57:24,248 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4978#true} {4979#false} #1332#return; {4979#false} is VALID [2022-02-20 19:57:24,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {4978#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {4978#true} is VALID [2022-02-20 19:57:24,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {4978#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {4978#true} is VALID [2022-02-20 19:57:24,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {4978#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {4980#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:24,249 INFO L290 TraceCheckUtils]: 3: Hoare triple {4980#(= ~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; {4980#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:24,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {4980#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {5018#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:57:24,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {5018#(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); {5019#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:24,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {5019#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {5019#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:24,251 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5019#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {4980#(= ~q_write_ev~0 ~q_read_ev~0)} #1324#return; {4980#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:24,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {4980#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {4980#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:24,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {4980#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {4980#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:24,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {4980#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {4980#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:24,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {4980#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {4980#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:57:24,252 INFO L272 TraceCheckUtils]: 12: Hoare triple {4980#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {5019#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:24,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {5019#(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); {5020#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:24,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {5020#(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; {5021#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:24,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {5021#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {5021#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:57:24,254 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5021#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {4980#(= ~q_write_ev~0 ~q_read_ev~0)} #1326#return; {4979#false} is VALID [2022-02-20 19:57:24,254 INFO L272 TraceCheckUtils]: 17: Hoare triple {4979#false} call activate_threads1(); {5022#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:24,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {5022#(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; {4978#true} is VALID [2022-02-20 19:57:24,254 INFO L272 TraceCheckUtils]: 19: Hoare triple {4978#true} call #t~ret8 := is_do_write_p_triggered(); {4978#true} is VALID [2022-02-20 19:57:24,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {4978#true} havoc ~__retres1~0; {4978#true} is VALID [2022-02-20 19:57:24,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {4978#true} assume !(1 == ~p_dw_pc~0); {4978#true} is VALID [2022-02-20 19:57:24,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {4978#true} ~__retres1~0 := 0; {4978#true} is VALID [2022-02-20 19:57:24,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {4978#true} #res := ~__retres1~0; {4978#true} is VALID [2022-02-20 19:57:24,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {4978#true} assume true; {4978#true} is VALID [2022-02-20 19:57:24,255 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {4978#true} {4978#true} #1320#return; {4978#true} is VALID [2022-02-20 19:57:24,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {4978#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {4978#true} is VALID [2022-02-20 19:57:24,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {4978#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {4978#true} is VALID [2022-02-20 19:57:24,255 INFO L272 TraceCheckUtils]: 28: Hoare triple {4978#true} call #t~ret9 := is_do_read_c_triggered(); {4978#true} is VALID [2022-02-20 19:57:24,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {4978#true} havoc ~__retres1~1; {4978#true} is VALID [2022-02-20 19:57:24,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {4978#true} assume 1 == ~c_dr_pc~0; {4978#true} is VALID [2022-02-20 19:57:24,256 INFO L290 TraceCheckUtils]: 31: Hoare triple {4978#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {4978#true} is VALID [2022-02-20 19:57:24,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {4978#true} #res := ~__retres1~1; {4978#true} is VALID [2022-02-20 19:57:24,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {4978#true} assume true; {4978#true} is VALID [2022-02-20 19:57:24,256 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {4978#true} {4978#true} #1322#return; {4978#true} is VALID [2022-02-20 19:57:24,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {4978#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {4978#true} is VALID [2022-02-20 19:57:24,256 INFO L290 TraceCheckUtils]: 36: Hoare triple {4978#true} assume !(0 != ~tmp___0~1); {4978#true} is VALID [2022-02-20 19:57:24,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {4978#true} assume true; {4978#true} is VALID [2022-02-20 19:57:24,257 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4978#true} {4979#false} #1328#return; {4979#false} is VALID [2022-02-20 19:57:24,257 INFO L272 TraceCheckUtils]: 39: Hoare triple {4979#false} call reset_delta_events1(); {5019#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:24,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {5019#(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); {4978#true} is VALID [2022-02-20 19:57:24,257 INFO L290 TraceCheckUtils]: 41: Hoare triple {4978#true} assume !(1 == ~q_write_ev~0); {4978#true} is VALID [2022-02-20 19:57:24,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {4978#true} assume true; {4978#true} is VALID [2022-02-20 19:57:24,257 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4978#true} {4979#false} #1330#return; {4979#false} is VALID [2022-02-20 19:57:24,258 INFO L290 TraceCheckUtils]: 44: Hoare triple {4979#false} assume !false; {4979#false} is VALID [2022-02-20 19:57:24,258 INFO L290 TraceCheckUtils]: 45: Hoare triple {4979#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; {4979#false} is VALID [2022-02-20 19:57:24,258 INFO L290 TraceCheckUtils]: 46: Hoare triple {4979#false} assume !false; {4979#false} is VALID [2022-02-20 19:57:24,258 INFO L272 TraceCheckUtils]: 47: Hoare triple {4979#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {4978#true} is VALID [2022-02-20 19:57:24,258 INFO L290 TraceCheckUtils]: 48: Hoare triple {4978#true} havoc ~__retres1~2; {4978#true} is VALID [2022-02-20 19:57:24,258 INFO L290 TraceCheckUtils]: 49: Hoare triple {4978#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {4978#true} is VALID [2022-02-20 19:57:24,258 INFO L290 TraceCheckUtils]: 50: Hoare triple {4978#true} #res := ~__retres1~2; {4978#true} is VALID [2022-02-20 19:57:24,258 INFO L290 TraceCheckUtils]: 51: Hoare triple {4978#true} assume true; {4978#true} is VALID [2022-02-20 19:57:24,259 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4978#true} {4979#false} #1332#return; {4979#false} is VALID [2022-02-20 19:57:24,259 INFO L290 TraceCheckUtils]: 53: Hoare triple {4979#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; {4979#false} is VALID [2022-02-20 19:57:24,259 INFO L290 TraceCheckUtils]: 54: Hoare triple {4979#false} assume 0 != eval1_~tmp___1~0#1; {4979#false} is VALID [2022-02-20 19:57:24,259 INFO L290 TraceCheckUtils]: 55: Hoare triple {4979#false} assume !(0 == ~p_dw_st~0); {4979#false} is VALID [2022-02-20 19:57:24,259 INFO L290 TraceCheckUtils]: 56: Hoare triple {4979#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; {4979#false} is VALID [2022-02-20 19:57:24,259 INFO L290 TraceCheckUtils]: 57: Hoare triple {4979#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; {4979#false} is VALID [2022-02-20 19:57:24,259 INFO L290 TraceCheckUtils]: 58: Hoare triple {4979#false} assume !(0 == ~c_dr_pc~0); {4979#false} is VALID [2022-02-20 19:57:24,260 INFO L290 TraceCheckUtils]: 59: Hoare triple {4979#false} assume 1 == ~c_dr_pc~0; {4979#false} is VALID [2022-02-20 19:57:24,260 INFO L290 TraceCheckUtils]: 60: Hoare triple {4979#false} do_read_c_~a~0#1 := ~a_t~0; {4979#false} is VALID [2022-02-20 19:57:24,260 INFO L290 TraceCheckUtils]: 61: Hoare triple {4979#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; {4979#false} is VALID [2022-02-20 19:57:24,260 INFO L290 TraceCheckUtils]: 62: Hoare triple {4979#false} assume !(~p_last_write~0 == ~c_last_read~0); {4979#false} is VALID [2022-02-20 19:57:24,260 INFO L272 TraceCheckUtils]: 63: Hoare triple {4979#false} call error1(); {4979#false} is VALID [2022-02-20 19:57:24,260 INFO L290 TraceCheckUtils]: 64: Hoare triple {4979#false} assume !false; {4979#false} is VALID [2022-02-20 19:57:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:24,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:24,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536468810] [2022-02-20 19:57:24,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536468810] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:24,261 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:24,261 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:57:24,261 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132169421] [2022-02-20 19:57:24,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:24,262 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:24,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:24,263 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:24,294 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:24,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:57:24,295 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:24,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:57:24,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:57:24,296 INFO L87 Difference]: Start difference. First operand 444 states and 652 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:26,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:26,694 INFO L93 Difference]: Finished difference Result 791 states and 1128 transitions. [2022-02-20 19:57:26,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:57:26,696 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:26,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:26,696 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:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 858 transitions. [2022-02-20 19:57:26,703 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:26,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 858 transitions. [2022-02-20 19:57:26,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 858 transitions. [2022-02-20 19:57:27,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 858 edges. 858 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:27,340 INFO L225 Difference]: With dead ends: 791 [2022-02-20 19:57:27,340 INFO L226 Difference]: Without dead ends: 614 [2022-02-20 19:57:27,343 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:27,347 INFO L933 BasicCegarLoop]: 523 mSDtfsCounter, 1038 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:27,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1065 Valid, 1775 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:57:27,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-02-20 19:57:27,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 540. [2022-02-20 19:57:27,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:27,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 614 states. Second operand has 540 states, 450 states have (on average 1.4666666666666666) internal successors, (660), 458 states have internal predecessors, (660), 57 states have call successors, (57), 28 states have call predecessors, (57), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2022-02-20 19:57:27,373 INFO L74 IsIncluded]: Start isIncluded. First operand 614 states. Second operand has 540 states, 450 states have (on average 1.4666666666666666) internal successors, (660), 458 states have internal predecessors, (660), 57 states have call successors, (57), 28 states have call predecessors, (57), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2022-02-20 19:57:27,374 INFO L87 Difference]: Start difference. First operand 614 states. Second operand has 540 states, 450 states have (on average 1.4666666666666666) internal successors, (660), 458 states have internal predecessors, (660), 57 states have call successors, (57), 28 states have call predecessors, (57), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2022-02-20 19:57:27,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:27,391 INFO L93 Difference]: Finished difference Result 614 states and 888 transitions. [2022-02-20 19:57:27,391 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 888 transitions. [2022-02-20 19:57:27,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:27,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:27,394 INFO L74 IsIncluded]: Start isIncluded. First operand has 540 states, 450 states have (on average 1.4666666666666666) internal successors, (660), 458 states have internal predecessors, (660), 57 states have call successors, (57), 28 states have call predecessors, (57), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) Second operand 614 states. [2022-02-20 19:57:27,395 INFO L87 Difference]: Start difference. First operand has 540 states, 450 states have (on average 1.4666666666666666) internal successors, (660), 458 states have internal predecessors, (660), 57 states have call successors, (57), 28 states have call predecessors, (57), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) Second operand 614 states. [2022-02-20 19:57:27,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:27,411 INFO L93 Difference]: Finished difference Result 614 states and 888 transitions. [2022-02-20 19:57:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 888 transitions. [2022-02-20 19:57:27,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:27,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:27,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:27,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:27,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 450 states have (on average 1.4666666666666666) internal successors, (660), 458 states have internal predecessors, (660), 57 states have call successors, (57), 28 states have call predecessors, (57), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2022-02-20 19:57:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 785 transitions. [2022-02-20 19:57:27,429 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 785 transitions. Word has length 65 [2022-02-20 19:57:27,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:27,429 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 785 transitions. [2022-02-20 19:57:27,429 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:27,430 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 785 transitions. [2022-02-20 19:57:27,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:27,431 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:27,431 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:27,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:57:27,432 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:27,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:27,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1898257328, now seen corresponding path program 1 times [2022-02-20 19:57:27,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:27,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650843769] [2022-02-20 19:57:27,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:27,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:27,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:27,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {8114#(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); {8075#true} is VALID [2022-02-20 19:57:27,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {8075#true} assume true; {8075#true} is VALID [2022-02-20 19:57:27,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8075#true} {8075#true} #1324#return; {8075#true} is VALID [2022-02-20 19:57:27,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:27,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {8115#(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); {8075#true} is VALID [2022-02-20 19:57:27,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {8075#true} assume !(0 == ~q_write_ev~0); {8075#true} is VALID [2022-02-20 19:57:27,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {8075#true} assume true; {8075#true} is VALID [2022-02-20 19:57:27,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8075#true} {8075#true} #1326#return; {8075#true} is VALID [2022-02-20 19:57:27,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:27,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:27,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {8075#true} havoc ~__retres1~0; {8075#true} is VALID [2022-02-20 19:57:27,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {8075#true} assume !(1 == ~p_dw_pc~0); {8075#true} is VALID [2022-02-20 19:57:27,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {8075#true} ~__retres1~0 := 0; {8075#true} is VALID [2022-02-20 19:57:27,537 INFO L290 TraceCheckUtils]: 3: Hoare triple {8075#true} #res := ~__retres1~0; {8075#true} is VALID [2022-02-20 19:57:27,537 INFO L290 TraceCheckUtils]: 4: Hoare triple {8075#true} assume true; {8075#true} is VALID [2022-02-20 19:57:27,537 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8075#true} {8075#true} #1320#return; {8075#true} is VALID [2022-02-20 19:57:27,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:27,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {8075#true} havoc ~__retres1~1; {8075#true} is VALID [2022-02-20 19:57:27,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {8075#true} assume 1 == ~c_dr_pc~0; {8075#true} is VALID [2022-02-20 19:57:27,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {8075#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {8131#(<= 1 is_do_read_c_triggered_~__retres1~1)} is VALID [2022-02-20 19:57:27,557 INFO L290 TraceCheckUtils]: 3: Hoare triple {8131#(<= 1 is_do_read_c_triggered_~__retres1~1)} #res := ~__retres1~1; {8132#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 19:57:27,557 INFO L290 TraceCheckUtils]: 4: Hoare triple {8132#(<= 1 |is_do_read_c_triggered_#res|)} assume true; {8132#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 19:57:27,558 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8132#(<= 1 |is_do_read_c_triggered_#res|)} {8075#true} #1322#return; {8129#(<= 1 |activate_threads1_#t~ret9|)} is VALID [2022-02-20 19:57:27,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {8116#(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; {8075#true} is VALID [2022-02-20 19:57:27,558 INFO L272 TraceCheckUtils]: 1: Hoare triple {8075#true} call #t~ret8 := is_do_write_p_triggered(); {8075#true} is VALID [2022-02-20 19:57:27,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {8075#true} havoc ~__retres1~0; {8075#true} is VALID [2022-02-20 19:57:27,558 INFO L290 TraceCheckUtils]: 3: Hoare triple {8075#true} assume !(1 == ~p_dw_pc~0); {8075#true} is VALID [2022-02-20 19:57:27,558 INFO L290 TraceCheckUtils]: 4: Hoare triple {8075#true} ~__retres1~0 := 0; {8075#true} is VALID [2022-02-20 19:57:27,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {8075#true} #res := ~__retres1~0; {8075#true} is VALID [2022-02-20 19:57:27,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {8075#true} assume true; {8075#true} is VALID [2022-02-20 19:57:27,559 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8075#true} {8075#true} #1320#return; {8075#true} is VALID [2022-02-20 19:57:27,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {8075#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {8075#true} is VALID [2022-02-20 19:57:27,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {8075#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {8075#true} is VALID [2022-02-20 19:57:27,559 INFO L272 TraceCheckUtils]: 10: Hoare triple {8075#true} call #t~ret9 := is_do_read_c_triggered(); {8075#true} is VALID [2022-02-20 19:57:27,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {8075#true} havoc ~__retres1~1; {8075#true} is VALID [2022-02-20 19:57:27,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {8075#true} assume 1 == ~c_dr_pc~0; {8075#true} is VALID [2022-02-20 19:57:27,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {8075#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {8131#(<= 1 is_do_read_c_triggered_~__retres1~1)} is VALID [2022-02-20 19:57:27,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {8131#(<= 1 is_do_read_c_triggered_~__retres1~1)} #res := ~__retres1~1; {8132#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 19:57:27,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {8132#(<= 1 |is_do_read_c_triggered_#res|)} assume true; {8132#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 19:57:27,569 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8132#(<= 1 |is_do_read_c_triggered_#res|)} {8075#true} #1322#return; {8129#(<= 1 |activate_threads1_#t~ret9|)} is VALID [2022-02-20 19:57:27,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {8129#(<= 1 |activate_threads1_#t~ret9|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {8130#(<= 1 activate_threads1_~tmp___0~1)} is VALID [2022-02-20 19:57:27,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {8130#(<= 1 activate_threads1_~tmp___0~1)} assume !(0 != ~tmp___0~1); {8076#false} is VALID [2022-02-20 19:57:27,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {8076#false} assume true; {8076#false} is VALID [2022-02-20 19:57:27,570 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {8076#false} {8075#true} #1328#return; {8076#false} is VALID [2022-02-20 19:57:27,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:27,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {8115#(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); {8075#true} is VALID [2022-02-20 19:57:27,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {8075#true} assume !(1 == ~q_write_ev~0); {8075#true} is VALID [2022-02-20 19:57:27,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {8075#true} assume true; {8075#true} is VALID [2022-02-20 19:57:27,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8075#true} {8076#false} #1330#return; {8076#false} is VALID [2022-02-20 19:57:27,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:27,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {8075#true} havoc ~__retres1~2; {8075#true} is VALID [2022-02-20 19:57:27,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {8075#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {8075#true} is VALID [2022-02-20 19:57:27,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {8075#true} #res := ~__retres1~2; {8075#true} is VALID [2022-02-20 19:57:27,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {8075#true} assume true; {8075#true} is VALID [2022-02-20 19:57:27,586 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8075#true} {8076#false} #1332#return; {8076#false} is VALID [2022-02-20 19:57:27,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {8075#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {8075#true} is VALID [2022-02-20 19:57:27,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {8075#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {8075#true} is VALID [2022-02-20 19:57:27,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {8075#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {8075#true} is VALID [2022-02-20 19:57:27,587 INFO L290 TraceCheckUtils]: 3: Hoare triple {8075#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; {8075#true} is VALID [2022-02-20 19:57:27,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {8075#true} call update_channels1(); {8114#(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:27,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {8114#(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); {8075#true} is VALID [2022-02-20 19:57:27,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {8075#true} assume true; {8075#true} is VALID [2022-02-20 19:57:27,588 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8075#true} {8075#true} #1324#return; {8075#true} is VALID [2022-02-20 19:57:27,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {8075#true} assume { :begin_inline_init_threads1 } true; {8075#true} is VALID [2022-02-20 19:57:27,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {8075#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {8075#true} is VALID [2022-02-20 19:57:27,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {8075#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {8075#true} is VALID [2022-02-20 19:57:27,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {8075#true} assume { :end_inline_init_threads1 } true; {8075#true} is VALID [2022-02-20 19:57:27,590 INFO L272 TraceCheckUtils]: 12: Hoare triple {8075#true} call fire_delta_events1(); {8115#(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:27,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {8115#(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); {8075#true} is VALID [2022-02-20 19:57:27,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {8075#true} assume !(0 == ~q_write_ev~0); {8075#true} is VALID [2022-02-20 19:57:27,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {8075#true} assume true; {8075#true} is VALID [2022-02-20 19:57:27,590 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8075#true} {8075#true} #1326#return; {8075#true} is VALID [2022-02-20 19:57:27,591 INFO L272 TraceCheckUtils]: 17: Hoare triple {8075#true} call activate_threads1(); {8116#(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:27,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {8116#(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; {8075#true} is VALID [2022-02-20 19:57:27,591 INFO L272 TraceCheckUtils]: 19: Hoare triple {8075#true} call #t~ret8 := is_do_write_p_triggered(); {8075#true} is VALID [2022-02-20 19:57:27,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {8075#true} havoc ~__retres1~0; {8075#true} is VALID [2022-02-20 19:57:27,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {8075#true} assume !(1 == ~p_dw_pc~0); {8075#true} is VALID [2022-02-20 19:57:27,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {8075#true} ~__retres1~0 := 0; {8075#true} is VALID [2022-02-20 19:57:27,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {8075#true} #res := ~__retres1~0; {8075#true} is VALID [2022-02-20 19:57:27,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {8075#true} assume true; {8075#true} is VALID [2022-02-20 19:57:27,592 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8075#true} {8075#true} #1320#return; {8075#true} is VALID [2022-02-20 19:57:27,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {8075#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {8075#true} is VALID [2022-02-20 19:57:27,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {8075#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {8075#true} is VALID [2022-02-20 19:57:27,592 INFO L272 TraceCheckUtils]: 28: Hoare triple {8075#true} call #t~ret9 := is_do_read_c_triggered(); {8075#true} is VALID [2022-02-20 19:57:27,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {8075#true} havoc ~__retres1~1; {8075#true} is VALID [2022-02-20 19:57:27,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {8075#true} assume 1 == ~c_dr_pc~0; {8075#true} is VALID [2022-02-20 19:57:27,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {8075#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {8131#(<= 1 is_do_read_c_triggered_~__retres1~1)} is VALID [2022-02-20 19:57:27,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {8131#(<= 1 is_do_read_c_triggered_~__retres1~1)} #res := ~__retres1~1; {8132#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 19:57:27,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {8132#(<= 1 |is_do_read_c_triggered_#res|)} assume true; {8132#(<= 1 |is_do_read_c_triggered_#res|)} is VALID [2022-02-20 19:57:27,594 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8132#(<= 1 |is_do_read_c_triggered_#res|)} {8075#true} #1322#return; {8129#(<= 1 |activate_threads1_#t~ret9|)} is VALID [2022-02-20 19:57:27,594 INFO L290 TraceCheckUtils]: 35: Hoare triple {8129#(<= 1 |activate_threads1_#t~ret9|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {8130#(<= 1 activate_threads1_~tmp___0~1)} is VALID [2022-02-20 19:57:27,595 INFO L290 TraceCheckUtils]: 36: Hoare triple {8130#(<= 1 activate_threads1_~tmp___0~1)} assume !(0 != ~tmp___0~1); {8076#false} is VALID [2022-02-20 19:57:27,595 INFO L290 TraceCheckUtils]: 37: Hoare triple {8076#false} assume true; {8076#false} is VALID [2022-02-20 19:57:27,595 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8076#false} {8075#true} #1328#return; {8076#false} is VALID [2022-02-20 19:57:27,595 INFO L272 TraceCheckUtils]: 39: Hoare triple {8076#false} call reset_delta_events1(); {8115#(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:27,595 INFO L290 TraceCheckUtils]: 40: Hoare triple {8115#(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); {8075#true} is VALID [2022-02-20 19:57:27,595 INFO L290 TraceCheckUtils]: 41: Hoare triple {8075#true} assume !(1 == ~q_write_ev~0); {8075#true} is VALID [2022-02-20 19:57:27,596 INFO L290 TraceCheckUtils]: 42: Hoare triple {8075#true} assume true; {8075#true} is VALID [2022-02-20 19:57:27,596 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8075#true} {8076#false} #1330#return; {8076#false} is VALID [2022-02-20 19:57:27,596 INFO L290 TraceCheckUtils]: 44: Hoare triple {8076#false} assume !false; {8076#false} is VALID [2022-02-20 19:57:27,596 INFO L290 TraceCheckUtils]: 45: Hoare triple {8076#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; {8076#false} is VALID [2022-02-20 19:57:27,596 INFO L290 TraceCheckUtils]: 46: Hoare triple {8076#false} assume !false; {8076#false} is VALID [2022-02-20 19:57:27,596 INFO L272 TraceCheckUtils]: 47: Hoare triple {8076#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {8075#true} is VALID [2022-02-20 19:57:27,596 INFO L290 TraceCheckUtils]: 48: Hoare triple {8075#true} havoc ~__retres1~2; {8075#true} is VALID [2022-02-20 19:57:27,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {8075#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {8075#true} is VALID [2022-02-20 19:57:27,597 INFO L290 TraceCheckUtils]: 50: Hoare triple {8075#true} #res := ~__retres1~2; {8075#true} is VALID [2022-02-20 19:57:27,597 INFO L290 TraceCheckUtils]: 51: Hoare triple {8075#true} assume true; {8075#true} is VALID [2022-02-20 19:57:27,597 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8075#true} {8076#false} #1332#return; {8076#false} is VALID [2022-02-20 19:57:27,597 INFO L290 TraceCheckUtils]: 53: Hoare triple {8076#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; {8076#false} is VALID [2022-02-20 19:57:27,597 INFO L290 TraceCheckUtils]: 54: Hoare triple {8076#false} assume 0 != eval1_~tmp___1~0#1; {8076#false} is VALID [2022-02-20 19:57:27,597 INFO L290 TraceCheckUtils]: 55: Hoare triple {8076#false} assume !(0 == ~p_dw_st~0); {8076#false} is VALID [2022-02-20 19:57:27,597 INFO L290 TraceCheckUtils]: 56: Hoare triple {8076#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; {8076#false} is VALID [2022-02-20 19:57:27,597 INFO L290 TraceCheckUtils]: 57: Hoare triple {8076#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; {8076#false} is VALID [2022-02-20 19:57:27,598 INFO L290 TraceCheckUtils]: 58: Hoare triple {8076#false} assume !(0 == ~c_dr_pc~0); {8076#false} is VALID [2022-02-20 19:57:27,598 INFO L290 TraceCheckUtils]: 59: Hoare triple {8076#false} assume 1 == ~c_dr_pc~0; {8076#false} is VALID [2022-02-20 19:57:27,598 INFO L290 TraceCheckUtils]: 60: Hoare triple {8076#false} do_read_c_~a~0#1 := ~a_t~0; {8076#false} is VALID [2022-02-20 19:57:27,598 INFO L290 TraceCheckUtils]: 61: Hoare triple {8076#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; {8076#false} is VALID [2022-02-20 19:57:27,598 INFO L290 TraceCheckUtils]: 62: Hoare triple {8076#false} assume !(~p_last_write~0 == ~c_last_read~0); {8076#false} is VALID [2022-02-20 19:57:27,598 INFO L272 TraceCheckUtils]: 63: Hoare triple {8076#false} call error1(); {8076#false} is VALID [2022-02-20 19:57:27,598 INFO L290 TraceCheckUtils]: 64: Hoare triple {8076#false} assume !false; {8076#false} is VALID [2022-02-20 19:57:27,599 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:27,600 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:27,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650843769] [2022-02-20 19:57:27,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650843769] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:27,600 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:27,600 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:27,600 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111807860] [2022-02-20 19:57:27,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:27,601 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:27,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:27,602 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:27,633 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:27,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:27,633 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:27,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:27,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:27,635 INFO L87 Difference]: Start difference. First operand 540 states and 785 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:30,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:30,325 INFO L93 Difference]: Finished difference Result 867 states and 1239 transitions. [2022-02-20 19:57:30,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:57:30,325 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:30,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:30,327 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:30,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 681 transitions. [2022-02-20 19:57:30,353 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:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 681 transitions. [2022-02-20 19:57:30,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 681 transitions. [2022-02-20 19:57:30,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 681 edges. 681 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:30,760 INFO L225 Difference]: With dead ends: 867 [2022-02-20 19:57:30,760 INFO L226 Difference]: Without dead ends: 600 [2022-02-20 19:57:30,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:57:30,766 INFO L933 BasicCegarLoop]: 509 mSDtfsCounter, 444 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:30,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 2257 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:57:30,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-02-20 19:57:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 555. [2022-02-20 19:57:30,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:30,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 600 states. Second operand has 555 states, 462 states have (on average 1.4545454545454546) internal successors, (672), 470 states have internal predecessors, (672), 57 states have call successors, (57), 28 states have call predecessors, (57), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) [2022-02-20 19:57:30,789 INFO L74 IsIncluded]: Start isIncluded. First operand 600 states. Second operand has 555 states, 462 states have (on average 1.4545454545454546) internal successors, (672), 470 states have internal predecessors, (672), 57 states have call successors, (57), 28 states have call predecessors, (57), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) [2022-02-20 19:57:30,790 INFO L87 Difference]: Start difference. First operand 600 states. Second operand has 555 states, 462 states have (on average 1.4545454545454546) internal successors, (672), 470 states have internal predecessors, (672), 57 states have call successors, (57), 28 states have call predecessors, (57), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) [2022-02-20 19:57:30,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:30,806 INFO L93 Difference]: Finished difference Result 600 states and 866 transitions. [2022-02-20 19:57:30,806 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 866 transitions. [2022-02-20 19:57:30,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:30,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:30,808 INFO L74 IsIncluded]: Start isIncluded. First operand has 555 states, 462 states have (on average 1.4545454545454546) internal successors, (672), 470 states have internal predecessors, (672), 57 states have call successors, (57), 28 states have call predecessors, (57), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) Second operand 600 states. [2022-02-20 19:57:30,809 INFO L87 Difference]: Start difference. First operand has 555 states, 462 states have (on average 1.4545454545454546) internal successors, (672), 470 states have internal predecessors, (672), 57 states have call successors, (57), 28 states have call predecessors, (57), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) Second operand 600 states. [2022-02-20 19:57:30,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:30,824 INFO L93 Difference]: Finished difference Result 600 states and 866 transitions. [2022-02-20 19:57:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 866 transitions. [2022-02-20 19:57:30,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:30,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:30,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:30,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:30,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 462 states have (on average 1.4545454545454546) internal successors, (672), 470 states have internal predecessors, (672), 57 states have call successors, (57), 28 states have call predecessors, (57), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) [2022-02-20 19:57:30,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 800 transitions. [2022-02-20 19:57:30,845 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 800 transitions. Word has length 65 [2022-02-20 19:57:30,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:30,845 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 800 transitions. [2022-02-20 19:57:30,845 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:30,845 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 800 transitions. [2022-02-20 19:57:30,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:30,850 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:30,850 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:30,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:57:30,850 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:30,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:30,851 INFO L85 PathProgramCache]: Analyzing trace with hash 512053934, now seen corresponding path program 1 times [2022-02-20 19:57:30,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:30,851 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858655068] [2022-02-20 19:57:30,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:30,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {11292#(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); {11253#true} is VALID [2022-02-20 19:57:30,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {11253#true} assume true; {11253#true} is VALID [2022-02-20 19:57:30,892 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11253#true} {11253#true} #1324#return; {11253#true} is VALID [2022-02-20 19:57:30,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {11293#(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); {11253#true} is VALID [2022-02-20 19:57:30,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {11253#true} assume !(0 == ~q_write_ev~0); {11253#true} is VALID [2022-02-20 19:57:30,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {11253#true} assume true; {11253#true} is VALID [2022-02-20 19:57:30,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11253#true} {11253#true} #1326#return; {11253#true} is VALID [2022-02-20 19:57:30,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {11253#true} havoc ~__retres1~0; {11253#true} is VALID [2022-02-20 19:57:30,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {11253#true} assume !(1 == ~p_dw_pc~0); {11253#true} is VALID [2022-02-20 19:57:30,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {11253#true} ~__retres1~0 := 0; {11309#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:30,985 INFO L290 TraceCheckUtils]: 3: Hoare triple {11309#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {11310#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:30,985 INFO L290 TraceCheckUtils]: 4: Hoare triple {11310#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {11310#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:30,986 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11310#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {11253#true} #1320#return; {11301#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:30,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {11253#true} havoc ~__retres1~1; {11253#true} is VALID [2022-02-20 19:57:30,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {11253#true} assume 1 == ~c_dr_pc~0; {11253#true} is VALID [2022-02-20 19:57:30,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {11253#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11253#true} is VALID [2022-02-20 19:57:30,989 INFO L290 TraceCheckUtils]: 3: Hoare triple {11253#true} #res := ~__retres1~1; {11253#true} is VALID [2022-02-20 19:57:30,989 INFO L290 TraceCheckUtils]: 4: Hoare triple {11253#true} assume true; {11253#true} is VALID [2022-02-20 19:57:30,989 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11253#true} {11254#false} #1322#return; {11254#false} is VALID [2022-02-20 19:57:30,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {11294#(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; {11253#true} is VALID [2022-02-20 19:57:30,990 INFO L272 TraceCheckUtils]: 1: Hoare triple {11253#true} call #t~ret8 := is_do_write_p_triggered(); {11253#true} is VALID [2022-02-20 19:57:30,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {11253#true} havoc ~__retres1~0; {11253#true} is VALID [2022-02-20 19:57:30,990 INFO L290 TraceCheckUtils]: 3: Hoare triple {11253#true} assume !(1 == ~p_dw_pc~0); {11253#true} is VALID [2022-02-20 19:57:30,990 INFO L290 TraceCheckUtils]: 4: Hoare triple {11253#true} ~__retres1~0 := 0; {11309#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:30,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {11309#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {11310#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:30,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {11310#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {11310#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:30,992 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11310#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {11253#true} #1320#return; {11301#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:30,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {11301#(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; {11302#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:30,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {11302#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {11254#false} is VALID [2022-02-20 19:57:30,993 INFO L272 TraceCheckUtils]: 10: Hoare triple {11254#false} call #t~ret9 := is_do_read_c_triggered(); {11253#true} is VALID [2022-02-20 19:57:30,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {11253#true} havoc ~__retres1~1; {11253#true} is VALID [2022-02-20 19:57:30,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {11253#true} assume 1 == ~c_dr_pc~0; {11253#true} is VALID [2022-02-20 19:57:30,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {11253#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11253#true} is VALID [2022-02-20 19:57:30,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {11253#true} #res := ~__retres1~1; {11253#true} is VALID [2022-02-20 19:57:30,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {11253#true} assume true; {11253#true} is VALID [2022-02-20 19:57:30,993 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11253#true} {11254#false} #1322#return; {11254#false} is VALID [2022-02-20 19:57:30,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {11254#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {11254#false} is VALID [2022-02-20 19:57:30,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {11254#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {11254#false} is VALID [2022-02-20 19:57:30,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {11254#false} assume true; {11254#false} is VALID [2022-02-20 19:57:30,994 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {11254#false} {11253#true} #1328#return; {11254#false} is VALID [2022-02-20 19:57:30,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:30,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {11293#(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); {11253#true} is VALID [2022-02-20 19:57:30,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {11253#true} assume !(1 == ~q_write_ev~0); {11253#true} is VALID [2022-02-20 19:57:30,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {11253#true} assume true; {11253#true} is VALID [2022-02-20 19:57:30,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11253#true} {11254#false} #1330#return; {11254#false} is VALID [2022-02-20 19:57:30,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {11253#true} havoc ~__retres1~2; {11253#true} is VALID [2022-02-20 19:57:31,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {11253#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {11253#true} is VALID [2022-02-20 19:57:31,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {11253#true} #res := ~__retres1~2; {11253#true} is VALID [2022-02-20 19:57:31,004 INFO L290 TraceCheckUtils]: 3: Hoare triple {11253#true} assume true; {11253#true} is VALID [2022-02-20 19:57:31,004 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11253#true} {11254#false} #1332#return; {11254#false} is VALID [2022-02-20 19:57:31,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {11253#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {11253#true} is VALID [2022-02-20 19:57:31,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {11253#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {11253#true} is VALID [2022-02-20 19:57:31,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {11253#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {11253#true} is VALID [2022-02-20 19:57:31,004 INFO L290 TraceCheckUtils]: 3: Hoare triple {11253#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; {11253#true} is VALID [2022-02-20 19:57:31,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {11253#true} call update_channels1(); {11292#(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:31,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {11292#(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); {11253#true} is VALID [2022-02-20 19:57:31,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {11253#true} assume true; {11253#true} is VALID [2022-02-20 19:57:31,005 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11253#true} {11253#true} #1324#return; {11253#true} is VALID [2022-02-20 19:57:31,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {11253#true} assume { :begin_inline_init_threads1 } true; {11253#true} is VALID [2022-02-20 19:57:31,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {11253#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {11253#true} is VALID [2022-02-20 19:57:31,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {11253#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {11253#true} is VALID [2022-02-20 19:57:31,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {11253#true} assume { :end_inline_init_threads1 } true; {11253#true} is VALID [2022-02-20 19:57:31,006 INFO L272 TraceCheckUtils]: 12: Hoare triple {11253#true} call fire_delta_events1(); {11293#(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:31,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {11293#(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); {11253#true} is VALID [2022-02-20 19:57:31,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {11253#true} assume !(0 == ~q_write_ev~0); {11253#true} is VALID [2022-02-20 19:57:31,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {11253#true} assume true; {11253#true} is VALID [2022-02-20 19:57:31,007 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11253#true} {11253#true} #1326#return; {11253#true} is VALID [2022-02-20 19:57:31,007 INFO L272 TraceCheckUtils]: 17: Hoare triple {11253#true} call activate_threads1(); {11294#(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:31,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {11294#(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; {11253#true} is VALID [2022-02-20 19:57:31,007 INFO L272 TraceCheckUtils]: 19: Hoare triple {11253#true} call #t~ret8 := is_do_write_p_triggered(); {11253#true} is VALID [2022-02-20 19:57:31,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {11253#true} havoc ~__retres1~0; {11253#true} is VALID [2022-02-20 19:57:31,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {11253#true} assume !(1 == ~p_dw_pc~0); {11253#true} is VALID [2022-02-20 19:57:31,008 INFO L290 TraceCheckUtils]: 22: Hoare triple {11253#true} ~__retres1~0 := 0; {11309#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:57:31,008 INFO L290 TraceCheckUtils]: 23: Hoare triple {11309#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {11310#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:31,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {11310#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {11310#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:57:31,009 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11310#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {11253#true} #1320#return; {11301#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:57:31,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {11301#(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; {11302#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:57:31,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {11302#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {11254#false} is VALID [2022-02-20 19:57:31,010 INFO L272 TraceCheckUtils]: 28: Hoare triple {11254#false} call #t~ret9 := is_do_read_c_triggered(); {11253#true} is VALID [2022-02-20 19:57:31,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {11253#true} havoc ~__retres1~1; {11253#true} is VALID [2022-02-20 19:57:31,010 INFO L290 TraceCheckUtils]: 30: Hoare triple {11253#true} assume 1 == ~c_dr_pc~0; {11253#true} is VALID [2022-02-20 19:57:31,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {11253#true} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {11253#true} is VALID [2022-02-20 19:57:31,010 INFO L290 TraceCheckUtils]: 32: Hoare triple {11253#true} #res := ~__retres1~1; {11253#true} is VALID [2022-02-20 19:57:31,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {11253#true} assume true; {11253#true} is VALID [2022-02-20 19:57:31,011 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11253#true} {11254#false} #1322#return; {11254#false} is VALID [2022-02-20 19:57:31,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {11254#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {11254#false} is VALID [2022-02-20 19:57:31,011 INFO L290 TraceCheckUtils]: 36: Hoare triple {11254#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {11254#false} is VALID [2022-02-20 19:57:31,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {11254#false} assume true; {11254#false} is VALID [2022-02-20 19:57:31,011 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {11254#false} {11253#true} #1328#return; {11254#false} is VALID [2022-02-20 19:57:31,011 INFO L272 TraceCheckUtils]: 39: Hoare triple {11254#false} call reset_delta_events1(); {11293#(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:31,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {11293#(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); {11253#true} is VALID [2022-02-20 19:57:31,011 INFO L290 TraceCheckUtils]: 41: Hoare triple {11253#true} assume !(1 == ~q_write_ev~0); {11253#true} is VALID [2022-02-20 19:57:31,011 INFO L290 TraceCheckUtils]: 42: Hoare triple {11253#true} assume true; {11253#true} is VALID [2022-02-20 19:57:31,012 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {11253#true} {11254#false} #1330#return; {11254#false} is VALID [2022-02-20 19:57:31,012 INFO L290 TraceCheckUtils]: 44: Hoare triple {11254#false} assume !false; {11254#false} is VALID [2022-02-20 19:57:31,012 INFO L290 TraceCheckUtils]: 45: Hoare triple {11254#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; {11254#false} is VALID [2022-02-20 19:57:31,012 INFO L290 TraceCheckUtils]: 46: Hoare triple {11254#false} assume !false; {11254#false} is VALID [2022-02-20 19:57:31,012 INFO L272 TraceCheckUtils]: 47: Hoare triple {11254#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {11253#true} is VALID [2022-02-20 19:57:31,012 INFO L290 TraceCheckUtils]: 48: Hoare triple {11253#true} havoc ~__retres1~2; {11253#true} is VALID [2022-02-20 19:57:31,012 INFO L290 TraceCheckUtils]: 49: Hoare triple {11253#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {11253#true} is VALID [2022-02-20 19:57:31,012 INFO L290 TraceCheckUtils]: 50: Hoare triple {11253#true} #res := ~__retres1~2; {11253#true} is VALID [2022-02-20 19:57:31,012 INFO L290 TraceCheckUtils]: 51: Hoare triple {11253#true} assume true; {11253#true} is VALID [2022-02-20 19:57:31,013 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11253#true} {11254#false} #1332#return; {11254#false} is VALID [2022-02-20 19:57:31,013 INFO L290 TraceCheckUtils]: 53: Hoare triple {11254#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; {11254#false} is VALID [2022-02-20 19:57:31,013 INFO L290 TraceCheckUtils]: 54: Hoare triple {11254#false} assume 0 != eval1_~tmp___1~0#1; {11254#false} is VALID [2022-02-20 19:57:31,013 INFO L290 TraceCheckUtils]: 55: Hoare triple {11254#false} assume !(0 == ~p_dw_st~0); {11254#false} is VALID [2022-02-20 19:57:31,013 INFO L290 TraceCheckUtils]: 56: Hoare triple {11254#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; {11254#false} is VALID [2022-02-20 19:57:31,013 INFO L290 TraceCheckUtils]: 57: Hoare triple {11254#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; {11254#false} is VALID [2022-02-20 19:57:31,013 INFO L290 TraceCheckUtils]: 58: Hoare triple {11254#false} assume !(0 == ~c_dr_pc~0); {11254#false} is VALID [2022-02-20 19:57:31,013 INFO L290 TraceCheckUtils]: 59: Hoare triple {11254#false} assume 1 == ~c_dr_pc~0; {11254#false} is VALID [2022-02-20 19:57:31,014 INFO L290 TraceCheckUtils]: 60: Hoare triple {11254#false} do_read_c_~a~0#1 := ~a_t~0; {11254#false} is VALID [2022-02-20 19:57:31,014 INFO L290 TraceCheckUtils]: 61: Hoare triple {11254#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; {11254#false} is VALID [2022-02-20 19:57:31,014 INFO L290 TraceCheckUtils]: 62: Hoare triple {11254#false} assume !(~p_last_write~0 == ~c_last_read~0); {11254#false} is VALID [2022-02-20 19:57:31,014 INFO L272 TraceCheckUtils]: 63: Hoare triple {11254#false} call error1(); {11254#false} is VALID [2022-02-20 19:57:31,014 INFO L290 TraceCheckUtils]: 64: Hoare triple {11254#false} assume !false; {11254#false} is VALID [2022-02-20 19:57:31,015 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:31,015 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:31,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858655068] [2022-02-20 19:57:31,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858655068] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:31,015 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:31,015 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:57:31,015 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842336129] [2022-02-20 19:57:31,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:31,016 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:31,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:31,016 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:31,047 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:31,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:57:31,047 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:31,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:57:31,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:57:31,048 INFO L87 Difference]: Start difference. First operand 555 states and 800 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:33,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:33,745 INFO L93 Difference]: Finished difference Result 873 states and 1232 transitions. [2022-02-20 19:57:33,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:33,746 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:33,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:33,746 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:33,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 677 transitions. [2022-02-20 19:57:33,750 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:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 677 transitions. [2022-02-20 19:57:33,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 677 transitions. [2022-02-20 19:57:34,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 677 edges. 677 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:34,221 INFO L225 Difference]: With dead ends: 873 [2022-02-20 19:57:34,221 INFO L226 Difference]: Without dead ends: 591 [2022-02-20 19:57:34,222 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:34,222 INFO L933 BasicCegarLoop]: 506 mSDtfsCounter, 451 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:34,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 2254 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 19:57:34,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-02-20 19:57:34,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 560. [2022-02-20 19:57:34,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:34,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 591 states. Second operand has 560 states, 466 states have (on average 1.446351931330472) internal successors, (674), 474 states have internal predecessors, (674), 57 states have call successors, (57), 28 states have call predecessors, (57), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) [2022-02-20 19:57:34,243 INFO L74 IsIncluded]: Start isIncluded. First operand 591 states. Second operand has 560 states, 466 states have (on average 1.446351931330472) internal successors, (674), 474 states have internal predecessors, (674), 57 states have call successors, (57), 28 states have call predecessors, (57), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) [2022-02-20 19:57:34,244 INFO L87 Difference]: Start difference. First operand 591 states. Second operand has 560 states, 466 states have (on average 1.446351931330472) internal successors, (674), 474 states have internal predecessors, (674), 57 states have call successors, (57), 28 states have call predecessors, (57), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) [2022-02-20 19:57:34,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:34,258 INFO L93 Difference]: Finished difference Result 591 states and 847 transitions. [2022-02-20 19:57:34,258 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 847 transitions. [2022-02-20 19:57:34,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:34,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:34,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 560 states, 466 states have (on average 1.446351931330472) internal successors, (674), 474 states have internal predecessors, (674), 57 states have call successors, (57), 28 states have call predecessors, (57), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) Second operand 591 states. [2022-02-20 19:57:34,262 INFO L87 Difference]: Start difference. First operand has 560 states, 466 states have (on average 1.446351931330472) internal successors, (674), 474 states have internal predecessors, (674), 57 states have call successors, (57), 28 states have call predecessors, (57), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) Second operand 591 states. [2022-02-20 19:57:34,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:34,277 INFO L93 Difference]: Finished difference Result 591 states and 847 transitions. [2022-02-20 19:57:34,277 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 847 transitions. [2022-02-20 19:57:34,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:34,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:34,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:34,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:34,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 466 states have (on average 1.446351931330472) internal successors, (674), 474 states have internal predecessors, (674), 57 states have call successors, (57), 28 states have call predecessors, (57), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) [2022-02-20 19:57:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 803 transitions. [2022-02-20 19:57:34,295 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 803 transitions. Word has length 65 [2022-02-20 19:57:34,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:34,295 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 803 transitions. [2022-02-20 19:57:34,296 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:34,296 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 803 transitions. [2022-02-20 19:57:34,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:34,297 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:34,297 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:34,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:57:34,297 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:34,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:34,297 INFO L85 PathProgramCache]: Analyzing trace with hash -517305364, now seen corresponding path program 1 times [2022-02-20 19:57:34,298 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:34,298 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811729060] [2022-02-20 19:57:34,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:34,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:34,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:34,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {14467#(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); {14468#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:57:34,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {14468#(not (= |old(~q_req_up~0)| 1))} assume true; {14468#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:57:34,339 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14468#(not (= |old(~q_req_up~0)| 1))} {14428#(= ~c_dr_pc~0 ~q_req_up~0)} #1324#return; {14432#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:34,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:34,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {14469#(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); {14425#true} is VALID [2022-02-20 19:57:34,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {14425#true} assume !(0 == ~q_write_ev~0); {14425#true} is VALID [2022-02-20 19:57:34,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {14425#true} assume true; {14425#true} is VALID [2022-02-20 19:57:34,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14425#true} {14432#(not (= ~c_dr_pc~0 1))} #1326#return; {14432#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:34,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:34,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:34,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {14425#true} havoc ~__retres1~0; {14425#true} is VALID [2022-02-20 19:57:34,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {14425#true} assume !(1 == ~p_dw_pc~0); {14425#true} is VALID [2022-02-20 19:57:34,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {14425#true} ~__retres1~0 := 0; {14425#true} is VALID [2022-02-20 19:57:34,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {14425#true} #res := ~__retres1~0; {14425#true} is VALID [2022-02-20 19:57:34,370 INFO L290 TraceCheckUtils]: 4: Hoare triple {14425#true} assume true; {14425#true} is VALID [2022-02-20 19:57:34,370 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14425#true} {14425#true} #1320#return; {14425#true} is VALID [2022-02-20 19:57:34,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:34,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {14425#true} havoc ~__retres1~1; {14425#true} is VALID [2022-02-20 19:57:34,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {14425#true} assume 1 == ~c_dr_pc~0; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,394 INFO L290 TraceCheckUtils]: 3: Hoare triple {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,394 INFO L290 TraceCheckUtils]: 4: Hoare triple {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,395 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} {14425#true} #1322#return; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {14470#(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; {14425#true} is VALID [2022-02-20 19:57:34,395 INFO L272 TraceCheckUtils]: 1: Hoare triple {14425#true} call #t~ret8 := is_do_write_p_triggered(); {14425#true} is VALID [2022-02-20 19:57:34,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {14425#true} havoc ~__retres1~0; {14425#true} is VALID [2022-02-20 19:57:34,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {14425#true} assume !(1 == ~p_dw_pc~0); {14425#true} is VALID [2022-02-20 19:57:34,396 INFO L290 TraceCheckUtils]: 4: Hoare triple {14425#true} ~__retres1~0 := 0; {14425#true} is VALID [2022-02-20 19:57:34,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {14425#true} #res := ~__retres1~0; {14425#true} is VALID [2022-02-20 19:57:34,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {14425#true} assume true; {14425#true} is VALID [2022-02-20 19:57:34,396 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14425#true} {14425#true} #1320#return; {14425#true} is VALID [2022-02-20 19:57:34,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {14425#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {14425#true} is VALID [2022-02-20 19:57:34,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {14425#true} assume !(0 != ~tmp~1); {14425#true} is VALID [2022-02-20 19:57:34,396 INFO L272 TraceCheckUtils]: 10: Hoare triple {14425#true} call #t~ret9 := is_do_read_c_triggered(); {14425#true} is VALID [2022-02-20 19:57:34,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {14425#true} havoc ~__retres1~1; {14425#true} is VALID [2022-02-20 19:57:34,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {14425#true} assume 1 == ~c_dr_pc~0; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,398 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} {14425#true} #1322#return; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,399 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} {14432#(not (= ~c_dr_pc~0 1))} #1328#return; {14426#false} is VALID [2022-02-20 19:57:34,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:34,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {14469#(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); {14425#true} is VALID [2022-02-20 19:57:34,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {14425#true} assume !(1 == ~q_write_ev~0); {14425#true} is VALID [2022-02-20 19:57:34,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {14425#true} assume true; {14425#true} is VALID [2022-02-20 19:57:34,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14425#true} {14426#false} #1330#return; {14426#false} is VALID [2022-02-20 19:57:34,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:34,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {14425#true} havoc ~__retres1~2; {14425#true} is VALID [2022-02-20 19:57:34,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {14425#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14425#true} is VALID [2022-02-20 19:57:34,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {14425#true} #res := ~__retres1~2; {14425#true} is VALID [2022-02-20 19:57:34,407 INFO L290 TraceCheckUtils]: 3: Hoare triple {14425#true} assume true; {14425#true} is VALID [2022-02-20 19:57:34,407 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14425#true} {14426#false} #1332#return; {14426#false} is VALID [2022-02-20 19:57:34,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {14425#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {14427#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:57:34,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {14427#(= ~q_req_up~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {14427#(= ~q_req_up~0 0)} is VALID [2022-02-20 19:57:34,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {14427#(= ~q_req_up~0 0)} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {14428#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:57:34,408 INFO L290 TraceCheckUtils]: 3: Hoare triple {14428#(= ~c_dr_pc~0 ~q_req_up~0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {14428#(= ~c_dr_pc~0 ~q_req_up~0)} is VALID [2022-02-20 19:57:34,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {14428#(= ~c_dr_pc~0 ~q_req_up~0)} call update_channels1(); {14467#(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:34,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {14467#(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); {14468#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:57:34,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {14468#(not (= |old(~q_req_up~0)| 1))} assume true; {14468#(not (= |old(~q_req_up~0)| 1))} is VALID [2022-02-20 19:57:34,410 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14468#(not (= |old(~q_req_up~0)| 1))} {14428#(= ~c_dr_pc~0 ~q_req_up~0)} #1324#return; {14432#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:34,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {14432#(not (= ~c_dr_pc~0 1))} assume { :begin_inline_init_threads1 } true; {14432#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:34,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {14432#(not (= ~c_dr_pc~0 1))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {14432#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:34,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {14432#(not (= ~c_dr_pc~0 1))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {14432#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:34,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {14432#(not (= ~c_dr_pc~0 1))} assume { :end_inline_init_threads1 } true; {14432#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:34,411 INFO L272 TraceCheckUtils]: 12: Hoare triple {14432#(not (= ~c_dr_pc~0 1))} call fire_delta_events1(); {14469#(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:34,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {14469#(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); {14425#true} is VALID [2022-02-20 19:57:34,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {14425#true} assume !(0 == ~q_write_ev~0); {14425#true} is VALID [2022-02-20 19:57:34,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {14425#true} assume true; {14425#true} is VALID [2022-02-20 19:57:34,412 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14425#true} {14432#(not (= ~c_dr_pc~0 1))} #1326#return; {14432#(not (= ~c_dr_pc~0 1))} is VALID [2022-02-20 19:57:34,412 INFO L272 TraceCheckUtils]: 17: Hoare triple {14432#(not (= ~c_dr_pc~0 1))} call activate_threads1(); {14470#(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:34,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {14470#(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; {14425#true} is VALID [2022-02-20 19:57:34,413 INFO L272 TraceCheckUtils]: 19: Hoare triple {14425#true} call #t~ret8 := is_do_write_p_triggered(); {14425#true} is VALID [2022-02-20 19:57:34,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {14425#true} havoc ~__retres1~0; {14425#true} is VALID [2022-02-20 19:57:34,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {14425#true} assume !(1 == ~p_dw_pc~0); {14425#true} is VALID [2022-02-20 19:57:34,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {14425#true} ~__retres1~0 := 0; {14425#true} is VALID [2022-02-20 19:57:34,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {14425#true} #res := ~__retres1~0; {14425#true} is VALID [2022-02-20 19:57:34,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {14425#true} assume true; {14425#true} is VALID [2022-02-20 19:57:34,413 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14425#true} {14425#true} #1320#return; {14425#true} is VALID [2022-02-20 19:57:34,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {14425#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {14425#true} is VALID [2022-02-20 19:57:34,414 INFO L290 TraceCheckUtils]: 27: Hoare triple {14425#true} assume !(0 != ~tmp~1); {14425#true} is VALID [2022-02-20 19:57:34,414 INFO L272 TraceCheckUtils]: 28: Hoare triple {14425#true} call #t~ret9 := is_do_read_c_triggered(); {14425#true} is VALID [2022-02-20 19:57:34,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {14425#true} havoc ~__retres1~1; {14425#true} is VALID [2022-02-20 19:57:34,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {14425#true} assume 1 == ~c_dr_pc~0; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,414 INFO L290 TraceCheckUtils]: 31: Hoare triple {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 1 == ~q_write_ev~0;~__retres1~1 := 1; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} #res := ~__retres1~1; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,415 INFO L290 TraceCheckUtils]: 33: Hoare triple {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,415 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} {14425#true} #1322#return; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,416 INFO L290 TraceCheckUtils]: 36: Hoare triple {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} assume true; {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} is VALID [2022-02-20 19:57:34,417 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14483#(= (+ (- 1) ~c_dr_pc~0) 0)} {14432#(not (= ~c_dr_pc~0 1))} #1328#return; {14426#false} is VALID [2022-02-20 19:57:34,417 INFO L272 TraceCheckUtils]: 39: Hoare triple {14426#false} call reset_delta_events1(); {14469#(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:34,417 INFO L290 TraceCheckUtils]: 40: Hoare triple {14469#(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); {14425#true} is VALID [2022-02-20 19:57:34,417 INFO L290 TraceCheckUtils]: 41: Hoare triple {14425#true} assume !(1 == ~q_write_ev~0); {14425#true} is VALID [2022-02-20 19:57:34,419 INFO L290 TraceCheckUtils]: 42: Hoare triple {14425#true} assume true; {14425#true} is VALID [2022-02-20 19:57:34,420 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {14425#true} {14426#false} #1330#return; {14426#false} is VALID [2022-02-20 19:57:34,421 INFO L290 TraceCheckUtils]: 44: Hoare triple {14426#false} assume !false; {14426#false} is VALID [2022-02-20 19:57:34,421 INFO L290 TraceCheckUtils]: 45: Hoare triple {14426#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; {14426#false} is VALID [2022-02-20 19:57:34,421 INFO L290 TraceCheckUtils]: 46: Hoare triple {14426#false} assume !false; {14426#false} is VALID [2022-02-20 19:57:34,421 INFO L272 TraceCheckUtils]: 47: Hoare triple {14426#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {14425#true} is VALID [2022-02-20 19:57:34,421 INFO L290 TraceCheckUtils]: 48: Hoare triple {14425#true} havoc ~__retres1~2; {14425#true} is VALID [2022-02-20 19:57:34,421 INFO L290 TraceCheckUtils]: 49: Hoare triple {14425#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14425#true} is VALID [2022-02-20 19:57:34,421 INFO L290 TraceCheckUtils]: 50: Hoare triple {14425#true} #res := ~__retres1~2; {14425#true} is VALID [2022-02-20 19:57:34,421 INFO L290 TraceCheckUtils]: 51: Hoare triple {14425#true} assume true; {14425#true} is VALID [2022-02-20 19:57:34,421 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14425#true} {14426#false} #1332#return; {14426#false} is VALID [2022-02-20 19:57:34,422 INFO L290 TraceCheckUtils]: 53: Hoare triple {14426#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; {14426#false} is VALID [2022-02-20 19:57:34,422 INFO L290 TraceCheckUtils]: 54: Hoare triple {14426#false} assume 0 != eval1_~tmp___1~0#1; {14426#false} is VALID [2022-02-20 19:57:34,422 INFO L290 TraceCheckUtils]: 55: Hoare triple {14426#false} assume !(0 == ~p_dw_st~0); {14426#false} is VALID [2022-02-20 19:57:34,422 INFO L290 TraceCheckUtils]: 56: Hoare triple {14426#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; {14426#false} is VALID [2022-02-20 19:57:34,422 INFO L290 TraceCheckUtils]: 57: Hoare triple {14426#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; {14426#false} is VALID [2022-02-20 19:57:34,422 INFO L290 TraceCheckUtils]: 58: Hoare triple {14426#false} assume !(0 == ~c_dr_pc~0); {14426#false} is VALID [2022-02-20 19:57:34,422 INFO L290 TraceCheckUtils]: 59: Hoare triple {14426#false} assume 1 == ~c_dr_pc~0; {14426#false} is VALID [2022-02-20 19:57:34,422 INFO L290 TraceCheckUtils]: 60: Hoare triple {14426#false} do_read_c_~a~0#1 := ~a_t~0; {14426#false} is VALID [2022-02-20 19:57:34,423 INFO L290 TraceCheckUtils]: 61: Hoare triple {14426#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; {14426#false} is VALID [2022-02-20 19:57:34,423 INFO L290 TraceCheckUtils]: 62: Hoare triple {14426#false} assume !(~p_last_write~0 == ~c_last_read~0); {14426#false} is VALID [2022-02-20 19:57:34,423 INFO L272 TraceCheckUtils]: 63: Hoare triple {14426#false} call error1(); {14426#false} is VALID [2022-02-20 19:57:34,423 INFO L290 TraceCheckUtils]: 64: Hoare triple {14426#false} assume !false; {14426#false} is VALID [2022-02-20 19:57:34,423 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:34,423 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:34,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811729060] [2022-02-20 19:57:34,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811729060] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:34,424 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:34,424 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 19:57:34,424 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387786292] [2022-02-20 19:57:34,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:34,425 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-02-20 19:57:34,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:34,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:34,462 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:34,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:57:34,463 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:34,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:57:34,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:57:34,463 INFO L87 Difference]: Start difference. First operand 560 states and 803 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:39,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:39,000 INFO L93 Difference]: Finished difference Result 1916 states and 2644 transitions. [2022-02-20 19:57:39,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-20 19:57:39,001 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-02-20 19:57:39,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1194 transitions. [2022-02-20 19:57:39,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:39,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1194 transitions. [2022-02-20 19:57:39,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 1194 transitions. [2022-02-20 19:57:39,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1194 edges. 1194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:39,844 INFO L225 Difference]: With dead ends: 1916 [2022-02-20 19:57:39,844 INFO L226 Difference]: Without dead ends: 1611 [2022-02-20 19:57:39,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 19:57:39,846 INFO L933 BasicCegarLoop]: 607 mSDtfsCounter, 2741 mSDsluCounter, 1670 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 592 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2760 SdHoareTripleChecker+Valid, 2277 SdHoareTripleChecker+Invalid, 2074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 592 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:39,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2760 Valid, 2277 Invalid, 2074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [592 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 19:57:39,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2022-02-20 19:57:39,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1476. [2022-02-20 19:57:39,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:39,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1611 states. Second operand has 1476 states, 1193 states have (on average 1.363788767812238) internal successors, (1627), 1216 states have internal predecessors, (1627), 145 states have call successors, (145), 111 states have call predecessors, (145), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) [2022-02-20 19:57:39,907 INFO L74 IsIncluded]: Start isIncluded. First operand 1611 states. Second operand has 1476 states, 1193 states have (on average 1.363788767812238) internal successors, (1627), 1216 states have internal predecessors, (1627), 145 states have call successors, (145), 111 states have call predecessors, (145), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) [2022-02-20 19:57:39,909 INFO L87 Difference]: Start difference. First operand 1611 states. Second operand has 1476 states, 1193 states have (on average 1.363788767812238) internal successors, (1627), 1216 states have internal predecessors, (1627), 145 states have call successors, (145), 111 states have call predecessors, (145), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) [2022-02-20 19:57:39,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:39,989 INFO L93 Difference]: Finished difference Result 1611 states and 2116 transitions. [2022-02-20 19:57:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2116 transitions. [2022-02-20 19:57:39,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:39,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:40,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 1476 states, 1193 states have (on average 1.363788767812238) internal successors, (1627), 1216 states have internal predecessors, (1627), 145 states have call successors, (145), 111 states have call predecessors, (145), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) Second operand 1611 states. [2022-02-20 19:57:40,015 INFO L87 Difference]: Start difference. First operand has 1476 states, 1193 states have (on average 1.363788767812238) internal successors, (1627), 1216 states have internal predecessors, (1627), 145 states have call successors, (145), 111 states have call predecessors, (145), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) Second operand 1611 states. [2022-02-20 19:57:40,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:40,099 INFO L93 Difference]: Finished difference Result 1611 states and 2116 transitions. [2022-02-20 19:57:40,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2116 transitions. [2022-02-20 19:57:40,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:40,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:40,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:40,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:40,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1193 states have (on average 1.363788767812238) internal successors, (1627), 1216 states have internal predecessors, (1627), 145 states have call successors, (145), 111 states have call predecessors, (145), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) [2022-02-20 19:57:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 1961 transitions. [2022-02-20 19:57:40,186 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 1961 transitions. Word has length 65 [2022-02-20 19:57:40,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:40,186 INFO L470 AbstractCegarLoop]: Abstraction has 1476 states and 1961 transitions. [2022-02-20 19:57:40,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-02-20 19:57:40,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 1961 transitions. [2022-02-20 19:57:40,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:57:40,187 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:40,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:40,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:57:40,187 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:40,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:40,188 INFO L85 PathProgramCache]: Analyzing trace with hash 462107460, now seen corresponding path program 1 times [2022-02-20 19:57:40,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:40,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661025659] [2022-02-20 19:57:40,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:40,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:40,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:40,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {22363#(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); {22323#true} is VALID [2022-02-20 19:57:40,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {22323#true} assume true; {22323#true} is VALID [2022-02-20 19:57:40,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22323#true} {22323#true} #1324#return; {22323#true} is VALID [2022-02-20 19:57:40,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:40,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {22364#(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); {22323#true} is VALID [2022-02-20 19:57:40,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {22323#true} assume !(0 == ~q_write_ev~0); {22323#true} is VALID [2022-02-20 19:57:40,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {22323#true} assume true; {22323#true} is VALID [2022-02-20 19:57:40,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22323#true} {22328#(= ~p_dw_st~0 0)} #1326#return; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:40,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:40,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {22323#true} havoc ~__retres1~0; {22323#true} is VALID [2022-02-20 19:57:40,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {22323#true} assume !(1 == ~p_dw_pc~0); {22323#true} is VALID [2022-02-20 19:57:40,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {22323#true} ~__retres1~0 := 0; {22323#true} is VALID [2022-02-20 19:57:40,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {22323#true} #res := ~__retres1~0; {22323#true} is VALID [2022-02-20 19:57:40,239 INFO L290 TraceCheckUtils]: 4: Hoare triple {22323#true} assume true; {22323#true} is VALID [2022-02-20 19:57:40,240 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22323#true} {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1320#return; {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:40,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:40,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {22323#true} havoc ~__retres1~1; {22323#true} is VALID [2022-02-20 19:57:40,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {22323#true} assume !(1 == ~c_dr_pc~0); {22323#true} is VALID [2022-02-20 19:57:40,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {22323#true} ~__retres1~1 := 0; {22323#true} is VALID [2022-02-20 19:57:40,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {22323#true} #res := ~__retres1~1; {22323#true} is VALID [2022-02-20 19:57:40,243 INFO L290 TraceCheckUtils]: 4: Hoare triple {22323#true} assume true; {22323#true} is VALID [2022-02-20 19:57:40,243 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {22323#true} {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1322#return; {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:40,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {22365#(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; {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:40,244 INFO L272 TraceCheckUtils]: 1: Hoare triple {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {22323#true} is VALID [2022-02-20 19:57:40,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {22323#true} havoc ~__retres1~0; {22323#true} is VALID [2022-02-20 19:57:40,244 INFO L290 TraceCheckUtils]: 3: Hoare triple {22323#true} assume !(1 == ~p_dw_pc~0); {22323#true} is VALID [2022-02-20 19:57:40,244 INFO L290 TraceCheckUtils]: 4: Hoare triple {22323#true} ~__retres1~0 := 0; {22323#true} is VALID [2022-02-20 19:57:40,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {22323#true} #res := ~__retres1~0; {22323#true} is VALID [2022-02-20 19:57:40,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {22323#true} assume true; {22323#true} is VALID [2022-02-20 19:57:40,253 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22323#true} {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1320#return; {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:40,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:40,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:40,254 INFO L272 TraceCheckUtils]: 10: Hoare triple {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {22323#true} is VALID [2022-02-20 19:57:40,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {22323#true} havoc ~__retres1~1; {22323#true} is VALID [2022-02-20 19:57:40,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {22323#true} assume !(1 == ~c_dr_pc~0); {22323#true} is VALID [2022-02-20 19:57:40,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {22323#true} ~__retres1~1 := 0; {22323#true} is VALID [2022-02-20 19:57:40,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {22323#true} #res := ~__retres1~1; {22323#true} is VALID [2022-02-20 19:57:40,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {22323#true} assume true; {22323#true} is VALID [2022-02-20 19:57:40,255 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22323#true} {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1322#return; {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:40,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:40,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:40,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:40,256 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {22328#(= ~p_dw_st~0 0)} #1328#return; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:40,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {22364#(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); {22323#true} is VALID [2022-02-20 19:57:40,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {22323#true} assume !(1 == ~q_write_ev~0); {22323#true} is VALID [2022-02-20 19:57:40,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {22323#true} assume true; {22323#true} is VALID [2022-02-20 19:57:40,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22323#true} {22328#(= ~p_dw_st~0 0)} #1330#return; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:40,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {22323#true} havoc ~__retres1~2; {22323#true} is VALID [2022-02-20 19:57:40,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {22323#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {22328#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,269 INFO L290 TraceCheckUtils]: 3: Hoare triple {22328#(= ~p_dw_st~0 0)} assume true; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,269 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22328#(= ~p_dw_st~0 0)} {22328#(= ~p_dw_st~0 0)} #1332#return; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {22323#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {22323#true} is VALID [2022-02-20 19:57:40,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {22323#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {22323#true} is VALID [2022-02-20 19:57:40,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {22323#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {22323#true} is VALID [2022-02-20 19:57:40,270 INFO L290 TraceCheckUtils]: 3: Hoare triple {22323#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; {22323#true} is VALID [2022-02-20 19:57:40,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {22323#true} call update_channels1(); {22363#(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:40,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {22363#(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); {22323#true} is VALID [2022-02-20 19:57:40,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {22323#true} assume true; {22323#true} is VALID [2022-02-20 19:57:40,270 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22323#true} {22323#true} #1324#return; {22323#true} is VALID [2022-02-20 19:57:40,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {22323#true} assume { :begin_inline_init_threads1 } true; {22323#true} is VALID [2022-02-20 19:57:40,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {22323#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {22328#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {22328#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,272 INFO L272 TraceCheckUtils]: 12: Hoare triple {22328#(= ~p_dw_st~0 0)} call fire_delta_events1(); {22364#(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:40,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {22364#(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); {22323#true} is VALID [2022-02-20 19:57:40,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {22323#true} assume !(0 == ~q_write_ev~0); {22323#true} is VALID [2022-02-20 19:57:40,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {22323#true} assume true; {22323#true} is VALID [2022-02-20 19:57:40,272 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22323#true} {22328#(= ~p_dw_st~0 0)} #1326#return; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,273 INFO L272 TraceCheckUtils]: 17: Hoare triple {22328#(= ~p_dw_st~0 0)} call activate_threads1(); {22365#(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:40,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {22365#(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; {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:40,273 INFO L272 TraceCheckUtils]: 19: Hoare triple {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {22323#true} is VALID [2022-02-20 19:57:40,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {22323#true} havoc ~__retres1~0; {22323#true} is VALID [2022-02-20 19:57:40,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {22323#true} assume !(1 == ~p_dw_pc~0); {22323#true} is VALID [2022-02-20 19:57:40,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {22323#true} ~__retres1~0 := 0; {22323#true} is VALID [2022-02-20 19:57:40,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {22323#true} #res := ~__retres1~0; {22323#true} is VALID [2022-02-20 19:57:40,274 INFO L290 TraceCheckUtils]: 24: Hoare triple {22323#true} assume true; {22323#true} is VALID [2022-02-20 19:57:40,274 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22323#true} {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1320#return; {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:40,275 INFO L290 TraceCheckUtils]: 26: Hoare triple {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:40,275 INFO L290 TraceCheckUtils]: 27: Hoare triple {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:40,275 INFO L272 TraceCheckUtils]: 28: Hoare triple {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {22323#true} is VALID [2022-02-20 19:57:40,275 INFO L290 TraceCheckUtils]: 29: Hoare triple {22323#true} havoc ~__retres1~1; {22323#true} is VALID [2022-02-20 19:57:40,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {22323#true} assume !(1 == ~c_dr_pc~0); {22323#true} is VALID [2022-02-20 19:57:40,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {22323#true} ~__retres1~1 := 0; {22323#true} is VALID [2022-02-20 19:57:40,275 INFO L290 TraceCheckUtils]: 32: Hoare triple {22323#true} #res := ~__retres1~1; {22323#true} is VALID [2022-02-20 19:57:40,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {22323#true} assume true; {22323#true} is VALID [2022-02-20 19:57:40,276 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {22323#true} {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #1322#return; {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:40,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:40,277 INFO L290 TraceCheckUtils]: 36: Hoare triple {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:40,277 INFO L290 TraceCheckUtils]: 37: Hoare triple {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:57:40,277 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22366#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {22328#(= ~p_dw_st~0 0)} #1328#return; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,278 INFO L272 TraceCheckUtils]: 39: Hoare triple {22328#(= ~p_dw_st~0 0)} call reset_delta_events1(); {22364#(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:40,278 INFO L290 TraceCheckUtils]: 40: Hoare triple {22364#(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); {22323#true} is VALID [2022-02-20 19:57:40,278 INFO L290 TraceCheckUtils]: 41: Hoare triple {22323#true} assume !(1 == ~q_write_ev~0); {22323#true} is VALID [2022-02-20 19:57:40,278 INFO L290 TraceCheckUtils]: 42: Hoare triple {22323#true} assume true; {22323#true} is VALID [2022-02-20 19:57:40,278 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {22323#true} {22328#(= ~p_dw_st~0 0)} #1330#return; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,278 INFO L290 TraceCheckUtils]: 44: Hoare triple {22328#(= ~p_dw_st~0 0)} assume !false; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,279 INFO L290 TraceCheckUtils]: 45: Hoare triple {22328#(= ~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; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,279 INFO L290 TraceCheckUtils]: 46: Hoare triple {22328#(= ~p_dw_st~0 0)} assume !false; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,279 INFO L272 TraceCheckUtils]: 47: Hoare triple {22328#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {22323#true} is VALID [2022-02-20 19:57:40,279 INFO L290 TraceCheckUtils]: 48: Hoare triple {22323#true} havoc ~__retres1~2; {22323#true} is VALID [2022-02-20 19:57:40,279 INFO L290 TraceCheckUtils]: 49: Hoare triple {22323#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,280 INFO L290 TraceCheckUtils]: 50: Hoare triple {22328#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,280 INFO L290 TraceCheckUtils]: 51: Hoare triple {22328#(= ~p_dw_st~0 0)} assume true; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,280 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {22328#(= ~p_dw_st~0 0)} {22328#(= ~p_dw_st~0 0)} #1332#return; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,281 INFO L290 TraceCheckUtils]: 53: Hoare triple {22328#(= ~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; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,281 INFO L290 TraceCheckUtils]: 54: Hoare triple {22328#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {22328#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:57:40,281 INFO L290 TraceCheckUtils]: 55: Hoare triple {22328#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {22324#false} is VALID [2022-02-20 19:57:40,281 INFO L290 TraceCheckUtils]: 56: Hoare triple {22324#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; {22324#false} is VALID [2022-02-20 19:57:40,281 INFO L290 TraceCheckUtils]: 57: Hoare triple {22324#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; {22324#false} is VALID [2022-02-20 19:57:40,282 INFO L290 TraceCheckUtils]: 58: Hoare triple {22324#false} assume 0 == ~c_dr_pc~0; {22324#false} is VALID [2022-02-20 19:57:40,282 INFO L290 TraceCheckUtils]: 59: Hoare triple {22324#false} assume !false; {22324#false} is VALID [2022-02-20 19:57:40,282 INFO L290 TraceCheckUtils]: 60: Hoare triple {22324#false} assume !(1 == ~q_free~0); {22324#false} is VALID [2022-02-20 19:57:40,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {22324#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; {22324#false} is VALID [2022-02-20 19:57:40,282 INFO L290 TraceCheckUtils]: 62: Hoare triple {22324#false} assume !(~p_last_write~0 == ~c_last_read~0); {22324#false} is VALID [2022-02-20 19:57:40,282 INFO L272 TraceCheckUtils]: 63: Hoare triple {22324#false} call error1(); {22324#false} is VALID [2022-02-20 19:57:40,282 INFO L290 TraceCheckUtils]: 64: Hoare triple {22324#false} assume !false; {22324#false} is VALID [2022-02-20 19:57:40,283 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:40,283 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:40,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661025659] [2022-02-20 19:57:40,283 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661025659] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:40,283 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:40,283 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:40,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898905473] [2022-02-20 19:57:40,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:40,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:40,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:40,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:40,314 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:40,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:40,314 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:40,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:40,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:40,315 INFO L87 Difference]: Start difference. First operand 1476 states and 1961 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:42,499 INFO L93 Difference]: Finished difference Result 3939 states and 5106 transitions. [2022-02-20 19:57:42,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:57:42,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-02-20 19:57:42,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 787 transitions. [2022-02-20 19:57:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 787 transitions. [2022-02-20 19:57:42,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 787 transitions. [2022-02-20 19:57:42,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 787 edges. 787 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:43,180 INFO L225 Difference]: With dead ends: 3939 [2022-02-20 19:57:43,180 INFO L226 Difference]: Without dead ends: 2725 [2022-02-20 19:57:43,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:57:43,185 INFO L933 BasicCegarLoop]: 484 mSDtfsCounter, 1257 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:43,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1284 Valid, 1220 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:43,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2022-02-20 19:57:43,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 2585. [2022-02-20 19:57:43,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:43,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2725 states. Second operand has 2585 states, 2046 states have (on average 1.3064516129032258) internal successors, (2673), 2090 states have internal predecessors, (2673), 267 states have call successors, (267), 215 states have call predecessors, (267), 270 states have return successors, (393), 282 states have call predecessors, (393), 265 states have call successors, (393) [2022-02-20 19:57:43,382 INFO L74 IsIncluded]: Start isIncluded. First operand 2725 states. Second operand has 2585 states, 2046 states have (on average 1.3064516129032258) internal successors, (2673), 2090 states have internal predecessors, (2673), 267 states have call successors, (267), 215 states have call predecessors, (267), 270 states have return successors, (393), 282 states have call predecessors, (393), 265 states have call successors, (393) [2022-02-20 19:57:43,387 INFO L87 Difference]: Start difference. First operand 2725 states. Second operand has 2585 states, 2046 states have (on average 1.3064516129032258) internal successors, (2673), 2090 states have internal predecessors, (2673), 267 states have call successors, (267), 215 states have call predecessors, (267), 270 states have return successors, (393), 282 states have call predecessors, (393), 265 states have call successors, (393) [2022-02-20 19:57:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:43,589 INFO L93 Difference]: Finished difference Result 2725 states and 3487 transitions. [2022-02-20 19:57:43,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2725 states and 3487 transitions. [2022-02-20 19:57:43,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:43,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:43,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 2585 states, 2046 states have (on average 1.3064516129032258) internal successors, (2673), 2090 states have internal predecessors, (2673), 267 states have call successors, (267), 215 states have call predecessors, (267), 270 states have return successors, (393), 282 states have call predecessors, (393), 265 states have call successors, (393) Second operand 2725 states. [2022-02-20 19:57:43,599 INFO L87 Difference]: Start difference. First operand has 2585 states, 2046 states have (on average 1.3064516129032258) internal successors, (2673), 2090 states have internal predecessors, (2673), 267 states have call successors, (267), 215 states have call predecessors, (267), 270 states have return successors, (393), 282 states have call predecessors, (393), 265 states have call successors, (393) Second operand 2725 states. [2022-02-20 19:57:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:43,789 INFO L93 Difference]: Finished difference Result 2725 states and 3487 transitions. [2022-02-20 19:57:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2725 states and 3487 transitions. [2022-02-20 19:57:43,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:43,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:43,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:43,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:43,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2585 states, 2046 states have (on average 1.3064516129032258) internal successors, (2673), 2090 states have internal predecessors, (2673), 267 states have call successors, (267), 215 states have call predecessors, (267), 270 states have return successors, (393), 282 states have call predecessors, (393), 265 states have call successors, (393) [2022-02-20 19:57:44,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 3333 transitions. [2022-02-20 19:57:44,043 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 3333 transitions. Word has length 65 [2022-02-20 19:57:44,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:44,043 INFO L470 AbstractCegarLoop]: Abstraction has 2585 states and 3333 transitions. [2022-02-20 19:57:44,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:57:44,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3333 transitions. [2022-02-20 19:57:44,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:57:44,044 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:44,044 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:44,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:57:44,044 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:44,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:44,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2123328339, now seen corresponding path program 1 times [2022-02-20 19:57:44,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:44,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475794124] [2022-02-20 19:57:44,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:44,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {36644#(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); {36604#true} is VALID [2022-02-20 19:57:44,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {36604#true} assume true; {36604#true} is VALID [2022-02-20 19:57:44,073 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36604#true} {36606#(= ~q_free~0 1)} #1324#return; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {36645#(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); {36604#true} is VALID [2022-02-20 19:57:44,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {36604#true} assume !(0 == ~q_write_ev~0); {36604#true} is VALID [2022-02-20 19:57:44,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {36604#true} assume true; {36604#true} is VALID [2022-02-20 19:57:44,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36604#true} {36606#(= ~q_free~0 1)} #1326#return; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {36604#true} havoc ~__retres1~0; {36604#true} is VALID [2022-02-20 19:57:44,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {36604#true} assume !(1 == ~p_dw_pc~0); {36604#true} is VALID [2022-02-20 19:57:44,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {36604#true} ~__retres1~0 := 0; {36604#true} is VALID [2022-02-20 19:57:44,089 INFO L290 TraceCheckUtils]: 3: Hoare triple {36604#true} #res := ~__retres1~0; {36604#true} is VALID [2022-02-20 19:57:44,089 INFO L290 TraceCheckUtils]: 4: Hoare triple {36604#true} assume true; {36604#true} is VALID [2022-02-20 19:57:44,089 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {36604#true} {36604#true} #1320#return; {36604#true} is VALID [2022-02-20 19:57:44,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {36604#true} havoc ~__retres1~1; {36604#true} is VALID [2022-02-20 19:57:44,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {36604#true} assume !(1 == ~c_dr_pc~0); {36604#true} is VALID [2022-02-20 19:57:44,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {36604#true} ~__retres1~1 := 0; {36604#true} is VALID [2022-02-20 19:57:44,091 INFO L290 TraceCheckUtils]: 3: Hoare triple {36604#true} #res := ~__retres1~1; {36604#true} is VALID [2022-02-20 19:57:44,091 INFO L290 TraceCheckUtils]: 4: Hoare triple {36604#true} assume true; {36604#true} is VALID [2022-02-20 19:57:44,091 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {36604#true} {36604#true} #1322#return; {36604#true} is VALID [2022-02-20 19:57:44,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {36646#(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; {36604#true} is VALID [2022-02-20 19:57:44,092 INFO L272 TraceCheckUtils]: 1: Hoare triple {36604#true} call #t~ret8 := is_do_write_p_triggered(); {36604#true} is VALID [2022-02-20 19:57:44,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {36604#true} havoc ~__retres1~0; {36604#true} is VALID [2022-02-20 19:57:44,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {36604#true} assume !(1 == ~p_dw_pc~0); {36604#true} is VALID [2022-02-20 19:57:44,092 INFO L290 TraceCheckUtils]: 4: Hoare triple {36604#true} ~__retres1~0 := 0; {36604#true} is VALID [2022-02-20 19:57:44,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {36604#true} #res := ~__retres1~0; {36604#true} is VALID [2022-02-20 19:57:44,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {36604#true} assume true; {36604#true} is VALID [2022-02-20 19:57:44,092 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {36604#true} {36604#true} #1320#return; {36604#true} is VALID [2022-02-20 19:57:44,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {36604#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {36604#true} is VALID [2022-02-20 19:57:44,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {36604#true} assume !(0 != ~tmp~1); {36604#true} is VALID [2022-02-20 19:57:44,093 INFO L272 TraceCheckUtils]: 10: Hoare triple {36604#true} call #t~ret9 := is_do_read_c_triggered(); {36604#true} is VALID [2022-02-20 19:57:44,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {36604#true} havoc ~__retres1~1; {36604#true} is VALID [2022-02-20 19:57:44,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {36604#true} assume !(1 == ~c_dr_pc~0); {36604#true} is VALID [2022-02-20 19:57:44,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {36604#true} ~__retres1~1 := 0; {36604#true} is VALID [2022-02-20 19:57:44,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {36604#true} #res := ~__retres1~1; {36604#true} is VALID [2022-02-20 19:57:44,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {36604#true} assume true; {36604#true} is VALID [2022-02-20 19:57:44,093 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36604#true} {36604#true} #1322#return; {36604#true} is VALID [2022-02-20 19:57:44,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {36604#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {36604#true} is VALID [2022-02-20 19:57:44,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {36604#true} assume !(0 != ~tmp___0~1); {36604#true} is VALID [2022-02-20 19:57:44,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {36604#true} assume true; {36604#true} is VALID [2022-02-20 19:57:44,094 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {36604#true} {36606#(= ~q_free~0 1)} #1328#return; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {36645#(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); {36604#true} is VALID [2022-02-20 19:57:44,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {36604#true} assume !(1 == ~q_write_ev~0); {36604#true} is VALID [2022-02-20 19:57:44,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {36604#true} assume true; {36604#true} is VALID [2022-02-20 19:57:44,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36604#true} {36606#(= ~q_free~0 1)} #1330#return; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:44,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {36604#true} havoc ~__retres1~2; {36604#true} is VALID [2022-02-20 19:57:44,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {36604#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {36604#true} is VALID [2022-02-20 19:57:44,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {36604#true} #res := ~__retres1~2; {36604#true} is VALID [2022-02-20 19:57:44,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {36604#true} assume true; {36604#true} is VALID [2022-02-20 19:57:44,100 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {36604#true} {36606#(= ~q_free~0 1)} #1332#return; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {36604#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {36604#true} is VALID [2022-02-20 19:57:44,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {36604#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {36604#true} is VALID [2022-02-20 19:57:44,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {36604#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,101 INFO L290 TraceCheckUtils]: 3: Hoare triple {36606#(= ~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; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {36606#(= ~q_free~0 1)} call update_channels1(); {36644#(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,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {36644#(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); {36604#true} is VALID [2022-02-20 19:57:44,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {36604#true} assume true; {36604#true} is VALID [2022-02-20 19:57:44,102 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {36604#true} {36606#(= ~q_free~0 1)} #1324#return; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {36606#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {36606#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {36606#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {36606#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,103 INFO L272 TraceCheckUtils]: 12: Hoare triple {36606#(= ~q_free~0 1)} call fire_delta_events1(); {36645#(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,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {36645#(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); {36604#true} is VALID [2022-02-20 19:57:44,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {36604#true} assume !(0 == ~q_write_ev~0); {36604#true} is VALID [2022-02-20 19:57:44,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {36604#true} assume true; {36604#true} is VALID [2022-02-20 19:57:44,104 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36604#true} {36606#(= ~q_free~0 1)} #1326#return; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,104 INFO L272 TraceCheckUtils]: 17: Hoare triple {36606#(= ~q_free~0 1)} call activate_threads1(); {36646#(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,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {36646#(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; {36604#true} is VALID [2022-02-20 19:57:44,105 INFO L272 TraceCheckUtils]: 19: Hoare triple {36604#true} call #t~ret8 := is_do_write_p_triggered(); {36604#true} is VALID [2022-02-20 19:57:44,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {36604#true} havoc ~__retres1~0; {36604#true} is VALID [2022-02-20 19:57:44,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {36604#true} assume !(1 == ~p_dw_pc~0); {36604#true} is VALID [2022-02-20 19:57:44,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {36604#true} ~__retres1~0 := 0; {36604#true} is VALID [2022-02-20 19:57:44,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {36604#true} #res := ~__retres1~0; {36604#true} is VALID [2022-02-20 19:57:44,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {36604#true} assume true; {36604#true} is VALID [2022-02-20 19:57:44,105 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {36604#true} {36604#true} #1320#return; {36604#true} is VALID [2022-02-20 19:57:44,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {36604#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {36604#true} is VALID [2022-02-20 19:57:44,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {36604#true} assume !(0 != ~tmp~1); {36604#true} is VALID [2022-02-20 19:57:44,106 INFO L272 TraceCheckUtils]: 28: Hoare triple {36604#true} call #t~ret9 := is_do_read_c_triggered(); {36604#true} is VALID [2022-02-20 19:57:44,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {36604#true} havoc ~__retres1~1; {36604#true} is VALID [2022-02-20 19:57:44,106 INFO L290 TraceCheckUtils]: 30: Hoare triple {36604#true} assume !(1 == ~c_dr_pc~0); {36604#true} is VALID [2022-02-20 19:57:44,106 INFO L290 TraceCheckUtils]: 31: Hoare triple {36604#true} ~__retres1~1 := 0; {36604#true} is VALID [2022-02-20 19:57:44,106 INFO L290 TraceCheckUtils]: 32: Hoare triple {36604#true} #res := ~__retres1~1; {36604#true} is VALID [2022-02-20 19:57:44,106 INFO L290 TraceCheckUtils]: 33: Hoare triple {36604#true} assume true; {36604#true} is VALID [2022-02-20 19:57:44,106 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {36604#true} {36604#true} #1322#return; {36604#true} is VALID [2022-02-20 19:57:44,107 INFO L290 TraceCheckUtils]: 35: Hoare triple {36604#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {36604#true} is VALID [2022-02-20 19:57:44,107 INFO L290 TraceCheckUtils]: 36: Hoare triple {36604#true} assume !(0 != ~tmp___0~1); {36604#true} is VALID [2022-02-20 19:57:44,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {36604#true} assume true; {36604#true} is VALID [2022-02-20 19:57:44,107 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {36604#true} {36606#(= ~q_free~0 1)} #1328#return; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,108 INFO L272 TraceCheckUtils]: 39: Hoare triple {36606#(= ~q_free~0 1)} call reset_delta_events1(); {36645#(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,108 INFO L290 TraceCheckUtils]: 40: Hoare triple {36645#(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); {36604#true} is VALID [2022-02-20 19:57:44,108 INFO L290 TraceCheckUtils]: 41: Hoare triple {36604#true} assume !(1 == ~q_write_ev~0); {36604#true} is VALID [2022-02-20 19:57:44,108 INFO L290 TraceCheckUtils]: 42: Hoare triple {36604#true} assume true; {36604#true} is VALID [2022-02-20 19:57:44,108 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {36604#true} {36606#(= ~q_free~0 1)} #1330#return; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,108 INFO L290 TraceCheckUtils]: 44: Hoare triple {36606#(= ~q_free~0 1)} assume !false; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,109 INFO L290 TraceCheckUtils]: 45: Hoare triple {36606#(= ~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; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,109 INFO L290 TraceCheckUtils]: 46: Hoare triple {36606#(= ~q_free~0 1)} assume !false; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,109 INFO L272 TraceCheckUtils]: 47: Hoare triple {36606#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {36604#true} is VALID [2022-02-20 19:57:44,109 INFO L290 TraceCheckUtils]: 48: Hoare triple {36604#true} havoc ~__retres1~2; {36604#true} is VALID [2022-02-20 19:57:44,109 INFO L290 TraceCheckUtils]: 49: Hoare triple {36604#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {36604#true} is VALID [2022-02-20 19:57:44,109 INFO L290 TraceCheckUtils]: 50: Hoare triple {36604#true} #res := ~__retres1~2; {36604#true} is VALID [2022-02-20 19:57:44,110 INFO L290 TraceCheckUtils]: 51: Hoare triple {36604#true} assume true; {36604#true} is VALID [2022-02-20 19:57:44,110 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {36604#true} {36606#(= ~q_free~0 1)} #1332#return; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,110 INFO L290 TraceCheckUtils]: 53: Hoare triple {36606#(= ~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; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,110 INFO L290 TraceCheckUtils]: 54: Hoare triple {36606#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,111 INFO L290 TraceCheckUtils]: 55: Hoare triple {36606#(= ~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; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,111 INFO L290 TraceCheckUtils]: 56: Hoare triple {36606#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,111 INFO L290 TraceCheckUtils]: 57: Hoare triple {36606#(= ~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; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,112 INFO L290 TraceCheckUtils]: 58: Hoare triple {36606#(= ~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; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,112 INFO L290 TraceCheckUtils]: 59: Hoare triple {36606#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,112 INFO L290 TraceCheckUtils]: 60: Hoare triple {36606#(= ~q_free~0 1)} assume !false; {36606#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:44,112 INFO L290 TraceCheckUtils]: 61: Hoare triple {36606#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {36605#false} is VALID [2022-02-20 19:57:44,112 INFO L290 TraceCheckUtils]: 62: Hoare triple {36605#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; {36605#false} is VALID [2022-02-20 19:57:44,113 INFO L290 TraceCheckUtils]: 63: Hoare triple {36605#false} assume !(~p_last_write~0 == ~c_last_read~0); {36605#false} is VALID [2022-02-20 19:57:44,113 INFO L272 TraceCheckUtils]: 64: Hoare triple {36605#false} call error1(); {36605#false} is VALID [2022-02-20 19:57:44,113 INFO L290 TraceCheckUtils]: 65: Hoare triple {36605#false} assume !false; {36605#false} is VALID [2022-02-20 19:57:44,113 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,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:44,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475794124] [2022-02-20 19:57:44,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475794124] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:44,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:44,114 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:44,114 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273402757] [2022-02-20 19:57:44,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:44,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:57:44,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:44,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:44,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:44,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:44,151 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:44,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:44,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:44,151 INFO L87 Difference]: Start difference. First operand 2585 states and 3333 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:46,905 INFO L93 Difference]: Finished difference Result 5877 states and 7495 transitions. [2022-02-20 19:57:46,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:57:46,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-02-20 19:57:46,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 786 transitions. [2022-02-20 19:57:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 786 transitions. [2022-02-20 19:57:46,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 786 transitions. [2022-02-20 19:57:47,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 786 edges. 786 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:47,966 INFO L225 Difference]: With dead ends: 5877 [2022-02-20 19:57:47,966 INFO L226 Difference]: Without dead ends: 3554 [2022-02-20 19:57:47,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:57:47,970 INFO L933 BasicCegarLoop]: 514 mSDtfsCounter, 874 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:47,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [883 Valid, 1213 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:47,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2022-02-20 19:57:48,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3270. [2022-02-20 19:57:48,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:48,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3554 states. Second operand has 3270 states, 2578 states have (on average 1.2936384794414275) internal successors, (3335), 2628 states have internal predecessors, (3335), 341 states have call successors, (341), 279 states have call predecessors, (341), 349 states have return successors, (485), 365 states have call predecessors, (485), 339 states have call successors, (485) [2022-02-20 19:57:48,137 INFO L74 IsIncluded]: Start isIncluded. First operand 3554 states. Second operand has 3270 states, 2578 states have (on average 1.2936384794414275) internal successors, (3335), 2628 states have internal predecessors, (3335), 341 states have call successors, (341), 279 states have call predecessors, (341), 349 states have return successors, (485), 365 states have call predecessors, (485), 339 states have call successors, (485) [2022-02-20 19:57:48,139 INFO L87 Difference]: Start difference. First operand 3554 states. Second operand has 3270 states, 2578 states have (on average 1.2936384794414275) internal successors, (3335), 2628 states have internal predecessors, (3335), 341 states have call successors, (341), 279 states have call predecessors, (341), 349 states have return successors, (485), 365 states have call predecessors, (485), 339 states have call successors, (485) [2022-02-20 19:57:48,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:48,506 INFO L93 Difference]: Finished difference Result 3554 states and 4495 transitions. [2022-02-20 19:57:48,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3554 states and 4495 transitions. [2022-02-20 19:57:48,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:48,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:48,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 3270 states, 2578 states have (on average 1.2936384794414275) internal successors, (3335), 2628 states have internal predecessors, (3335), 341 states have call successors, (341), 279 states have call predecessors, (341), 349 states have return successors, (485), 365 states have call predecessors, (485), 339 states have call successors, (485) Second operand 3554 states. [2022-02-20 19:57:48,518 INFO L87 Difference]: Start difference. First operand has 3270 states, 2578 states have (on average 1.2936384794414275) internal successors, (3335), 2628 states have internal predecessors, (3335), 341 states have call successors, (341), 279 states have call predecessors, (341), 349 states have return successors, (485), 365 states have call predecessors, (485), 339 states have call successors, (485) Second operand 3554 states. [2022-02-20 19:57:48,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:48,892 INFO L93 Difference]: Finished difference Result 3554 states and 4495 transitions. [2022-02-20 19:57:48,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3554 states and 4495 transitions. [2022-02-20 19:57:48,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:48,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:48,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:48,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3270 states, 2578 states have (on average 1.2936384794414275) internal successors, (3335), 2628 states have internal predecessors, (3335), 341 states have call successors, (341), 279 states have call predecessors, (341), 349 states have return successors, (485), 365 states have call predecessors, (485), 339 states have call successors, (485) [2022-02-20 19:57:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 4161 transitions. [2022-02-20 19:57:49,369 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 4161 transitions. Word has length 66 [2022-02-20 19:57:49,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:49,369 INFO L470 AbstractCegarLoop]: Abstraction has 3270 states and 4161 transitions. [2022-02-20 19:57:49,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:49,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 4161 transitions. [2022-02-20 19:57:49,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:57:49,370 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:49,370 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:49,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:57:49,371 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:49,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:49,371 INFO L85 PathProgramCache]: Analyzing trace with hash 534392178, now seen corresponding path program 1 times [2022-02-20 19:57:49,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:49,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859102715] [2022-02-20 19:57:49,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:49,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:49,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:49,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {56087#(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); {56047#true} is VALID [2022-02-20 19:57:49,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {56047#true} assume true; {56047#true} is VALID [2022-02-20 19:57:49,400 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56047#true} {56049#(= ~p_dw_pc~0 0)} #1324#return; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:49,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {56088#(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); {56047#true} is VALID [2022-02-20 19:57:49,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {56047#true} assume !(0 == ~q_write_ev~0); {56047#true} is VALID [2022-02-20 19:57:49,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {56047#true} assume true; {56047#true} is VALID [2022-02-20 19:57:49,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56047#true} {56049#(= ~p_dw_pc~0 0)} #1326#return; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:49,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:49,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {56047#true} havoc ~__retres1~0; {56047#true} is VALID [2022-02-20 19:57:49,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {56047#true} assume !(1 == ~p_dw_pc~0); {56047#true} is VALID [2022-02-20 19:57:49,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {56047#true} ~__retres1~0 := 0; {56047#true} is VALID [2022-02-20 19:57:49,417 INFO L290 TraceCheckUtils]: 3: Hoare triple {56047#true} #res := ~__retres1~0; {56047#true} is VALID [2022-02-20 19:57:49,417 INFO L290 TraceCheckUtils]: 4: Hoare triple {56047#true} assume true; {56047#true} is VALID [2022-02-20 19:57:49,417 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {56047#true} {56047#true} #1320#return; {56047#true} is VALID [2022-02-20 19:57:49,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:49,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {56047#true} havoc ~__retres1~1; {56047#true} is VALID [2022-02-20 19:57:49,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {56047#true} assume !(1 == ~c_dr_pc~0); {56047#true} is VALID [2022-02-20 19:57:49,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {56047#true} ~__retres1~1 := 0; {56047#true} is VALID [2022-02-20 19:57:49,419 INFO L290 TraceCheckUtils]: 3: Hoare triple {56047#true} #res := ~__retres1~1; {56047#true} is VALID [2022-02-20 19:57:49,419 INFO L290 TraceCheckUtils]: 4: Hoare triple {56047#true} assume true; {56047#true} is VALID [2022-02-20 19:57:49,419 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {56047#true} {56047#true} #1322#return; {56047#true} is VALID [2022-02-20 19:57:49,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {56089#(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; {56047#true} is VALID [2022-02-20 19:57:49,420 INFO L272 TraceCheckUtils]: 1: Hoare triple {56047#true} call #t~ret8 := is_do_write_p_triggered(); {56047#true} is VALID [2022-02-20 19:57:49,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {56047#true} havoc ~__retres1~0; {56047#true} is VALID [2022-02-20 19:57:49,420 INFO L290 TraceCheckUtils]: 3: Hoare triple {56047#true} assume !(1 == ~p_dw_pc~0); {56047#true} is VALID [2022-02-20 19:57:49,420 INFO L290 TraceCheckUtils]: 4: Hoare triple {56047#true} ~__retres1~0 := 0; {56047#true} is VALID [2022-02-20 19:57:49,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {56047#true} #res := ~__retres1~0; {56047#true} is VALID [2022-02-20 19:57:49,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {56047#true} assume true; {56047#true} is VALID [2022-02-20 19:57:49,420 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {56047#true} {56047#true} #1320#return; {56047#true} is VALID [2022-02-20 19:57:49,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {56047#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {56047#true} is VALID [2022-02-20 19:57:49,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {56047#true} assume !(0 != ~tmp~1); {56047#true} is VALID [2022-02-20 19:57:49,421 INFO L272 TraceCheckUtils]: 10: Hoare triple {56047#true} call #t~ret9 := is_do_read_c_triggered(); {56047#true} is VALID [2022-02-20 19:57:49,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {56047#true} havoc ~__retres1~1; {56047#true} is VALID [2022-02-20 19:57:49,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {56047#true} assume !(1 == ~c_dr_pc~0); {56047#true} is VALID [2022-02-20 19:57:49,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {56047#true} ~__retres1~1 := 0; {56047#true} is VALID [2022-02-20 19:57:49,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {56047#true} #res := ~__retres1~1; {56047#true} is VALID [2022-02-20 19:57:49,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {56047#true} assume true; {56047#true} is VALID [2022-02-20 19:57:49,421 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {56047#true} {56047#true} #1322#return; {56047#true} is VALID [2022-02-20 19:57:49,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {56047#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {56047#true} is VALID [2022-02-20 19:57:49,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {56047#true} assume !(0 != ~tmp___0~1); {56047#true} is VALID [2022-02-20 19:57:49,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {56047#true} assume true; {56047#true} is VALID [2022-02-20 19:57:49,422 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {56047#true} {56049#(= ~p_dw_pc~0 0)} #1328#return; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:49,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {56088#(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); {56047#true} is VALID [2022-02-20 19:57:49,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {56047#true} assume !(1 == ~q_write_ev~0); {56047#true} is VALID [2022-02-20 19:57:49,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {56047#true} assume true; {56047#true} is VALID [2022-02-20 19:57:49,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56047#true} {56049#(= ~p_dw_pc~0 0)} #1330#return; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:49,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {56047#true} havoc ~__retres1~2; {56047#true} is VALID [2022-02-20 19:57:49,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {56047#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {56047#true} is VALID [2022-02-20 19:57:49,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {56047#true} #res := ~__retres1~2; {56047#true} is VALID [2022-02-20 19:57:49,428 INFO L290 TraceCheckUtils]: 3: Hoare triple {56047#true} assume true; {56047#true} is VALID [2022-02-20 19:57:49,429 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {56047#true} {56049#(= ~p_dw_pc~0 0)} #1332#return; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {56047#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {56047#true} is VALID [2022-02-20 19:57:49,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {56047#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {56047#true} is VALID [2022-02-20 19:57:49,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {56047#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {56049#(= ~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; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {56049#(= ~p_dw_pc~0 0)} call update_channels1(); {56087#(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:49,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {56087#(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); {56047#true} is VALID [2022-02-20 19:57:49,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {56047#true} assume true; {56047#true} is VALID [2022-02-20 19:57:49,430 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {56047#true} {56049#(= ~p_dw_pc~0 0)} #1324#return; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {56049#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {56049#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {56049#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {56049#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,432 INFO L272 TraceCheckUtils]: 12: Hoare triple {56049#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {56088#(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:49,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {56088#(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); {56047#true} is VALID [2022-02-20 19:57:49,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {56047#true} assume !(0 == ~q_write_ev~0); {56047#true} is VALID [2022-02-20 19:57:49,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {56047#true} assume true; {56047#true} is VALID [2022-02-20 19:57:49,433 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {56047#true} {56049#(= ~p_dw_pc~0 0)} #1326#return; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,433 INFO L272 TraceCheckUtils]: 17: Hoare triple {56049#(= ~p_dw_pc~0 0)} call activate_threads1(); {56089#(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:49,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {56089#(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; {56047#true} is VALID [2022-02-20 19:57:49,433 INFO L272 TraceCheckUtils]: 19: Hoare triple {56047#true} call #t~ret8 := is_do_write_p_triggered(); {56047#true} is VALID [2022-02-20 19:57:49,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {56047#true} havoc ~__retres1~0; {56047#true} is VALID [2022-02-20 19:57:49,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {56047#true} assume !(1 == ~p_dw_pc~0); {56047#true} is VALID [2022-02-20 19:57:49,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {56047#true} ~__retres1~0 := 0; {56047#true} is VALID [2022-02-20 19:57:49,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {56047#true} #res := ~__retres1~0; {56047#true} is VALID [2022-02-20 19:57:49,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {56047#true} assume true; {56047#true} is VALID [2022-02-20 19:57:49,434 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {56047#true} {56047#true} #1320#return; {56047#true} is VALID [2022-02-20 19:57:49,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {56047#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {56047#true} is VALID [2022-02-20 19:57:49,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {56047#true} assume !(0 != ~tmp~1); {56047#true} is VALID [2022-02-20 19:57:49,434 INFO L272 TraceCheckUtils]: 28: Hoare triple {56047#true} call #t~ret9 := is_do_read_c_triggered(); {56047#true} is VALID [2022-02-20 19:57:49,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {56047#true} havoc ~__retres1~1; {56047#true} is VALID [2022-02-20 19:57:49,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {56047#true} assume !(1 == ~c_dr_pc~0); {56047#true} is VALID [2022-02-20 19:57:49,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {56047#true} ~__retres1~1 := 0; {56047#true} is VALID [2022-02-20 19:57:49,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {56047#true} #res := ~__retres1~1; {56047#true} is VALID [2022-02-20 19:57:49,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {56047#true} assume true; {56047#true} is VALID [2022-02-20 19:57:49,435 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {56047#true} {56047#true} #1322#return; {56047#true} is VALID [2022-02-20 19:57:49,435 INFO L290 TraceCheckUtils]: 35: Hoare triple {56047#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {56047#true} is VALID [2022-02-20 19:57:49,435 INFO L290 TraceCheckUtils]: 36: Hoare triple {56047#true} assume !(0 != ~tmp___0~1); {56047#true} is VALID [2022-02-20 19:57:49,435 INFO L290 TraceCheckUtils]: 37: Hoare triple {56047#true} assume true; {56047#true} is VALID [2022-02-20 19:57:49,436 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {56047#true} {56049#(= ~p_dw_pc~0 0)} #1328#return; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,436 INFO L272 TraceCheckUtils]: 39: Hoare triple {56049#(= ~p_dw_pc~0 0)} call reset_delta_events1(); {56088#(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:49,436 INFO L290 TraceCheckUtils]: 40: Hoare triple {56088#(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); {56047#true} is VALID [2022-02-20 19:57:49,436 INFO L290 TraceCheckUtils]: 41: Hoare triple {56047#true} assume !(1 == ~q_write_ev~0); {56047#true} is VALID [2022-02-20 19:57:49,436 INFO L290 TraceCheckUtils]: 42: Hoare triple {56047#true} assume true; {56047#true} is VALID [2022-02-20 19:57:49,437 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {56047#true} {56049#(= ~p_dw_pc~0 0)} #1330#return; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,437 INFO L290 TraceCheckUtils]: 44: Hoare triple {56049#(= ~p_dw_pc~0 0)} assume !false; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,437 INFO L290 TraceCheckUtils]: 45: Hoare triple {56049#(= ~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; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,438 INFO L290 TraceCheckUtils]: 46: Hoare triple {56049#(= ~p_dw_pc~0 0)} assume !false; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,438 INFO L272 TraceCheckUtils]: 47: Hoare triple {56049#(= ~p_dw_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {56047#true} is VALID [2022-02-20 19:57:49,438 INFO L290 TraceCheckUtils]: 48: Hoare triple {56047#true} havoc ~__retres1~2; {56047#true} is VALID [2022-02-20 19:57:49,438 INFO L290 TraceCheckUtils]: 49: Hoare triple {56047#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {56047#true} is VALID [2022-02-20 19:57:49,438 INFO L290 TraceCheckUtils]: 50: Hoare triple {56047#true} #res := ~__retres1~2; {56047#true} is VALID [2022-02-20 19:57:49,438 INFO L290 TraceCheckUtils]: 51: Hoare triple {56047#true} assume true; {56047#true} is VALID [2022-02-20 19:57:49,439 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {56047#true} {56049#(= ~p_dw_pc~0 0)} #1332#return; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,439 INFO L290 TraceCheckUtils]: 53: Hoare triple {56049#(= ~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; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,439 INFO L290 TraceCheckUtils]: 54: Hoare triple {56049#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,439 INFO L290 TraceCheckUtils]: 55: Hoare triple {56049#(= ~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; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,440 INFO L290 TraceCheckUtils]: 56: Hoare triple {56049#(= ~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; {56049#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:49,440 INFO L290 TraceCheckUtils]: 57: Hoare triple {56049#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {56048#false} is VALID [2022-02-20 19:57:49,440 INFO L290 TraceCheckUtils]: 58: Hoare triple {56048#false} assume 1 == ~p_dw_pc~0; {56048#false} is VALID [2022-02-20 19:57:49,440 INFO L290 TraceCheckUtils]: 59: Hoare triple {56048#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; {56048#false} is VALID [2022-02-20 19:57:49,440 INFO L290 TraceCheckUtils]: 60: Hoare triple {56048#false} assume !false; {56048#false} is VALID [2022-02-20 19:57:49,441 INFO L290 TraceCheckUtils]: 61: Hoare triple {56048#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {56048#false} is VALID [2022-02-20 19:57:49,441 INFO L290 TraceCheckUtils]: 62: Hoare triple {56048#false} assume { :end_inline_do_write_p } true; {56048#false} is VALID [2022-02-20 19:57:49,441 INFO L290 TraceCheckUtils]: 63: Hoare triple {56048#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; {56048#false} is VALID [2022-02-20 19:57:49,441 INFO L290 TraceCheckUtils]: 64: Hoare triple {56048#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; {56048#false} is VALID [2022-02-20 19:57:49,441 INFO L290 TraceCheckUtils]: 65: Hoare triple {56048#false} assume 0 == ~c_dr_pc~0; {56048#false} is VALID [2022-02-20 19:57:49,441 INFO L290 TraceCheckUtils]: 66: Hoare triple {56048#false} assume !false; {56048#false} is VALID [2022-02-20 19:57:49,441 INFO L290 TraceCheckUtils]: 67: Hoare triple {56048#false} assume !(1 == ~q_free~0); {56048#false} is VALID [2022-02-20 19:57:49,441 INFO L290 TraceCheckUtils]: 68: Hoare triple {56048#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; {56048#false} is VALID [2022-02-20 19:57:49,441 INFO L290 TraceCheckUtils]: 69: Hoare triple {56048#false} assume !(~p_last_write~0 == ~c_last_read~0); {56048#false} is VALID [2022-02-20 19:57:49,442 INFO L272 TraceCheckUtils]: 70: Hoare triple {56048#false} call error1(); {56048#false} is VALID [2022-02-20 19:57:49,442 INFO L290 TraceCheckUtils]: 71: Hoare triple {56048#false} assume !false; {56048#false} is VALID [2022-02-20 19:57:49,442 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:49,442 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:49,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859102715] [2022-02-20 19:57:49,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859102715] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:49,442 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:49,443 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:49,443 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193212237] [2022-02-20 19:57:49,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:49,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:57:49,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:49,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:49,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:49,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:49,485 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:49,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:49,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:49,486 INFO L87 Difference]: Start difference. First operand 3270 states and 4161 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:52,763 INFO L93 Difference]: Finished difference Result 6825 states and 8577 transitions. [2022-02-20 19:57:52,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:57:52,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-02-20 19:57:52,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 779 transitions. [2022-02-20 19:57:52,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 779 transitions. [2022-02-20 19:57:52,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 779 transitions. [2022-02-20 19:57:53,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 779 edges. 779 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:53,953 INFO L225 Difference]: With dead ends: 6825 [2022-02-20 19:57:53,953 INFO L226 Difference]: Without dead ends: 3816 [2022-02-20 19:57:53,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:57:53,957 INFO L933 BasicCegarLoop]: 528 mSDtfsCounter, 1210 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:53,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1239 Valid, 1053 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:57:53,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3816 states. [2022-02-20 19:57:54,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3816 to 3553. [2022-02-20 19:57:54,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:54,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3816 states. Second operand has 3553 states, 2803 states have (on average 1.2854084909026045) internal successors, (3603), 2856 states have internal predecessors, (3603), 369 states have call successors, (369), 304 states have call predecessors, (369), 379 states have return successors, (519), 395 states have call predecessors, (519), 367 states have call successors, (519) [2022-02-20 19:57:54,144 INFO L74 IsIncluded]: Start isIncluded. First operand 3816 states. Second operand has 3553 states, 2803 states have (on average 1.2854084909026045) internal successors, (3603), 2856 states have internal predecessors, (3603), 369 states have call successors, (369), 304 states have call predecessors, (369), 379 states have return successors, (519), 395 states have call predecessors, (519), 367 states have call successors, (519) [2022-02-20 19:57:54,146 INFO L87 Difference]: Start difference. First operand 3816 states. Second operand has 3553 states, 2803 states have (on average 1.2854084909026045) internal successors, (3603), 2856 states have internal predecessors, (3603), 369 states have call successors, (369), 304 states have call predecessors, (369), 379 states have return successors, (519), 395 states have call predecessors, (519), 367 states have call successors, (519) [2022-02-20 19:57:54,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:54,585 INFO L93 Difference]: Finished difference Result 3816 states and 4798 transitions. [2022-02-20 19:57:54,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3816 states and 4798 transitions. [2022-02-20 19:57:54,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:54,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:54,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 3553 states, 2803 states have (on average 1.2854084909026045) internal successors, (3603), 2856 states have internal predecessors, (3603), 369 states have call successors, (369), 304 states have call predecessors, (369), 379 states have return successors, (519), 395 states have call predecessors, (519), 367 states have call successors, (519) Second operand 3816 states. [2022-02-20 19:57:54,598 INFO L87 Difference]: Start difference. First operand has 3553 states, 2803 states have (on average 1.2854084909026045) internal successors, (3603), 2856 states have internal predecessors, (3603), 369 states have call successors, (369), 304 states have call predecessors, (369), 379 states have return successors, (519), 395 states have call predecessors, (519), 367 states have call successors, (519) Second operand 3816 states. [2022-02-20 19:57:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:55,046 INFO L93 Difference]: Finished difference Result 3816 states and 4798 transitions. [2022-02-20 19:57:55,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3816 states and 4798 transitions. [2022-02-20 19:57:55,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:55,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:55,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:55,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:55,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3553 states, 2803 states have (on average 1.2854084909026045) internal successors, (3603), 2856 states have internal predecessors, (3603), 369 states have call successors, (369), 304 states have call predecessors, (369), 379 states have return successors, (519), 395 states have call predecessors, (519), 367 states have call successors, (519) [2022-02-20 19:57:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3553 states to 3553 states and 4491 transitions. [2022-02-20 19:57:55,639 INFO L78 Accepts]: Start accepts. Automaton has 3553 states and 4491 transitions. Word has length 72 [2022-02-20 19:57:55,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:55,639 INFO L470 AbstractCegarLoop]: Abstraction has 3553 states and 4491 transitions. [2022-02-20 19:57:55,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 19:57:55,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3553 states and 4491 transitions. [2022-02-20 19:57:55,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:57:55,640 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:55,641 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:55,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:57:55,641 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:55,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:55,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1130274590, now seen corresponding path program 1 times [2022-02-20 19:57:55,641 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:55,642 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207658545] [2022-02-20 19:57:55,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:55,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {77715#(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); {77674#true} is VALID [2022-02-20 19:57:55,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {77674#true} assume true; {77674#true} is VALID [2022-02-20 19:57:55,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {77674#true} {77674#true} #1324#return; {77674#true} is VALID [2022-02-20 19:57:55,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {77716#(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); {77674#true} is VALID [2022-02-20 19:57:55,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {77674#true} assume !(0 == ~q_write_ev~0); {77674#true} is VALID [2022-02-20 19:57:55,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {77674#true} assume true; {77674#true} is VALID [2022-02-20 19:57:55,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77674#true} {77674#true} #1326#return; {77674#true} is VALID [2022-02-20 19:57:55,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {77674#true} havoc ~__retres1~0; {77674#true} is VALID [2022-02-20 19:57:55,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {77674#true} assume !(1 == ~p_dw_pc~0); {77674#true} is VALID [2022-02-20 19:57:55,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {77674#true} ~__retres1~0 := 0; {77674#true} is VALID [2022-02-20 19:57:55,694 INFO L290 TraceCheckUtils]: 3: Hoare triple {77674#true} #res := ~__retres1~0; {77674#true} is VALID [2022-02-20 19:57:55,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {77674#true} assume true; {77674#true} is VALID [2022-02-20 19:57:55,706 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {77674#true} {77674#true} #1320#return; {77674#true} is VALID [2022-02-20 19:57:55,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {77674#true} havoc ~__retres1~1; {77674#true} is VALID [2022-02-20 19:57:55,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {77674#true} assume !(1 == ~c_dr_pc~0); {77674#true} is VALID [2022-02-20 19:57:55,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {77674#true} ~__retres1~1 := 0; {77674#true} is VALID [2022-02-20 19:57:55,709 INFO L290 TraceCheckUtils]: 3: Hoare triple {77674#true} #res := ~__retres1~1; {77674#true} is VALID [2022-02-20 19:57:55,709 INFO L290 TraceCheckUtils]: 4: Hoare triple {77674#true} assume true; {77674#true} is VALID [2022-02-20 19:57:55,709 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {77674#true} {77674#true} #1322#return; {77674#true} is VALID [2022-02-20 19:57:55,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {77717#(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; {77674#true} is VALID [2022-02-20 19:57:55,709 INFO L272 TraceCheckUtils]: 1: Hoare triple {77674#true} call #t~ret8 := is_do_write_p_triggered(); {77674#true} is VALID [2022-02-20 19:57:55,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {77674#true} havoc ~__retres1~0; {77674#true} is VALID [2022-02-20 19:57:55,710 INFO L290 TraceCheckUtils]: 3: Hoare triple {77674#true} assume !(1 == ~p_dw_pc~0); {77674#true} is VALID [2022-02-20 19:57:55,710 INFO L290 TraceCheckUtils]: 4: Hoare triple {77674#true} ~__retres1~0 := 0; {77674#true} is VALID [2022-02-20 19:57:55,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {77674#true} #res := ~__retres1~0; {77674#true} is VALID [2022-02-20 19:57:55,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {77674#true} assume true; {77674#true} is VALID [2022-02-20 19:57:55,710 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {77674#true} {77674#true} #1320#return; {77674#true} is VALID [2022-02-20 19:57:55,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {77674#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {77674#true} is VALID [2022-02-20 19:57:55,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {77674#true} assume !(0 != ~tmp~1); {77674#true} is VALID [2022-02-20 19:57:55,711 INFO L272 TraceCheckUtils]: 10: Hoare triple {77674#true} call #t~ret9 := is_do_read_c_triggered(); {77674#true} is VALID [2022-02-20 19:57:55,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {77674#true} havoc ~__retres1~1; {77674#true} is VALID [2022-02-20 19:57:55,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {77674#true} assume !(1 == ~c_dr_pc~0); {77674#true} is VALID [2022-02-20 19:57:55,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {77674#true} ~__retres1~1 := 0; {77674#true} is VALID [2022-02-20 19:57:55,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {77674#true} #res := ~__retres1~1; {77674#true} is VALID [2022-02-20 19:57:55,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {77674#true} assume true; {77674#true} is VALID [2022-02-20 19:57:55,711 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {77674#true} {77674#true} #1322#return; {77674#true} is VALID [2022-02-20 19:57:55,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {77674#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {77674#true} is VALID [2022-02-20 19:57:55,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {77674#true} assume !(0 != ~tmp___0~1); {77674#true} is VALID [2022-02-20 19:57:55,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {77674#true} assume true; {77674#true} is VALID [2022-02-20 19:57:55,712 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {77674#true} {77674#true} #1328#return; {77674#true} is VALID [2022-02-20 19:57:55,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {77716#(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); {77674#true} is VALID [2022-02-20 19:57:55,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {77674#true} assume !(1 == ~q_write_ev~0); {77674#true} is VALID [2022-02-20 19:57:55,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {77674#true} assume true; {77674#true} is VALID [2022-02-20 19:57:55,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {77674#true} {77674#true} #1330#return; {77674#true} is VALID [2022-02-20 19:57:55,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:55,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {77674#true} havoc ~__retres1~2; {77674#true} is VALID [2022-02-20 19:57:55,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {77674#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {77674#true} is VALID [2022-02-20 19:57:55,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {77674#true} #res := ~__retres1~2; {77674#true} is VALID [2022-02-20 19:57:55,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {77674#true} assume true; {77674#true} is VALID [2022-02-20 19:57:55,717 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {77674#true} {77674#true} #1332#return; {77674#true} is VALID [2022-02-20 19:57:55,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {77674#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {77674#true} is VALID [2022-02-20 19:57:55,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {77674#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {77674#true} is VALID [2022-02-20 19:57:55,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {77674#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {77674#true} is VALID [2022-02-20 19:57:55,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {77674#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; {77674#true} is VALID [2022-02-20 19:57:55,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {77674#true} call update_channels1(); {77715#(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:55,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {77715#(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); {77674#true} is VALID [2022-02-20 19:57:55,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {77674#true} assume true; {77674#true} is VALID [2022-02-20 19:57:55,718 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {77674#true} {77674#true} #1324#return; {77674#true} is VALID [2022-02-20 19:57:55,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {77674#true} assume { :begin_inline_init_threads1 } true; {77674#true} is VALID [2022-02-20 19:57:55,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {77674#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {77674#true} is VALID [2022-02-20 19:57:55,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {77674#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {77674#true} is VALID [2022-02-20 19:57:55,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {77674#true} assume { :end_inline_init_threads1 } true; {77674#true} is VALID [2022-02-20 19:57:55,719 INFO L272 TraceCheckUtils]: 12: Hoare triple {77674#true} call fire_delta_events1(); {77716#(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:55,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {77716#(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); {77674#true} is VALID [2022-02-20 19:57:55,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {77674#true} assume !(0 == ~q_write_ev~0); {77674#true} is VALID [2022-02-20 19:57:55,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {77674#true} assume true; {77674#true} is VALID [2022-02-20 19:57:55,719 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {77674#true} {77674#true} #1326#return; {77674#true} is VALID [2022-02-20 19:57:55,720 INFO L272 TraceCheckUtils]: 17: Hoare triple {77674#true} call activate_threads1(); {77717#(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:55,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {77717#(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; {77674#true} is VALID [2022-02-20 19:57:55,720 INFO L272 TraceCheckUtils]: 19: Hoare triple {77674#true} call #t~ret8 := is_do_write_p_triggered(); {77674#true} is VALID [2022-02-20 19:57:55,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {77674#true} havoc ~__retres1~0; {77674#true} is VALID [2022-02-20 19:57:55,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {77674#true} assume !(1 == ~p_dw_pc~0); {77674#true} is VALID [2022-02-20 19:57:55,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {77674#true} ~__retres1~0 := 0; {77674#true} is VALID [2022-02-20 19:57:55,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {77674#true} #res := ~__retres1~0; {77674#true} is VALID [2022-02-20 19:57:55,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {77674#true} assume true; {77674#true} is VALID [2022-02-20 19:57:55,721 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {77674#true} {77674#true} #1320#return; {77674#true} is VALID [2022-02-20 19:57:55,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {77674#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {77674#true} is VALID [2022-02-20 19:57:55,721 INFO L290 TraceCheckUtils]: 27: Hoare triple {77674#true} assume !(0 != ~tmp~1); {77674#true} is VALID [2022-02-20 19:57:55,721 INFO L272 TraceCheckUtils]: 28: Hoare triple {77674#true} call #t~ret9 := is_do_read_c_triggered(); {77674#true} is VALID [2022-02-20 19:57:55,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {77674#true} havoc ~__retres1~1; {77674#true} is VALID [2022-02-20 19:57:55,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {77674#true} assume !(1 == ~c_dr_pc~0); {77674#true} is VALID [2022-02-20 19:57:55,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {77674#true} ~__retres1~1 := 0; {77674#true} is VALID [2022-02-20 19:57:55,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {77674#true} #res := ~__retres1~1; {77674#true} is VALID [2022-02-20 19:57:55,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {77674#true} assume true; {77674#true} is VALID [2022-02-20 19:57:55,722 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {77674#true} {77674#true} #1322#return; {77674#true} is VALID [2022-02-20 19:57:55,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {77674#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {77674#true} is VALID [2022-02-20 19:57:55,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {77674#true} assume !(0 != ~tmp___0~1); {77674#true} is VALID [2022-02-20 19:57:55,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {77674#true} assume true; {77674#true} is VALID [2022-02-20 19:57:55,722 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {77674#true} {77674#true} #1328#return; {77674#true} is VALID [2022-02-20 19:57:55,723 INFO L272 TraceCheckUtils]: 39: Hoare triple {77674#true} call reset_delta_events1(); {77716#(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:55,723 INFO L290 TraceCheckUtils]: 40: Hoare triple {77716#(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); {77674#true} is VALID [2022-02-20 19:57:55,723 INFO L290 TraceCheckUtils]: 41: Hoare triple {77674#true} assume !(1 == ~q_write_ev~0); {77674#true} is VALID [2022-02-20 19:57:55,723 INFO L290 TraceCheckUtils]: 42: Hoare triple {77674#true} assume true; {77674#true} is VALID [2022-02-20 19:57:55,723 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {77674#true} {77674#true} #1330#return; {77674#true} is VALID [2022-02-20 19:57:55,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {77674#true} assume !false; {77674#true} is VALID [2022-02-20 19:57:55,723 INFO L290 TraceCheckUtils]: 45: Hoare triple {77674#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; {77674#true} is VALID [2022-02-20 19:57:55,724 INFO L290 TraceCheckUtils]: 46: Hoare triple {77674#true} assume !false; {77674#true} is VALID [2022-02-20 19:57:55,724 INFO L272 TraceCheckUtils]: 47: Hoare triple {77674#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {77674#true} is VALID [2022-02-20 19:57:55,724 INFO L290 TraceCheckUtils]: 48: Hoare triple {77674#true} havoc ~__retres1~2; {77674#true} is VALID [2022-02-20 19:57:55,724 INFO L290 TraceCheckUtils]: 49: Hoare triple {77674#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {77674#true} is VALID [2022-02-20 19:57:55,724 INFO L290 TraceCheckUtils]: 50: Hoare triple {77674#true} #res := ~__retres1~2; {77674#true} is VALID [2022-02-20 19:57:55,724 INFO L290 TraceCheckUtils]: 51: Hoare triple {77674#true} assume true; {77674#true} is VALID [2022-02-20 19:57:55,724 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {77674#true} {77674#true} #1332#return; {77674#true} is VALID [2022-02-20 19:57:55,724 INFO L290 TraceCheckUtils]: 53: Hoare triple {77674#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; {77674#true} is VALID [2022-02-20 19:57:55,725 INFO L290 TraceCheckUtils]: 54: Hoare triple {77674#true} assume 0 != eval1_~tmp___1~0#1; {77674#true} is VALID [2022-02-20 19:57:55,725 INFO L290 TraceCheckUtils]: 55: Hoare triple {77674#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; {77674#true} is VALID [2022-02-20 19:57:55,725 INFO L290 TraceCheckUtils]: 56: Hoare triple {77674#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; {77674#true} is VALID [2022-02-20 19:57:55,725 INFO L290 TraceCheckUtils]: 57: Hoare triple {77674#true} assume 0 == ~p_dw_pc~0; {77674#true} is VALID [2022-02-20 19:57:55,725 INFO L290 TraceCheckUtils]: 58: Hoare triple {77674#true} assume !false; {77674#true} is VALID [2022-02-20 19:57:55,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {77674#true} assume !(0 == ~q_free~0); {77674#true} is VALID [2022-02-20 19:57:55,726 INFO L290 TraceCheckUtils]: 60: Hoare triple {77674#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; {77713#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:55,726 INFO L290 TraceCheckUtils]: 61: Hoare triple {77713#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {77713#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:55,726 INFO L290 TraceCheckUtils]: 62: Hoare triple {77713#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {77713#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:55,726 INFO L290 TraceCheckUtils]: 63: Hoare triple {77713#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {77713#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:55,727 INFO L290 TraceCheckUtils]: 64: Hoare triple {77713#(= ~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; {77713#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:55,727 INFO L290 TraceCheckUtils]: 65: Hoare triple {77713#(= ~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; {77713#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:55,728 INFO L290 TraceCheckUtils]: 66: Hoare triple {77713#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {77713#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:55,728 INFO L290 TraceCheckUtils]: 67: Hoare triple {77713#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {77713#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:55,728 INFO L290 TraceCheckUtils]: 68: Hoare triple {77713#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {77713#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:55,728 INFO L290 TraceCheckUtils]: 69: Hoare triple {77713#(= ~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; {77714#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:57:55,729 INFO L290 TraceCheckUtils]: 70: Hoare triple {77714#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {77675#false} is VALID [2022-02-20 19:57:55,729 INFO L272 TraceCheckUtils]: 71: Hoare triple {77675#false} call error1(); {77675#false} is VALID [2022-02-20 19:57:55,729 INFO L290 TraceCheckUtils]: 72: Hoare triple {77675#false} assume !false; {77675#false} is VALID [2022-02-20 19:57:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:55,729 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:55,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207658545] [2022-02-20 19:57:55,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207658545] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:55,730 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:55,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:55,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999975617] [2022-02-20 19:57:55,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:55,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:57:55,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:55,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:57:55,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:55,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:55,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:55,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:55,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:55,774 INFO L87 Difference]: Start difference. First operand 3553 states and 4491 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:57:58,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:58,481 INFO L93 Difference]: Finished difference Result 4617 states and 5769 transitions. [2022-02-20 19:57:58,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:58,482 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-02-20 19:57:58,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:58,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:57:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 666 transitions. [2022-02-20 19:57:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:57:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 666 transitions. [2022-02-20 19:57:58,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 666 transitions. [2022-02-20 19:57:59,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 666 edges. 666 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:59,919 INFO L225 Difference]: With dead ends: 4617 [2022-02-20 19:57:59,920 INFO L226 Difference]: Without dead ends: 4614 [2022-02-20 19:57:59,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:57:59,921 INFO L933 BasicCegarLoop]: 524 mSDtfsCounter, 1712 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1722 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:59,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1722 Valid, 1033 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:59,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4614 states. [2022-02-20 19:58:00,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4614 to 4290. [2022-02-20 19:58:00,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:00,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4614 states. Second operand has 4290 states, 3365 states have (on average 1.2736998514115898) internal successors, (4286), 3425 states have internal predecessors, (4286), 450 states have call successors, (450), 374 states have call predecessors, (450), 473 states have return successors, (643), 493 states have call predecessors, (643), 449 states have call successors, (643) [2022-02-20 19:58:00,167 INFO L74 IsIncluded]: Start isIncluded. First operand 4614 states. Second operand has 4290 states, 3365 states have (on average 1.2736998514115898) internal successors, (4286), 3425 states have internal predecessors, (4286), 450 states have call successors, (450), 374 states have call predecessors, (450), 473 states have return successors, (643), 493 states have call predecessors, (643), 449 states have call successors, (643) [2022-02-20 19:58:00,170 INFO L87 Difference]: Start difference. First operand 4614 states. Second operand has 4290 states, 3365 states have (on average 1.2736998514115898) internal successors, (4286), 3425 states have internal predecessors, (4286), 450 states have call successors, (450), 374 states have call predecessors, (450), 473 states have return successors, (643), 493 states have call predecessors, (643), 449 states have call successors, (643) [2022-02-20 19:58:00,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:00,740 INFO L93 Difference]: Finished difference Result 4614 states and 5752 transitions. [2022-02-20 19:58:00,741 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 5752 transitions. [2022-02-20 19:58:00,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:00,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:00,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 4290 states, 3365 states have (on average 1.2736998514115898) internal successors, (4286), 3425 states have internal predecessors, (4286), 450 states have call successors, (450), 374 states have call predecessors, (450), 473 states have return successors, (643), 493 states have call predecessors, (643), 449 states have call successors, (643) Second operand 4614 states. [2022-02-20 19:58:00,754 INFO L87 Difference]: Start difference. First operand has 4290 states, 3365 states have (on average 1.2736998514115898) internal successors, (4286), 3425 states have internal predecessors, (4286), 450 states have call successors, (450), 374 states have call predecessors, (450), 473 states have return successors, (643), 493 states have call predecessors, (643), 449 states have call successors, (643) Second operand 4614 states. [2022-02-20 19:58:01,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:01,348 INFO L93 Difference]: Finished difference Result 4614 states and 5752 transitions. [2022-02-20 19:58:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 5752 transitions. [2022-02-20 19:58:01,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:01,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:01,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:01,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4290 states, 3365 states have (on average 1.2736998514115898) internal successors, (4286), 3425 states have internal predecessors, (4286), 450 states have call successors, (450), 374 states have call predecessors, (450), 473 states have return successors, (643), 493 states have call predecessors, (643), 449 states have call successors, (643) [2022-02-20 19:58:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4290 states to 4290 states and 5379 transitions. [2022-02-20 19:58:02,185 INFO L78 Accepts]: Start accepts. Automaton has 4290 states and 5379 transitions. Word has length 73 [2022-02-20 19:58:02,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:02,185 INFO L470 AbstractCegarLoop]: Abstraction has 4290 states and 5379 transitions. [2022-02-20 19:58:02,185 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:02,186 INFO L276 IsEmpty]: Start isEmpty. Operand 4290 states and 5379 transitions. [2022-02-20 19:58:02,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 19:58:02,186 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:02,187 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:02,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:58:02,187 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:02,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:02,187 INFO L85 PathProgramCache]: Analyzing trace with hash -679840836, now seen corresponding path program 1 times [2022-02-20 19:58:02,187 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:02,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575435562] [2022-02-20 19:58:02,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:02,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {98928#(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); {98886#true} is VALID [2022-02-20 19:58:02,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:02,260 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98886#true} {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1324#return; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {98929#(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); {98886#true} is VALID [2022-02-20 19:58:02,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {98886#true} assume !(0 == ~q_write_ev~0); {98886#true} is VALID [2022-02-20 19:58:02,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:02,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98886#true} {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1326#return; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {98886#true} havoc ~__retres1~0; {98886#true} is VALID [2022-02-20 19:58:02,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {98886#true} assume !(1 == ~p_dw_pc~0); {98886#true} is VALID [2022-02-20 19:58:02,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {98886#true} ~__retres1~0 := 0; {98886#true} is VALID [2022-02-20 19:58:02,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {98886#true} #res := ~__retres1~0; {98886#true} is VALID [2022-02-20 19:58:02,283 INFO L290 TraceCheckUtils]: 4: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:02,284 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {98886#true} {98886#true} #1320#return; {98886#true} is VALID [2022-02-20 19:58:02,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {98886#true} havoc ~__retres1~1; {98886#true} is VALID [2022-02-20 19:58:02,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {98886#true} assume !(1 == ~c_dr_pc~0); {98886#true} is VALID [2022-02-20 19:58:02,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {98886#true} ~__retres1~1 := 0; {98886#true} is VALID [2022-02-20 19:58:02,289 INFO L290 TraceCheckUtils]: 3: Hoare triple {98886#true} #res := ~__retres1~1; {98886#true} is VALID [2022-02-20 19:58:02,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:02,289 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {98886#true} {98886#true} #1322#return; {98886#true} is VALID [2022-02-20 19:58:02,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {98930#(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; {98886#true} is VALID [2022-02-20 19:58:02,289 INFO L272 TraceCheckUtils]: 1: Hoare triple {98886#true} call #t~ret8 := is_do_write_p_triggered(); {98886#true} is VALID [2022-02-20 19:58:02,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {98886#true} havoc ~__retres1~0; {98886#true} is VALID [2022-02-20 19:58:02,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {98886#true} assume !(1 == ~p_dw_pc~0); {98886#true} is VALID [2022-02-20 19:58:02,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {98886#true} ~__retres1~0 := 0; {98886#true} is VALID [2022-02-20 19:58:02,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {98886#true} #res := ~__retres1~0; {98886#true} is VALID [2022-02-20 19:58:02,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:02,290 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {98886#true} {98886#true} #1320#return; {98886#true} is VALID [2022-02-20 19:58:02,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {98886#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {98886#true} is VALID [2022-02-20 19:58:02,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {98886#true} assume !(0 != ~tmp~1); {98886#true} is VALID [2022-02-20 19:58:02,291 INFO L272 TraceCheckUtils]: 10: Hoare triple {98886#true} call #t~ret9 := is_do_read_c_triggered(); {98886#true} is VALID [2022-02-20 19:58:02,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {98886#true} havoc ~__retres1~1; {98886#true} is VALID [2022-02-20 19:58:02,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {98886#true} assume !(1 == ~c_dr_pc~0); {98886#true} is VALID [2022-02-20 19:58:02,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {98886#true} ~__retres1~1 := 0; {98886#true} is VALID [2022-02-20 19:58:02,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {98886#true} #res := ~__retres1~1; {98886#true} is VALID [2022-02-20 19:58:02,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:02,291 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {98886#true} {98886#true} #1322#return; {98886#true} is VALID [2022-02-20 19:58:02,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {98886#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {98886#true} is VALID [2022-02-20 19:58:02,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {98886#true} assume !(0 != ~tmp___0~1); {98886#true} is VALID [2022-02-20 19:58:02,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:02,292 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {98886#true} {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1328#return; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {98929#(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); {98886#true} is VALID [2022-02-20 19:58:02,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {98886#true} assume !(1 == ~q_write_ev~0); {98886#true} is VALID [2022-02-20 19:58:02,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:02,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98886#true} {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1330#return; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {98886#true} havoc ~__retres1~2; {98886#true} is VALID [2022-02-20 19:58:02,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {98886#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {98886#true} is VALID [2022-02-20 19:58:02,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {98886#true} #res := ~__retres1~2; {98886#true} is VALID [2022-02-20 19:58:02,308 INFO L290 TraceCheckUtils]: 3: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:02,308 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {98886#true} {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1332#return; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {98886#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {98886#true} is VALID [2022-02-20 19:58:02,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {98886#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {98886#true} is VALID [2022-02-20 19:58:02,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {98886#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,309 INFO L290 TraceCheckUtils]: 3: Hoare triple {98888#(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; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {98928#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:02,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {98928#(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); {98886#true} is VALID [2022-02-20 19:58:02,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:02,310 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {98886#true} {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1324#return; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,312 INFO L272 TraceCheckUtils]: 12: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {98929#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:02,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {98929#(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); {98886#true} is VALID [2022-02-20 19:58:02,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {98886#true} assume !(0 == ~q_write_ev~0); {98886#true} is VALID [2022-02-20 19:58:02,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:02,313 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {98886#true} {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1326#return; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,313 INFO L272 TraceCheckUtils]: 17: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {98930#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:02,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {98930#(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; {98886#true} is VALID [2022-02-20 19:58:02,314 INFO L272 TraceCheckUtils]: 19: Hoare triple {98886#true} call #t~ret8 := is_do_write_p_triggered(); {98886#true} is VALID [2022-02-20 19:58:02,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {98886#true} havoc ~__retres1~0; {98886#true} is VALID [2022-02-20 19:58:02,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {98886#true} assume !(1 == ~p_dw_pc~0); {98886#true} is VALID [2022-02-20 19:58:02,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {98886#true} ~__retres1~0 := 0; {98886#true} is VALID [2022-02-20 19:58:02,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {98886#true} #res := ~__retres1~0; {98886#true} is VALID [2022-02-20 19:58:02,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:02,314 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {98886#true} {98886#true} #1320#return; {98886#true} is VALID [2022-02-20 19:58:02,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {98886#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {98886#true} is VALID [2022-02-20 19:58:02,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {98886#true} assume !(0 != ~tmp~1); {98886#true} is VALID [2022-02-20 19:58:02,315 INFO L272 TraceCheckUtils]: 28: Hoare triple {98886#true} call #t~ret9 := is_do_read_c_triggered(); {98886#true} is VALID [2022-02-20 19:58:02,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {98886#true} havoc ~__retres1~1; {98886#true} is VALID [2022-02-20 19:58:02,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {98886#true} assume !(1 == ~c_dr_pc~0); {98886#true} is VALID [2022-02-20 19:58:02,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {98886#true} ~__retres1~1 := 0; {98886#true} is VALID [2022-02-20 19:58:02,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {98886#true} #res := ~__retres1~1; {98886#true} is VALID [2022-02-20 19:58:02,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:02,315 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {98886#true} {98886#true} #1322#return; {98886#true} is VALID [2022-02-20 19:58:02,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {98886#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {98886#true} is VALID [2022-02-20 19:58:02,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {98886#true} assume !(0 != ~tmp___0~1); {98886#true} is VALID [2022-02-20 19:58:02,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:02,316 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {98886#true} {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1328#return; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,316 INFO L272 TraceCheckUtils]: 39: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {98929#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:02,317 INFO L290 TraceCheckUtils]: 40: Hoare triple {98929#(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); {98886#true} is VALID [2022-02-20 19:58:02,317 INFO L290 TraceCheckUtils]: 41: Hoare triple {98886#true} assume !(1 == ~q_write_ev~0); {98886#true} is VALID [2022-02-20 19:58:02,317 INFO L290 TraceCheckUtils]: 42: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:02,317 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {98886#true} {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1330#return; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,317 INFO L290 TraceCheckUtils]: 44: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {98888#(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; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,318 INFO L272 TraceCheckUtils]: 47: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {98886#true} is VALID [2022-02-20 19:58:02,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {98886#true} havoc ~__retres1~2; {98886#true} is VALID [2022-02-20 19:58:02,318 INFO L290 TraceCheckUtils]: 49: Hoare triple {98886#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {98886#true} is VALID [2022-02-20 19:58:02,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {98886#true} #res := ~__retres1~2; {98886#true} is VALID [2022-02-20 19:58:02,319 INFO L290 TraceCheckUtils]: 51: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:02,319 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {98886#true} {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1332#return; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,319 INFO L290 TraceCheckUtils]: 53: Hoare triple {98888#(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; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,320 INFO L290 TraceCheckUtils]: 55: Hoare triple {98888#(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; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,321 INFO L290 TraceCheckUtils]: 56: Hoare triple {98888#(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; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,321 INFO L290 TraceCheckUtils]: 58: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,322 INFO L290 TraceCheckUtils]: 59: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:02,322 INFO L290 TraceCheckUtils]: 60: Hoare triple {98888#(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; {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:02,322 INFO L290 TraceCheckUtils]: 61: Hoare triple {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:02,323 INFO L290 TraceCheckUtils]: 62: Hoare triple {98926#(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; {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:02,323 INFO L290 TraceCheckUtils]: 63: Hoare triple {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:02,323 INFO L290 TraceCheckUtils]: 64: Hoare triple {98926#(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; {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:02,324 INFO L290 TraceCheckUtils]: 65: Hoare triple {98926#(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; {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:02,324 INFO L290 TraceCheckUtils]: 66: Hoare triple {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:02,324 INFO L290 TraceCheckUtils]: 67: Hoare triple {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:02,325 INFO L290 TraceCheckUtils]: 68: Hoare triple {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:02,325 INFO L290 TraceCheckUtils]: 69: Hoare triple {98926#(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; {98927#(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:02,326 INFO L290 TraceCheckUtils]: 70: Hoare triple {98927#(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; {98927#(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:02,326 INFO L290 TraceCheckUtils]: 71: Hoare triple {98927#(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); {98887#false} is VALID [2022-02-20 19:58:02,326 INFO L272 TraceCheckUtils]: 72: Hoare triple {98887#false} call error1(); {98887#false} is VALID [2022-02-20 19:58:02,326 INFO L290 TraceCheckUtils]: 73: Hoare triple {98887#false} assume !false; {98887#false} is VALID [2022-02-20 19:58:02,327 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:02,327 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:58:02,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575435562] [2022-02-20 19:58:02,327 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575435562] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:58:02,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436052496] [2022-02-20 19:58:02,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:02,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:58:02,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:58:02,329 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:02,339 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:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:58:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:02,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:58:03,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {98886#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {98886#true} is VALID [2022-02-20 19:58:03,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {98886#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {98886#true} is VALID [2022-02-20 19:58:03,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {98886#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,282 INFO L290 TraceCheckUtils]: 3: Hoare triple {98888#(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; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_req_up~0); {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,284 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1324#return; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,286 INFO L272 TraceCheckUtils]: 12: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_read_ev~0); {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_write_ev~0); {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,288 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1326#return; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,288 INFO L272 TraceCheckUtils]: 17: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~tmp~1;havoc ~tmp___0~1; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,289 INFO L272 TraceCheckUtils]: 19: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret8 := is_do_write_p_triggered(); {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~0; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~p_dw_pc~0); {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~0 := 0; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~0; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,291 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1320#return; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {98888#(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; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp~1); {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,292 INFO L272 TraceCheckUtils]: 28: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret9 := is_do_read_c_triggered(); {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~1; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~c_dr_pc~0); {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~1 := 0; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~1; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,294 INFO L290 TraceCheckUtils]: 33: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,294 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1322#return; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {98888#(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; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp___0~1); {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,295 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1328#return; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,296 INFO L272 TraceCheckUtils]: 39: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_read_ev~0); {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,297 INFO L290 TraceCheckUtils]: 41: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_write_ev~0); {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,297 INFO L290 TraceCheckUtils]: 42: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,297 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1330#return; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,298 INFO L290 TraceCheckUtils]: 44: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,298 INFO L290 TraceCheckUtils]: 45: Hoare triple {98888#(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; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,298 INFO L290 TraceCheckUtils]: 46: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,299 INFO L272 TraceCheckUtils]: 47: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,299 INFO L290 TraceCheckUtils]: 48: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,299 INFO L290 TraceCheckUtils]: 49: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,300 INFO L290 TraceCheckUtils]: 50: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,300 INFO L290 TraceCheckUtils]: 51: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,300 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #1332#return; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,301 INFO L290 TraceCheckUtils]: 53: Hoare triple {98888#(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; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,301 INFO L290 TraceCheckUtils]: 54: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,302 INFO L290 TraceCheckUtils]: 55: Hoare triple {98888#(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; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,302 INFO L290 TraceCheckUtils]: 56: Hoare triple {98888#(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; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,302 INFO L290 TraceCheckUtils]: 57: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,303 INFO L290 TraceCheckUtils]: 58: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,303 INFO L290 TraceCheckUtils]: 59: Hoare triple {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {98888#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:58:03,303 INFO L290 TraceCheckUtils]: 60: Hoare triple {98888#(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; {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,304 INFO L290 TraceCheckUtils]: 61: Hoare triple {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,304 INFO L290 TraceCheckUtils]: 62: Hoare triple {98926#(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; {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,304 INFO L290 TraceCheckUtils]: 63: Hoare triple {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,305 INFO L290 TraceCheckUtils]: 64: Hoare triple {98926#(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; {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,305 INFO L290 TraceCheckUtils]: 65: Hoare triple {98926#(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; {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,306 INFO L290 TraceCheckUtils]: 66: Hoare triple {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,306 INFO L290 TraceCheckUtils]: 67: Hoare triple {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,306 INFO L290 TraceCheckUtils]: 68: Hoare triple {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {98926#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,307 INFO L290 TraceCheckUtils]: 69: Hoare triple {98926#(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; {99153#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,307 INFO L290 TraceCheckUtils]: 70: Hoare triple {99153#(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; {99153#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:58:03,308 INFO L290 TraceCheckUtils]: 71: Hoare triple {99153#(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); {98887#false} is VALID [2022-02-20 19:58:03,308 INFO L272 TraceCheckUtils]: 72: Hoare triple {98887#false} call error1(); {98887#false} is VALID [2022-02-20 19:58:03,308 INFO L290 TraceCheckUtils]: 73: Hoare triple {98887#false} assume !false; {98887#false} is VALID [2022-02-20 19:58:03,308 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:03,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:58:03,651 INFO L290 TraceCheckUtils]: 73: Hoare triple {98887#false} assume !false; {98887#false} is VALID [2022-02-20 19:58:03,652 INFO L272 TraceCheckUtils]: 72: Hoare triple {98887#false} call error1(); {98887#false} is VALID [2022-02-20 19:58:03,652 INFO L290 TraceCheckUtils]: 71: Hoare triple {98927#(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); {98887#false} is VALID [2022-02-20 19:58:03,652 INFO L290 TraceCheckUtils]: 70: Hoare triple {98927#(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; {98927#(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:03,653 INFO L290 TraceCheckUtils]: 69: Hoare triple {99178#(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; {98927#(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:03,653 INFO L290 TraceCheckUtils]: 68: Hoare triple {99178#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !(1 == ~q_free~0); {99178#(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:03,654 INFO L290 TraceCheckUtils]: 67: Hoare triple {99178#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {99178#(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:03,654 INFO L290 TraceCheckUtils]: 66: Hoare triple {99178#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_pc~0; {99178#(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:03,654 INFO L290 TraceCheckUtils]: 65: Hoare triple {99178#(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; {99178#(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:03,655 INFO L290 TraceCheckUtils]: 64: Hoare triple {99178#(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; {99178#(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:03,655 INFO L290 TraceCheckUtils]: 63: Hoare triple {99178#(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; {99178#(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:03,656 INFO L290 TraceCheckUtils]: 62: Hoare triple {99178#(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; {99178#(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:03,656 INFO L290 TraceCheckUtils]: 61: Hoare triple {99178#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {99178#(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:03,657 INFO L290 TraceCheckUtils]: 60: Hoare triple {98927#(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; {99178#(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:03,657 INFO L290 TraceCheckUtils]: 59: Hoare triple {98927#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(0 == ~q_free~0); {98927#(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:03,657 INFO L290 TraceCheckUtils]: 58: Hoare triple {98927#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {98927#(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:03,658 INFO L290 TraceCheckUtils]: 57: Hoare triple {98927#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_pc~0; {98927#(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:03,658 INFO L290 TraceCheckUtils]: 56: Hoare triple {98927#(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; {98927#(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:03,658 INFO L290 TraceCheckUtils]: 55: Hoare triple {98927#(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; {98927#(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:03,659 INFO L290 TraceCheckUtils]: 54: Hoare triple {98927#(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; {98927#(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:03,659 INFO L290 TraceCheckUtils]: 53: Hoare triple {98927#(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; {98927#(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:03,660 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {98886#true} {98927#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1332#return; {98927#(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:03,660 INFO L290 TraceCheckUtils]: 51: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:03,660 INFO L290 TraceCheckUtils]: 50: Hoare triple {98886#true} #res := ~__retres1~2; {98886#true} is VALID [2022-02-20 19:58:03,660 INFO L290 TraceCheckUtils]: 49: Hoare triple {98886#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {98886#true} is VALID [2022-02-20 19:58:03,660 INFO L290 TraceCheckUtils]: 48: Hoare triple {98886#true} havoc ~__retres1~2; {98886#true} is VALID [2022-02-20 19:58:03,660 INFO L272 TraceCheckUtils]: 47: Hoare triple {98927#(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(); {98886#true} is VALID [2022-02-20 19:58:03,661 INFO L290 TraceCheckUtils]: 46: Hoare triple {98927#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {98927#(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:03,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {98927#(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; {98927#(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:03,661 INFO L290 TraceCheckUtils]: 44: Hoare triple {98927#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {98927#(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:03,662 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {98886#true} {98927#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1330#return; {98927#(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:03,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:03,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {98886#true} assume !(1 == ~q_write_ev~0); {98886#true} is VALID [2022-02-20 19:58:03,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {98886#true} assume !(1 == ~q_read_ev~0); {98886#true} is VALID [2022-02-20 19:58:03,662 INFO L272 TraceCheckUtils]: 39: Hoare triple {98927#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call reset_delta_events1(); {98886#true} is VALID [2022-02-20 19:58:03,662 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {98886#true} {98927#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1328#return; {98927#(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:03,663 INFO L290 TraceCheckUtils]: 37: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:03,663 INFO L290 TraceCheckUtils]: 36: Hoare triple {98886#true} assume !(0 != ~tmp___0~1); {98886#true} is VALID [2022-02-20 19:58:03,663 INFO L290 TraceCheckUtils]: 35: Hoare triple {98886#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {98886#true} is VALID [2022-02-20 19:58:03,663 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {98886#true} {98886#true} #1322#return; {98886#true} is VALID [2022-02-20 19:58:03,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:03,663 INFO L290 TraceCheckUtils]: 32: Hoare triple {98886#true} #res := ~__retres1~1; {98886#true} is VALID [2022-02-20 19:58:03,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {98886#true} ~__retres1~1 := 0; {98886#true} is VALID [2022-02-20 19:58:03,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {98886#true} assume !(1 == ~c_dr_pc~0); {98886#true} is VALID [2022-02-20 19:58:03,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {98886#true} havoc ~__retres1~1; {98886#true} is VALID [2022-02-20 19:58:03,664 INFO L272 TraceCheckUtils]: 28: Hoare triple {98886#true} call #t~ret9 := is_do_read_c_triggered(); {98886#true} is VALID [2022-02-20 19:58:03,664 INFO L290 TraceCheckUtils]: 27: Hoare triple {98886#true} assume !(0 != ~tmp~1); {98886#true} is VALID [2022-02-20 19:58:03,664 INFO L290 TraceCheckUtils]: 26: Hoare triple {98886#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {98886#true} is VALID [2022-02-20 19:58:03,664 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {98886#true} {98886#true} #1320#return; {98886#true} is VALID [2022-02-20 19:58:03,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:03,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {98886#true} #res := ~__retres1~0; {98886#true} is VALID [2022-02-20 19:58:03,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {98886#true} ~__retres1~0 := 0; {98886#true} is VALID [2022-02-20 19:58:03,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {98886#true} assume !(1 == ~p_dw_pc~0); {98886#true} is VALID [2022-02-20 19:58:03,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {98886#true} havoc ~__retres1~0; {98886#true} is VALID [2022-02-20 19:58:03,665 INFO L272 TraceCheckUtils]: 19: Hoare triple {98886#true} call #t~ret8 := is_do_write_p_triggered(); {98886#true} is VALID [2022-02-20 19:58:03,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {98886#true} havoc ~tmp~1;havoc ~tmp___0~1; {98886#true} is VALID [2022-02-20 19:58:03,665 INFO L272 TraceCheckUtils]: 17: Hoare triple {98927#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call activate_threads1(); {98886#true} is VALID [2022-02-20 19:58:03,665 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {98886#true} {98927#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1326#return; {98927#(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:03,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:03,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {98886#true} assume !(0 == ~q_write_ev~0); {98886#true} is VALID [2022-02-20 19:58:03,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {98886#true} assume !(0 == ~q_read_ev~0); {98886#true} is VALID [2022-02-20 19:58:03,666 INFO L272 TraceCheckUtils]: 12: Hoare triple {98927#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call fire_delta_events1(); {98886#true} is VALID [2022-02-20 19:58:03,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {98927#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_threads1 } true; {98927#(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:03,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {98927#(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; {98927#(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:03,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {98927#(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; {98927#(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:03,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {98927#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :begin_inline_init_threads1 } true; {98927#(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:03,676 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {98886#true} {98927#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #1324#return; {98927#(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:03,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {98886#true} assume true; {98886#true} is VALID [2022-02-20 19:58:03,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {98886#true} assume !(1 == ~q_req_up~0); {98886#true} is VALID [2022-02-20 19:58:03,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {98927#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call update_channels1(); {98886#true} is VALID [2022-02-20 19:58:03,676 INFO L290 TraceCheckUtils]: 3: Hoare triple {98927#(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; {98927#(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:03,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {98886#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {98927#(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:03,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {98886#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {98886#true} is VALID [2022-02-20 19:58:03,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {98886#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {98886#true} is VALID [2022-02-20 19:58:03,677 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:03,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436052496] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:58:03,678 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:58:03,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-02-20 19:58:03,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878833036] [2022-02-20 19:58:03,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:58:03,679 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:03,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:58:03,680 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:03,769 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:03,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:58:03,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:58:03,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:58:03,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:58:03,770 INFO L87 Difference]: Start difference. First operand 4290 states and 5379 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:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:12,128 INFO L93 Difference]: Finished difference Result 8661 states and 10712 transitions. [2022-02-20 19:58:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-20 19:58:12,128 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:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:58:12,128 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:12,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1131 transitions. [2022-02-20 19:58:12,134 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:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1131 transitions. [2022-02-20 19:58:12,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 1131 transitions. [2022-02-20 19:58:12,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1131 edges. 1131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:58:15,844 INFO L225 Difference]: With dead ends: 8661 [2022-02-20 19:58:15,844 INFO L226 Difference]: Without dead ends: 8658 [2022-02-20 19:58:15,846 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:15,846 INFO L933 BasicCegarLoop]: 674 mSDtfsCounter, 1470 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 1840 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 2458 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:58:15,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1531 Valid, 2458 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1840 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 19:58:15,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8658 states. [2022-02-20 19:58:17,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8658 to 7749. [2022-02-20 19:58:17,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:58:17,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8658 states. Second operand has 7749 states, 6070 states have (on average 1.2606260296540361) internal successors, (7652), 6181 states have internal predecessors, (7652), 810 states have call successors, (810), 689 states have call predecessors, (810), 867 states have return successors, (1169), 881 states have call predecessors, (1169), 809 states have call successors, (1169) [2022-02-20 19:58:17,251 INFO L74 IsIncluded]: Start isIncluded. First operand 8658 states. Second operand has 7749 states, 6070 states have (on average 1.2606260296540361) internal successors, (7652), 6181 states have internal predecessors, (7652), 810 states have call successors, (810), 689 states have call predecessors, (810), 867 states have return successors, (1169), 881 states have call predecessors, (1169), 809 states have call successors, (1169) [2022-02-20 19:58:17,258 INFO L87 Difference]: Start difference. First operand 8658 states. Second operand has 7749 states, 6070 states have (on average 1.2606260296540361) internal successors, (7652), 6181 states have internal predecessors, (7652), 810 states have call successors, (810), 689 states have call predecessors, (810), 867 states have return successors, (1169), 881 states have call predecessors, (1169), 809 states have call successors, (1169) [2022-02-20 19:58:19,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:19,303 INFO L93 Difference]: Finished difference Result 8658 states and 10694 transitions. [2022-02-20 19:58:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 8658 states and 10694 transitions. [2022-02-20 19:58:19,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:19,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:19,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 7749 states, 6070 states have (on average 1.2606260296540361) internal successors, (7652), 6181 states have internal predecessors, (7652), 810 states have call successors, (810), 689 states have call predecessors, (810), 867 states have return successors, (1169), 881 states have call predecessors, (1169), 809 states have call successors, (1169) Second operand 8658 states. [2022-02-20 19:58:19,331 INFO L87 Difference]: Start difference. First operand has 7749 states, 6070 states have (on average 1.2606260296540361) internal successors, (7652), 6181 states have internal predecessors, (7652), 810 states have call successors, (810), 689 states have call predecessors, (810), 867 states have return successors, (1169), 881 states have call predecessors, (1169), 809 states have call successors, (1169) Second operand 8658 states. [2022-02-20 19:58:21,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:58:21,469 INFO L93 Difference]: Finished difference Result 8658 states and 10694 transitions. [2022-02-20 19:58:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand 8658 states and 10694 transitions. [2022-02-20 19:58:21,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:58:21,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:58:21,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:58:21,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:58:21,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7749 states, 6070 states have (on average 1.2606260296540361) internal successors, (7652), 6181 states have internal predecessors, (7652), 810 states have call successors, (810), 689 states have call predecessors, (810), 867 states have return successors, (1169), 881 states have call predecessors, (1169), 809 states have call successors, (1169) [2022-02-20 19:58:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7749 states to 7749 states and 9631 transitions. [2022-02-20 19:58:23,986 INFO L78 Accepts]: Start accepts. Automaton has 7749 states and 9631 transitions. Word has length 74 [2022-02-20 19:58:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:58:23,986 INFO L470 AbstractCegarLoop]: Abstraction has 7749 states and 9631 transitions. [2022-02-20 19:58:23,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:58:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 7749 states and 9631 transitions. [2022-02-20 19:58:23,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:58:23,987 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:58:23,987 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:58:24,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 19:58:24,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-20 19:58:24,201 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:58:24,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:58:24,202 INFO L85 PathProgramCache]: Analyzing trace with hash 669680098, now seen corresponding path program 2 times [2022-02-20 19:58:24,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:58:24,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780608197] [2022-02-20 19:58:24,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:58:24,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:58:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:58:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {138744#(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); {138704#true} is VALID [2022-02-20 19:58:24,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {138704#true} assume true; {138704#true} is VALID [2022-02-20 19:58:24,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {138704#true} {138704#true} #1324#return; {138704#true} is VALID [2022-02-20 19:58:24,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:58:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {138745#(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); {138704#true} is VALID [2022-02-20 19:58:24,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {138704#true} assume !(0 == ~q_write_ev~0); {138704#true} is VALID [2022-02-20 19:58:24,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {138704#true} assume true; {138704#true} is VALID [2022-02-20 19:58:24,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138704#true} {138704#true} #1326#return; {138704#true} is VALID [2022-02-20 19:58:24,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:58:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:58:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {138704#true} havoc ~__retres1~0; {138704#true} is VALID [2022-02-20 19:58:24,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {138704#true} assume !(1 == ~p_dw_pc~0); {138704#true} is VALID [2022-02-20 19:58:24,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {138704#true} ~__retres1~0 := 0; {138704#true} is VALID [2022-02-20 19:58:24,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {138704#true} #res := ~__retres1~0; {138704#true} is VALID [2022-02-20 19:58:24,288 INFO L290 TraceCheckUtils]: 4: Hoare triple {138704#true} assume true; {138704#true} is VALID [2022-02-20 19:58:24,288 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {138704#true} {138704#true} #1320#return; {138704#true} is VALID [2022-02-20 19:58:24,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:58:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {138704#true} havoc ~__retres1~1; {138704#true} is VALID [2022-02-20 19:58:24,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {138704#true} assume !(1 == ~c_dr_pc~0); {138704#true} is VALID [2022-02-20 19:58:24,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {138704#true} ~__retres1~1 := 0; {138704#true} is VALID [2022-02-20 19:58:24,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {138704#true} #res := ~__retres1~1; {138704#true} is VALID [2022-02-20 19:58:24,291 INFO L290 TraceCheckUtils]: 4: Hoare triple {138704#true} assume true; {138704#true} is VALID [2022-02-20 19:58:24,291 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {138704#true} {138704#true} #1322#return; {138704#true} is VALID [2022-02-20 19:58:24,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {138746#(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; {138704#true} is VALID [2022-02-20 19:58:24,291 INFO L272 TraceCheckUtils]: 1: Hoare triple {138704#true} call #t~ret8 := is_do_write_p_triggered(); {138704#true} is VALID [2022-02-20 19:58:24,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {138704#true} havoc ~__retres1~0; {138704#true} is VALID [2022-02-20 19:58:24,291 INFO L290 TraceCheckUtils]: 3: Hoare triple {138704#true} assume !(1 == ~p_dw_pc~0); {138704#true} is VALID [2022-02-20 19:58:24,291 INFO L290 TraceCheckUtils]: 4: Hoare triple {138704#true} ~__retres1~0 := 0; {138704#true} is VALID [2022-02-20 19:58:24,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {138704#true} #res := ~__retres1~0; {138704#true} is VALID [2022-02-20 19:58:24,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {138704#true} assume true; {138704#true} is VALID [2022-02-20 19:58:24,292 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {138704#true} {138704#true} #1320#return; {138704#true} is VALID [2022-02-20 19:58:24,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {138704#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {138704#true} is VALID [2022-02-20 19:58:24,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {138704#true} assume !(0 != ~tmp~1); {138704#true} is VALID [2022-02-20 19:58:24,292 INFO L272 TraceCheckUtils]: 10: Hoare triple {138704#true} call #t~ret9 := is_do_read_c_triggered(); {138704#true} is VALID [2022-02-20 19:58:24,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {138704#true} havoc ~__retres1~1; {138704#true} is VALID [2022-02-20 19:58:24,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {138704#true} assume !(1 == ~c_dr_pc~0); {138704#true} is VALID [2022-02-20 19:58:24,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {138704#true} ~__retres1~1 := 0; {138704#true} is VALID [2022-02-20 19:58:24,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {138704#true} #res := ~__retres1~1; {138704#true} is VALID [2022-02-20 19:58:24,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {138704#true} assume true; {138704#true} is VALID [2022-02-20 19:58:24,293 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {138704#true} {138704#true} #1322#return; {138704#true} is VALID [2022-02-20 19:58:24,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {138704#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {138704#true} is VALID [2022-02-20 19:58:24,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {138704#true} assume !(0 != ~tmp___0~1); {138704#true} is VALID [2022-02-20 19:58:24,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {138704#true} assume true; {138704#true} is VALID [2022-02-20 19:58:24,294 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {138704#true} {138704#true} #1328#return; {138704#true} is VALID [2022-02-20 19:58:24,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:58:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {138745#(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); {138704#true} is VALID [2022-02-20 19:58:24,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {138704#true} assume !(1 == ~q_write_ev~0); {138704#true} is VALID [2022-02-20 19:58:24,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {138704#true} assume true; {138704#true} is VALID [2022-02-20 19:58:24,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138704#true} {138704#true} #1330#return; {138704#true} is VALID [2022-02-20 19:58:24,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:58:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:58:24,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {138704#true} havoc ~__retres1~2; {138704#true} is VALID [2022-02-20 19:58:24,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {138704#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {138704#true} is VALID [2022-02-20 19:58:24,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {138704#true} #res := ~__retres1~2; {138704#true} is VALID [2022-02-20 19:58:24,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {138704#true} assume true; {138704#true} is VALID [2022-02-20 19:58:24,310 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {138704#true} {138704#true} #1332#return; {138704#true} is VALID [2022-02-20 19:58:24,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {138704#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;~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;~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;~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;~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;~token~0 := 0;~local~0 := 0; {138704#true} is VALID [2022-02-20 19:58:24,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {138704#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1;assume -2147483648 <= main_#t~nondet40#1 && main_#t~nondet40#1 <= 2147483647; {138704#true} is VALID [2022-02-20 19:58:24,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {138704#true} assume 0 != main_#t~nondet40#1;havoc main_#t~nondet40#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; {138704#true} is VALID [2022-02-20 19:58:24,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {138704#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; {138704#true} is VALID [2022-02-20 19:58:24,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {138704#true} call update_channels1(); {138744#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:58:24,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {138744#(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); {138704#true} is VALID [2022-02-20 19:58:24,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {138704#true} assume true; {138704#true} is VALID [2022-02-20 19:58:24,311 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {138704#true} {138704#true} #1324#return; {138704#true} is VALID [2022-02-20 19:58:24,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {138704#true} assume { :begin_inline_init_threads1 } true; {138704#true} is VALID [2022-02-20 19:58:24,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {138704#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {138704#true} is VALID [2022-02-20 19:58:24,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {138704#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {138704#true} is VALID [2022-02-20 19:58:24,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {138704#true} assume { :end_inline_init_threads1 } true; {138704#true} is VALID [2022-02-20 19:58:24,312 INFO L272 TraceCheckUtils]: 12: Hoare triple {138704#true} call fire_delta_events1(); {138745#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:58:24,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {138745#(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); {138704#true} is VALID [2022-02-20 19:58:24,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {138704#true} assume !(0 == ~q_write_ev~0); {138704#true} is VALID [2022-02-20 19:58:24,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {138704#true} assume true; {138704#true} is VALID [2022-02-20 19:58:24,312 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {138704#true} {138704#true} #1326#return; {138704#true} is VALID [2022-02-20 19:58:24,313 INFO L272 TraceCheckUtils]: 17: Hoare triple {138704#true} call activate_threads1(); {138746#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:58:24,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {138746#(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; {138704#true} is VALID [2022-02-20 19:58:24,313 INFO L272 TraceCheckUtils]: 19: Hoare triple {138704#true} call #t~ret8 := is_do_write_p_triggered(); {138704#true} is VALID [2022-02-20 19:58:24,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {138704#true} havoc ~__retres1~0; {138704#true} is VALID [2022-02-20 19:58:24,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {138704#true} assume !(1 == ~p_dw_pc~0); {138704#true} is VALID [2022-02-20 19:58:24,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {138704#true} ~__retres1~0 := 0; {138704#true} is VALID [2022-02-20 19:58:24,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {138704#true} #res := ~__retres1~0; {138704#true} is VALID [2022-02-20 19:58:24,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {138704#true} assume true; {138704#true} is VALID [2022-02-20 19:58:24,314 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {138704#true} {138704#true} #1320#return; {138704#true} is VALID [2022-02-20 19:58:24,314 INFO L290 TraceCheckUtils]: 26: Hoare triple {138704#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {138704#true} is VALID [2022-02-20 19:58:24,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {138704#true} assume !(0 != ~tmp~1); {138704#true} is VALID [2022-02-20 19:58:24,314 INFO L272 TraceCheckUtils]: 28: Hoare triple {138704#true} call #t~ret9 := is_do_read_c_triggered(); {138704#true} is VALID [2022-02-20 19:58:24,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {138704#true} havoc ~__retres1~1; {138704#true} is VALID [2022-02-20 19:58:24,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {138704#true} assume !(1 == ~c_dr_pc~0); {138704#true} is VALID [2022-02-20 19:58:24,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {138704#true} ~__retres1~1 := 0; {138704#true} is VALID [2022-02-20 19:58:24,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {138704#true} #res := ~__retres1~1; {138704#true} is VALID [2022-02-20 19:58:24,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {138704#true} assume true; {138704#true} is VALID