./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c3aab1156afcb98b97b027e9b66004d54025f3b89e95d6d35dc2e84fdb640d2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:56:44,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:56:44,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:56:45,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:56:45,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:56:45,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:56:45,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:56:45,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:56:45,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:56:45,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:56:45,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:56:45,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:56:45,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:56:45,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:56:45,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:56:45,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:56:45,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:56:45,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:56:45,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:56:45,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:56:45,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:56:45,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:56:45,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:56:45,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:56:45,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:56:45,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:56:45,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:56:45,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:56:45,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:56:45,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:56:45,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:56:45,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:56:45,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:56:45,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:56:45,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:56:45,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:56:45,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:56:45,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:56:45,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:56:45,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:56:45,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:56:45,037 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:56:45,062 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:56:45,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:56:45,062 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:56:45,062 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:56:45,063 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:56:45,063 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:56:45,063 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:56:45,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:56:45,064 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:56:45,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:56:45,064 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:56:45,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:56:45,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:56:45,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:56:45,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:56:45,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:56:45,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:56:45,065 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:56:45,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:56:45,065 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:56:45,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:56:45,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:56:45,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:56:45,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:56:45,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:56:45,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:56:45,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:56:45,067 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:56:45,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:56:45,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:56:45,067 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:56:45,067 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:56:45,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:56:45,067 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 -> 4c3aab1156afcb98b97b027e9b66004d54025f3b89e95d6d35dc2e84fdb640d2 [2022-02-20 19:56:45,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:56:45,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:56:45,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:56:45,229 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:56:45,230 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:56:45,230 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.03.cil-2.c [2022-02-20 19:56:45,295 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20e3b4a67/259a8897c32b4a4d924cd99036f66ca1/FLAG1143e95d3 [2022-02-20 19:56:45,686 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:56:45,688 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2022-02-20 19:56:45,698 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20e3b4a67/259a8897c32b4a4d924cd99036f66ca1/FLAG1143e95d3 [2022-02-20 19:56:45,707 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20e3b4a67/259a8897c32b4a4d924cd99036f66ca1 [2022-02-20 19:56:45,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:56:45,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:56:45,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:56:45,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:56:45,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:56:45,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:56:45" (1/1) ... [2022-02-20 19:56:45,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@baf07c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:45, skipping insertion in model container [2022-02-20 19:56:45,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:56:45" (1/1) ... [2022-02-20 19:56:45,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:56:45,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:56:45,880 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.03.cil-2.c[914,927] [2022-02-20 19:56:45,911 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.03.cil-2.c[7115,7128] [2022-02-20 19:56:45,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:56:45,949 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:56:45,956 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.03.cil-2.c[914,927] [2022-02-20 19:56:45,981 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.03.cil-2.c[7115,7128] [2022-02-20 19:56:46,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:56:46,025 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:56:46,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:46 WrapperNode [2022-02-20 19:56:46,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:56:46,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:56:46,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:56:46,027 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:56:46,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:46" (1/1) ... [2022-02-20 19:56:46,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:46" (1/1) ... [2022-02-20 19:56:46,080 INFO L137 Inliner]: procedures = 59, calls = 66, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 518 [2022-02-20 19:56:46,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:56:46,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:56:46,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:56:46,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:56:46,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:46" (1/1) ... [2022-02-20 19:56:46,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:46" (1/1) ... [2022-02-20 19:56:46,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:46" (1/1) ... [2022-02-20 19:56:46,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:46" (1/1) ... [2022-02-20 19:56:46,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:46" (1/1) ... [2022-02-20 19:56:46,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:46" (1/1) ... [2022-02-20 19:56:46,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:46" (1/1) ... [2022-02-20 19:56:46,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:56:46,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:56:46,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:56:46,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:56:46,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:46" (1/1) ... [2022-02-20 19:56:46,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:56:46,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:56:46,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:56:46,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:56:46,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:56:46,184 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-02-20 19:56:46,185 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-02-20 19:56:46,185 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-02-20 19:56:46,185 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-02-20 19:56:46,185 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-02-20 19:56:46,185 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-02-20 19:56:46,185 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-02-20 19:56:46,185 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-02-20 19:56:46,185 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-02-20 19:56:46,185 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-02-20 19:56:46,185 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-02-20 19:56:46,185 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-02-20 19:56:46,185 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-02-20 19:56:46,185 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-02-20 19:56:46,185 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-02-20 19:56:46,185 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-02-20 19:56:46,186 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-02-20 19:56:46,186 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-02-20 19:56:46,186 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-02-20 19:56:46,186 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-02-20 19:56:46,186 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-02-20 19:56:46,186 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-02-20 19:56:46,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:56:46,186 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-02-20 19:56:46,186 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-02-20 19:56:46,186 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-02-20 19:56:46,187 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-02-20 19:56:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:56:46,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:56:46,187 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-02-20 19:56:46,187 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-02-20 19:56:46,258 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:56:46,260 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:56:46,751 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:56:46,765 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:56:46,765 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-02-20 19:56:46,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:56:46 BoogieIcfgContainer [2022-02-20 19:56:46,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:56:46,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:56:46,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:56:46,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:56:46,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:56:45" (1/3) ... [2022-02-20 19:56:46,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a86de43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:56:46, skipping insertion in model container [2022-02-20 19:56:46,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:56:46" (2/3) ... [2022-02-20 19:56:46,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a86de43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:56:46, skipping insertion in model container [2022-02-20 19:56:46,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:56:46" (3/3) ... [2022-02-20 19:56:46,773 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2022-02-20 19:56:46,776 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:56:46,777 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:56:46,810 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:56:46,814 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:56:46,814 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:56:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 258 states, 210 states have (on average 1.5714285714285714) internal successors, (330), 216 states have internal predecessors, (330), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 19:56:46,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:46,844 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:46,845 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:56:46,845 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:46,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:46,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2111945575, now seen corresponding path program 1 times [2022-02-20 19:56:46,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:46,855 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788749002] [2022-02-20 19:56:46,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:46,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#(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); {302#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:47,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {302#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:47,095 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {302#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {263#(= ~q_read_ev~0 2)} #876#return; {263#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:47,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {303#(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; {304#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:47,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {304#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {304#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:47,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {304#(= |old(~q_read_ev~0)| 0)} assume true; {304#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:47,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {304#(= |old(~q_read_ev~0)| 0)} {263#(= ~q_read_ev~0 2)} #878#return; {262#false} is VALID [2022-02-20 19:56:47,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {261#true} havoc ~__retres1~0; {261#true} is VALID [2022-02-20 19:56:47,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#true} assume 1 == ~p_dw_pc~0; {261#true} is VALID [2022-02-20 19:56:47,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {261#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {261#true} is VALID [2022-02-20 19:56:47,161 INFO L290 TraceCheckUtils]: 3: Hoare triple {261#true} #res := ~__retres1~0; {261#true} is VALID [2022-02-20 19:56:47,162 INFO L290 TraceCheckUtils]: 4: Hoare triple {261#true} assume true; {261#true} is VALID [2022-02-20 19:56:47,162 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {261#true} {261#true} #872#return; {261#true} is VALID [2022-02-20 19:56:47,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {261#true} havoc ~__retres1~1; {261#true} is VALID [2022-02-20 19:56:47,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#true} assume !(1 == ~c_dr_pc~0); {261#true} is VALID [2022-02-20 19:56:47,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {261#true} ~__retres1~1 := 0; {261#true} is VALID [2022-02-20 19:56:47,166 INFO L290 TraceCheckUtils]: 3: Hoare triple {261#true} #res := ~__retres1~1; {261#true} is VALID [2022-02-20 19:56:47,167 INFO L290 TraceCheckUtils]: 4: Hoare triple {261#true} assume true; {261#true} is VALID [2022-02-20 19:56:47,167 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {261#true} {261#true} #874#return; {261#true} is VALID [2022-02-20 19:56:47,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {305#(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; {261#true} is VALID [2022-02-20 19:56:47,167 INFO L272 TraceCheckUtils]: 1: Hoare triple {261#true} call #t~ret8 := is_do_write_p_triggered(); {261#true} is VALID [2022-02-20 19:56:47,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {261#true} havoc ~__retres1~0; {261#true} is VALID [2022-02-20 19:56:47,168 INFO L290 TraceCheckUtils]: 3: Hoare triple {261#true} assume 1 == ~p_dw_pc~0; {261#true} is VALID [2022-02-20 19:56:47,168 INFO L290 TraceCheckUtils]: 4: Hoare triple {261#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {261#true} is VALID [2022-02-20 19:56:47,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {261#true} #res := ~__retres1~0; {261#true} is VALID [2022-02-20 19:56:47,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {261#true} assume true; {261#true} is VALID [2022-02-20 19:56:47,171 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {261#true} {261#true} #872#return; {261#true} is VALID [2022-02-20 19:56:47,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {261#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {261#true} is VALID [2022-02-20 19:56:47,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {261#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {261#true} is VALID [2022-02-20 19:56:47,171 INFO L272 TraceCheckUtils]: 10: Hoare triple {261#true} call #t~ret9 := is_do_read_c_triggered(); {261#true} is VALID [2022-02-20 19:56:47,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {261#true} havoc ~__retres1~1; {261#true} is VALID [2022-02-20 19:56:47,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {261#true} assume !(1 == ~c_dr_pc~0); {261#true} is VALID [2022-02-20 19:56:47,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {261#true} ~__retres1~1 := 0; {261#true} is VALID [2022-02-20 19:56:47,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {261#true} #res := ~__retres1~1; {261#true} is VALID [2022-02-20 19:56:47,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {261#true} assume true; {261#true} is VALID [2022-02-20 19:56:47,172 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {261#true} {261#true} #874#return; {261#true} is VALID [2022-02-20 19:56:47,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {261#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {261#true} is VALID [2022-02-20 19:56:47,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {261#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {261#true} is VALID [2022-02-20 19:56:47,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {261#true} assume true; {261#true} is VALID [2022-02-20 19:56:47,173 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {261#true} {262#false} #880#return; {262#false} is VALID [2022-02-20 19:56:47,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {303#(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; {261#true} is VALID [2022-02-20 19:56:47,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#true} assume !(1 == ~q_write_ev~0); {261#true} is VALID [2022-02-20 19:56:47,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {261#true} assume true; {261#true} is VALID [2022-02-20 19:56:47,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {261#true} {262#false} #882#return; {262#false} is VALID [2022-02-20 19:56:47,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:47,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {261#true} havoc ~__retres1~2; {261#true} is VALID [2022-02-20 19:56:47,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {261#true} is VALID [2022-02-20 19:56:47,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {261#true} #res := ~__retres1~2; {261#true} is VALID [2022-02-20 19:56:47,183 INFO L290 TraceCheckUtils]: 3: Hoare triple {261#true} assume true; {261#true} is VALID [2022-02-20 19:56:47,183 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {261#true} {262#false} #884#return; {262#false} is VALID [2022-02-20 19:56:47,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {261#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {261#true} is VALID [2022-02-20 19:56:47,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {261#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {261#true} is VALID [2022-02-20 19:56:47,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {261#true} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {263#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:47,185 INFO L290 TraceCheckUtils]: 3: Hoare triple {263#(= ~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; {263#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:47,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {263#(= ~q_read_ev~0 2)} call update_channels1(); {301#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:56:47,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#(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); {302#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:47,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {302#(= |old(~q_read_ev~0)| ~q_read_ev~0)} assume true; {302#(= |old(~q_read_ev~0)| ~q_read_ev~0)} is VALID [2022-02-20 19:56:47,187 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {302#(= |old(~q_read_ev~0)| ~q_read_ev~0)} {263#(= ~q_read_ev~0 2)} #876#return; {263#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:47,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {263#(= ~q_read_ev~0 2)} assume { :begin_inline_init_threads1 } true; {263#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:47,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#(= ~q_read_ev~0 2)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {263#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:47,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#(= ~q_read_ev~0 2)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {263#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:47,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#(= ~q_read_ev~0 2)} assume { :end_inline_init_threads1 } true; {263#(= ~q_read_ev~0 2)} is VALID [2022-02-20 19:56:47,189 INFO L272 TraceCheckUtils]: 12: Hoare triple {263#(= ~q_read_ev~0 2)} call fire_delta_events1(); {303#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:47,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {303#(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; {304#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:47,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {304#(= |old(~q_read_ev~0)| 0)} assume 0 == ~q_write_ev~0;~q_write_ev~0 := 1; {304#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:47,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {304#(= |old(~q_read_ev~0)| 0)} assume true; {304#(= |old(~q_read_ev~0)| 0)} is VALID [2022-02-20 19:56:47,191 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {304#(= |old(~q_read_ev~0)| 0)} {263#(= ~q_read_ev~0 2)} #878#return; {262#false} is VALID [2022-02-20 19:56:47,191 INFO L272 TraceCheckUtils]: 17: Hoare triple {262#false} call activate_threads1(); {305#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:56:47,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {305#(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; {261#true} is VALID [2022-02-20 19:56:47,191 INFO L272 TraceCheckUtils]: 19: Hoare triple {261#true} call #t~ret8 := is_do_write_p_triggered(); {261#true} is VALID [2022-02-20 19:56:47,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {261#true} havoc ~__retres1~0; {261#true} is VALID [2022-02-20 19:56:47,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {261#true} assume 1 == ~p_dw_pc~0; {261#true} is VALID [2022-02-20 19:56:47,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {261#true} assume 1 == ~q_read_ev~0;~__retres1~0 := 1; {261#true} is VALID [2022-02-20 19:56:47,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {261#true} #res := ~__retres1~0; {261#true} is VALID [2022-02-20 19:56:47,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {261#true} assume true; {261#true} is VALID [2022-02-20 19:56:47,192 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {261#true} {261#true} #872#return; {261#true} is VALID [2022-02-20 19:56:47,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {261#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {261#true} is VALID [2022-02-20 19:56:47,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {261#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {261#true} is VALID [2022-02-20 19:56:47,193 INFO L272 TraceCheckUtils]: 28: Hoare triple {261#true} call #t~ret9 := is_do_read_c_triggered(); {261#true} is VALID [2022-02-20 19:56:47,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {261#true} havoc ~__retres1~1; {261#true} is VALID [2022-02-20 19:56:47,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {261#true} assume !(1 == ~c_dr_pc~0); {261#true} is VALID [2022-02-20 19:56:47,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {261#true} ~__retres1~1 := 0; {261#true} is VALID [2022-02-20 19:56:47,194 INFO L290 TraceCheckUtils]: 32: Hoare triple {261#true} #res := ~__retres1~1; {261#true} is VALID [2022-02-20 19:56:47,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {261#true} assume true; {261#true} is VALID [2022-02-20 19:56:47,194 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {261#true} {261#true} #874#return; {261#true} is VALID [2022-02-20 19:56:47,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {261#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {261#true} is VALID [2022-02-20 19:56:47,194 INFO L290 TraceCheckUtils]: 36: Hoare triple {261#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {261#true} is VALID [2022-02-20 19:56:47,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {261#true} assume true; {261#true} is VALID [2022-02-20 19:56:47,195 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {261#true} {262#false} #880#return; {262#false} is VALID [2022-02-20 19:56:47,195 INFO L272 TraceCheckUtils]: 39: Hoare triple {262#false} call reset_delta_events1(); {303#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:47,195 INFO L290 TraceCheckUtils]: 40: Hoare triple {303#(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; {261#true} is VALID [2022-02-20 19:56:47,195 INFO L290 TraceCheckUtils]: 41: Hoare triple {261#true} assume !(1 == ~q_write_ev~0); {261#true} is VALID [2022-02-20 19:56:47,196 INFO L290 TraceCheckUtils]: 42: Hoare triple {261#true} assume true; {261#true} is VALID [2022-02-20 19:56:47,196 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {261#true} {262#false} #882#return; {262#false} is VALID [2022-02-20 19:56:47,196 INFO L290 TraceCheckUtils]: 44: Hoare triple {262#false} assume !false; {262#false} is VALID [2022-02-20 19:56:47,196 INFO L290 TraceCheckUtils]: 45: Hoare triple {262#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; {262#false} is VALID [2022-02-20 19:56:47,196 INFO L290 TraceCheckUtils]: 46: Hoare triple {262#false} assume !false; {262#false} is VALID [2022-02-20 19:56:47,196 INFO L272 TraceCheckUtils]: 47: Hoare triple {262#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {261#true} is VALID [2022-02-20 19:56:47,197 INFO L290 TraceCheckUtils]: 48: Hoare triple {261#true} havoc ~__retres1~2; {261#true} is VALID [2022-02-20 19:56:47,197 INFO L290 TraceCheckUtils]: 49: Hoare triple {261#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {261#true} is VALID [2022-02-20 19:56:47,197 INFO L290 TraceCheckUtils]: 50: Hoare triple {261#true} #res := ~__retres1~2; {261#true} is VALID [2022-02-20 19:56:47,197 INFO L290 TraceCheckUtils]: 51: Hoare triple {261#true} assume true; {261#true} is VALID [2022-02-20 19:56:47,197 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {261#true} {262#false} #884#return; {262#false} is VALID [2022-02-20 19:56:47,198 INFO L290 TraceCheckUtils]: 53: Hoare triple {262#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; {262#false} is VALID [2022-02-20 19:56:47,198 INFO L290 TraceCheckUtils]: 54: Hoare triple {262#false} assume 0 != eval1_~tmp___1~0#1; {262#false} is VALID [2022-02-20 19:56:47,198 INFO L290 TraceCheckUtils]: 55: Hoare triple {262#false} assume !(0 == ~p_dw_st~0); {262#false} is VALID [2022-02-20 19:56:47,198 INFO L290 TraceCheckUtils]: 56: Hoare triple {262#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; {262#false} is VALID [2022-02-20 19:56:47,198 INFO L290 TraceCheckUtils]: 57: Hoare triple {262#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; {262#false} is VALID [2022-02-20 19:56:47,199 INFO L290 TraceCheckUtils]: 58: Hoare triple {262#false} assume 0 == ~c_dr_pc~0; {262#false} is VALID [2022-02-20 19:56:47,199 INFO L290 TraceCheckUtils]: 59: Hoare triple {262#false} assume !false; {262#false} is VALID [2022-02-20 19:56:47,199 INFO L290 TraceCheckUtils]: 60: Hoare triple {262#false} assume !(1 == ~q_free~0); {262#false} is VALID [2022-02-20 19:56:47,199 INFO L290 TraceCheckUtils]: 61: Hoare triple {262#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; {262#false} is VALID [2022-02-20 19:56:47,199 INFO L290 TraceCheckUtils]: 62: Hoare triple {262#false} assume !(~p_last_write~0 == ~c_last_read~0); {262#false} is VALID [2022-02-20 19:56:47,200 INFO L272 TraceCheckUtils]: 63: Hoare triple {262#false} call error1(); {262#false} is VALID [2022-02-20 19:56:47,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {262#false} assume !false; {262#false} is VALID [2022-02-20 19:56:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:56:47,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:47,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788749002] [2022-02-20 19:56:47,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788749002] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:47,202 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:47,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:56:47,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072034234] [2022-02-20 19:56:47,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:47,207 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:56:47,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:47,210 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:56:47,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:47,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:56:47,260 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:47,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:56:47,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:56:47,276 INFO L87 Difference]: Start difference. First operand has 258 states, 210 states have (on average 1.5714285714285714) internal successors, (330), 216 states have internal predecessors, (330), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) 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:56:49,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:49,405 INFO L93 Difference]: Finished difference Result 632 states and 960 transitions. [2022-02-20 19:56:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 19:56:49,405 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:56:49,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:49,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 19:56:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 960 transitions. [2022-02-20 19:56:49,424 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:56:49,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 960 transitions. [2022-02-20 19:56:49,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 960 transitions. [2022-02-20 19:56:50,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 960 edges. 960 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:50,066 INFO L225 Difference]: With dead ends: 632 [2022-02-20 19:56:50,067 INFO L226 Difference]: Without dead ends: 383 [2022-02-20 19:56:50,070 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:56:50,072 INFO L933 BasicCegarLoop]: 368 mSDtfsCounter, 678 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:50,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [683 Valid, 1214 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:56:50,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-02-20 19:56:50,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 344. [2022-02-20 19:56:50,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:50,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states. Second operand has 344 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 284 states have internal predecessors, (403), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2022-02-20 19:56:50,140 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states. Second operand has 344 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 284 states have internal predecessors, (403), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2022-02-20 19:56:50,141 INFO L87 Difference]: Start difference. First operand 383 states. Second operand has 344 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 284 states have internal predecessors, (403), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2022-02-20 19:56:50,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:50,164 INFO L93 Difference]: Finished difference Result 383 states and 544 transitions. [2022-02-20 19:56:50,165 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 544 transitions. [2022-02-20 19:56:50,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:50,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:50,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 284 states have internal predecessors, (403), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) Second operand 383 states. [2022-02-20 19:56:50,175 INFO L87 Difference]: Start difference. First operand has 344 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 284 states have internal predecessors, (403), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) Second operand 383 states. [2022-02-20 19:56:50,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:50,190 INFO L93 Difference]: Finished difference Result 383 states and 544 transitions. [2022-02-20 19:56:50,190 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 544 transitions. [2022-02-20 19:56:50,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:50,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:50,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:50,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 278 states have (on average 1.4496402877697843) internal successors, (403), 284 states have internal predecessors, (403), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2022-02-20 19:56:50,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 490 transitions. [2022-02-20 19:56:50,210 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 490 transitions. Word has length 65 [2022-02-20 19:56:50,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:50,211 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 490 transitions. [2022-02-20 19:56:50,211 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:56:50,219 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 490 transitions. [2022-02-20 19:56:50,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:50,220 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:50,221 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:56:50,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:56:50,221 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:50,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:50,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1779235770, now seen corresponding path program 1 times [2022-02-20 19:56:50,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:50,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737620576] [2022-02-20 19:56:50,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:50,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:50,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:50,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {2477#(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); {2478#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:50,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {2478#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2478#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:50,291 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2478#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2439#(= ~q_write_ev~0 ~q_read_ev~0)} #876#return; {2439#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:50,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:50,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {2478#(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); {2479#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:50,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {2479#(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; {2480#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:50,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {2480#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2480#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:50,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2480#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2439#(= ~q_write_ev~0 ~q_read_ev~0)} #878#return; {2438#false} is VALID [2022-02-20 19:56:50,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:50,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:50,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {2437#true} havoc ~__retres1~0; {2437#true} is VALID [2022-02-20 19:56:50,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {2437#true} assume !(1 == ~p_dw_pc~0); {2437#true} is VALID [2022-02-20 19:56:50,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {2437#true} ~__retres1~0 := 0; {2437#true} is VALID [2022-02-20 19:56:50,327 INFO L290 TraceCheckUtils]: 3: Hoare triple {2437#true} #res := ~__retres1~0; {2437#true} is VALID [2022-02-20 19:56:50,327 INFO L290 TraceCheckUtils]: 4: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 19:56:50,327 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2437#true} {2437#true} #872#return; {2437#true} is VALID [2022-02-20 19:56:50,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:50,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {2437#true} havoc ~__retres1~1; {2437#true} is VALID [2022-02-20 19:56:50,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {2437#true} assume !(1 == ~c_dr_pc~0); {2437#true} is VALID [2022-02-20 19:56:50,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {2437#true} ~__retres1~1 := 0; {2437#true} is VALID [2022-02-20 19:56:50,336 INFO L290 TraceCheckUtils]: 3: Hoare triple {2437#true} #res := ~__retres1~1; {2437#true} is VALID [2022-02-20 19:56:50,336 INFO L290 TraceCheckUtils]: 4: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 19:56:50,336 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2437#true} {2437#true} #874#return; {2437#true} is VALID [2022-02-20 19:56:50,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {2481#(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; {2437#true} is VALID [2022-02-20 19:56:50,337 INFO L272 TraceCheckUtils]: 1: Hoare triple {2437#true} call #t~ret8 := is_do_write_p_triggered(); {2437#true} is VALID [2022-02-20 19:56:50,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {2437#true} havoc ~__retres1~0; {2437#true} is VALID [2022-02-20 19:56:50,337 INFO L290 TraceCheckUtils]: 3: Hoare triple {2437#true} assume !(1 == ~p_dw_pc~0); {2437#true} is VALID [2022-02-20 19:56:50,337 INFO L290 TraceCheckUtils]: 4: Hoare triple {2437#true} ~__retres1~0 := 0; {2437#true} is VALID [2022-02-20 19:56:50,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {2437#true} #res := ~__retres1~0; {2437#true} is VALID [2022-02-20 19:56:50,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 19:56:50,338 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2437#true} {2437#true} #872#return; {2437#true} is VALID [2022-02-20 19:56:50,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {2437#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2437#true} is VALID [2022-02-20 19:56:50,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {2437#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2437#true} is VALID [2022-02-20 19:56:50,338 INFO L272 TraceCheckUtils]: 10: Hoare triple {2437#true} call #t~ret9 := is_do_read_c_triggered(); {2437#true} is VALID [2022-02-20 19:56:50,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {2437#true} havoc ~__retres1~1; {2437#true} is VALID [2022-02-20 19:56:50,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {2437#true} assume !(1 == ~c_dr_pc~0); {2437#true} is VALID [2022-02-20 19:56:50,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {2437#true} ~__retres1~1 := 0; {2437#true} is VALID [2022-02-20 19:56:50,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {2437#true} #res := ~__retres1~1; {2437#true} is VALID [2022-02-20 19:56:50,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 19:56:50,339 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2437#true} {2437#true} #874#return; {2437#true} is VALID [2022-02-20 19:56:50,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {2437#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2437#true} is VALID [2022-02-20 19:56:50,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {2437#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2437#true} is VALID [2022-02-20 19:56:50,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 19:56:50,340 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2437#true} {2438#false} #880#return; {2438#false} is VALID [2022-02-20 19:56:50,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:50,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {2478#(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); {2437#true} is VALID [2022-02-20 19:56:50,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {2437#true} assume !(1 == ~q_write_ev~0); {2437#true} is VALID [2022-02-20 19:56:50,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 19:56:50,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2437#true} {2438#false} #882#return; {2438#false} is VALID [2022-02-20 19:56:50,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:50,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {2437#true} havoc ~__retres1~2; {2437#true} is VALID [2022-02-20 19:56:50,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {2437#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2437#true} is VALID [2022-02-20 19:56:50,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {2437#true} #res := ~__retres1~2; {2437#true} is VALID [2022-02-20 19:56:50,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 19:56:50,354 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2437#true} {2438#false} #884#return; {2438#false} is VALID [2022-02-20 19:56:50,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {2437#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {2437#true} is VALID [2022-02-20 19:56:50,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {2437#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {2437#true} is VALID [2022-02-20 19:56:50,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {2437#true} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {2439#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:50,355 INFO L290 TraceCheckUtils]: 3: Hoare triple {2439#(= ~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; {2439#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:50,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {2439#(= ~q_write_ev~0 ~q_read_ev~0)} call update_channels1(); {2477#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:56:50,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {2477#(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); {2478#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:50,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {2478#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} assume true; {2478#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:50,357 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2478#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} {2439#(= ~q_write_ev~0 ~q_read_ev~0)} #876#return; {2439#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:50,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {2439#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :begin_inline_init_threads1 } true; {2439#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:50,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {2439#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {2439#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:50,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {2439#(= ~q_write_ev~0 ~q_read_ev~0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {2439#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:50,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {2439#(= ~q_write_ev~0 ~q_read_ev~0)} assume { :end_inline_init_threads1 } true; {2439#(= ~q_write_ev~0 ~q_read_ev~0)} is VALID [2022-02-20 19:56:50,358 INFO L272 TraceCheckUtils]: 12: Hoare triple {2439#(= ~q_write_ev~0 ~q_read_ev~0)} call fire_delta_events1(); {2478#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:50,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {2478#(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); {2479#(and (not (= |old(~q_read_ev~0)| 0)) (= ~q_write_ev~0 |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:50,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {2479#(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; {2480#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:50,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {2480#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} assume true; {2480#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} is VALID [2022-02-20 19:56:50,361 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2480#(not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))} {2439#(= ~q_write_ev~0 ~q_read_ev~0)} #878#return; {2438#false} is VALID [2022-02-20 19:56:50,361 INFO L272 TraceCheckUtils]: 17: Hoare triple {2438#false} call activate_threads1(); {2481#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:56:50,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {2481#(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; {2437#true} is VALID [2022-02-20 19:56:50,361 INFO L272 TraceCheckUtils]: 19: Hoare triple {2437#true} call #t~ret8 := is_do_write_p_triggered(); {2437#true} is VALID [2022-02-20 19:56:50,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {2437#true} havoc ~__retres1~0; {2437#true} is VALID [2022-02-20 19:56:50,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {2437#true} assume !(1 == ~p_dw_pc~0); {2437#true} is VALID [2022-02-20 19:56:50,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {2437#true} ~__retres1~0 := 0; {2437#true} is VALID [2022-02-20 19:56:50,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {2437#true} #res := ~__retres1~0; {2437#true} is VALID [2022-02-20 19:56:50,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 19:56:50,364 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {2437#true} {2437#true} #872#return; {2437#true} is VALID [2022-02-20 19:56:50,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {2437#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {2437#true} is VALID [2022-02-20 19:56:50,364 INFO L290 TraceCheckUtils]: 27: Hoare triple {2437#true} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {2437#true} is VALID [2022-02-20 19:56:50,364 INFO L272 TraceCheckUtils]: 28: Hoare triple {2437#true} call #t~ret9 := is_do_read_c_triggered(); {2437#true} is VALID [2022-02-20 19:56:50,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {2437#true} havoc ~__retres1~1; {2437#true} is VALID [2022-02-20 19:56:50,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {2437#true} assume !(1 == ~c_dr_pc~0); {2437#true} is VALID [2022-02-20 19:56:50,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {2437#true} ~__retres1~1 := 0; {2437#true} is VALID [2022-02-20 19:56:50,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {2437#true} #res := ~__retres1~1; {2437#true} is VALID [2022-02-20 19:56:50,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 19:56:50,365 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2437#true} {2437#true} #874#return; {2437#true} is VALID [2022-02-20 19:56:50,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {2437#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {2437#true} is VALID [2022-02-20 19:56:50,368 INFO L290 TraceCheckUtils]: 36: Hoare triple {2437#true} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {2437#true} is VALID [2022-02-20 19:56:50,368 INFO L290 TraceCheckUtils]: 37: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 19:56:50,368 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2437#true} {2438#false} #880#return; {2438#false} is VALID [2022-02-20 19:56:50,368 INFO L272 TraceCheckUtils]: 39: Hoare triple {2438#false} call reset_delta_events1(); {2478#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:50,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {2478#(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); {2437#true} is VALID [2022-02-20 19:56:50,368 INFO L290 TraceCheckUtils]: 41: Hoare triple {2437#true} assume !(1 == ~q_write_ev~0); {2437#true} is VALID [2022-02-20 19:56:50,369 INFO L290 TraceCheckUtils]: 42: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 19:56:50,369 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {2437#true} {2438#false} #882#return; {2438#false} is VALID [2022-02-20 19:56:50,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {2438#false} assume !false; {2438#false} is VALID [2022-02-20 19:56:50,369 INFO L290 TraceCheckUtils]: 45: Hoare triple {2438#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; {2438#false} is VALID [2022-02-20 19:56:50,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {2438#false} assume !false; {2438#false} is VALID [2022-02-20 19:56:50,369 INFO L272 TraceCheckUtils]: 47: Hoare triple {2438#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {2437#true} is VALID [2022-02-20 19:56:50,369 INFO L290 TraceCheckUtils]: 48: Hoare triple {2437#true} havoc ~__retres1~2; {2437#true} is VALID [2022-02-20 19:56:50,370 INFO L290 TraceCheckUtils]: 49: Hoare triple {2437#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {2437#true} is VALID [2022-02-20 19:56:50,370 INFO L290 TraceCheckUtils]: 50: Hoare triple {2437#true} #res := ~__retres1~2; {2437#true} is VALID [2022-02-20 19:56:50,370 INFO L290 TraceCheckUtils]: 51: Hoare triple {2437#true} assume true; {2437#true} is VALID [2022-02-20 19:56:50,370 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2437#true} {2438#false} #884#return; {2438#false} is VALID [2022-02-20 19:56:50,370 INFO L290 TraceCheckUtils]: 53: Hoare triple {2438#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; {2438#false} is VALID [2022-02-20 19:56:50,370 INFO L290 TraceCheckUtils]: 54: Hoare triple {2438#false} assume 0 != eval1_~tmp___1~0#1; {2438#false} is VALID [2022-02-20 19:56:50,370 INFO L290 TraceCheckUtils]: 55: Hoare triple {2438#false} assume !(0 == ~p_dw_st~0); {2438#false} is VALID [2022-02-20 19:56:50,370 INFO L290 TraceCheckUtils]: 56: Hoare triple {2438#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; {2438#false} is VALID [2022-02-20 19:56:50,371 INFO L290 TraceCheckUtils]: 57: Hoare triple {2438#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; {2438#false} is VALID [2022-02-20 19:56:50,371 INFO L290 TraceCheckUtils]: 58: Hoare triple {2438#false} assume 0 == ~c_dr_pc~0; {2438#false} is VALID [2022-02-20 19:56:50,371 INFO L290 TraceCheckUtils]: 59: Hoare triple {2438#false} assume !false; {2438#false} is VALID [2022-02-20 19:56:50,372 INFO L290 TraceCheckUtils]: 60: Hoare triple {2438#false} assume !(1 == ~q_free~0); {2438#false} is VALID [2022-02-20 19:56:50,373 INFO L290 TraceCheckUtils]: 61: Hoare triple {2438#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; {2438#false} is VALID [2022-02-20 19:56:50,373 INFO L290 TraceCheckUtils]: 62: Hoare triple {2438#false} assume !(~p_last_write~0 == ~c_last_read~0); {2438#false} is VALID [2022-02-20 19:56:50,373 INFO L272 TraceCheckUtils]: 63: Hoare triple {2438#false} call error1(); {2438#false} is VALID [2022-02-20 19:56:50,373 INFO L290 TraceCheckUtils]: 64: Hoare triple {2438#false} assume !false; {2438#false} is VALID [2022-02-20 19:56:50,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:56:50,373 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:50,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737620576] [2022-02-20 19:56:50,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737620576] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:50,374 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:50,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:56:50,374 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780015918] [2022-02-20 19:56:50,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:50,375 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:56:50,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:50,376 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:56:50,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:50,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:56:50,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:50,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:56:50,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:56:50,421 INFO L87 Difference]: Start difference. First operand 344 states and 490 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:56:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:52,523 INFO L93 Difference]: Finished difference Result 691 states and 967 transitions. [2022-02-20 19:56:52,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 19:56:52,524 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:56:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:52,524 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:56:52,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 696 transitions. [2022-02-20 19:56:52,531 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:56:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 696 transitions. [2022-02-20 19:56:52,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 696 transitions. [2022-02-20 19:56:52,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 696 edges. 696 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:53,012 INFO L225 Difference]: With dead ends: 691 [2022-02-20 19:56:53,012 INFO L226 Difference]: Without dead ends: 514 [2022-02-20 19:56:53,013 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:56:53,014 INFO L933 BasicCegarLoop]: 368 mSDtfsCounter, 924 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:53,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [945 Valid, 1082 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:56:53,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-02-20 19:56:53,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 440. [2022-02-20 19:56:53,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:53,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 514 states. Second operand has 440 states, 354 states have (on average 1.4322033898305084) internal successors, (507), 362 states have internal predecessors, (507), 53 states have call successors, (53), 28 states have call predecessors, (53), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2022-02-20 19:56:53,035 INFO L74 IsIncluded]: Start isIncluded. First operand 514 states. Second operand has 440 states, 354 states have (on average 1.4322033898305084) internal successors, (507), 362 states have internal predecessors, (507), 53 states have call successors, (53), 28 states have call predecessors, (53), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2022-02-20 19:56:53,036 INFO L87 Difference]: Start difference. First operand 514 states. Second operand has 440 states, 354 states have (on average 1.4322033898305084) internal successors, (507), 362 states have internal predecessors, (507), 53 states have call successors, (53), 28 states have call predecessors, (53), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2022-02-20 19:56:53,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:53,052 INFO L93 Difference]: Finished difference Result 514 states and 727 transitions. [2022-02-20 19:56:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 727 transitions. [2022-02-20 19:56:53,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:53,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:53,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 440 states, 354 states have (on average 1.4322033898305084) internal successors, (507), 362 states have internal predecessors, (507), 53 states have call successors, (53), 28 states have call predecessors, (53), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) Second operand 514 states. [2022-02-20 19:56:53,056 INFO L87 Difference]: Start difference. First operand has 440 states, 354 states have (on average 1.4322033898305084) internal successors, (507), 362 states have internal predecessors, (507), 53 states have call successors, (53), 28 states have call predecessors, (53), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) Second operand 514 states. [2022-02-20 19:56:53,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:53,072 INFO L93 Difference]: Finished difference Result 514 states and 727 transitions. [2022-02-20 19:56:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 727 transitions. [2022-02-20 19:56:53,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:53,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:53,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:53,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 354 states have (on average 1.4322033898305084) internal successors, (507), 362 states have internal predecessors, (507), 53 states have call successors, (53), 28 states have call predecessors, (53), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2022-02-20 19:56:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 624 transitions. [2022-02-20 19:56:53,091 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 624 transitions. Word has length 65 [2022-02-20 19:56:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:53,092 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 624 transitions. [2022-02-20 19:56:53,092 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:56:53,092 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 624 transitions. [2022-02-20 19:56:53,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:53,093 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:53,093 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:56:53,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:56:53,094 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:53,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:53,094 INFO L85 PathProgramCache]: Analyzing trace with hash 487145416, now seen corresponding path program 1 times [2022-02-20 19:56:53,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:53,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632810424] [2022-02-20 19:56:53,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:53,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {5125#(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); {5086#true} is VALID [2022-02-20 19:56:53,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-02-20 19:56:53,132 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5086#true} {5086#true} #876#return; {5086#true} is VALID [2022-02-20 19:56:53,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {5126#(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); {5086#true} is VALID [2022-02-20 19:56:53,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {5086#true} assume !(0 == ~q_write_ev~0); {5086#true} is VALID [2022-02-20 19:56:53,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-02-20 19:56:53,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5086#true} {5086#true} #878#return; {5086#true} is VALID [2022-02-20 19:56:53,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {5086#true} havoc ~__retres1~0; {5086#true} is VALID [2022-02-20 19:56:53,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {5086#true} assume !(1 == ~p_dw_pc~0); {5086#true} is VALID [2022-02-20 19:56:53,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {5086#true} ~__retres1~0 := 0; {5142#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:56:53,211 INFO L290 TraceCheckUtils]: 3: Hoare triple {5142#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {5143#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:53,211 INFO L290 TraceCheckUtils]: 4: Hoare triple {5143#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {5143#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:53,211 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5143#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {5086#true} #872#return; {5134#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:56:53,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {5086#true} havoc ~__retres1~1; {5086#true} is VALID [2022-02-20 19:56:53,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {5086#true} assume !(1 == ~c_dr_pc~0); {5086#true} is VALID [2022-02-20 19:56:53,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {5086#true} ~__retres1~1 := 0; {5086#true} is VALID [2022-02-20 19:56:53,215 INFO L290 TraceCheckUtils]: 3: Hoare triple {5086#true} #res := ~__retres1~1; {5086#true} is VALID [2022-02-20 19:56:53,215 INFO L290 TraceCheckUtils]: 4: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-02-20 19:56:53,215 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5086#true} {5087#false} #874#return; {5087#false} is VALID [2022-02-20 19:56:53,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {5127#(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; {5086#true} is VALID [2022-02-20 19:56:53,216 INFO L272 TraceCheckUtils]: 1: Hoare triple {5086#true} call #t~ret8 := is_do_write_p_triggered(); {5086#true} is VALID [2022-02-20 19:56:53,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {5086#true} havoc ~__retres1~0; {5086#true} is VALID [2022-02-20 19:56:53,216 INFO L290 TraceCheckUtils]: 3: Hoare triple {5086#true} assume !(1 == ~p_dw_pc~0); {5086#true} is VALID [2022-02-20 19:56:53,216 INFO L290 TraceCheckUtils]: 4: Hoare triple {5086#true} ~__retres1~0 := 0; {5142#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:56:53,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {5142#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {5143#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:53,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {5143#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {5143#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:53,217 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5143#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {5086#true} #872#return; {5134#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:56:53,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {5134#(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; {5135#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:56:53,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {5135#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {5087#false} is VALID [2022-02-20 19:56:53,218 INFO L272 TraceCheckUtils]: 10: Hoare triple {5087#false} call #t~ret9 := is_do_read_c_triggered(); {5086#true} is VALID [2022-02-20 19:56:53,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {5086#true} havoc ~__retres1~1; {5086#true} is VALID [2022-02-20 19:56:53,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {5086#true} assume !(1 == ~c_dr_pc~0); {5086#true} is VALID [2022-02-20 19:56:53,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {5086#true} ~__retres1~1 := 0; {5086#true} is VALID [2022-02-20 19:56:53,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {5086#true} #res := ~__retres1~1; {5086#true} is VALID [2022-02-20 19:56:53,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-02-20 19:56:53,219 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5086#true} {5087#false} #874#return; {5087#false} is VALID [2022-02-20 19:56:53,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {5087#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5087#false} is VALID [2022-02-20 19:56:53,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {5087#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5087#false} is VALID [2022-02-20 19:56:53,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {5087#false} assume true; {5087#false} is VALID [2022-02-20 19:56:53,220 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {5087#false} {5086#true} #880#return; {5087#false} is VALID [2022-02-20 19:56:53,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {5126#(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); {5086#true} is VALID [2022-02-20 19:56:53,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {5086#true} assume !(1 == ~q_write_ev~0); {5086#true} is VALID [2022-02-20 19:56:53,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-02-20 19:56:53,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5086#true} {5087#false} #882#return; {5087#false} is VALID [2022-02-20 19:56:53,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:53,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {5086#true} havoc ~__retres1~2; {5086#true} is VALID [2022-02-20 19:56:53,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {5086#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5086#true} is VALID [2022-02-20 19:56:53,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {5086#true} #res := ~__retres1~2; {5086#true} is VALID [2022-02-20 19:56:53,227 INFO L290 TraceCheckUtils]: 3: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-02-20 19:56:53,227 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5086#true} {5087#false} #884#return; {5087#false} is VALID [2022-02-20 19:56:53,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {5086#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {5086#true} is VALID [2022-02-20 19:56:53,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {5086#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {5086#true} is VALID [2022-02-20 19:56:53,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {5086#true} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {5086#true} is VALID [2022-02-20 19:56:53,227 INFO L290 TraceCheckUtils]: 3: Hoare triple {5086#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; {5086#true} is VALID [2022-02-20 19:56:53,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {5086#true} call update_channels1(); {5125#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:56:53,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {5125#(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); {5086#true} is VALID [2022-02-20 19:56:53,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-02-20 19:56:53,228 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5086#true} {5086#true} #876#return; {5086#true} is VALID [2022-02-20 19:56:53,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {5086#true} assume { :begin_inline_init_threads1 } true; {5086#true} is VALID [2022-02-20 19:56:53,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {5086#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {5086#true} is VALID [2022-02-20 19:56:53,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {5086#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {5086#true} is VALID [2022-02-20 19:56:53,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {5086#true} assume { :end_inline_init_threads1 } true; {5086#true} is VALID [2022-02-20 19:56:53,229 INFO L272 TraceCheckUtils]: 12: Hoare triple {5086#true} call fire_delta_events1(); {5126#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:53,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {5126#(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); {5086#true} is VALID [2022-02-20 19:56:53,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {5086#true} assume !(0 == ~q_write_ev~0); {5086#true} is VALID [2022-02-20 19:56:53,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-02-20 19:56:53,230 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5086#true} {5086#true} #878#return; {5086#true} is VALID [2022-02-20 19:56:53,230 INFO L272 TraceCheckUtils]: 17: Hoare triple {5086#true} call activate_threads1(); {5127#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:56:53,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {5127#(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; {5086#true} is VALID [2022-02-20 19:56:53,230 INFO L272 TraceCheckUtils]: 19: Hoare triple {5086#true} call #t~ret8 := is_do_write_p_triggered(); {5086#true} is VALID [2022-02-20 19:56:53,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {5086#true} havoc ~__retres1~0; {5086#true} is VALID [2022-02-20 19:56:53,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {5086#true} assume !(1 == ~p_dw_pc~0); {5086#true} is VALID [2022-02-20 19:56:53,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {5086#true} ~__retres1~0 := 0; {5142#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} is VALID [2022-02-20 19:56:53,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {5142#(and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))} #res := ~__retres1~0; {5143#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:53,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {5143#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} assume true; {5143#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} is VALID [2022-02-20 19:56:53,232 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {5143#(and (<= 0 |is_do_write_p_triggered_#res|) (<= |is_do_write_p_triggered_#res| 0))} {5086#true} #872#return; {5134#(and (<= 0 |activate_threads1_#t~ret8|) (<= |activate_threads1_#t~ret8| 0))} is VALID [2022-02-20 19:56:53,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {5134#(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; {5135#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} is VALID [2022-02-20 19:56:53,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {5135#(and (<= activate_threads1_~tmp~1 0) (< 0 (+ activate_threads1_~tmp~1 1)))} assume 0 != ~tmp~1;~p_dw_st~0 := 0; {5087#false} is VALID [2022-02-20 19:56:53,233 INFO L272 TraceCheckUtils]: 28: Hoare triple {5087#false} call #t~ret9 := is_do_read_c_triggered(); {5086#true} is VALID [2022-02-20 19:56:53,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {5086#true} havoc ~__retres1~1; {5086#true} is VALID [2022-02-20 19:56:53,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {5086#true} assume !(1 == ~c_dr_pc~0); {5086#true} is VALID [2022-02-20 19:56:53,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {5086#true} ~__retres1~1 := 0; {5086#true} is VALID [2022-02-20 19:56:53,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {5086#true} #res := ~__retres1~1; {5086#true} is VALID [2022-02-20 19:56:53,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-02-20 19:56:53,234 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5086#true} {5087#false} #874#return; {5087#false} is VALID [2022-02-20 19:56:53,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {5087#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {5087#false} is VALID [2022-02-20 19:56:53,234 INFO L290 TraceCheckUtils]: 36: Hoare triple {5087#false} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {5087#false} is VALID [2022-02-20 19:56:53,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {5087#false} assume true; {5087#false} is VALID [2022-02-20 19:56:53,234 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5087#false} {5086#true} #880#return; {5087#false} is VALID [2022-02-20 19:56:53,234 INFO L272 TraceCheckUtils]: 39: Hoare triple {5087#false} call reset_delta_events1(); {5126#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:53,234 INFO L290 TraceCheckUtils]: 40: Hoare triple {5126#(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); {5086#true} is VALID [2022-02-20 19:56:53,235 INFO L290 TraceCheckUtils]: 41: Hoare triple {5086#true} assume !(1 == ~q_write_ev~0); {5086#true} is VALID [2022-02-20 19:56:53,235 INFO L290 TraceCheckUtils]: 42: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-02-20 19:56:53,235 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5086#true} {5087#false} #882#return; {5087#false} is VALID [2022-02-20 19:56:53,235 INFO L290 TraceCheckUtils]: 44: Hoare triple {5087#false} assume !false; {5087#false} is VALID [2022-02-20 19:56:53,235 INFO L290 TraceCheckUtils]: 45: Hoare triple {5087#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; {5087#false} is VALID [2022-02-20 19:56:53,235 INFO L290 TraceCheckUtils]: 46: Hoare triple {5087#false} assume !false; {5087#false} is VALID [2022-02-20 19:56:53,235 INFO L272 TraceCheckUtils]: 47: Hoare triple {5087#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {5086#true} is VALID [2022-02-20 19:56:53,235 INFO L290 TraceCheckUtils]: 48: Hoare triple {5086#true} havoc ~__retres1~2; {5086#true} is VALID [2022-02-20 19:56:53,236 INFO L290 TraceCheckUtils]: 49: Hoare triple {5086#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {5086#true} is VALID [2022-02-20 19:56:53,236 INFO L290 TraceCheckUtils]: 50: Hoare triple {5086#true} #res := ~__retres1~2; {5086#true} is VALID [2022-02-20 19:56:53,236 INFO L290 TraceCheckUtils]: 51: Hoare triple {5086#true} assume true; {5086#true} is VALID [2022-02-20 19:56:53,236 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {5086#true} {5087#false} #884#return; {5087#false} is VALID [2022-02-20 19:56:53,236 INFO L290 TraceCheckUtils]: 53: Hoare triple {5087#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; {5087#false} is VALID [2022-02-20 19:56:53,236 INFO L290 TraceCheckUtils]: 54: Hoare triple {5087#false} assume 0 != eval1_~tmp___1~0#1; {5087#false} is VALID [2022-02-20 19:56:53,236 INFO L290 TraceCheckUtils]: 55: Hoare triple {5087#false} assume !(0 == ~p_dw_st~0); {5087#false} is VALID [2022-02-20 19:56:53,237 INFO L290 TraceCheckUtils]: 56: Hoare triple {5087#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; {5087#false} is VALID [2022-02-20 19:56:53,237 INFO L290 TraceCheckUtils]: 57: Hoare triple {5087#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; {5087#false} is VALID [2022-02-20 19:56:53,237 INFO L290 TraceCheckUtils]: 58: Hoare triple {5087#false} assume 0 == ~c_dr_pc~0; {5087#false} is VALID [2022-02-20 19:56:53,237 INFO L290 TraceCheckUtils]: 59: Hoare triple {5087#false} assume !false; {5087#false} is VALID [2022-02-20 19:56:53,237 INFO L290 TraceCheckUtils]: 60: Hoare triple {5087#false} assume !(1 == ~q_free~0); {5087#false} is VALID [2022-02-20 19:56:53,237 INFO L290 TraceCheckUtils]: 61: Hoare triple {5087#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; {5087#false} is VALID [2022-02-20 19:56:53,237 INFO L290 TraceCheckUtils]: 62: Hoare triple {5087#false} assume !(~p_last_write~0 == ~c_last_read~0); {5087#false} is VALID [2022-02-20 19:56:53,237 INFO L272 TraceCheckUtils]: 63: Hoare triple {5087#false} call error1(); {5087#false} is VALID [2022-02-20 19:56:53,238 INFO L290 TraceCheckUtils]: 64: Hoare triple {5087#false} assume !false; {5087#false} is VALID [2022-02-20 19:56:53,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:56:53,238 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:53,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632810424] [2022-02-20 19:56:53,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632810424] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:53,238 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:53,238 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:56:53,239 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99574462] [2022-02-20 19:56:53,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:53,239 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:56:53,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:53,240 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:56:53,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:53,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:56:53,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:53,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:56:53,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:56:53,274 INFO L87 Difference]: Start difference. First operand 440 states and 624 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:56:55,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:55,270 INFO L93 Difference]: Finished difference Result 741 states and 1038 transitions. [2022-02-20 19:56:55,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:56:55,271 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:56:55,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:55,272 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:56:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 514 transitions. [2022-02-20 19:56:55,283 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:56:55,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 514 transitions. [2022-02-20 19:56:55,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 514 transitions. [2022-02-20 19:56:55,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 514 edges. 514 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:55,626 INFO L225 Difference]: With dead ends: 741 [2022-02-20 19:56:55,626 INFO L226 Difference]: Without dead ends: 474 [2022-02-20 19:56:55,627 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:56:55,627 INFO L933 BasicCegarLoop]: 343 mSDtfsCounter, 429 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:55,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 1394 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:56:55,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-02-20 19:56:55,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 445. [2022-02-20 19:56:55,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:55,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 474 states. Second operand has 445 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 366 states have internal predecessors, (509), 53 states have call successors, (53), 28 states have call predecessors, (53), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2022-02-20 19:56:55,648 INFO L74 IsIncluded]: Start isIncluded. First operand 474 states. Second operand has 445 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 366 states have internal predecessors, (509), 53 states have call successors, (53), 28 states have call predecessors, (53), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2022-02-20 19:56:55,648 INFO L87 Difference]: Start difference. First operand 474 states. Second operand has 445 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 366 states have internal predecessors, (509), 53 states have call successors, (53), 28 states have call predecessors, (53), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2022-02-20 19:56:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:55,660 INFO L93 Difference]: Finished difference Result 474 states and 668 transitions. [2022-02-20 19:56:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 668 transitions. [2022-02-20 19:56:55,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:55,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:55,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 445 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 366 states have internal predecessors, (509), 53 states have call successors, (53), 28 states have call predecessors, (53), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) Second operand 474 states. [2022-02-20 19:56:55,663 INFO L87 Difference]: Start difference. First operand has 445 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 366 states have internal predecessors, (509), 53 states have call successors, (53), 28 states have call predecessors, (53), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) Second operand 474 states. [2022-02-20 19:56:55,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:55,674 INFO L93 Difference]: Finished difference Result 474 states and 668 transitions. [2022-02-20 19:56:55,674 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 668 transitions. [2022-02-20 19:56:55,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:55,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:55,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:55,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 366 states have internal predecessors, (509), 53 states have call successors, (53), 28 states have call predecessors, (53), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2022-02-20 19:56:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 627 transitions. [2022-02-20 19:56:55,687 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 627 transitions. Word has length 65 [2022-02-20 19:56:55,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:55,688 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 627 transitions. [2022-02-20 19:56:55,688 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:56:55,688 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 627 transitions. [2022-02-20 19:56:55,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:55,689 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:55,689 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:56:55,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:56:55,689 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:55,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:55,690 INFO L85 PathProgramCache]: Analyzing trace with hash -542213882, now seen corresponding path program 1 times [2022-02-20 19:56:55,690 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:55,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90410334] [2022-02-20 19:56:55,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:55,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {7759#(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); {7720#true} is VALID [2022-02-20 19:56:55,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {7720#true} assume true; {7720#true} is VALID [2022-02-20 19:56:55,721 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7720#true} {7720#true} #876#return; {7720#true} is VALID [2022-02-20 19:56:55,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {7760#(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); {7720#true} is VALID [2022-02-20 19:56:55,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {7720#true} assume !(0 == ~q_write_ev~0); {7720#true} is VALID [2022-02-20 19:56:55,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {7720#true} assume true; {7720#true} is VALID [2022-02-20 19:56:55,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7720#true} {7720#true} #878#return; {7720#true} is VALID [2022-02-20 19:56:55,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {7720#true} havoc ~__retres1~0; {7720#true} is VALID [2022-02-20 19:56:55,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {7720#true} assume !(1 == ~p_dw_pc~0); {7720#true} is VALID [2022-02-20 19:56:55,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {7720#true} ~__retres1~0 := 0; {7720#true} is VALID [2022-02-20 19:56:55,783 INFO L290 TraceCheckUtils]: 3: Hoare triple {7720#true} #res := ~__retres1~0; {7720#true} is VALID [2022-02-20 19:56:55,783 INFO L290 TraceCheckUtils]: 4: Hoare triple {7720#true} assume true; {7720#true} is VALID [2022-02-20 19:56:55,783 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7720#true} {7720#true} #872#return; {7720#true} is VALID [2022-02-20 19:56:55,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {7720#true} havoc ~__retres1~1; {7720#true} is VALID [2022-02-20 19:56:55,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {7720#true} assume !(1 == ~c_dr_pc~0); {7720#true} is VALID [2022-02-20 19:56:55,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {7720#true} ~__retres1~1 := 0; {7776#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:56:55,821 INFO L290 TraceCheckUtils]: 3: Hoare triple {7776#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {7777#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:55,821 INFO L290 TraceCheckUtils]: 4: Hoare triple {7777#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {7777#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:55,821 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7777#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {7720#true} #874#return; {7774#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:56:55,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {7761#(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; {7720#true} is VALID [2022-02-20 19:56:55,822 INFO L272 TraceCheckUtils]: 1: Hoare triple {7720#true} call #t~ret8 := is_do_write_p_triggered(); {7720#true} is VALID [2022-02-20 19:56:55,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {7720#true} havoc ~__retres1~0; {7720#true} is VALID [2022-02-20 19:56:55,823 INFO L290 TraceCheckUtils]: 3: Hoare triple {7720#true} assume !(1 == ~p_dw_pc~0); {7720#true} is VALID [2022-02-20 19:56:55,823 INFO L290 TraceCheckUtils]: 4: Hoare triple {7720#true} ~__retres1~0 := 0; {7720#true} is VALID [2022-02-20 19:56:55,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {7720#true} #res := ~__retres1~0; {7720#true} is VALID [2022-02-20 19:56:55,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {7720#true} assume true; {7720#true} is VALID [2022-02-20 19:56:55,823 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7720#true} {7720#true} #872#return; {7720#true} is VALID [2022-02-20 19:56:55,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {7720#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7720#true} is VALID [2022-02-20 19:56:55,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {7720#true} assume !(0 != ~tmp~1); {7720#true} is VALID [2022-02-20 19:56:55,823 INFO L272 TraceCheckUtils]: 10: Hoare triple {7720#true} call #t~ret9 := is_do_read_c_triggered(); {7720#true} is VALID [2022-02-20 19:56:55,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {7720#true} havoc ~__retres1~1; {7720#true} is VALID [2022-02-20 19:56:55,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {7720#true} assume !(1 == ~c_dr_pc~0); {7720#true} is VALID [2022-02-20 19:56:55,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {7720#true} ~__retres1~1 := 0; {7776#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:56:55,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {7776#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {7777#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:55,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {7777#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {7777#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:55,832 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7777#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {7720#true} #874#return; {7774#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:56:55,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {7774#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7775#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:56:55,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {7775#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7721#false} is VALID [2022-02-20 19:56:55,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {7721#false} assume true; {7721#false} is VALID [2022-02-20 19:56:55,834 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {7721#false} {7720#true} #880#return; {7721#false} is VALID [2022-02-20 19:56:55,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {7760#(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); {7720#true} is VALID [2022-02-20 19:56:55,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {7720#true} assume !(1 == ~q_write_ev~0); {7720#true} is VALID [2022-02-20 19:56:55,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {7720#true} assume true; {7720#true} is VALID [2022-02-20 19:56:55,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7720#true} {7721#false} #882#return; {7721#false} is VALID [2022-02-20 19:56:55,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:55,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {7720#true} havoc ~__retres1~2; {7720#true} is VALID [2022-02-20 19:56:55,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {7720#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7720#true} is VALID [2022-02-20 19:56:55,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {7720#true} #res := ~__retres1~2; {7720#true} is VALID [2022-02-20 19:56:55,840 INFO L290 TraceCheckUtils]: 3: Hoare triple {7720#true} assume true; {7720#true} is VALID [2022-02-20 19:56:55,840 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {7720#true} {7721#false} #884#return; {7721#false} is VALID [2022-02-20 19:56:55,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {7720#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {7720#true} is VALID [2022-02-20 19:56:55,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {7720#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {7720#true} is VALID [2022-02-20 19:56:55,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {7720#true} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {7720#true} is VALID [2022-02-20 19:56:55,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {7720#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; {7720#true} is VALID [2022-02-20 19:56:55,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {7720#true} call update_channels1(); {7759#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:56:55,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {7759#(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); {7720#true} is VALID [2022-02-20 19:56:55,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {7720#true} assume true; {7720#true} is VALID [2022-02-20 19:56:55,842 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {7720#true} {7720#true} #876#return; {7720#true} is VALID [2022-02-20 19:56:55,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {7720#true} assume { :begin_inline_init_threads1 } true; {7720#true} is VALID [2022-02-20 19:56:55,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {7720#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {7720#true} is VALID [2022-02-20 19:56:55,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {7720#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {7720#true} is VALID [2022-02-20 19:56:55,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {7720#true} assume { :end_inline_init_threads1 } true; {7720#true} is VALID [2022-02-20 19:56:55,842 INFO L272 TraceCheckUtils]: 12: Hoare triple {7720#true} call fire_delta_events1(); {7760#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:55,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {7760#(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); {7720#true} is VALID [2022-02-20 19:56:55,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {7720#true} assume !(0 == ~q_write_ev~0); {7720#true} is VALID [2022-02-20 19:56:55,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {7720#true} assume true; {7720#true} is VALID [2022-02-20 19:56:55,843 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7720#true} {7720#true} #878#return; {7720#true} is VALID [2022-02-20 19:56:55,843 INFO L272 TraceCheckUtils]: 17: Hoare triple {7720#true} call activate_threads1(); {7761#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:56:55,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {7761#(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; {7720#true} is VALID [2022-02-20 19:56:55,843 INFO L272 TraceCheckUtils]: 19: Hoare triple {7720#true} call #t~ret8 := is_do_write_p_triggered(); {7720#true} is VALID [2022-02-20 19:56:55,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {7720#true} havoc ~__retres1~0; {7720#true} is VALID [2022-02-20 19:56:55,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {7720#true} assume !(1 == ~p_dw_pc~0); {7720#true} is VALID [2022-02-20 19:56:55,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {7720#true} ~__retres1~0 := 0; {7720#true} is VALID [2022-02-20 19:56:55,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {7720#true} #res := ~__retres1~0; {7720#true} is VALID [2022-02-20 19:56:55,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {7720#true} assume true; {7720#true} is VALID [2022-02-20 19:56:55,844 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {7720#true} {7720#true} #872#return; {7720#true} is VALID [2022-02-20 19:56:55,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {7720#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {7720#true} is VALID [2022-02-20 19:56:55,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {7720#true} assume !(0 != ~tmp~1); {7720#true} is VALID [2022-02-20 19:56:55,844 INFO L272 TraceCheckUtils]: 28: Hoare triple {7720#true} call #t~ret9 := is_do_read_c_triggered(); {7720#true} is VALID [2022-02-20 19:56:55,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {7720#true} havoc ~__retres1~1; {7720#true} is VALID [2022-02-20 19:56:55,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {7720#true} assume !(1 == ~c_dr_pc~0); {7720#true} is VALID [2022-02-20 19:56:55,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {7720#true} ~__retres1~1 := 0; {7776#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} is VALID [2022-02-20 19:56:55,845 INFO L290 TraceCheckUtils]: 32: Hoare triple {7776#(and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))} #res := ~__retres1~1; {7777#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:55,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {7777#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} assume true; {7777#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} is VALID [2022-02-20 19:56:55,846 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {7777#(and (<= |is_do_read_c_triggered_#res| 0) (<= 0 |is_do_read_c_triggered_#res|))} {7720#true} #874#return; {7774#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} is VALID [2022-02-20 19:56:55,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {7774#(and (<= 0 |activate_threads1_#t~ret9|) (<= |activate_threads1_#t~ret9| 0))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {7775#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} is VALID [2022-02-20 19:56:55,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {7775#(and (< 0 (+ activate_threads1_~tmp___0~1 1)) (<= activate_threads1_~tmp___0~1 0))} assume 0 != ~tmp___0~1;~c_dr_st~0 := 0; {7721#false} is VALID [2022-02-20 19:56:55,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {7721#false} assume true; {7721#false} is VALID [2022-02-20 19:56:55,861 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7721#false} {7720#true} #880#return; {7721#false} is VALID [2022-02-20 19:56:55,861 INFO L272 TraceCheckUtils]: 39: Hoare triple {7721#false} call reset_delta_events1(); {7760#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:55,861 INFO L290 TraceCheckUtils]: 40: Hoare triple {7760#(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); {7720#true} is VALID [2022-02-20 19:56:55,861 INFO L290 TraceCheckUtils]: 41: Hoare triple {7720#true} assume !(1 == ~q_write_ev~0); {7720#true} is VALID [2022-02-20 19:56:55,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {7720#true} assume true; {7720#true} is VALID [2022-02-20 19:56:55,861 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7720#true} {7721#false} #882#return; {7721#false} is VALID [2022-02-20 19:56:55,862 INFO L290 TraceCheckUtils]: 44: Hoare triple {7721#false} assume !false; {7721#false} is VALID [2022-02-20 19:56:55,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {7721#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; {7721#false} is VALID [2022-02-20 19:56:55,862 INFO L290 TraceCheckUtils]: 46: Hoare triple {7721#false} assume !false; {7721#false} is VALID [2022-02-20 19:56:55,862 INFO L272 TraceCheckUtils]: 47: Hoare triple {7721#false} call eval1_#t~ret10#1 := exists_runnable_thread1(); {7720#true} is VALID [2022-02-20 19:56:55,862 INFO L290 TraceCheckUtils]: 48: Hoare triple {7720#true} havoc ~__retres1~2; {7720#true} is VALID [2022-02-20 19:56:55,862 INFO L290 TraceCheckUtils]: 49: Hoare triple {7720#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {7720#true} is VALID [2022-02-20 19:56:55,862 INFO L290 TraceCheckUtils]: 50: Hoare triple {7720#true} #res := ~__retres1~2; {7720#true} is VALID [2022-02-20 19:56:55,862 INFO L290 TraceCheckUtils]: 51: Hoare triple {7720#true} assume true; {7720#true} is VALID [2022-02-20 19:56:55,862 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7720#true} {7721#false} #884#return; {7721#false} is VALID [2022-02-20 19:56:55,863 INFO L290 TraceCheckUtils]: 53: Hoare triple {7721#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; {7721#false} is VALID [2022-02-20 19:56:55,863 INFO L290 TraceCheckUtils]: 54: Hoare triple {7721#false} assume 0 != eval1_~tmp___1~0#1; {7721#false} is VALID [2022-02-20 19:56:55,863 INFO L290 TraceCheckUtils]: 55: Hoare triple {7721#false} assume !(0 == ~p_dw_st~0); {7721#false} is VALID [2022-02-20 19:56:55,863 INFO L290 TraceCheckUtils]: 56: Hoare triple {7721#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; {7721#false} is VALID [2022-02-20 19:56:55,863 INFO L290 TraceCheckUtils]: 57: Hoare triple {7721#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; {7721#false} is VALID [2022-02-20 19:56:55,863 INFO L290 TraceCheckUtils]: 58: Hoare triple {7721#false} assume 0 == ~c_dr_pc~0; {7721#false} is VALID [2022-02-20 19:56:55,863 INFO L290 TraceCheckUtils]: 59: Hoare triple {7721#false} assume !false; {7721#false} is VALID [2022-02-20 19:56:55,863 INFO L290 TraceCheckUtils]: 60: Hoare triple {7721#false} assume !(1 == ~q_free~0); {7721#false} is VALID [2022-02-20 19:56:55,863 INFO L290 TraceCheckUtils]: 61: Hoare triple {7721#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; {7721#false} is VALID [2022-02-20 19:56:55,863 INFO L290 TraceCheckUtils]: 62: Hoare triple {7721#false} assume !(~p_last_write~0 == ~c_last_read~0); {7721#false} is VALID [2022-02-20 19:56:55,864 INFO L272 TraceCheckUtils]: 63: Hoare triple {7721#false} call error1(); {7721#false} is VALID [2022-02-20 19:56:55,864 INFO L290 TraceCheckUtils]: 64: Hoare triple {7721#false} assume !false; {7721#false} is VALID [2022-02-20 19:56:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:56:55,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:55,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90410334] [2022-02-20 19:56:55,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90410334] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:55,865 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:55,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 19:56:55,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471172341] [2022-02-20 19:56:55,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:55,865 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:56:55,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:55,866 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:56:55,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:55,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 19:56:55,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:55,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 19:56:55,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 19:56:55,899 INFO L87 Difference]: Start difference. First operand 445 states and 627 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:56:57,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:57,766 INFO L93 Difference]: Finished difference Result 763 states and 1060 transitions. [2022-02-20 19:56:57,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:56:57,767 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:56:57,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:57,767 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:56:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 518 transitions. [2022-02-20 19:56:57,770 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:56:57,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 518 transitions. [2022-02-20 19:56:57,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 518 transitions. [2022-02-20 19:56:58,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 518 edges. 518 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:58,107 INFO L225 Difference]: With dead ends: 763 [2022-02-20 19:56:58,107 INFO L226 Difference]: Without dead ends: 491 [2022-02-20 19:56:58,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-02-20 19:56:58,116 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 430 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 19:56:58,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [432 Valid, 1392 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 19:56:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-02-20 19:56:58,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 460. [2022-02-20 19:56:58,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:56:58,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 491 states. Second operand has 460 states, 370 states have (on average 1.4081081081081082) internal successors, (521), 378 states have internal predecessors, (521), 53 states have call successors, (53), 28 states have call predecessors, (53), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2022-02-20 19:56:58,144 INFO L74 IsIncluded]: Start isIncluded. First operand 491 states. Second operand has 460 states, 370 states have (on average 1.4081081081081082) internal successors, (521), 378 states have internal predecessors, (521), 53 states have call successors, (53), 28 states have call predecessors, (53), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2022-02-20 19:56:58,145 INFO L87 Difference]: Start difference. First operand 491 states. Second operand has 460 states, 370 states have (on average 1.4081081081081082) internal successors, (521), 378 states have internal predecessors, (521), 53 states have call successors, (53), 28 states have call predecessors, (53), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2022-02-20 19:56:58,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:58,156 INFO L93 Difference]: Finished difference Result 491 states and 686 transitions. [2022-02-20 19:56:58,156 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 686 transitions. [2022-02-20 19:56:58,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:58,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:58,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 460 states, 370 states have (on average 1.4081081081081082) internal successors, (521), 378 states have internal predecessors, (521), 53 states have call successors, (53), 28 states have call predecessors, (53), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) Second operand 491 states. [2022-02-20 19:56:58,158 INFO L87 Difference]: Start difference. First operand has 460 states, 370 states have (on average 1.4081081081081082) internal successors, (521), 378 states have internal predecessors, (521), 53 states have call successors, (53), 28 states have call predecessors, (53), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) Second operand 491 states. [2022-02-20 19:56:58,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:58,170 INFO L93 Difference]: Finished difference Result 491 states and 686 transitions. [2022-02-20 19:56:58,170 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 686 transitions. [2022-02-20 19:56:58,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:56:58,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:56:58,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:56:58,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:56:58,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 370 states have (on average 1.4081081081081082) internal successors, (521), 378 states have internal predecessors, (521), 53 states have call successors, (53), 28 states have call predecessors, (53), 35 states have return successors, (68), 57 states have call predecessors, (68), 51 states have call successors, (68) [2022-02-20 19:56:58,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 642 transitions. [2022-02-20 19:56:58,184 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 642 transitions. Word has length 65 [2022-02-20 19:56:58,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:56:58,184 INFO L470 AbstractCegarLoop]: Abstraction has 460 states and 642 transitions. [2022-02-20 19:56:58,184 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:56:58,184 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 642 transitions. [2022-02-20 19:56:58,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-02-20 19:56:58,186 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:56:58,186 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:56:58,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:56:58,186 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:56:58,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:56:58,187 INFO L85 PathProgramCache]: Analyzing trace with hash 843989512, now seen corresponding path program 1 times [2022-02-20 19:56:58,187 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:56:58,187 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207841712] [2022-02-20 19:56:58,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:56:58,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:56:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:56:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {10474#(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); {10434#true} is VALID [2022-02-20 19:56:58,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-02-20 19:56:58,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10434#true} {10434#true} #876#return; {10434#true} is VALID [2022-02-20 19:56:58,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:56:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {10475#(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); {10434#true} is VALID [2022-02-20 19:56:58,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {10434#true} assume !(0 == ~q_write_ev~0); {10434#true} is VALID [2022-02-20 19:56:58,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-02-20 19:56:58,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10434#true} {10439#(= ~p_dw_st~0 0)} #878#return; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:56:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:56:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {10434#true} havoc ~__retres1~0; {10434#true} is VALID [2022-02-20 19:56:58,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {10434#true} assume !(1 == ~p_dw_pc~0); {10434#true} is VALID [2022-02-20 19:56:58,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {10434#true} ~__retres1~0 := 0; {10434#true} is VALID [2022-02-20 19:56:58,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {10434#true} #res := ~__retres1~0; {10434#true} is VALID [2022-02-20 19:56:58,266 INFO L290 TraceCheckUtils]: 4: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-02-20 19:56:58,267 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10434#true} {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #872#return; {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:58,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:56:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {10434#true} havoc ~__retres1~1; {10434#true} is VALID [2022-02-20 19:56:58,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {10434#true} assume !(1 == ~c_dr_pc~0); {10434#true} is VALID [2022-02-20 19:56:58,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {10434#true} ~__retres1~1 := 0; {10434#true} is VALID [2022-02-20 19:56:58,270 INFO L290 TraceCheckUtils]: 3: Hoare triple {10434#true} #res := ~__retres1~1; {10434#true} is VALID [2022-02-20 19:56:58,270 INFO L290 TraceCheckUtils]: 4: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-02-20 19:56:58,270 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {10434#true} {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #874#return; {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:58,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {10476#(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; {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:58,271 INFO L272 TraceCheckUtils]: 1: Hoare triple {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {10434#true} is VALID [2022-02-20 19:56:58,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {10434#true} havoc ~__retres1~0; {10434#true} is VALID [2022-02-20 19:56:58,271 INFO L290 TraceCheckUtils]: 3: Hoare triple {10434#true} assume !(1 == ~p_dw_pc~0); {10434#true} is VALID [2022-02-20 19:56:58,271 INFO L290 TraceCheckUtils]: 4: Hoare triple {10434#true} ~__retres1~0 := 0; {10434#true} is VALID [2022-02-20 19:56:58,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {10434#true} #res := ~__retres1~0; {10434#true} is VALID [2022-02-20 19:56:58,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-02-20 19:56:58,272 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10434#true} {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #872#return; {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:58,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:58,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:58,272 INFO L272 TraceCheckUtils]: 10: Hoare triple {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {10434#true} is VALID [2022-02-20 19:56:58,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {10434#true} havoc ~__retres1~1; {10434#true} is VALID [2022-02-20 19:56:58,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {10434#true} assume !(1 == ~c_dr_pc~0); {10434#true} is VALID [2022-02-20 19:56:58,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {10434#true} ~__retres1~1 := 0; {10434#true} is VALID [2022-02-20 19:56:58,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {10434#true} #res := ~__retres1~1; {10434#true} is VALID [2022-02-20 19:56:58,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-02-20 19:56:58,273 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10434#true} {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #874#return; {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:58,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:58,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:58,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:58,274 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {10439#(= ~p_dw_st~0 0)} #880#return; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:56:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {10475#(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); {10434#true} is VALID [2022-02-20 19:56:58,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {10434#true} assume !(1 == ~q_write_ev~0); {10434#true} is VALID [2022-02-20 19:56:58,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-02-20 19:56:58,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10434#true} {10439#(= ~p_dw_st~0 0)} #882#return; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:56:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:56:58,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {10434#true} havoc ~__retres1~2; {10434#true} is VALID [2022-02-20 19:56:58,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {10434#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {10439#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {10439#(= ~p_dw_st~0 0)} assume true; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,286 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10439#(= ~p_dw_st~0 0)} {10439#(= ~p_dw_st~0 0)} #884#return; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {10434#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {10434#true} is VALID [2022-02-20 19:56:58,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {10434#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {10434#true} is VALID [2022-02-20 19:56:58,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {10434#true} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {10434#true} is VALID [2022-02-20 19:56:58,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {10434#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; {10434#true} is VALID [2022-02-20 19:56:58,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {10434#true} call update_channels1(); {10474#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:56:58,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {10474#(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); {10434#true} is VALID [2022-02-20 19:56:58,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-02-20 19:56:58,287 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10434#true} {10434#true} #876#return; {10434#true} is VALID [2022-02-20 19:56:58,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {10434#true} assume { :begin_inline_init_threads1 } true; {10434#true} is VALID [2022-02-20 19:56:58,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {10434#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {10439#(= ~p_dw_st~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {10439#(= ~p_dw_st~0 0)} assume { :end_inline_init_threads1 } true; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,289 INFO L272 TraceCheckUtils]: 12: Hoare triple {10439#(= ~p_dw_st~0 0)} call fire_delta_events1(); {10475#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:58,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {10475#(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); {10434#true} is VALID [2022-02-20 19:56:58,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {10434#true} assume !(0 == ~q_write_ev~0); {10434#true} is VALID [2022-02-20 19:56:58,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-02-20 19:56:58,289 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10434#true} {10439#(= ~p_dw_st~0 0)} #878#return; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,290 INFO L272 TraceCheckUtils]: 17: Hoare triple {10439#(= ~p_dw_st~0 0)} call activate_threads1(); {10476#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:56:58,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {10476#(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; {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:58,290 INFO L272 TraceCheckUtils]: 19: Hoare triple {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret8 := is_do_write_p_triggered(); {10434#true} is VALID [2022-02-20 19:56:58,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {10434#true} havoc ~__retres1~0; {10434#true} is VALID [2022-02-20 19:56:58,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {10434#true} assume !(1 == ~p_dw_pc~0); {10434#true} is VALID [2022-02-20 19:56:58,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {10434#true} ~__retres1~0 := 0; {10434#true} is VALID [2022-02-20 19:56:58,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {10434#true} #res := ~__retres1~0; {10434#true} is VALID [2022-02-20 19:56:58,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-02-20 19:56:58,291 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10434#true} {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #872#return; {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:58,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:58,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp~1); {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:58,291 INFO L272 TraceCheckUtils]: 28: Hoare triple {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} call #t~ret9 := is_do_read_c_triggered(); {10434#true} is VALID [2022-02-20 19:56:58,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {10434#true} havoc ~__retres1~1; {10434#true} is VALID [2022-02-20 19:56:58,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {10434#true} assume !(1 == ~c_dr_pc~0); {10434#true} is VALID [2022-02-20 19:56:58,292 INFO L290 TraceCheckUtils]: 31: Hoare triple {10434#true} ~__retres1~1 := 0; {10434#true} is VALID [2022-02-20 19:56:58,292 INFO L290 TraceCheckUtils]: 32: Hoare triple {10434#true} #res := ~__retres1~1; {10434#true} is VALID [2022-02-20 19:56:58,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-02-20 19:56:58,292 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10434#true} {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} #874#return; {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:58,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:58,293 INFO L290 TraceCheckUtils]: 36: Hoare triple {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume !(0 != ~tmp___0~1); {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:58,293 INFO L290 TraceCheckUtils]: 37: Hoare triple {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} assume true; {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} is VALID [2022-02-20 19:56:58,293 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10477#(= |old(~p_dw_st~0)| ~p_dw_st~0)} {10439#(= ~p_dw_st~0 0)} #880#return; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,294 INFO L272 TraceCheckUtils]: 39: Hoare triple {10439#(= ~p_dw_st~0 0)} call reset_delta_events1(); {10475#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:56:58,294 INFO L290 TraceCheckUtils]: 40: Hoare triple {10475#(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); {10434#true} is VALID [2022-02-20 19:56:58,294 INFO L290 TraceCheckUtils]: 41: Hoare triple {10434#true} assume !(1 == ~q_write_ev~0); {10434#true} is VALID [2022-02-20 19:56:58,294 INFO L290 TraceCheckUtils]: 42: Hoare triple {10434#true} assume true; {10434#true} is VALID [2022-02-20 19:56:58,294 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {10434#true} {10439#(= ~p_dw_st~0 0)} #882#return; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,295 INFO L290 TraceCheckUtils]: 44: Hoare triple {10439#(= ~p_dw_st~0 0)} assume !false; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,295 INFO L290 TraceCheckUtils]: 45: Hoare triple {10439#(= ~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; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,295 INFO L290 TraceCheckUtils]: 46: Hoare triple {10439#(= ~p_dw_st~0 0)} assume !false; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,295 INFO L272 TraceCheckUtils]: 47: Hoare triple {10439#(= ~p_dw_st~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {10434#true} is VALID [2022-02-20 19:56:58,295 INFO L290 TraceCheckUtils]: 48: Hoare triple {10434#true} havoc ~__retres1~2; {10434#true} is VALID [2022-02-20 19:56:58,296 INFO L290 TraceCheckUtils]: 49: Hoare triple {10434#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,296 INFO L290 TraceCheckUtils]: 50: Hoare triple {10439#(= ~p_dw_st~0 0)} #res := ~__retres1~2; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,296 INFO L290 TraceCheckUtils]: 51: Hoare triple {10439#(= ~p_dw_st~0 0)} assume true; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,296 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10439#(= ~p_dw_st~0 0)} {10439#(= ~p_dw_st~0 0)} #884#return; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,297 INFO L290 TraceCheckUtils]: 53: Hoare triple {10439#(= ~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; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,297 INFO L290 TraceCheckUtils]: 54: Hoare triple {10439#(= ~p_dw_st~0 0)} assume 0 != eval1_~tmp___1~0#1; {10439#(= ~p_dw_st~0 0)} is VALID [2022-02-20 19:56:58,297 INFO L290 TraceCheckUtils]: 55: Hoare triple {10439#(= ~p_dw_st~0 0)} assume !(0 == ~p_dw_st~0); {10435#false} is VALID [2022-02-20 19:56:58,297 INFO L290 TraceCheckUtils]: 56: Hoare triple {10435#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; {10435#false} is VALID [2022-02-20 19:56:58,297 INFO L290 TraceCheckUtils]: 57: Hoare triple {10435#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; {10435#false} is VALID [2022-02-20 19:56:58,297 INFO L290 TraceCheckUtils]: 58: Hoare triple {10435#false} assume 0 == ~c_dr_pc~0; {10435#false} is VALID [2022-02-20 19:56:58,297 INFO L290 TraceCheckUtils]: 59: Hoare triple {10435#false} assume !false; {10435#false} is VALID [2022-02-20 19:56:58,298 INFO L290 TraceCheckUtils]: 60: Hoare triple {10435#false} assume !(1 == ~q_free~0); {10435#false} is VALID [2022-02-20 19:56:58,298 INFO L290 TraceCheckUtils]: 61: Hoare triple {10435#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; {10435#false} is VALID [2022-02-20 19:56:58,298 INFO L290 TraceCheckUtils]: 62: Hoare triple {10435#false} assume !(~p_last_write~0 == ~c_last_read~0); {10435#false} is VALID [2022-02-20 19:56:58,298 INFO L272 TraceCheckUtils]: 63: Hoare triple {10435#false} call error1(); {10435#false} is VALID [2022-02-20 19:56:58,298 INFO L290 TraceCheckUtils]: 64: Hoare triple {10435#false} assume !false; {10435#false} is VALID [2022-02-20 19:56:58,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:56:58,299 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:56:58,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207841712] [2022-02-20 19:56:58,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207841712] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:56:58,299 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:56:58,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:56:58,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94523142] [2022-02-20 19:56:58,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:56:58,300 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:56:58,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:56:58,300 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:56:58,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:56:58,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:56:58,338 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:56:58,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:56:58,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:56:58,338 INFO L87 Difference]: Start difference. First operand 460 states and 642 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:56:59,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:56:59,722 INFO L93 Difference]: Finished difference Result 1074 states and 1461 transitions. [2022-02-20 19:56:59,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 19:56:59,722 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:56:59,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:56:59,723 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:56:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 640 transitions. [2022-02-20 19:56:59,727 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:56:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 640 transitions. [2022-02-20 19:56:59,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 640 transitions. [2022-02-20 19:57:00,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 640 edges. 640 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:00,166 INFO L225 Difference]: With dead ends: 1074 [2022-02-20 19:57:00,167 INFO L226 Difference]: Without dead ends: 790 [2022-02-20 19:57:00,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:57:00,169 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 680 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:00,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [705 Valid, 990 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:00,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2022-02-20 19:57:00,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 738. [2022-02-20 19:57:00,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:00,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 790 states. Second operand has 738 states, 584 states have (on average 1.3664383561643836) internal successors, (798), 599 states have internal predecessors, (798), 87 states have call successors, (87), 49 states have call predecessors, (87), 65 states have return successors, (126), 96 states have call predecessors, (126), 85 states have call successors, (126) [2022-02-20 19:57:00,205 INFO L74 IsIncluded]: Start isIncluded. First operand 790 states. Second operand has 738 states, 584 states have (on average 1.3664383561643836) internal successors, (798), 599 states have internal predecessors, (798), 87 states have call successors, (87), 49 states have call predecessors, (87), 65 states have return successors, (126), 96 states have call predecessors, (126), 85 states have call successors, (126) [2022-02-20 19:57:00,206 INFO L87 Difference]: Start difference. First operand 790 states. Second operand has 738 states, 584 states have (on average 1.3664383561643836) internal successors, (798), 599 states have internal predecessors, (798), 87 states have call successors, (87), 49 states have call predecessors, (87), 65 states have return successors, (126), 96 states have call predecessors, (126), 85 states have call successors, (126) [2022-02-20 19:57:00,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:00,230 INFO L93 Difference]: Finished difference Result 790 states and 1079 transitions. [2022-02-20 19:57:00,230 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1079 transitions. [2022-02-20 19:57:00,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:00,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:00,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 738 states, 584 states have (on average 1.3664383561643836) internal successors, (798), 599 states have internal predecessors, (798), 87 states have call successors, (87), 49 states have call predecessors, (87), 65 states have return successors, (126), 96 states have call predecessors, (126), 85 states have call successors, (126) Second operand 790 states. [2022-02-20 19:57:00,234 INFO L87 Difference]: Start difference. First operand has 738 states, 584 states have (on average 1.3664383561643836) internal successors, (798), 599 states have internal predecessors, (798), 87 states have call successors, (87), 49 states have call predecessors, (87), 65 states have return successors, (126), 96 states have call predecessors, (126), 85 states have call successors, (126) Second operand 790 states. [2022-02-20 19:57:00,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:00,260 INFO L93 Difference]: Finished difference Result 790 states and 1079 transitions. [2022-02-20 19:57:00,260 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1079 transitions. [2022-02-20 19:57:00,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:00,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:00,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:00,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 584 states have (on average 1.3664383561643836) internal successors, (798), 599 states have internal predecessors, (798), 87 states have call successors, (87), 49 states have call predecessors, (87), 65 states have return successors, (126), 96 states have call predecessors, (126), 85 states have call successors, (126) [2022-02-20 19:57:00,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1011 transitions. [2022-02-20 19:57:00,290 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1011 transitions. Word has length 65 [2022-02-20 19:57:00,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:00,290 INFO L470 AbstractCegarLoop]: Abstraction has 738 states and 1011 transitions. [2022-02-20 19:57:00,291 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:00,291 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1011 transitions. [2022-02-20 19:57:00,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:57:00,292 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:00,292 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:00,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:57:00,292 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:00,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:00,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1077063563, now seen corresponding path program 1 times [2022-02-20 19:57:00,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:00,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699772713] [2022-02-20 19:57:00,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:00,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:00,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:00,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {14579#(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); {14539#true} is VALID [2022-02-20 19:57:00,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {14539#true} assume true; {14539#true} is VALID [2022-02-20 19:57:00,337 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14539#true} {14541#(= ~q_free~0 1)} #876#return; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:00,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {14580#(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); {14539#true} is VALID [2022-02-20 19:57:00,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {14539#true} assume !(0 == ~q_write_ev~0); {14539#true} is VALID [2022-02-20 19:57:00,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {14539#true} assume true; {14539#true} is VALID [2022-02-20 19:57:00,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14539#true} {14541#(= ~q_free~0 1)} #878#return; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:00,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:00,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {14539#true} havoc ~__retres1~0; {14539#true} is VALID [2022-02-20 19:57:00,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {14539#true} assume !(1 == ~p_dw_pc~0); {14539#true} is VALID [2022-02-20 19:57:00,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {14539#true} ~__retres1~0 := 0; {14539#true} is VALID [2022-02-20 19:57:00,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {14539#true} #res := ~__retres1~0; {14539#true} is VALID [2022-02-20 19:57:00,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {14539#true} assume true; {14539#true} is VALID [2022-02-20 19:57:00,373 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14539#true} {14539#true} #872#return; {14539#true} is VALID [2022-02-20 19:57:00,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:00,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {14539#true} havoc ~__retres1~1; {14539#true} is VALID [2022-02-20 19:57:00,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {14539#true} assume !(1 == ~c_dr_pc~0); {14539#true} is VALID [2022-02-20 19:57:00,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {14539#true} ~__retres1~1 := 0; {14539#true} is VALID [2022-02-20 19:57:00,376 INFO L290 TraceCheckUtils]: 3: Hoare triple {14539#true} #res := ~__retres1~1; {14539#true} is VALID [2022-02-20 19:57:00,376 INFO L290 TraceCheckUtils]: 4: Hoare triple {14539#true} assume true; {14539#true} is VALID [2022-02-20 19:57:00,376 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14539#true} {14539#true} #874#return; {14539#true} is VALID [2022-02-20 19:57:00,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {14581#(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; {14539#true} is VALID [2022-02-20 19:57:00,377 INFO L272 TraceCheckUtils]: 1: Hoare triple {14539#true} call #t~ret8 := is_do_write_p_triggered(); {14539#true} is VALID [2022-02-20 19:57:00,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {14539#true} havoc ~__retres1~0; {14539#true} is VALID [2022-02-20 19:57:00,377 INFO L290 TraceCheckUtils]: 3: Hoare triple {14539#true} assume !(1 == ~p_dw_pc~0); {14539#true} is VALID [2022-02-20 19:57:00,377 INFO L290 TraceCheckUtils]: 4: Hoare triple {14539#true} ~__retres1~0 := 0; {14539#true} is VALID [2022-02-20 19:57:00,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {14539#true} #res := ~__retres1~0; {14539#true} is VALID [2022-02-20 19:57:00,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {14539#true} assume true; {14539#true} is VALID [2022-02-20 19:57:00,377 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14539#true} {14539#true} #872#return; {14539#true} is VALID [2022-02-20 19:57:00,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {14539#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {14539#true} is VALID [2022-02-20 19:57:00,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {14539#true} assume !(0 != ~tmp~1); {14539#true} is VALID [2022-02-20 19:57:00,378 INFO L272 TraceCheckUtils]: 10: Hoare triple {14539#true} call #t~ret9 := is_do_read_c_triggered(); {14539#true} is VALID [2022-02-20 19:57:00,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {14539#true} havoc ~__retres1~1; {14539#true} is VALID [2022-02-20 19:57:00,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {14539#true} assume !(1 == ~c_dr_pc~0); {14539#true} is VALID [2022-02-20 19:57:00,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {14539#true} ~__retres1~1 := 0; {14539#true} is VALID [2022-02-20 19:57:00,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {14539#true} #res := ~__retres1~1; {14539#true} is VALID [2022-02-20 19:57:00,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {14539#true} assume true; {14539#true} is VALID [2022-02-20 19:57:00,378 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14539#true} {14539#true} #874#return; {14539#true} is VALID [2022-02-20 19:57:00,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {14539#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {14539#true} is VALID [2022-02-20 19:57:00,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {14539#true} assume !(0 != ~tmp___0~1); {14539#true} is VALID [2022-02-20 19:57:00,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {14539#true} assume true; {14539#true} is VALID [2022-02-20 19:57:00,379 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {14539#true} {14541#(= ~q_free~0 1)} #880#return; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:00,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {14580#(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); {14539#true} is VALID [2022-02-20 19:57:00,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {14539#true} assume !(1 == ~q_write_ev~0); {14539#true} is VALID [2022-02-20 19:57:00,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {14539#true} assume true; {14539#true} is VALID [2022-02-20 19:57:00,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14539#true} {14541#(= ~q_free~0 1)} #882#return; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:00,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {14539#true} havoc ~__retres1~2; {14539#true} is VALID [2022-02-20 19:57:00,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {14539#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14539#true} is VALID [2022-02-20 19:57:00,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {14539#true} #res := ~__retres1~2; {14539#true} is VALID [2022-02-20 19:57:00,387 INFO L290 TraceCheckUtils]: 3: Hoare triple {14539#true} assume true; {14539#true} is VALID [2022-02-20 19:57:00,388 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14539#true} {14541#(= ~q_free~0 1)} #884#return; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {14539#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {14539#true} is VALID [2022-02-20 19:57:00,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {14539#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {14539#true} is VALID [2022-02-20 19:57:00,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {14539#true} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {14541#(= ~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; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {14541#(= ~q_free~0 1)} call update_channels1(); {14579#(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:00,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {14579#(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); {14539#true} is VALID [2022-02-20 19:57:00,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {14539#true} assume true; {14539#true} is VALID [2022-02-20 19:57:00,389 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14539#true} {14541#(= ~q_free~0 1)} #876#return; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {14541#(= ~q_free~0 1)} assume { :begin_inline_init_threads1 } true; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {14541#(= ~q_free~0 1)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {14541#(= ~q_free~0 1)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {14541#(= ~q_free~0 1)} assume { :end_inline_init_threads1 } true; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,391 INFO L272 TraceCheckUtils]: 12: Hoare triple {14541#(= ~q_free~0 1)} call fire_delta_events1(); {14580#(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:00,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {14580#(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); {14539#true} is VALID [2022-02-20 19:57:00,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {14539#true} assume !(0 == ~q_write_ev~0); {14539#true} is VALID [2022-02-20 19:57:00,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {14539#true} assume true; {14539#true} is VALID [2022-02-20 19:57:00,391 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14539#true} {14541#(= ~q_free~0 1)} #878#return; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,392 INFO L272 TraceCheckUtils]: 17: Hoare triple {14541#(= ~q_free~0 1)} call activate_threads1(); {14581#(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:00,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {14581#(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; {14539#true} is VALID [2022-02-20 19:57:00,392 INFO L272 TraceCheckUtils]: 19: Hoare triple {14539#true} call #t~ret8 := is_do_write_p_triggered(); {14539#true} is VALID [2022-02-20 19:57:00,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {14539#true} havoc ~__retres1~0; {14539#true} is VALID [2022-02-20 19:57:00,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {14539#true} assume !(1 == ~p_dw_pc~0); {14539#true} is VALID [2022-02-20 19:57:00,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {14539#true} ~__retres1~0 := 0; {14539#true} is VALID [2022-02-20 19:57:00,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {14539#true} #res := ~__retres1~0; {14539#true} is VALID [2022-02-20 19:57:00,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {14539#true} assume true; {14539#true} is VALID [2022-02-20 19:57:00,393 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14539#true} {14539#true} #872#return; {14539#true} is VALID [2022-02-20 19:57:00,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {14539#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {14539#true} is VALID [2022-02-20 19:57:00,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {14539#true} assume !(0 != ~tmp~1); {14539#true} is VALID [2022-02-20 19:57:00,393 INFO L272 TraceCheckUtils]: 28: Hoare triple {14539#true} call #t~ret9 := is_do_read_c_triggered(); {14539#true} is VALID [2022-02-20 19:57:00,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {14539#true} havoc ~__retres1~1; {14539#true} is VALID [2022-02-20 19:57:00,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {14539#true} assume !(1 == ~c_dr_pc~0); {14539#true} is VALID [2022-02-20 19:57:00,393 INFO L290 TraceCheckUtils]: 31: Hoare triple {14539#true} ~__retres1~1 := 0; {14539#true} is VALID [2022-02-20 19:57:00,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {14539#true} #res := ~__retres1~1; {14539#true} is VALID [2022-02-20 19:57:00,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {14539#true} assume true; {14539#true} is VALID [2022-02-20 19:57:00,394 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14539#true} {14539#true} #874#return; {14539#true} is VALID [2022-02-20 19:57:00,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {14539#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {14539#true} is VALID [2022-02-20 19:57:00,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {14539#true} assume !(0 != ~tmp___0~1); {14539#true} is VALID [2022-02-20 19:57:00,394 INFO L290 TraceCheckUtils]: 37: Hoare triple {14539#true} assume true; {14539#true} is VALID [2022-02-20 19:57:00,394 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {14539#true} {14541#(= ~q_free~0 1)} #880#return; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,395 INFO L272 TraceCheckUtils]: 39: Hoare triple {14541#(= ~q_free~0 1)} call reset_delta_events1(); {14580#(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:00,395 INFO L290 TraceCheckUtils]: 40: Hoare triple {14580#(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); {14539#true} is VALID [2022-02-20 19:57:00,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {14539#true} assume !(1 == ~q_write_ev~0); {14539#true} is VALID [2022-02-20 19:57:00,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {14539#true} assume true; {14539#true} is VALID [2022-02-20 19:57:00,395 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {14539#true} {14541#(= ~q_free~0 1)} #882#return; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,395 INFO L290 TraceCheckUtils]: 44: Hoare triple {14541#(= ~q_free~0 1)} assume !false; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {14541#(= ~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; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {14541#(= ~q_free~0 1)} assume !false; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,396 INFO L272 TraceCheckUtils]: 47: Hoare triple {14541#(= ~q_free~0 1)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {14539#true} is VALID [2022-02-20 19:57:00,396 INFO L290 TraceCheckUtils]: 48: Hoare triple {14539#true} havoc ~__retres1~2; {14539#true} is VALID [2022-02-20 19:57:00,396 INFO L290 TraceCheckUtils]: 49: Hoare triple {14539#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {14539#true} is VALID [2022-02-20 19:57:00,396 INFO L290 TraceCheckUtils]: 50: Hoare triple {14539#true} #res := ~__retres1~2; {14539#true} is VALID [2022-02-20 19:57:00,396 INFO L290 TraceCheckUtils]: 51: Hoare triple {14539#true} assume true; {14539#true} is VALID [2022-02-20 19:57:00,397 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {14539#true} {14541#(= ~q_free~0 1)} #884#return; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,397 INFO L290 TraceCheckUtils]: 53: Hoare triple {14541#(= ~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; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {14541#(= ~q_free~0 1)} assume 0 != eval1_~tmp___1~0#1; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,401 INFO L290 TraceCheckUtils]: 55: Hoare triple {14541#(= ~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; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,401 INFO L290 TraceCheckUtils]: 56: Hoare triple {14541#(= ~q_free~0 1)} assume !(0 != eval1_~tmp~2#1); {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,401 INFO L290 TraceCheckUtils]: 57: Hoare triple {14541#(= ~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; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,401 INFO L290 TraceCheckUtils]: 58: Hoare triple {14541#(= ~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; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,402 INFO L290 TraceCheckUtils]: 59: Hoare triple {14541#(= ~q_free~0 1)} assume 0 == ~c_dr_pc~0; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,402 INFO L290 TraceCheckUtils]: 60: Hoare triple {14541#(= ~q_free~0 1)} assume !false; {14541#(= ~q_free~0 1)} is VALID [2022-02-20 19:57:00,402 INFO L290 TraceCheckUtils]: 61: Hoare triple {14541#(= ~q_free~0 1)} assume !(1 == ~q_free~0); {14540#false} is VALID [2022-02-20 19:57:00,402 INFO L290 TraceCheckUtils]: 62: Hoare triple {14540#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; {14540#false} is VALID [2022-02-20 19:57:00,402 INFO L290 TraceCheckUtils]: 63: Hoare triple {14540#false} assume !(~p_last_write~0 == ~c_last_read~0); {14540#false} is VALID [2022-02-20 19:57:00,402 INFO L272 TraceCheckUtils]: 64: Hoare triple {14540#false} call error1(); {14540#false} is VALID [2022-02-20 19:57:00,403 INFO L290 TraceCheckUtils]: 65: Hoare triple {14540#false} assume !false; {14540#false} is VALID [2022-02-20 19:57:00,403 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:00,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:00,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699772713] [2022-02-20 19:57:00,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699772713] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:00,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:00,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:00,403 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649518958] [2022-02-20 19:57:00,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:00,404 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:00,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:00,404 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:00,437 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:00,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:00,437 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:00,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:00,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:00,437 INFO L87 Difference]: Start difference. First operand 738 states and 1011 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:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:01,745 INFO L93 Difference]: Finished difference Result 1885 states and 2528 transitions. [2022-02-20 19:57:01,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:57:01,745 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:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:01,746 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:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 638 transitions. [2022-02-20 19:57:01,749 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:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 638 transitions. [2022-02-20 19:57:01,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 638 transitions. [2022-02-20 19:57:02,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 638 edges. 638 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:02,214 INFO L225 Difference]: With dead ends: 1885 [2022-02-20 19:57:02,215 INFO L226 Difference]: Without dead ends: 1302 [2022-02-20 19:57:02,216 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:02,217 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 470 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:02,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [479 Valid, 959 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2022-02-20 19:57:02,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1195. [2022-02-20 19:57:02,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:02,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1302 states. Second operand has 1195 states, 943 states have (on average 1.335100742311771) internal successors, (1259), 961 states have internal predecessors, (1259), 130 states have call successors, (130), 91 states have call predecessors, (130), 120 states have return successors, (194), 149 states have call predecessors, (194), 128 states have call successors, (194) [2022-02-20 19:57:02,289 INFO L74 IsIncluded]: Start isIncluded. First operand 1302 states. Second operand has 1195 states, 943 states have (on average 1.335100742311771) internal successors, (1259), 961 states have internal predecessors, (1259), 130 states have call successors, (130), 91 states have call predecessors, (130), 120 states have return successors, (194), 149 states have call predecessors, (194), 128 states have call successors, (194) [2022-02-20 19:57:02,290 INFO L87 Difference]: Start difference. First operand 1302 states. Second operand has 1195 states, 943 states have (on average 1.335100742311771) internal successors, (1259), 961 states have internal predecessors, (1259), 130 states have call successors, (130), 91 states have call predecessors, (130), 120 states have return successors, (194), 149 states have call predecessors, (194), 128 states have call successors, (194) [2022-02-20 19:57:02,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:02,341 INFO L93 Difference]: Finished difference Result 1302 states and 1710 transitions. [2022-02-20 19:57:02,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1710 transitions. [2022-02-20 19:57:02,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:02,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:02,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 1195 states, 943 states have (on average 1.335100742311771) internal successors, (1259), 961 states have internal predecessors, (1259), 130 states have call successors, (130), 91 states have call predecessors, (130), 120 states have return successors, (194), 149 states have call predecessors, (194), 128 states have call successors, (194) Second operand 1302 states. [2022-02-20 19:57:02,353 INFO L87 Difference]: Start difference. First operand has 1195 states, 943 states have (on average 1.335100742311771) internal successors, (1259), 961 states have internal predecessors, (1259), 130 states have call successors, (130), 91 states have call predecessors, (130), 120 states have return successors, (194), 149 states have call predecessors, (194), 128 states have call successors, (194) Second operand 1302 states. [2022-02-20 19:57:02,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:02,408 INFO L93 Difference]: Finished difference Result 1302 states and 1710 transitions. [2022-02-20 19:57:02,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1710 transitions. [2022-02-20 19:57:02,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:02,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:02,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:02,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:02,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 943 states have (on average 1.335100742311771) internal successors, (1259), 961 states have internal predecessors, (1259), 130 states have call successors, (130), 91 states have call predecessors, (130), 120 states have return successors, (194), 149 states have call predecessors, (194), 128 states have call successors, (194) [2022-02-20 19:57:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1583 transitions. [2022-02-20 19:57:02,475 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1583 transitions. Word has length 66 [2022-02-20 19:57:02,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:02,476 INFO L470 AbstractCegarLoop]: Abstraction has 1195 states and 1583 transitions. [2022-02-20 19:57:02,476 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:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1583 transitions. [2022-02-20 19:57:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 19:57:02,477 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:02,477 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:02,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:57:02,478 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:02,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:02,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1759664074, now seen corresponding path program 1 times [2022-02-20 19:57:02,478 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:02,478 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510342817] [2022-02-20 19:57:02,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:02,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {21385#(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); {21345#true} is VALID [2022-02-20 19:57:02,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {21345#true} assume true; {21345#true} is VALID [2022-02-20 19:57:02,511 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21345#true} {21347#(= ~c_dr_pc~0 0)} #876#return; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {21386#(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); {21345#true} is VALID [2022-02-20 19:57:02,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {21345#true} assume !(0 == ~q_write_ev~0); {21345#true} is VALID [2022-02-20 19:57:02,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {21345#true} assume true; {21345#true} is VALID [2022-02-20 19:57:02,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21345#true} {21347#(= ~c_dr_pc~0 0)} #878#return; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {21345#true} havoc ~__retres1~0; {21345#true} is VALID [2022-02-20 19:57:02,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {21345#true} assume !(1 == ~p_dw_pc~0); {21345#true} is VALID [2022-02-20 19:57:02,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {21345#true} ~__retres1~0 := 0; {21345#true} is VALID [2022-02-20 19:57:02,532 INFO L290 TraceCheckUtils]: 3: Hoare triple {21345#true} #res := ~__retres1~0; {21345#true} is VALID [2022-02-20 19:57:02,533 INFO L290 TraceCheckUtils]: 4: Hoare triple {21345#true} assume true; {21345#true} is VALID [2022-02-20 19:57:02,533 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {21345#true} {21345#true} #872#return; {21345#true} is VALID [2022-02-20 19:57:02,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {21345#true} havoc ~__retres1~1; {21345#true} is VALID [2022-02-20 19:57:02,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {21345#true} assume !(1 == ~c_dr_pc~0); {21345#true} is VALID [2022-02-20 19:57:02,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {21345#true} ~__retres1~1 := 0; {21345#true} is VALID [2022-02-20 19:57:02,536 INFO L290 TraceCheckUtils]: 3: Hoare triple {21345#true} #res := ~__retres1~1; {21345#true} is VALID [2022-02-20 19:57:02,536 INFO L290 TraceCheckUtils]: 4: Hoare triple {21345#true} assume true; {21345#true} is VALID [2022-02-20 19:57:02,536 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {21345#true} {21345#true} #874#return; {21345#true} is VALID [2022-02-20 19:57:02,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {21387#(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; {21345#true} is VALID [2022-02-20 19:57:02,537 INFO L272 TraceCheckUtils]: 1: Hoare triple {21345#true} call #t~ret8 := is_do_write_p_triggered(); {21345#true} is VALID [2022-02-20 19:57:02,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {21345#true} havoc ~__retres1~0; {21345#true} is VALID [2022-02-20 19:57:02,537 INFO L290 TraceCheckUtils]: 3: Hoare triple {21345#true} assume !(1 == ~p_dw_pc~0); {21345#true} is VALID [2022-02-20 19:57:02,537 INFO L290 TraceCheckUtils]: 4: Hoare triple {21345#true} ~__retres1~0 := 0; {21345#true} is VALID [2022-02-20 19:57:02,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {21345#true} #res := ~__retres1~0; {21345#true} is VALID [2022-02-20 19:57:02,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {21345#true} assume true; {21345#true} is VALID [2022-02-20 19:57:02,537 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {21345#true} {21345#true} #872#return; {21345#true} is VALID [2022-02-20 19:57:02,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {21345#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {21345#true} is VALID [2022-02-20 19:57:02,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {21345#true} assume !(0 != ~tmp~1); {21345#true} is VALID [2022-02-20 19:57:02,538 INFO L272 TraceCheckUtils]: 10: Hoare triple {21345#true} call #t~ret9 := is_do_read_c_triggered(); {21345#true} is VALID [2022-02-20 19:57:02,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {21345#true} havoc ~__retres1~1; {21345#true} is VALID [2022-02-20 19:57:02,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {21345#true} assume !(1 == ~c_dr_pc~0); {21345#true} is VALID [2022-02-20 19:57:02,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {21345#true} ~__retres1~1 := 0; {21345#true} is VALID [2022-02-20 19:57:02,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {21345#true} #res := ~__retres1~1; {21345#true} is VALID [2022-02-20 19:57:02,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {21345#true} assume true; {21345#true} is VALID [2022-02-20 19:57:02,538 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21345#true} {21345#true} #874#return; {21345#true} is VALID [2022-02-20 19:57:02,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {21345#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {21345#true} is VALID [2022-02-20 19:57:02,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {21345#true} assume !(0 != ~tmp___0~1); {21345#true} is VALID [2022-02-20 19:57:02,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {21345#true} assume true; {21345#true} is VALID [2022-02-20 19:57:02,539 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {21345#true} {21347#(= ~c_dr_pc~0 0)} #880#return; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {21386#(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); {21345#true} is VALID [2022-02-20 19:57:02,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {21345#true} assume !(1 == ~q_write_ev~0); {21345#true} is VALID [2022-02-20 19:57:02,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {21345#true} assume true; {21345#true} is VALID [2022-02-20 19:57:02,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21345#true} {21347#(= ~c_dr_pc~0 0)} #882#return; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:02,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {21345#true} havoc ~__retres1~2; {21345#true} is VALID [2022-02-20 19:57:02,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {21345#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {21345#true} is VALID [2022-02-20 19:57:02,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {21345#true} #res := ~__retres1~2; {21345#true} is VALID [2022-02-20 19:57:02,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {21345#true} assume true; {21345#true} is VALID [2022-02-20 19:57:02,553 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21345#true} {21347#(= ~c_dr_pc~0 0)} #884#return; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {21345#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {21345#true} is VALID [2022-02-20 19:57:02,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {21345#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {21345#true} is VALID [2022-02-20 19:57:02,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {21345#true} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {21347#(= ~c_dr_pc~0 0)} assume { :end_inline_init_model1 } true;assume { :begin_inline_start_simulation1 } true;havoc start_simulation1_#t~ret14#1, start_simulation1_~kernel_st~0#1, start_simulation1_~tmp~4#1;havoc start_simulation1_~kernel_st~0#1;havoc start_simulation1_~tmp~4#1;start_simulation1_~kernel_st~0#1 := 0; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {21347#(= ~c_dr_pc~0 0)} call update_channels1(); {21385#(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:02,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {21385#(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); {21345#true} is VALID [2022-02-20 19:57:02,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {21345#true} assume true; {21345#true} is VALID [2022-02-20 19:57:02,554 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {21345#true} {21347#(= ~c_dr_pc~0 0)} #876#return; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {21347#(= ~c_dr_pc~0 0)} assume { :begin_inline_init_threads1 } true; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {21347#(= ~c_dr_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {21347#(= ~c_dr_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {21347#(= ~c_dr_pc~0 0)} assume { :end_inline_init_threads1 } true; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,556 INFO L272 TraceCheckUtils]: 12: Hoare triple {21347#(= ~c_dr_pc~0 0)} call fire_delta_events1(); {21386#(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:02,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {21386#(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); {21345#true} is VALID [2022-02-20 19:57:02,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {21345#true} assume !(0 == ~q_write_ev~0); {21345#true} is VALID [2022-02-20 19:57:02,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {21345#true} assume true; {21345#true} is VALID [2022-02-20 19:57:02,556 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21345#true} {21347#(= ~c_dr_pc~0 0)} #878#return; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,557 INFO L272 TraceCheckUtils]: 17: Hoare triple {21347#(= ~c_dr_pc~0 0)} call activate_threads1(); {21387#(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:02,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {21387#(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; {21345#true} is VALID [2022-02-20 19:57:02,557 INFO L272 TraceCheckUtils]: 19: Hoare triple {21345#true} call #t~ret8 := is_do_write_p_triggered(); {21345#true} is VALID [2022-02-20 19:57:02,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {21345#true} havoc ~__retres1~0; {21345#true} is VALID [2022-02-20 19:57:02,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {21345#true} assume !(1 == ~p_dw_pc~0); {21345#true} is VALID [2022-02-20 19:57:02,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {21345#true} ~__retres1~0 := 0; {21345#true} is VALID [2022-02-20 19:57:02,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {21345#true} #res := ~__retres1~0; {21345#true} is VALID [2022-02-20 19:57:02,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {21345#true} assume true; {21345#true} is VALID [2022-02-20 19:57:02,558 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {21345#true} {21345#true} #872#return; {21345#true} is VALID [2022-02-20 19:57:02,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {21345#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {21345#true} is VALID [2022-02-20 19:57:02,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {21345#true} assume !(0 != ~tmp~1); {21345#true} is VALID [2022-02-20 19:57:02,558 INFO L272 TraceCheckUtils]: 28: Hoare triple {21345#true} call #t~ret9 := is_do_read_c_triggered(); {21345#true} is VALID [2022-02-20 19:57:02,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {21345#true} havoc ~__retres1~1; {21345#true} is VALID [2022-02-20 19:57:02,558 INFO L290 TraceCheckUtils]: 30: Hoare triple {21345#true} assume !(1 == ~c_dr_pc~0); {21345#true} is VALID [2022-02-20 19:57:02,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {21345#true} ~__retres1~1 := 0; {21345#true} is VALID [2022-02-20 19:57:02,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {21345#true} #res := ~__retres1~1; {21345#true} is VALID [2022-02-20 19:57:02,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {21345#true} assume true; {21345#true} is VALID [2022-02-20 19:57:02,559 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {21345#true} {21345#true} #874#return; {21345#true} is VALID [2022-02-20 19:57:02,559 INFO L290 TraceCheckUtils]: 35: Hoare triple {21345#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {21345#true} is VALID [2022-02-20 19:57:02,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {21345#true} assume !(0 != ~tmp___0~1); {21345#true} is VALID [2022-02-20 19:57:02,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {21345#true} assume true; {21345#true} is VALID [2022-02-20 19:57:02,559 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21345#true} {21347#(= ~c_dr_pc~0 0)} #880#return; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,560 INFO L272 TraceCheckUtils]: 39: Hoare triple {21347#(= ~c_dr_pc~0 0)} call reset_delta_events1(); {21386#(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:02,560 INFO L290 TraceCheckUtils]: 40: Hoare triple {21386#(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); {21345#true} is VALID [2022-02-20 19:57:02,560 INFO L290 TraceCheckUtils]: 41: Hoare triple {21345#true} assume !(1 == ~q_write_ev~0); {21345#true} is VALID [2022-02-20 19:57:02,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {21345#true} assume true; {21345#true} is VALID [2022-02-20 19:57:02,560 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {21345#true} {21347#(= ~c_dr_pc~0 0)} #882#return; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,560 INFO L290 TraceCheckUtils]: 44: Hoare triple {21347#(= ~c_dr_pc~0 0)} assume !false; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,561 INFO L290 TraceCheckUtils]: 45: Hoare triple {21347#(= ~c_dr_pc~0 0)} start_simulation1_~kernel_st~0#1 := 1;assume { :begin_inline_eval1 } true;havoc eval1_#t~ret10#1, eval1_#t~nondet11#1, eval1_#t~nondet12#1, eval1_~tmp~2#1, eval1_~tmp___0~2#1, eval1_~tmp___1~0#1;havoc eval1_~tmp~2#1;havoc eval1_~tmp___0~2#1;havoc eval1_~tmp___1~0#1; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,561 INFO L290 TraceCheckUtils]: 46: Hoare triple {21347#(= ~c_dr_pc~0 0)} assume !false; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,561 INFO L272 TraceCheckUtils]: 47: Hoare triple {21347#(= ~c_dr_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {21345#true} is VALID [2022-02-20 19:57:02,561 INFO L290 TraceCheckUtils]: 48: Hoare triple {21345#true} havoc ~__retres1~2; {21345#true} is VALID [2022-02-20 19:57:02,561 INFO L290 TraceCheckUtils]: 49: Hoare triple {21345#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {21345#true} is VALID [2022-02-20 19:57:02,561 INFO L290 TraceCheckUtils]: 50: Hoare triple {21345#true} #res := ~__retres1~2; {21345#true} is VALID [2022-02-20 19:57:02,561 INFO L290 TraceCheckUtils]: 51: Hoare triple {21345#true} assume true; {21345#true} is VALID [2022-02-20 19:57:02,562 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {21345#true} {21347#(= ~c_dr_pc~0 0)} #884#return; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,562 INFO L290 TraceCheckUtils]: 53: Hoare triple {21347#(= ~c_dr_pc~0 0)} assume -2147483648 <= eval1_#t~ret10#1 && eval1_#t~ret10#1 <= 2147483647;eval1_~tmp___1~0#1 := eval1_#t~ret10#1;havoc eval1_#t~ret10#1; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,562 INFO L290 TraceCheckUtils]: 54: Hoare triple {21347#(= ~c_dr_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,562 INFO L290 TraceCheckUtils]: 55: Hoare triple {21347#(= ~c_dr_pc~0 0)} assume 0 == ~p_dw_st~0;assume -2147483648 <= eval1_#t~nondet11#1 && eval1_#t~nondet11#1 <= 2147483647;eval1_~tmp~2#1 := eval1_#t~nondet11#1;havoc eval1_#t~nondet11#1; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,563 INFO L290 TraceCheckUtils]: 56: Hoare triple {21347#(= ~c_dr_pc~0 0)} assume !(0 != eval1_~tmp~2#1); {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,563 INFO L290 TraceCheckUtils]: 57: Hoare triple {21347#(= ~c_dr_pc~0 0)} assume 0 == ~c_dr_st~0;assume -2147483648 <= eval1_#t~nondet12#1 && eval1_#t~nondet12#1 <= 2147483647;eval1_~tmp___0~2#1 := eval1_#t~nondet12#1;havoc eval1_#t~nondet12#1; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,563 INFO L290 TraceCheckUtils]: 58: Hoare triple {21347#(= ~c_dr_pc~0 0)} assume 0 != eval1_~tmp___0~2#1;~c_dr_st~0 := 1;assume { :begin_inline_do_read_c } true;havoc do_read_c_~a~0#1;havoc do_read_c_~a~0#1; {21347#(= ~c_dr_pc~0 0)} is VALID [2022-02-20 19:57:02,563 INFO L290 TraceCheckUtils]: 59: Hoare triple {21347#(= ~c_dr_pc~0 0)} assume !(0 == ~c_dr_pc~0); {21346#false} is VALID [2022-02-20 19:57:02,564 INFO L290 TraceCheckUtils]: 60: Hoare triple {21346#false} assume 1 == ~c_dr_pc~0; {21346#false} is VALID [2022-02-20 19:57:02,564 INFO L290 TraceCheckUtils]: 61: Hoare triple {21346#false} do_read_c_~a~0#1 := ~a_t~0; {21346#false} is VALID [2022-02-20 19:57:02,564 INFO L290 TraceCheckUtils]: 62: Hoare triple {21346#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; {21346#false} is VALID [2022-02-20 19:57:02,564 INFO L290 TraceCheckUtils]: 63: Hoare triple {21346#false} assume !(~p_last_write~0 == ~c_last_read~0); {21346#false} is VALID [2022-02-20 19:57:02,564 INFO L272 TraceCheckUtils]: 64: Hoare triple {21346#false} call error1(); {21346#false} is VALID [2022-02-20 19:57:02,564 INFO L290 TraceCheckUtils]: 65: Hoare triple {21346#false} assume !false; {21346#false} is VALID [2022-02-20 19:57:02,564 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:02,565 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:02,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510342817] [2022-02-20 19:57:02,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510342817] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:02,565 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:02,565 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:02,565 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802929951] [2022-02-20 19:57:02,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:02,566 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:02,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:02,567 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:02,597 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:02,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:02,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:02,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:02,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:02,598 INFO L87 Difference]: Start difference. First operand 1195 states and 1583 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:04,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:04,095 INFO L93 Difference]: Finished difference Result 3275 states and 4283 transitions. [2022-02-20 19:57:04,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:04,095 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:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:04,095 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:04,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 636 transitions. [2022-02-20 19:57:04,099 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:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 636 transitions. [2022-02-20 19:57:04,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 636 transitions. [2022-02-20 19:57:04,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 636 edges. 636 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:04,725 INFO L225 Difference]: With dead ends: 3275 [2022-02-20 19:57:04,725 INFO L226 Difference]: Without dead ends: 2255 [2022-02-20 19:57:04,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-02-20 19:57:04,727 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 858 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:04,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [883 Valid, 696 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 19:57:04,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2022-02-20 19:57:04,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 2065. [2022-02-20 19:57:04,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:04,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2255 states. Second operand has 2065 states, 1613 states have (on average 1.2982021078735275) internal successors, (2094), 1645 states have internal predecessors, (2094), 228 states have call successors, (228), 175 states have call predecessors, (228), 222 states have return successors, (338), 251 states have call predecessors, (338), 226 states have call successors, (338) [2022-02-20 19:57:04,847 INFO L74 IsIncluded]: Start isIncluded. First operand 2255 states. Second operand has 2065 states, 1613 states have (on average 1.2982021078735275) internal successors, (2094), 1645 states have internal predecessors, (2094), 228 states have call successors, (228), 175 states have call predecessors, (228), 222 states have return successors, (338), 251 states have call predecessors, (338), 226 states have call successors, (338) [2022-02-20 19:57:04,849 INFO L87 Difference]: Start difference. First operand 2255 states. Second operand has 2065 states, 1613 states have (on average 1.2982021078735275) internal successors, (2094), 1645 states have internal predecessors, (2094), 228 states have call successors, (228), 175 states have call predecessors, (228), 222 states have return successors, (338), 251 states have call predecessors, (338), 226 states have call successors, (338) [2022-02-20 19:57:04,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:04,995 INFO L93 Difference]: Finished difference Result 2255 states and 2892 transitions. [2022-02-20 19:57:04,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2892 transitions. [2022-02-20 19:57:04,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:04,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:05,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 2065 states, 1613 states have (on average 1.2982021078735275) internal successors, (2094), 1645 states have internal predecessors, (2094), 228 states have call successors, (228), 175 states have call predecessors, (228), 222 states have return successors, (338), 251 states have call predecessors, (338), 226 states have call successors, (338) Second operand 2255 states. [2022-02-20 19:57:05,004 INFO L87 Difference]: Start difference. First operand has 2065 states, 1613 states have (on average 1.2982021078735275) internal successors, (2094), 1645 states have internal predecessors, (2094), 228 states have call successors, (228), 175 states have call predecessors, (228), 222 states have return successors, (338), 251 states have call predecessors, (338), 226 states have call successors, (338) Second operand 2255 states. [2022-02-20 19:57:05,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:05,155 INFO L93 Difference]: Finished difference Result 2255 states and 2892 transitions. [2022-02-20 19:57:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2892 transitions. [2022-02-20 19:57:05,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:05,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:05,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:05,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2065 states, 1613 states have (on average 1.2982021078735275) internal successors, (2094), 1645 states have internal predecessors, (2094), 228 states have call successors, (228), 175 states have call predecessors, (228), 222 states have return successors, (338), 251 states have call predecessors, (338), 226 states have call successors, (338) [2022-02-20 19:57:05,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 2660 transitions. [2022-02-20 19:57:05,334 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 2660 transitions. Word has length 66 [2022-02-20 19:57:05,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:05,334 INFO L470 AbstractCegarLoop]: Abstraction has 2065 states and 2660 transitions. [2022-02-20 19:57:05,334 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:05,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2660 transitions. [2022-02-20 19:57:05,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 19:57:05,336 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:05,336 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:05,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:57:05,336 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:05,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:05,337 INFO L85 PathProgramCache]: Analyzing trace with hash 825996842, now seen corresponding path program 1 times [2022-02-20 19:57:05,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:05,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821948814] [2022-02-20 19:57:05,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:05,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {33114#(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); {33074#true} is VALID [2022-02-20 19:57:05,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {33074#true} assume true; {33074#true} is VALID [2022-02-20 19:57:05,366 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33074#true} {33076#(= ~p_dw_pc~0 0)} #876#return; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {33115#(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); {33074#true} is VALID [2022-02-20 19:57:05,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {33074#true} assume !(0 == ~q_write_ev~0); {33074#true} is VALID [2022-02-20 19:57:05,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {33074#true} assume true; {33074#true} is VALID [2022-02-20 19:57:05,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33074#true} {33076#(= ~p_dw_pc~0 0)} #878#return; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {33074#true} havoc ~__retres1~0; {33074#true} is VALID [2022-02-20 19:57:05,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {33074#true} assume !(1 == ~p_dw_pc~0); {33074#true} is VALID [2022-02-20 19:57:05,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {33074#true} ~__retres1~0 := 0; {33074#true} is VALID [2022-02-20 19:57:05,387 INFO L290 TraceCheckUtils]: 3: Hoare triple {33074#true} #res := ~__retres1~0; {33074#true} is VALID [2022-02-20 19:57:05,387 INFO L290 TraceCheckUtils]: 4: Hoare triple {33074#true} assume true; {33074#true} is VALID [2022-02-20 19:57:05,387 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {33074#true} {33074#true} #872#return; {33074#true} is VALID [2022-02-20 19:57:05,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {33074#true} havoc ~__retres1~1; {33074#true} is VALID [2022-02-20 19:57:05,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {33074#true} assume !(1 == ~c_dr_pc~0); {33074#true} is VALID [2022-02-20 19:57:05,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {33074#true} ~__retres1~1 := 0; {33074#true} is VALID [2022-02-20 19:57:05,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {33074#true} #res := ~__retres1~1; {33074#true} is VALID [2022-02-20 19:57:05,391 INFO L290 TraceCheckUtils]: 4: Hoare triple {33074#true} assume true; {33074#true} is VALID [2022-02-20 19:57:05,391 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {33074#true} {33074#true} #874#return; {33074#true} is VALID [2022-02-20 19:57:05,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {33116#(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; {33074#true} is VALID [2022-02-20 19:57:05,392 INFO L272 TraceCheckUtils]: 1: Hoare triple {33074#true} call #t~ret8 := is_do_write_p_triggered(); {33074#true} is VALID [2022-02-20 19:57:05,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {33074#true} havoc ~__retres1~0; {33074#true} is VALID [2022-02-20 19:57:05,392 INFO L290 TraceCheckUtils]: 3: Hoare triple {33074#true} assume !(1 == ~p_dw_pc~0); {33074#true} is VALID [2022-02-20 19:57:05,392 INFO L290 TraceCheckUtils]: 4: Hoare triple {33074#true} ~__retres1~0 := 0; {33074#true} is VALID [2022-02-20 19:57:05,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {33074#true} #res := ~__retres1~0; {33074#true} is VALID [2022-02-20 19:57:05,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {33074#true} assume true; {33074#true} is VALID [2022-02-20 19:57:05,392 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {33074#true} {33074#true} #872#return; {33074#true} is VALID [2022-02-20 19:57:05,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {33074#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {33074#true} is VALID [2022-02-20 19:57:05,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {33074#true} assume !(0 != ~tmp~1); {33074#true} is VALID [2022-02-20 19:57:05,393 INFO L272 TraceCheckUtils]: 10: Hoare triple {33074#true} call #t~ret9 := is_do_read_c_triggered(); {33074#true} is VALID [2022-02-20 19:57:05,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {33074#true} havoc ~__retres1~1; {33074#true} is VALID [2022-02-20 19:57:05,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {33074#true} assume !(1 == ~c_dr_pc~0); {33074#true} is VALID [2022-02-20 19:57:05,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {33074#true} ~__retres1~1 := 0; {33074#true} is VALID [2022-02-20 19:57:05,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {33074#true} #res := ~__retres1~1; {33074#true} is VALID [2022-02-20 19:57:05,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {33074#true} assume true; {33074#true} is VALID [2022-02-20 19:57:05,393 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {33074#true} {33074#true} #874#return; {33074#true} is VALID [2022-02-20 19:57:05,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {33074#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {33074#true} is VALID [2022-02-20 19:57:05,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {33074#true} assume !(0 != ~tmp___0~1); {33074#true} is VALID [2022-02-20 19:57:05,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {33074#true} assume true; {33074#true} is VALID [2022-02-20 19:57:05,394 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {33074#true} {33076#(= ~p_dw_pc~0 0)} #880#return; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {33115#(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); {33074#true} is VALID [2022-02-20 19:57:05,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {33074#true} assume !(1 == ~q_write_ev~0); {33074#true} is VALID [2022-02-20 19:57:05,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {33074#true} assume true; {33074#true} is VALID [2022-02-20 19:57:05,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33074#true} {33076#(= ~p_dw_pc~0 0)} #882#return; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:05,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {33074#true} havoc ~__retres1~2; {33074#true} is VALID [2022-02-20 19:57:05,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {33074#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {33074#true} is VALID [2022-02-20 19:57:05,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {33074#true} #res := ~__retres1~2; {33074#true} is VALID [2022-02-20 19:57:05,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {33074#true} assume true; {33074#true} is VALID [2022-02-20 19:57:05,406 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {33074#true} {33076#(= ~p_dw_pc~0 0)} #884#return; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {33074#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {33074#true} is VALID [2022-02-20 19:57:05,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {33074#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {33074#true} is VALID [2022-02-20 19:57:05,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {33074#true} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,407 INFO L290 TraceCheckUtils]: 3: Hoare triple {33076#(= ~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; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {33076#(= ~p_dw_pc~0 0)} call update_channels1(); {33114#(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:05,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {33114#(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); {33074#true} is VALID [2022-02-20 19:57:05,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {33074#true} assume true; {33074#true} is VALID [2022-02-20 19:57:05,408 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {33074#true} {33076#(= ~p_dw_pc~0 0)} #876#return; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {33076#(= ~p_dw_pc~0 0)} assume { :begin_inline_init_threads1 } true; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {33076#(= ~p_dw_pc~0 0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {33076#(= ~p_dw_pc~0 0)} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {33076#(= ~p_dw_pc~0 0)} assume { :end_inline_init_threads1 } true; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,409 INFO L272 TraceCheckUtils]: 12: Hoare triple {33076#(= ~p_dw_pc~0 0)} call fire_delta_events1(); {33115#(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:05,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {33115#(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); {33074#true} is VALID [2022-02-20 19:57:05,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {33074#true} assume !(0 == ~q_write_ev~0); {33074#true} is VALID [2022-02-20 19:57:05,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {33074#true} assume true; {33074#true} is VALID [2022-02-20 19:57:05,410 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {33074#true} {33076#(= ~p_dw_pc~0 0)} #878#return; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,410 INFO L272 TraceCheckUtils]: 17: Hoare triple {33076#(= ~p_dw_pc~0 0)} call activate_threads1(); {33116#(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:05,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {33116#(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; {33074#true} is VALID [2022-02-20 19:57:05,410 INFO L272 TraceCheckUtils]: 19: Hoare triple {33074#true} call #t~ret8 := is_do_write_p_triggered(); {33074#true} is VALID [2022-02-20 19:57:05,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {33074#true} havoc ~__retres1~0; {33074#true} is VALID [2022-02-20 19:57:05,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {33074#true} assume !(1 == ~p_dw_pc~0); {33074#true} is VALID [2022-02-20 19:57:05,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {33074#true} ~__retres1~0 := 0; {33074#true} is VALID [2022-02-20 19:57:05,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {33074#true} #res := ~__retres1~0; {33074#true} is VALID [2022-02-20 19:57:05,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {33074#true} assume true; {33074#true} is VALID [2022-02-20 19:57:05,411 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {33074#true} {33074#true} #872#return; {33074#true} is VALID [2022-02-20 19:57:05,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {33074#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {33074#true} is VALID [2022-02-20 19:57:05,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {33074#true} assume !(0 != ~tmp~1); {33074#true} is VALID [2022-02-20 19:57:05,411 INFO L272 TraceCheckUtils]: 28: Hoare triple {33074#true} call #t~ret9 := is_do_read_c_triggered(); {33074#true} is VALID [2022-02-20 19:57:05,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {33074#true} havoc ~__retres1~1; {33074#true} is VALID [2022-02-20 19:57:05,412 INFO L290 TraceCheckUtils]: 30: Hoare triple {33074#true} assume !(1 == ~c_dr_pc~0); {33074#true} is VALID [2022-02-20 19:57:05,412 INFO L290 TraceCheckUtils]: 31: Hoare triple {33074#true} ~__retres1~1 := 0; {33074#true} is VALID [2022-02-20 19:57:05,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {33074#true} #res := ~__retres1~1; {33074#true} is VALID [2022-02-20 19:57:05,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {33074#true} assume true; {33074#true} is VALID [2022-02-20 19:57:05,412 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {33074#true} {33074#true} #874#return; {33074#true} is VALID [2022-02-20 19:57:05,412 INFO L290 TraceCheckUtils]: 35: Hoare triple {33074#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {33074#true} is VALID [2022-02-20 19:57:05,412 INFO L290 TraceCheckUtils]: 36: Hoare triple {33074#true} assume !(0 != ~tmp___0~1); {33074#true} is VALID [2022-02-20 19:57:05,412 INFO L290 TraceCheckUtils]: 37: Hoare triple {33074#true} assume true; {33074#true} is VALID [2022-02-20 19:57:05,413 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {33074#true} {33076#(= ~p_dw_pc~0 0)} #880#return; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,413 INFO L272 TraceCheckUtils]: 39: Hoare triple {33076#(= ~p_dw_pc~0 0)} call reset_delta_events1(); {33115#(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:05,413 INFO L290 TraceCheckUtils]: 40: Hoare triple {33115#(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); {33074#true} is VALID [2022-02-20 19:57:05,413 INFO L290 TraceCheckUtils]: 41: Hoare triple {33074#true} assume !(1 == ~q_write_ev~0); {33074#true} is VALID [2022-02-20 19:57:05,413 INFO L290 TraceCheckUtils]: 42: Hoare triple {33074#true} assume true; {33074#true} is VALID [2022-02-20 19:57:05,414 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {33074#true} {33076#(= ~p_dw_pc~0 0)} #882#return; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,414 INFO L290 TraceCheckUtils]: 44: Hoare triple {33076#(= ~p_dw_pc~0 0)} assume !false; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,414 INFO L290 TraceCheckUtils]: 45: Hoare triple {33076#(= ~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; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,414 INFO L290 TraceCheckUtils]: 46: Hoare triple {33076#(= ~p_dw_pc~0 0)} assume !false; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,414 INFO L272 TraceCheckUtils]: 47: Hoare triple {33076#(= ~p_dw_pc~0 0)} call eval1_#t~ret10#1 := exists_runnable_thread1(); {33074#true} is VALID [2022-02-20 19:57:05,415 INFO L290 TraceCheckUtils]: 48: Hoare triple {33074#true} havoc ~__retres1~2; {33074#true} is VALID [2022-02-20 19:57:05,415 INFO L290 TraceCheckUtils]: 49: Hoare triple {33074#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {33074#true} is VALID [2022-02-20 19:57:05,415 INFO L290 TraceCheckUtils]: 50: Hoare triple {33074#true} #res := ~__retres1~2; {33074#true} is VALID [2022-02-20 19:57:05,415 INFO L290 TraceCheckUtils]: 51: Hoare triple {33074#true} assume true; {33074#true} is VALID [2022-02-20 19:57:05,415 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {33074#true} {33076#(= ~p_dw_pc~0 0)} #884#return; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,415 INFO L290 TraceCheckUtils]: 53: Hoare triple {33076#(= ~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; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,416 INFO L290 TraceCheckUtils]: 54: Hoare triple {33076#(= ~p_dw_pc~0 0)} assume 0 != eval1_~tmp___1~0#1; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,416 INFO L290 TraceCheckUtils]: 55: Hoare triple {33076#(= ~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; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,416 INFO L290 TraceCheckUtils]: 56: Hoare triple {33076#(= ~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; {33076#(= ~p_dw_pc~0 0)} is VALID [2022-02-20 19:57:05,417 INFO L290 TraceCheckUtils]: 57: Hoare triple {33076#(= ~p_dw_pc~0 0)} assume !(0 == ~p_dw_pc~0); {33075#false} is VALID [2022-02-20 19:57:05,417 INFO L290 TraceCheckUtils]: 58: Hoare triple {33075#false} assume 1 == ~p_dw_pc~0; {33075#false} is VALID [2022-02-20 19:57:05,417 INFO L290 TraceCheckUtils]: 59: Hoare triple {33075#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; {33075#false} is VALID [2022-02-20 19:57:05,417 INFO L290 TraceCheckUtils]: 60: Hoare triple {33075#false} assume !false; {33075#false} is VALID [2022-02-20 19:57:05,417 INFO L290 TraceCheckUtils]: 61: Hoare triple {33075#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {33075#false} is VALID [2022-02-20 19:57:05,417 INFO L290 TraceCheckUtils]: 62: Hoare triple {33075#false} assume { :end_inline_do_write_p } true; {33075#false} is VALID [2022-02-20 19:57:05,417 INFO L290 TraceCheckUtils]: 63: Hoare triple {33075#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; {33075#false} is VALID [2022-02-20 19:57:05,417 INFO L290 TraceCheckUtils]: 64: Hoare triple {33075#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; {33075#false} is VALID [2022-02-20 19:57:05,417 INFO L290 TraceCheckUtils]: 65: Hoare triple {33075#false} assume 0 == ~c_dr_pc~0; {33075#false} is VALID [2022-02-20 19:57:05,417 INFO L290 TraceCheckUtils]: 66: Hoare triple {33075#false} assume !false; {33075#false} is VALID [2022-02-20 19:57:05,418 INFO L290 TraceCheckUtils]: 67: Hoare triple {33075#false} assume !(1 == ~q_free~0); {33075#false} is VALID [2022-02-20 19:57:05,418 INFO L290 TraceCheckUtils]: 68: Hoare triple {33075#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; {33075#false} is VALID [2022-02-20 19:57:05,418 INFO L290 TraceCheckUtils]: 69: Hoare triple {33075#false} assume !(~p_last_write~0 == ~c_last_read~0); {33075#false} is VALID [2022-02-20 19:57:05,418 INFO L272 TraceCheckUtils]: 70: Hoare triple {33075#false} call error1(); {33075#false} is VALID [2022-02-20 19:57:05,418 INFO L290 TraceCheckUtils]: 71: Hoare triple {33075#false} assume !false; {33075#false} is VALID [2022-02-20 19:57:05,418 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:05,418 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:05,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821948814] [2022-02-20 19:57:05,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821948814] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:05,419 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:05,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:05,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460457410] [2022-02-20 19:57:05,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:05,420 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:05,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:05,420 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:05,452 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:05,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:05,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:05,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:05,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:05,454 INFO L87 Difference]: Start difference. First operand 2065 states and 2660 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:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:07,436 INFO L93 Difference]: Finished difference Result 4911 states and 6260 transitions. [2022-02-20 19:57:07,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:57:07,436 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:07,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:07,437 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:07,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 622 transitions. [2022-02-20 19:57:07,440 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:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 622 transitions. [2022-02-20 19:57:07,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 622 transitions. [2022-02-20 19:57:07,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 622 edges. 622 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:08,170 INFO L225 Difference]: With dead ends: 4911 [2022-02-20 19:57:08,170 INFO L226 Difference]: Without dead ends: 3021 [2022-02-20 19:57:08,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:57:08,173 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 839 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:08,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [864 Valid, 732 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:57:08,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2022-02-20 19:57:08,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 2801. [2022-02-20 19:57:08,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:08,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3021 states. Second operand has 2801 states, 2183 states have (on average 1.2835547411818597) internal successors, (2802), 2225 states have internal predecessors, (2802), 308 states have call successors, (308), 245 states have call predecessors, (308), 308 states have return successors, (451), 337 states have call predecessors, (451), 306 states have call successors, (451) [2022-02-20 19:57:08,352 INFO L74 IsIncluded]: Start isIncluded. First operand 3021 states. Second operand has 2801 states, 2183 states have (on average 1.2835547411818597) internal successors, (2802), 2225 states have internal predecessors, (2802), 308 states have call successors, (308), 245 states have call predecessors, (308), 308 states have return successors, (451), 337 states have call predecessors, (451), 306 states have call successors, (451) [2022-02-20 19:57:08,355 INFO L87 Difference]: Start difference. First operand 3021 states. Second operand has 2801 states, 2183 states have (on average 1.2835547411818597) internal successors, (2802), 2225 states have internal predecessors, (2802), 308 states have call successors, (308), 245 states have call predecessors, (308), 308 states have return successors, (451), 337 states have call predecessors, (451), 306 states have call successors, (451) [2022-02-20 19:57:08,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:08,590 INFO L93 Difference]: Finished difference Result 3021 states and 3814 transitions. [2022-02-20 19:57:08,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 3814 transitions. [2022-02-20 19:57:08,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:08,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:08,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 2801 states, 2183 states have (on average 1.2835547411818597) internal successors, (2802), 2225 states have internal predecessors, (2802), 308 states have call successors, (308), 245 states have call predecessors, (308), 308 states have return successors, (451), 337 states have call predecessors, (451), 306 states have call successors, (451) Second operand 3021 states. [2022-02-20 19:57:08,600 INFO L87 Difference]: Start difference. First operand has 2801 states, 2183 states have (on average 1.2835547411818597) internal successors, (2802), 2225 states have internal predecessors, (2802), 308 states have call successors, (308), 245 states have call predecessors, (308), 308 states have return successors, (451), 337 states have call predecessors, (451), 306 states have call successors, (451) Second operand 3021 states. [2022-02-20 19:57:08,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:08,841 INFO L93 Difference]: Finished difference Result 3021 states and 3814 transitions. [2022-02-20 19:57:08,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 3814 transitions. [2022-02-20 19:57:08,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:08,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:08,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:08,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2801 states, 2183 states have (on average 1.2835547411818597) internal successors, (2802), 2225 states have internal predecessors, (2802), 308 states have call successors, (308), 245 states have call predecessors, (308), 308 states have return successors, (451), 337 states have call predecessors, (451), 306 states have call successors, (451) [2022-02-20 19:57:09,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 3561 transitions. [2022-02-20 19:57:09,160 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 3561 transitions. Word has length 72 [2022-02-20 19:57:09,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:09,160 INFO L470 AbstractCegarLoop]: Abstraction has 2801 states and 3561 transitions. [2022-02-20 19:57:09,160 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:09,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 3561 transitions. [2022-02-20 19:57:09,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 19:57:09,162 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:09,162 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:09,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:57:09,163 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:09,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash -680171098, now seen corresponding path program 1 times [2022-02-20 19:57:09,163 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:09,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901457915] [2022-02-20 19:57:09,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:09,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:09,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:09,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {49570#(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); {49529#true} is VALID [2022-02-20 19:57:09,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {49529#true} assume true; {49529#true} is VALID [2022-02-20 19:57:09,211 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49529#true} {49529#true} #876#return; {49529#true} is VALID [2022-02-20 19:57:09,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:09,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {49571#(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); {49529#true} is VALID [2022-02-20 19:57:09,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {49529#true} assume !(0 == ~q_write_ev~0); {49529#true} is VALID [2022-02-20 19:57:09,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {49529#true} assume true; {49529#true} is VALID [2022-02-20 19:57:09,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49529#true} {49529#true} #878#return; {49529#true} is VALID [2022-02-20 19:57:09,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:09,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:09,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {49529#true} havoc ~__retres1~0; {49529#true} is VALID [2022-02-20 19:57:09,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {49529#true} assume !(1 == ~p_dw_pc~0); {49529#true} is VALID [2022-02-20 19:57:09,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {49529#true} ~__retres1~0 := 0; {49529#true} is VALID [2022-02-20 19:57:09,233 INFO L290 TraceCheckUtils]: 3: Hoare triple {49529#true} #res := ~__retres1~0; {49529#true} is VALID [2022-02-20 19:57:09,233 INFO L290 TraceCheckUtils]: 4: Hoare triple {49529#true} assume true; {49529#true} is VALID [2022-02-20 19:57:09,233 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {49529#true} {49529#true} #872#return; {49529#true} is VALID [2022-02-20 19:57:09,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:09,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {49529#true} havoc ~__retres1~1; {49529#true} is VALID [2022-02-20 19:57:09,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {49529#true} assume !(1 == ~c_dr_pc~0); {49529#true} is VALID [2022-02-20 19:57:09,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {49529#true} ~__retres1~1 := 0; {49529#true} is VALID [2022-02-20 19:57:09,235 INFO L290 TraceCheckUtils]: 3: Hoare triple {49529#true} #res := ~__retres1~1; {49529#true} is VALID [2022-02-20 19:57:09,235 INFO L290 TraceCheckUtils]: 4: Hoare triple {49529#true} assume true; {49529#true} is VALID [2022-02-20 19:57:09,235 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {49529#true} {49529#true} #874#return; {49529#true} is VALID [2022-02-20 19:57:09,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {49572#(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; {49529#true} is VALID [2022-02-20 19:57:09,236 INFO L272 TraceCheckUtils]: 1: Hoare triple {49529#true} call #t~ret8 := is_do_write_p_triggered(); {49529#true} is VALID [2022-02-20 19:57:09,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {49529#true} havoc ~__retres1~0; {49529#true} is VALID [2022-02-20 19:57:09,236 INFO L290 TraceCheckUtils]: 3: Hoare triple {49529#true} assume !(1 == ~p_dw_pc~0); {49529#true} is VALID [2022-02-20 19:57:09,236 INFO L290 TraceCheckUtils]: 4: Hoare triple {49529#true} ~__retres1~0 := 0; {49529#true} is VALID [2022-02-20 19:57:09,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {49529#true} #res := ~__retres1~0; {49529#true} is VALID [2022-02-20 19:57:09,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {49529#true} assume true; {49529#true} is VALID [2022-02-20 19:57:09,236 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {49529#true} {49529#true} #872#return; {49529#true} is VALID [2022-02-20 19:57:09,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {49529#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {49529#true} is VALID [2022-02-20 19:57:09,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {49529#true} assume !(0 != ~tmp~1); {49529#true} is VALID [2022-02-20 19:57:09,237 INFO L272 TraceCheckUtils]: 10: Hoare triple {49529#true} call #t~ret9 := is_do_read_c_triggered(); {49529#true} is VALID [2022-02-20 19:57:09,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {49529#true} havoc ~__retres1~1; {49529#true} is VALID [2022-02-20 19:57:09,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {49529#true} assume !(1 == ~c_dr_pc~0); {49529#true} is VALID [2022-02-20 19:57:09,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {49529#true} ~__retres1~1 := 0; {49529#true} is VALID [2022-02-20 19:57:09,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {49529#true} #res := ~__retres1~1; {49529#true} is VALID [2022-02-20 19:57:09,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {49529#true} assume true; {49529#true} is VALID [2022-02-20 19:57:09,237 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {49529#true} {49529#true} #874#return; {49529#true} is VALID [2022-02-20 19:57:09,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {49529#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {49529#true} is VALID [2022-02-20 19:57:09,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {49529#true} assume !(0 != ~tmp___0~1); {49529#true} is VALID [2022-02-20 19:57:09,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {49529#true} assume true; {49529#true} is VALID [2022-02-20 19:57:09,238 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {49529#true} {49529#true} #880#return; {49529#true} is VALID [2022-02-20 19:57:09,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:09,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {49571#(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); {49529#true} is VALID [2022-02-20 19:57:09,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {49529#true} assume !(1 == ~q_write_ev~0); {49529#true} is VALID [2022-02-20 19:57:09,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {49529#true} assume true; {49529#true} is VALID [2022-02-20 19:57:09,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49529#true} {49529#true} #882#return; {49529#true} is VALID [2022-02-20 19:57:09,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:09,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {49529#true} havoc ~__retres1~2; {49529#true} is VALID [2022-02-20 19:57:09,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {49529#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {49529#true} is VALID [2022-02-20 19:57:09,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {49529#true} #res := ~__retres1~2; {49529#true} is VALID [2022-02-20 19:57:09,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {49529#true} assume true; {49529#true} is VALID [2022-02-20 19:57:09,242 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {49529#true} {49529#true} #884#return; {49529#true} is VALID [2022-02-20 19:57:09,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {49529#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {49529#true} is VALID [2022-02-20 19:57:09,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {49529#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {49529#true} is VALID [2022-02-20 19:57:09,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {49529#true} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {49529#true} is VALID [2022-02-20 19:57:09,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {49529#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; {49529#true} is VALID [2022-02-20 19:57:09,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {49529#true} call update_channels1(); {49570#(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:09,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {49570#(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); {49529#true} is VALID [2022-02-20 19:57:09,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {49529#true} assume true; {49529#true} is VALID [2022-02-20 19:57:09,243 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {49529#true} {49529#true} #876#return; {49529#true} is VALID [2022-02-20 19:57:09,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {49529#true} assume { :begin_inline_init_threads1 } true; {49529#true} is VALID [2022-02-20 19:57:09,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {49529#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {49529#true} is VALID [2022-02-20 19:57:09,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {49529#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {49529#true} is VALID [2022-02-20 19:57:09,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {49529#true} assume { :end_inline_init_threads1 } true; {49529#true} is VALID [2022-02-20 19:57:09,244 INFO L272 TraceCheckUtils]: 12: Hoare triple {49529#true} call fire_delta_events1(); {49571#(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:09,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {49571#(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); {49529#true} is VALID [2022-02-20 19:57:09,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {49529#true} assume !(0 == ~q_write_ev~0); {49529#true} is VALID [2022-02-20 19:57:09,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {49529#true} assume true; {49529#true} is VALID [2022-02-20 19:57:09,245 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {49529#true} {49529#true} #878#return; {49529#true} is VALID [2022-02-20 19:57:09,245 INFO L272 TraceCheckUtils]: 17: Hoare triple {49529#true} call activate_threads1(); {49572#(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:09,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {49572#(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; {49529#true} is VALID [2022-02-20 19:57:09,245 INFO L272 TraceCheckUtils]: 19: Hoare triple {49529#true} call #t~ret8 := is_do_write_p_triggered(); {49529#true} is VALID [2022-02-20 19:57:09,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {49529#true} havoc ~__retres1~0; {49529#true} is VALID [2022-02-20 19:57:09,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {49529#true} assume !(1 == ~p_dw_pc~0); {49529#true} is VALID [2022-02-20 19:57:09,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {49529#true} ~__retres1~0 := 0; {49529#true} is VALID [2022-02-20 19:57:09,246 INFO L290 TraceCheckUtils]: 23: Hoare triple {49529#true} #res := ~__retres1~0; {49529#true} is VALID [2022-02-20 19:57:09,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {49529#true} assume true; {49529#true} is VALID [2022-02-20 19:57:09,246 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {49529#true} {49529#true} #872#return; {49529#true} is VALID [2022-02-20 19:57:09,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {49529#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {49529#true} is VALID [2022-02-20 19:57:09,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {49529#true} assume !(0 != ~tmp~1); {49529#true} is VALID [2022-02-20 19:57:09,246 INFO L272 TraceCheckUtils]: 28: Hoare triple {49529#true} call #t~ret9 := is_do_read_c_triggered(); {49529#true} is VALID [2022-02-20 19:57:09,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {49529#true} havoc ~__retres1~1; {49529#true} is VALID [2022-02-20 19:57:09,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {49529#true} assume !(1 == ~c_dr_pc~0); {49529#true} is VALID [2022-02-20 19:57:09,246 INFO L290 TraceCheckUtils]: 31: Hoare triple {49529#true} ~__retres1~1 := 0; {49529#true} is VALID [2022-02-20 19:57:09,246 INFO L290 TraceCheckUtils]: 32: Hoare triple {49529#true} #res := ~__retres1~1; {49529#true} is VALID [2022-02-20 19:57:09,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {49529#true} assume true; {49529#true} is VALID [2022-02-20 19:57:09,247 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {49529#true} {49529#true} #874#return; {49529#true} is VALID [2022-02-20 19:57:09,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {49529#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {49529#true} is VALID [2022-02-20 19:57:09,247 INFO L290 TraceCheckUtils]: 36: Hoare triple {49529#true} assume !(0 != ~tmp___0~1); {49529#true} is VALID [2022-02-20 19:57:09,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {49529#true} assume true; {49529#true} is VALID [2022-02-20 19:57:09,247 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {49529#true} {49529#true} #880#return; {49529#true} is VALID [2022-02-20 19:57:09,247 INFO L272 TraceCheckUtils]: 39: Hoare triple {49529#true} call reset_delta_events1(); {49571#(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:09,248 INFO L290 TraceCheckUtils]: 40: Hoare triple {49571#(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); {49529#true} is VALID [2022-02-20 19:57:09,248 INFO L290 TraceCheckUtils]: 41: Hoare triple {49529#true} assume !(1 == ~q_write_ev~0); {49529#true} is VALID [2022-02-20 19:57:09,248 INFO L290 TraceCheckUtils]: 42: Hoare triple {49529#true} assume true; {49529#true} is VALID [2022-02-20 19:57:09,248 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {49529#true} {49529#true} #882#return; {49529#true} is VALID [2022-02-20 19:57:09,248 INFO L290 TraceCheckUtils]: 44: Hoare triple {49529#true} assume !false; {49529#true} is VALID [2022-02-20 19:57:09,248 INFO L290 TraceCheckUtils]: 45: Hoare triple {49529#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; {49529#true} is VALID [2022-02-20 19:57:09,248 INFO L290 TraceCheckUtils]: 46: Hoare triple {49529#true} assume !false; {49529#true} is VALID [2022-02-20 19:57:09,248 INFO L272 TraceCheckUtils]: 47: Hoare triple {49529#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {49529#true} is VALID [2022-02-20 19:57:09,248 INFO L290 TraceCheckUtils]: 48: Hoare triple {49529#true} havoc ~__retres1~2; {49529#true} is VALID [2022-02-20 19:57:09,249 INFO L290 TraceCheckUtils]: 49: Hoare triple {49529#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {49529#true} is VALID [2022-02-20 19:57:09,249 INFO L290 TraceCheckUtils]: 50: Hoare triple {49529#true} #res := ~__retres1~2; {49529#true} is VALID [2022-02-20 19:57:09,249 INFO L290 TraceCheckUtils]: 51: Hoare triple {49529#true} assume true; {49529#true} is VALID [2022-02-20 19:57:09,249 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {49529#true} {49529#true} #884#return; {49529#true} is VALID [2022-02-20 19:57:09,249 INFO L290 TraceCheckUtils]: 53: Hoare triple {49529#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; {49529#true} is VALID [2022-02-20 19:57:09,249 INFO L290 TraceCheckUtils]: 54: Hoare triple {49529#true} assume 0 != eval1_~tmp___1~0#1; {49529#true} is VALID [2022-02-20 19:57:09,249 INFO L290 TraceCheckUtils]: 55: Hoare triple {49529#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; {49529#true} is VALID [2022-02-20 19:57:09,249 INFO L290 TraceCheckUtils]: 56: Hoare triple {49529#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; {49529#true} is VALID [2022-02-20 19:57:09,249 INFO L290 TraceCheckUtils]: 57: Hoare triple {49529#true} assume 0 == ~p_dw_pc~0; {49529#true} is VALID [2022-02-20 19:57:09,250 INFO L290 TraceCheckUtils]: 58: Hoare triple {49529#true} assume !false; {49529#true} is VALID [2022-02-20 19:57:09,250 INFO L290 TraceCheckUtils]: 59: Hoare triple {49529#true} assume !(0 == ~q_free~0); {49529#true} is VALID [2022-02-20 19:57:09,250 INFO L290 TraceCheckUtils]: 60: Hoare triple {49529#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; {49568#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:09,250 INFO L290 TraceCheckUtils]: 61: Hoare triple {49568#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {49568#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:09,251 INFO L290 TraceCheckUtils]: 62: Hoare triple {49568#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {49568#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:09,251 INFO L290 TraceCheckUtils]: 63: Hoare triple {49568#(= ~p_last_write~0 ~q_buf_0~0)} assume { :end_inline_do_write_p } true; {49568#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:09,251 INFO L290 TraceCheckUtils]: 64: Hoare triple {49568#(= ~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; {49568#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:09,252 INFO L290 TraceCheckUtils]: 65: Hoare triple {49568#(= ~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; {49568#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:09,252 INFO L290 TraceCheckUtils]: 66: Hoare triple {49568#(= ~p_last_write~0 ~q_buf_0~0)} assume 0 == ~c_dr_pc~0; {49568#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:09,252 INFO L290 TraceCheckUtils]: 67: Hoare triple {49568#(= ~p_last_write~0 ~q_buf_0~0)} assume !false; {49568#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:09,253 INFO L290 TraceCheckUtils]: 68: Hoare triple {49568#(= ~p_last_write~0 ~q_buf_0~0)} assume !(1 == ~q_free~0); {49568#(= ~p_last_write~0 ~q_buf_0~0)} is VALID [2022-02-20 19:57:09,253 INFO L290 TraceCheckUtils]: 69: Hoare triple {49568#(= ~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; {49569#(= ~c_last_read~0 ~p_last_write~0)} is VALID [2022-02-20 19:57:09,253 INFO L290 TraceCheckUtils]: 70: Hoare triple {49569#(= ~c_last_read~0 ~p_last_write~0)} assume !(~p_last_write~0 == ~c_last_read~0); {49530#false} is VALID [2022-02-20 19:57:09,253 INFO L272 TraceCheckUtils]: 71: Hoare triple {49530#false} call error1(); {49530#false} is VALID [2022-02-20 19:57:09,253 INFO L290 TraceCheckUtils]: 72: Hoare triple {49530#false} assume !false; {49530#false} is VALID [2022-02-20 19:57:09,254 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:09,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:09,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901457915] [2022-02-20 19:57:09,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901457915] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:09,254 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:09,254 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 19:57:09,254 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534181680] [2022-02-20 19:57:09,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:09,255 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:09,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:09,256 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:09,296 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:09,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 19:57:09,296 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:09,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 19:57:09,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:57:09,297 INFO L87 Difference]: Start difference. First operand 2801 states and 3561 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:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:11,318 INFO L93 Difference]: Finished difference Result 3527 states and 4444 transitions. [2022-02-20 19:57:11,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 19:57:11,318 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:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:11,318 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:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 505 transitions. [2022-02-20 19:57:11,321 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:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 505 transitions. [2022-02-20 19:57:11,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 505 transitions. [2022-02-20 19:57:11,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 505 edges. 505 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:12,176 INFO L225 Difference]: With dead ends: 3527 [2022-02-20 19:57:12,176 INFO L226 Difference]: Without dead ends: 3524 [2022-02-20 19:57:12,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:57:12,177 INFO L933 BasicCegarLoop]: 355 mSDtfsCounter, 1202 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:12,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1212 Valid, 710 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 19:57:12,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3524 states. [2022-02-20 19:57:12,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3524 to 3271. [2022-02-20 19:57:12,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:12,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3524 states. Second operand has 3271 states, 2548 states have (on average 1.2770800627943486) internal successors, (3254), 2595 states have internal predecessors, (3254), 356 states have call successors, (356), 287 states have call predecessors, (356), 365 states have return successors, (528), 395 states have call predecessors, (528), 355 states have call successors, (528) [2022-02-20 19:57:12,388 INFO L74 IsIncluded]: Start isIncluded. First operand 3524 states. Second operand has 3271 states, 2548 states have (on average 1.2770800627943486) internal successors, (3254), 2595 states have internal predecessors, (3254), 356 states have call successors, (356), 287 states have call predecessors, (356), 365 states have return successors, (528), 395 states have call predecessors, (528), 355 states have call successors, (528) [2022-02-20 19:57:12,391 INFO L87 Difference]: Start difference. First operand 3524 states. Second operand has 3271 states, 2548 states have (on average 1.2770800627943486) internal successors, (3254), 2595 states have internal predecessors, (3254), 356 states have call successors, (356), 287 states have call predecessors, (356), 365 states have return successors, (528), 395 states have call predecessors, (528), 355 states have call successors, (528) [2022-02-20 19:57:12,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:12,754 INFO L93 Difference]: Finished difference Result 3524 states and 4430 transitions. [2022-02-20 19:57:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 4430 transitions. [2022-02-20 19:57:12,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:12,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:12,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 3271 states, 2548 states have (on average 1.2770800627943486) internal successors, (3254), 2595 states have internal predecessors, (3254), 356 states have call successors, (356), 287 states have call predecessors, (356), 365 states have return successors, (528), 395 states have call predecessors, (528), 355 states have call successors, (528) Second operand 3524 states. [2022-02-20 19:57:12,766 INFO L87 Difference]: Start difference. First operand has 3271 states, 2548 states have (on average 1.2770800627943486) internal successors, (3254), 2595 states have internal predecessors, (3254), 356 states have call successors, (356), 287 states have call predecessors, (356), 365 states have return successors, (528), 395 states have call predecessors, (528), 355 states have call successors, (528) Second operand 3524 states. [2022-02-20 19:57:13,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:13,140 INFO L93 Difference]: Finished difference Result 3524 states and 4430 transitions. [2022-02-20 19:57:13,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 4430 transitions. [2022-02-20 19:57:13,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:13,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:13,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:13,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3271 states, 2548 states have (on average 1.2770800627943486) internal successors, (3254), 2595 states have internal predecessors, (3254), 356 states have call successors, (356), 287 states have call predecessors, (356), 365 states have return successors, (528), 395 states have call predecessors, (528), 355 states have call successors, (528) [2022-02-20 19:57:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3271 states to 3271 states and 4138 transitions. [2022-02-20 19:57:13,677 INFO L78 Accepts]: Start accepts. Automaton has 3271 states and 4138 transitions. Word has length 73 [2022-02-20 19:57:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:13,677 INFO L470 AbstractCegarLoop]: Abstraction has 3271 states and 4138 transitions. [2022-02-20 19:57:13,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:57:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3271 states and 4138 transitions. [2022-02-20 19:57:13,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 19:57:13,679 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:13,679 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:13,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:57:13,680 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:13,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash 388759028, now seen corresponding path program 1 times [2022-02-20 19:57:13,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:13,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060364379] [2022-02-20 19:57:13,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:13,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {65797#(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); {65755#true} is VALID [2022-02-20 19:57:13,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:13,755 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65755#true} {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #876#return; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {65798#(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); {65755#true} is VALID [2022-02-20 19:57:13,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {65755#true} assume !(0 == ~q_write_ev~0); {65755#true} is VALID [2022-02-20 19:57:13,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:13,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65755#true} {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #878#return; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {65755#true} havoc ~__retres1~0; {65755#true} is VALID [2022-02-20 19:57:13,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {65755#true} assume !(1 == ~p_dw_pc~0); {65755#true} is VALID [2022-02-20 19:57:13,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {65755#true} ~__retres1~0 := 0; {65755#true} is VALID [2022-02-20 19:57:13,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {65755#true} #res := ~__retres1~0; {65755#true} is VALID [2022-02-20 19:57:13,780 INFO L290 TraceCheckUtils]: 4: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:13,780 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {65755#true} {65755#true} #872#return; {65755#true} is VALID [2022-02-20 19:57:13,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {65755#true} havoc ~__retres1~1; {65755#true} is VALID [2022-02-20 19:57:13,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {65755#true} assume !(1 == ~c_dr_pc~0); {65755#true} is VALID [2022-02-20 19:57:13,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {65755#true} ~__retres1~1 := 0; {65755#true} is VALID [2022-02-20 19:57:13,783 INFO L290 TraceCheckUtils]: 3: Hoare triple {65755#true} #res := ~__retres1~1; {65755#true} is VALID [2022-02-20 19:57:13,783 INFO L290 TraceCheckUtils]: 4: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:13,783 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {65755#true} {65755#true} #874#return; {65755#true} is VALID [2022-02-20 19:57:13,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {65799#(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; {65755#true} is VALID [2022-02-20 19:57:13,783 INFO L272 TraceCheckUtils]: 1: Hoare triple {65755#true} call #t~ret8 := is_do_write_p_triggered(); {65755#true} is VALID [2022-02-20 19:57:13,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {65755#true} havoc ~__retres1~0; {65755#true} is VALID [2022-02-20 19:57:13,784 INFO L290 TraceCheckUtils]: 3: Hoare triple {65755#true} assume !(1 == ~p_dw_pc~0); {65755#true} is VALID [2022-02-20 19:57:13,784 INFO L290 TraceCheckUtils]: 4: Hoare triple {65755#true} ~__retres1~0 := 0; {65755#true} is VALID [2022-02-20 19:57:13,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {65755#true} #res := ~__retres1~0; {65755#true} is VALID [2022-02-20 19:57:13,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:13,784 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {65755#true} {65755#true} #872#return; {65755#true} is VALID [2022-02-20 19:57:13,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {65755#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {65755#true} is VALID [2022-02-20 19:57:13,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {65755#true} assume !(0 != ~tmp~1); {65755#true} is VALID [2022-02-20 19:57:13,784 INFO L272 TraceCheckUtils]: 10: Hoare triple {65755#true} call #t~ret9 := is_do_read_c_triggered(); {65755#true} is VALID [2022-02-20 19:57:13,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {65755#true} havoc ~__retres1~1; {65755#true} is VALID [2022-02-20 19:57:13,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {65755#true} assume !(1 == ~c_dr_pc~0); {65755#true} is VALID [2022-02-20 19:57:13,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {65755#true} ~__retres1~1 := 0; {65755#true} is VALID [2022-02-20 19:57:13,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {65755#true} #res := ~__retres1~1; {65755#true} is VALID [2022-02-20 19:57:13,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:13,785 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {65755#true} {65755#true} #874#return; {65755#true} is VALID [2022-02-20 19:57:13,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {65755#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {65755#true} is VALID [2022-02-20 19:57:13,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {65755#true} assume !(0 != ~tmp___0~1); {65755#true} is VALID [2022-02-20 19:57:13,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:13,786 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {65755#true} {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #880#return; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {65798#(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); {65755#true} is VALID [2022-02-20 19:57:13,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {65755#true} assume !(1 == ~q_write_ev~0); {65755#true} is VALID [2022-02-20 19:57:13,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:13,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65755#true} {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #882#return; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {65755#true} havoc ~__retres1~2; {65755#true} is VALID [2022-02-20 19:57:13,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {65755#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {65755#true} is VALID [2022-02-20 19:57:13,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {65755#true} #res := ~__retres1~2; {65755#true} is VALID [2022-02-20 19:57:13,795 INFO L290 TraceCheckUtils]: 3: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:13,796 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {65755#true} {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #884#return; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {65755#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {65755#true} is VALID [2022-02-20 19:57:13,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {65755#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {65755#true} is VALID [2022-02-20 19:57:13,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {65755#true} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,797 INFO L290 TraceCheckUtils]: 3: Hoare triple {65757#(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; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {65797#(and (= ~q_ev~0 |old(~q_ev~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))} is VALID [2022-02-20 19:57:13,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {65797#(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); {65755#true} is VALID [2022-02-20 19:57:13,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:13,798 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {65755#true} {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #876#return; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,799 INFO L272 TraceCheckUtils]: 12: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {65798#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:13,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {65798#(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); {65755#true} is VALID [2022-02-20 19:57:13,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {65755#true} assume !(0 == ~q_write_ev~0); {65755#true} is VALID [2022-02-20 19:57:13,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:13,800 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {65755#true} {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #878#return; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,801 INFO L272 TraceCheckUtils]: 17: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {65799#(and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))} is VALID [2022-02-20 19:57:13,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {65799#(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; {65755#true} is VALID [2022-02-20 19:57:13,801 INFO L272 TraceCheckUtils]: 19: Hoare triple {65755#true} call #t~ret8 := is_do_write_p_triggered(); {65755#true} is VALID [2022-02-20 19:57:13,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {65755#true} havoc ~__retres1~0; {65755#true} is VALID [2022-02-20 19:57:13,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {65755#true} assume !(1 == ~p_dw_pc~0); {65755#true} is VALID [2022-02-20 19:57:13,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {65755#true} ~__retres1~0 := 0; {65755#true} is VALID [2022-02-20 19:57:13,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {65755#true} #res := ~__retres1~0; {65755#true} is VALID [2022-02-20 19:57:13,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:13,801 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {65755#true} {65755#true} #872#return; {65755#true} is VALID [2022-02-20 19:57:13,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {65755#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {65755#true} is VALID [2022-02-20 19:57:13,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {65755#true} assume !(0 != ~tmp~1); {65755#true} is VALID [2022-02-20 19:57:13,801 INFO L272 TraceCheckUtils]: 28: Hoare triple {65755#true} call #t~ret9 := is_do_read_c_triggered(); {65755#true} is VALID [2022-02-20 19:57:13,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {65755#true} havoc ~__retres1~1; {65755#true} is VALID [2022-02-20 19:57:13,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {65755#true} assume !(1 == ~c_dr_pc~0); {65755#true} is VALID [2022-02-20 19:57:13,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {65755#true} ~__retres1~1 := 0; {65755#true} is VALID [2022-02-20 19:57:13,801 INFO L290 TraceCheckUtils]: 32: Hoare triple {65755#true} #res := ~__retres1~1; {65755#true} is VALID [2022-02-20 19:57:13,801 INFO L290 TraceCheckUtils]: 33: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:13,801 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {65755#true} {65755#true} #874#return; {65755#true} is VALID [2022-02-20 19:57:13,802 INFO L290 TraceCheckUtils]: 35: Hoare triple {65755#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {65755#true} is VALID [2022-02-20 19:57:13,802 INFO L290 TraceCheckUtils]: 36: Hoare triple {65755#true} assume !(0 != ~tmp___0~1); {65755#true} is VALID [2022-02-20 19:57:13,802 INFO L290 TraceCheckUtils]: 37: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:13,802 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {65755#true} {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #880#return; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,803 INFO L272 TraceCheckUtils]: 39: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {65798#(and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0))} is VALID [2022-02-20 19:57:13,803 INFO L290 TraceCheckUtils]: 40: Hoare triple {65798#(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); {65755#true} is VALID [2022-02-20 19:57:13,803 INFO L290 TraceCheckUtils]: 41: Hoare triple {65755#true} assume !(1 == ~q_write_ev~0); {65755#true} is VALID [2022-02-20 19:57:13,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:13,803 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {65755#true} {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #882#return; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,804 INFO L290 TraceCheckUtils]: 44: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,804 INFO L290 TraceCheckUtils]: 45: Hoare triple {65757#(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; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,804 INFO L290 TraceCheckUtils]: 46: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,804 INFO L272 TraceCheckUtils]: 47: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {65755#true} is VALID [2022-02-20 19:57:13,805 INFO L290 TraceCheckUtils]: 48: Hoare triple {65755#true} havoc ~__retres1~2; {65755#true} is VALID [2022-02-20 19:57:13,805 INFO L290 TraceCheckUtils]: 49: Hoare triple {65755#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {65755#true} is VALID [2022-02-20 19:57:13,805 INFO L290 TraceCheckUtils]: 50: Hoare triple {65755#true} #res := ~__retres1~2; {65755#true} is VALID [2022-02-20 19:57:13,805 INFO L290 TraceCheckUtils]: 51: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:13,805 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {65755#true} {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #884#return; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,806 INFO L290 TraceCheckUtils]: 53: Hoare triple {65757#(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; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,806 INFO L290 TraceCheckUtils]: 54: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,806 INFO L290 TraceCheckUtils]: 55: Hoare triple {65757#(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; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,807 INFO L290 TraceCheckUtils]: 56: Hoare triple {65757#(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; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,807 INFO L290 TraceCheckUtils]: 57: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,807 INFO L290 TraceCheckUtils]: 58: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,808 INFO L290 TraceCheckUtils]: 59: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:13,808 INFO L290 TraceCheckUtils]: 60: Hoare triple {65757#(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; {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:13,808 INFO L290 TraceCheckUtils]: 61: Hoare triple {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:13,809 INFO L290 TraceCheckUtils]: 62: Hoare triple {65795#(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; {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:13,809 INFO L290 TraceCheckUtils]: 63: Hoare triple {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:13,810 INFO L290 TraceCheckUtils]: 64: Hoare triple {65795#(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; {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:13,810 INFO L290 TraceCheckUtils]: 65: Hoare triple {65795#(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; {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:13,810 INFO L290 TraceCheckUtils]: 66: Hoare triple {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:13,811 INFO L290 TraceCheckUtils]: 67: Hoare triple {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:13,811 INFO L290 TraceCheckUtils]: 68: Hoare triple {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:13,811 INFO L290 TraceCheckUtils]: 69: Hoare triple {65795#(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; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:13,812 INFO L290 TraceCheckUtils]: 70: Hoare triple {65796#(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; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:13,812 INFO L290 TraceCheckUtils]: 71: Hoare triple {65796#(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); {65756#false} is VALID [2022-02-20 19:57:13,812 INFO L272 TraceCheckUtils]: 72: Hoare triple {65756#false} call error1(); {65756#false} is VALID [2022-02-20 19:57:13,812 INFO L290 TraceCheckUtils]: 73: Hoare triple {65756#false} assume !false; {65756#false} is VALID [2022-02-20 19:57:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:13,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:13,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060364379] [2022-02-20 19:57:13,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060364379] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 19:57:13,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507987759] [2022-02-20 19:57:13,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:13,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:57:13,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:57:13,815 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:57:13,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 19:57:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 19:57:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:13,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:57:14,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {65755#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {65755#true} is VALID [2022-02-20 19:57:14,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {65755#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {65755#true} is VALID [2022-02-20 19:57:14,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {65755#true} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,487 INFO L290 TraceCheckUtils]: 3: Hoare triple {65757#(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; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call update_channels1(); {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_req_up~0); {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,489 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #876#return; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :begin_inline_init_threads1 } true; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume { :end_inline_init_threads1 } true; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,490 INFO L272 TraceCheckUtils]: 12: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call fire_delta_events1(); {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_read_ev~0); {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_write_ev~0); {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,492 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #878#return; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,492 INFO L272 TraceCheckUtils]: 17: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call activate_threads1(); {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~tmp~1;havoc ~tmp___0~1; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,492 INFO L272 TraceCheckUtils]: 19: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret8 := is_do_write_p_triggered(); {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~0; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~p_dw_pc~0); {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~0 := 0; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~0; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,495 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #872#return; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {65757#(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; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp~1); {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,496 INFO L272 TraceCheckUtils]: 28: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call #t~ret9 := is_do_read_c_triggered(); {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~1; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~c_dr_pc~0); {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} ~__retres1~1 := 0; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~1; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,498 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #874#return; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {65757#(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; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 != ~tmp___0~1); {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,499 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #880#return; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,499 INFO L272 TraceCheckUtils]: 39: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call reset_delta_events1(); {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,500 INFO L290 TraceCheckUtils]: 40: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_read_ev~0); {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,500 INFO L290 TraceCheckUtils]: 41: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(1 == ~q_write_ev~0); {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,500 INFO L290 TraceCheckUtils]: 42: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,501 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #882#return; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,501 INFO L290 TraceCheckUtils]: 44: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,501 INFO L290 TraceCheckUtils]: 45: Hoare triple {65757#(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; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,518 INFO L290 TraceCheckUtils]: 46: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,519 INFO L272 TraceCheckUtils]: 47: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} call eval1_#t~ret10#1 := exists_runnable_thread1(); {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,519 INFO L290 TraceCheckUtils]: 48: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} havoc ~__retres1~2; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,519 INFO L290 TraceCheckUtils]: 49: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,520 INFO L290 TraceCheckUtils]: 50: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #res := ~__retres1~2; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,520 INFO L290 TraceCheckUtils]: 51: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume true; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,520 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} #884#return; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,521 INFO L290 TraceCheckUtils]: 53: Hoare triple {65757#(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; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,521 INFO L290 TraceCheckUtils]: 54: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 != eval1_~tmp___1~0#1; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,521 INFO L290 TraceCheckUtils]: 55: Hoare triple {65757#(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; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,522 INFO L290 TraceCheckUtils]: 56: Hoare triple {65757#(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; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,522 INFO L290 TraceCheckUtils]: 57: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume 0 == ~p_dw_pc~0; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,522 INFO L290 TraceCheckUtils]: 58: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !false; {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,523 INFO L290 TraceCheckUtils]: 59: Hoare triple {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} assume !(0 == ~q_free~0); {65757#(and (= ~p_num_write~0 0) (= ~c_num_read~0 0))} is VALID [2022-02-20 19:57:14,523 INFO L290 TraceCheckUtils]: 60: Hoare triple {65757#(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; {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:14,523 INFO L290 TraceCheckUtils]: 61: Hoare triple {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:14,524 INFO L290 TraceCheckUtils]: 62: Hoare triple {65795#(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; {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:14,524 INFO L290 TraceCheckUtils]: 63: Hoare triple {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume { :end_inline_do_write_p } true; {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:14,524 INFO L290 TraceCheckUtils]: 64: Hoare triple {65795#(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; {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:14,525 INFO L290 TraceCheckUtils]: 65: Hoare triple {65795#(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; {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:14,525 INFO L290 TraceCheckUtils]: 66: Hoare triple {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume 0 == ~c_dr_pc~0; {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:14,525 INFO L290 TraceCheckUtils]: 67: Hoare triple {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !false; {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:14,526 INFO L290 TraceCheckUtils]: 68: Hoare triple {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} assume !(1 == ~q_free~0); {65795#(and (= ~c_num_read~0 0) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:14,526 INFO L290 TraceCheckUtils]: 69: Hoare triple {65795#(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; {66022#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:14,526 INFO L290 TraceCheckUtils]: 70: Hoare triple {66022#(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; {66022#(and (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0))} is VALID [2022-02-20 19:57:14,527 INFO L290 TraceCheckUtils]: 71: Hoare triple {66022#(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); {65756#false} is VALID [2022-02-20 19:57:14,527 INFO L272 TraceCheckUtils]: 72: Hoare triple {65756#false} call error1(); {65756#false} is VALID [2022-02-20 19:57:14,527 INFO L290 TraceCheckUtils]: 73: Hoare triple {65756#false} assume !false; {65756#false} is VALID [2022-02-20 19:57:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:14,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:57:14,832 INFO L290 TraceCheckUtils]: 73: Hoare triple {65756#false} assume !false; {65756#false} is VALID [2022-02-20 19:57:14,832 INFO L272 TraceCheckUtils]: 72: Hoare triple {65756#false} call error1(); {65756#false} is VALID [2022-02-20 19:57:14,832 INFO L290 TraceCheckUtils]: 71: Hoare triple {65796#(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); {65756#false} is VALID [2022-02-20 19:57:14,833 INFO L290 TraceCheckUtils]: 70: Hoare triple {65796#(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; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,833 INFO L290 TraceCheckUtils]: 69: Hoare triple {66047#(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; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,833 INFO L290 TraceCheckUtils]: 68: Hoare triple {66047#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !(1 == ~q_free~0); {66047#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:14,834 INFO L290 TraceCheckUtils]: 67: Hoare triple {66047#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {66047#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:14,834 INFO L290 TraceCheckUtils]: 66: Hoare triple {66047#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume 0 == ~c_dr_pc~0; {66047#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:14,834 INFO L290 TraceCheckUtils]: 65: Hoare triple {66047#(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; {66047#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:14,835 INFO L290 TraceCheckUtils]: 64: Hoare triple {66047#(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; {66047#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:14,835 INFO L290 TraceCheckUtils]: 63: Hoare triple {66047#(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; {66047#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:14,835 INFO L290 TraceCheckUtils]: 62: Hoare triple {66047#(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; {66047#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:14,836 INFO L290 TraceCheckUtils]: 61: Hoare triple {66047#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} assume !false; {66047#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:14,836 INFO L290 TraceCheckUtils]: 60: Hoare triple {65796#(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; {66047#(and (< ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1)))} is VALID [2022-02-20 19:57:14,836 INFO L290 TraceCheckUtils]: 59: Hoare triple {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !(0 == ~q_free~0); {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,837 INFO L290 TraceCheckUtils]: 58: Hoare triple {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,837 INFO L290 TraceCheckUtils]: 57: Hoare triple {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume 0 == ~p_dw_pc~0; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,837 INFO L290 TraceCheckUtils]: 56: Hoare triple {65796#(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; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,838 INFO L290 TraceCheckUtils]: 55: Hoare triple {65796#(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; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,838 INFO L290 TraceCheckUtils]: 54: Hoare triple {65796#(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; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,838 INFO L290 TraceCheckUtils]: 53: Hoare triple {65796#(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; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,839 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {65755#true} {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #884#return; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,839 INFO L290 TraceCheckUtils]: 51: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:14,839 INFO L290 TraceCheckUtils]: 50: Hoare triple {65755#true} #res := ~__retres1~2; {65755#true} is VALID [2022-02-20 19:57:14,839 INFO L290 TraceCheckUtils]: 49: Hoare triple {65755#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {65755#true} is VALID [2022-02-20 19:57:14,839 INFO L290 TraceCheckUtils]: 48: Hoare triple {65755#true} havoc ~__retres1~2; {65755#true} is VALID [2022-02-20 19:57:14,839 INFO L272 TraceCheckUtils]: 47: Hoare triple {65796#(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(); {65755#true} is VALID [2022-02-20 19:57:14,839 INFO L290 TraceCheckUtils]: 46: Hoare triple {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,840 INFO L290 TraceCheckUtils]: 45: Hoare triple {65796#(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; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,840 INFO L290 TraceCheckUtils]: 44: Hoare triple {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume !false; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,840 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {65755#true} {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #882#return; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,840 INFO L290 TraceCheckUtils]: 42: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:14,840 INFO L290 TraceCheckUtils]: 41: Hoare triple {65755#true} assume !(1 == ~q_write_ev~0); {65755#true} is VALID [2022-02-20 19:57:14,840 INFO L290 TraceCheckUtils]: 40: Hoare triple {65755#true} assume !(1 == ~q_read_ev~0); {65755#true} is VALID [2022-02-20 19:57:14,840 INFO L272 TraceCheckUtils]: 39: Hoare triple {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call reset_delta_events1(); {65755#true} is VALID [2022-02-20 19:57:14,841 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {65755#true} {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #880#return; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,841 INFO L290 TraceCheckUtils]: 37: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:14,841 INFO L290 TraceCheckUtils]: 36: Hoare triple {65755#true} assume !(0 != ~tmp___0~1); {65755#true} is VALID [2022-02-20 19:57:14,841 INFO L290 TraceCheckUtils]: 35: Hoare triple {65755#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {65755#true} is VALID [2022-02-20 19:57:14,841 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {65755#true} {65755#true} #874#return; {65755#true} is VALID [2022-02-20 19:57:14,841 INFO L290 TraceCheckUtils]: 33: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:14,841 INFO L290 TraceCheckUtils]: 32: Hoare triple {65755#true} #res := ~__retres1~1; {65755#true} is VALID [2022-02-20 19:57:14,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {65755#true} ~__retres1~1 := 0; {65755#true} is VALID [2022-02-20 19:57:14,841 INFO L290 TraceCheckUtils]: 30: Hoare triple {65755#true} assume !(1 == ~c_dr_pc~0); {65755#true} is VALID [2022-02-20 19:57:14,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {65755#true} havoc ~__retres1~1; {65755#true} is VALID [2022-02-20 19:57:14,841 INFO L272 TraceCheckUtils]: 28: Hoare triple {65755#true} call #t~ret9 := is_do_read_c_triggered(); {65755#true} is VALID [2022-02-20 19:57:14,841 INFO L290 TraceCheckUtils]: 27: Hoare triple {65755#true} assume !(0 != ~tmp~1); {65755#true} is VALID [2022-02-20 19:57:14,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {65755#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {65755#true} is VALID [2022-02-20 19:57:14,841 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {65755#true} {65755#true} #872#return; {65755#true} is VALID [2022-02-20 19:57:14,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:14,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {65755#true} #res := ~__retres1~0; {65755#true} is VALID [2022-02-20 19:57:14,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {65755#true} ~__retres1~0 := 0; {65755#true} is VALID [2022-02-20 19:57:14,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {65755#true} assume !(1 == ~p_dw_pc~0); {65755#true} is VALID [2022-02-20 19:57:14,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {65755#true} havoc ~__retres1~0; {65755#true} is VALID [2022-02-20 19:57:14,841 INFO L272 TraceCheckUtils]: 19: Hoare triple {65755#true} call #t~ret8 := is_do_write_p_triggered(); {65755#true} is VALID [2022-02-20 19:57:14,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {65755#true} havoc ~tmp~1;havoc ~tmp___0~1; {65755#true} is VALID [2022-02-20 19:57:14,842 INFO L272 TraceCheckUtils]: 17: Hoare triple {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call activate_threads1(); {65755#true} is VALID [2022-02-20 19:57:14,842 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {65755#true} {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #878#return; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:14,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {65755#true} assume !(0 == ~q_write_ev~0); {65755#true} is VALID [2022-02-20 19:57:14,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {65755#true} assume !(0 == ~q_read_ev~0); {65755#true} is VALID [2022-02-20 19:57:14,842 INFO L272 TraceCheckUtils]: 12: Hoare triple {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call fire_delta_events1(); {65755#true} is VALID [2022-02-20 19:57:14,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :end_inline_init_threads1 } true; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {65796#(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; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {65796#(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; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} assume { :begin_inline_init_threads1 } true; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,844 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {65755#true} {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} #876#return; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {65755#true} assume true; {65755#true} is VALID [2022-02-20 19:57:14,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {65755#true} assume !(1 == ~q_req_up~0); {65755#true} is VALID [2022-02-20 19:57:14,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} call update_channels1(); {65755#true} is VALID [2022-02-20 19:57:14,844 INFO L290 TraceCheckUtils]: 3: Hoare triple {65796#(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; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {65755#true} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {65796#(and (<= ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 (+ ~p_num_write~0 1)))} is VALID [2022-02-20 19:57:14,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {65755#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {65755#true} is VALID [2022-02-20 19:57:14,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {65755#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {65755#true} is VALID [2022-02-20 19:57:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:14,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507987759] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:57:14,845 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 19:57:14,845 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-02-20 19:57:14,845 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21984486] [2022-02-20 19:57:14,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 19:57:14,846 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-02-20 19:57:14,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:14,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:57:14,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:14,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 19:57:14,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:14,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 19:57:14,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:57:14,941 INFO L87 Difference]: Start difference. First operand 3271 states and 4138 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:57:22,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:22,456 INFO L93 Difference]: Finished difference Result 7548 states and 9468 transitions. [2022-02-20 19:57:22,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-20 19:57:22,456 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-02-20 19:57:22,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:22,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:57:22,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1000 transitions. [2022-02-20 19:57:22,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:57:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1000 transitions. [2022-02-20 19:57:22,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 1000 transitions. [2022-02-20 19:57:23,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1000 edges. 1000 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:25,536 INFO L225 Difference]: With dead ends: 7548 [2022-02-20 19:57:25,537 INFO L226 Difference]: Without dead ends: 7545 [2022-02-20 19:57:25,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-02-20 19:57:25,538 INFO L933 BasicCegarLoop]: 513 mSDtfsCounter, 1126 mSDsluCounter, 1391 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 1904 SdHoareTripleChecker+Invalid, 1826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:25,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1190 Valid, 1904 Invalid, 1826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 19:57:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7545 states. [2022-02-20 19:57:26,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7545 to 5017. [2022-02-20 19:57:26,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:26,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7545 states. Second operand has 5017 states, 3914 states have (on average 1.275932549821155) internal successors, (4994), 3985 states have internal predecessors, (4994), 536 states have call successors, (536), 441 states have call predecessors, (536), 565 states have return successors, (806), 597 states have call predecessors, (806), 535 states have call successors, (806) [2022-02-20 19:57:26,998 INFO L74 IsIncluded]: Start isIncluded. First operand 7545 states. Second operand has 5017 states, 3914 states have (on average 1.275932549821155) internal successors, (4994), 3985 states have internal predecessors, (4994), 536 states have call successors, (536), 441 states have call predecessors, (536), 565 states have return successors, (806), 597 states have call predecessors, (806), 535 states have call successors, (806) [2022-02-20 19:57:27,004 INFO L87 Difference]: Start difference. First operand 7545 states. Second operand has 5017 states, 3914 states have (on average 1.275932549821155) internal successors, (4994), 3985 states have internal predecessors, (4994), 536 states have call successors, (536), 441 states have call predecessors, (536), 565 states have return successors, (806), 597 states have call predecessors, (806), 535 states have call successors, (806) [2022-02-20 19:57:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:28,654 INFO L93 Difference]: Finished difference Result 7545 states and 9454 transitions. [2022-02-20 19:57:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand 7545 states and 9454 transitions. [2022-02-20 19:57:28,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:28,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:28,670 INFO L74 IsIncluded]: Start isIncluded. First operand has 5017 states, 3914 states have (on average 1.275932549821155) internal successors, (4994), 3985 states have internal predecessors, (4994), 536 states have call successors, (536), 441 states have call predecessors, (536), 565 states have return successors, (806), 597 states have call predecessors, (806), 535 states have call successors, (806) Second operand 7545 states. [2022-02-20 19:57:28,675 INFO L87 Difference]: Start difference. First operand has 5017 states, 3914 states have (on average 1.275932549821155) internal successors, (4994), 3985 states have internal predecessors, (4994), 536 states have call successors, (536), 441 states have call predecessors, (536), 565 states have return successors, (806), 597 states have call predecessors, (806), 535 states have call successors, (806) Second operand 7545 states. [2022-02-20 19:57:30,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:30,292 INFO L93 Difference]: Finished difference Result 7545 states and 9454 transitions. [2022-02-20 19:57:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 7545 states and 9454 transitions. [2022-02-20 19:57:30,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:30,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:30,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:30,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:30,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5017 states, 3914 states have (on average 1.275932549821155) internal successors, (4994), 3985 states have internal predecessors, (4994), 536 states have call successors, (536), 441 states have call predecessors, (536), 565 states have return successors, (806), 597 states have call predecessors, (806), 535 states have call successors, (806) [2022-02-20 19:57:31,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5017 states to 5017 states and 6336 transitions. [2022-02-20 19:57:31,310 INFO L78 Accepts]: Start accepts. Automaton has 5017 states and 6336 transitions. Word has length 74 [2022-02-20 19:57:31,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:31,310 INFO L470 AbstractCegarLoop]: Abstraction has 5017 states and 6336 transitions. [2022-02-20 19:57:31,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-02-20 19:57:31,310 INFO L276 IsEmpty]: Start isEmpty. Operand 5017 states and 6336 transitions. [2022-02-20 19:57:31,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:57:31,312 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:31,312 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:31,331 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:57:31,514 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,SelfDestructingSolverStorable9 [2022-02-20 19:57:31,515 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:31,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:31,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1322076070, now seen corresponding path program 2 times [2022-02-20 19:57:31,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:31,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056943894] [2022-02-20 19:57:31,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:31,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,549 INFO L290 TraceCheckUtils]: 0: Hoare triple {98194#(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); {98154#true} is VALID [2022-02-20 19:57:31,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {98154#true} assume true; {98154#true} is VALID [2022-02-20 19:57:31,549 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98154#true} {98154#true} #876#return; {98154#true} is VALID [2022-02-20 19:57:31,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 19:57:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {98195#(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); {98154#true} is VALID [2022-02-20 19:57:31,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {98154#true} assume !(0 == ~q_write_ev~0); {98154#true} is VALID [2022-02-20 19:57:31,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {98154#true} assume true; {98154#true} is VALID [2022-02-20 19:57:31,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98154#true} {98154#true} #878#return; {98154#true} is VALID [2022-02-20 19:57:31,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-20 19:57:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 19:57:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {98154#true} havoc ~__retres1~0; {98154#true} is VALID [2022-02-20 19:57:31,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {98154#true} assume !(1 == ~p_dw_pc~0); {98154#true} is VALID [2022-02-20 19:57:31,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {98154#true} ~__retres1~0 := 0; {98154#true} is VALID [2022-02-20 19:57:31,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {98154#true} #res := ~__retres1~0; {98154#true} is VALID [2022-02-20 19:57:31,565 INFO L290 TraceCheckUtils]: 4: Hoare triple {98154#true} assume true; {98154#true} is VALID [2022-02-20 19:57:31,565 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {98154#true} {98154#true} #872#return; {98154#true} is VALID [2022-02-20 19:57:31,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:57:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {98154#true} havoc ~__retres1~1; {98154#true} is VALID [2022-02-20 19:57:31,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {98154#true} assume !(1 == ~c_dr_pc~0); {98154#true} is VALID [2022-02-20 19:57:31,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {98154#true} ~__retres1~1 := 0; {98154#true} is VALID [2022-02-20 19:57:31,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {98154#true} #res := ~__retres1~1; {98154#true} is VALID [2022-02-20 19:57:31,567 INFO L290 TraceCheckUtils]: 4: Hoare triple {98154#true} assume true; {98154#true} is VALID [2022-02-20 19:57:31,567 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {98154#true} {98154#true} #874#return; {98154#true} is VALID [2022-02-20 19:57:31,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {98196#(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; {98154#true} is VALID [2022-02-20 19:57:31,568 INFO L272 TraceCheckUtils]: 1: Hoare triple {98154#true} call #t~ret8 := is_do_write_p_triggered(); {98154#true} is VALID [2022-02-20 19:57:31,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {98154#true} havoc ~__retres1~0; {98154#true} is VALID [2022-02-20 19:57:31,568 INFO L290 TraceCheckUtils]: 3: Hoare triple {98154#true} assume !(1 == ~p_dw_pc~0); {98154#true} is VALID [2022-02-20 19:57:31,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {98154#true} ~__retres1~0 := 0; {98154#true} is VALID [2022-02-20 19:57:31,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {98154#true} #res := ~__retres1~0; {98154#true} is VALID [2022-02-20 19:57:31,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {98154#true} assume true; {98154#true} is VALID [2022-02-20 19:57:31,568 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {98154#true} {98154#true} #872#return; {98154#true} is VALID [2022-02-20 19:57:31,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {98154#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {98154#true} is VALID [2022-02-20 19:57:31,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {98154#true} assume !(0 != ~tmp~1); {98154#true} is VALID [2022-02-20 19:57:31,569 INFO L272 TraceCheckUtils]: 10: Hoare triple {98154#true} call #t~ret9 := is_do_read_c_triggered(); {98154#true} is VALID [2022-02-20 19:57:31,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {98154#true} havoc ~__retres1~1; {98154#true} is VALID [2022-02-20 19:57:31,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {98154#true} assume !(1 == ~c_dr_pc~0); {98154#true} is VALID [2022-02-20 19:57:31,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {98154#true} ~__retres1~1 := 0; {98154#true} is VALID [2022-02-20 19:57:31,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {98154#true} #res := ~__retres1~1; {98154#true} is VALID [2022-02-20 19:57:31,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {98154#true} assume true; {98154#true} is VALID [2022-02-20 19:57:31,569 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {98154#true} {98154#true} #874#return; {98154#true} is VALID [2022-02-20 19:57:31,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {98154#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {98154#true} is VALID [2022-02-20 19:57:31,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {98154#true} assume !(0 != ~tmp___0~1); {98154#true} is VALID [2022-02-20 19:57:31,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {98154#true} assume true; {98154#true} is VALID [2022-02-20 19:57:31,570 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {98154#true} {98154#true} #880#return; {98154#true} is VALID [2022-02-20 19:57:31,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 19:57:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {98195#(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); {98154#true} is VALID [2022-02-20 19:57:31,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {98154#true} assume !(1 == ~q_write_ev~0); {98154#true} is VALID [2022-02-20 19:57:31,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {98154#true} assume true; {98154#true} is VALID [2022-02-20 19:57:31,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98154#true} {98154#true} #882#return; {98154#true} is VALID [2022-02-20 19:57:31,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 19:57:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:31,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {98154#true} havoc ~__retres1~2; {98154#true} is VALID [2022-02-20 19:57:31,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {98154#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {98154#true} is VALID [2022-02-20 19:57:31,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {98154#true} #res := ~__retres1~2; {98154#true} is VALID [2022-02-20 19:57:31,575 INFO L290 TraceCheckUtils]: 3: Hoare triple {98154#true} assume true; {98154#true} is VALID [2022-02-20 19:57:31,575 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {98154#true} {98154#true} #884#return; {98154#true} is VALID [2022-02-20 19:57:31,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {98154#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {98154#true} is VALID [2022-02-20 19:57:31,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {98154#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {98154#true} is VALID [2022-02-20 19:57:31,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {98154#true} assume 0 != main_#t~nondet32#1;havoc main_#t~nondet32#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; {98154#true} is VALID [2022-02-20 19:57:31,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {98154#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; {98154#true} is VALID [2022-02-20 19:57:31,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {98154#true} call update_channels1(); {98194#(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,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {98194#(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); {98154#true} is VALID [2022-02-20 19:57:31,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {98154#true} assume true; {98154#true} is VALID [2022-02-20 19:57:31,576 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {98154#true} {98154#true} #876#return; {98154#true} is VALID [2022-02-20 19:57:31,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {98154#true} assume { :begin_inline_init_threads1 } true; {98154#true} is VALID [2022-02-20 19:57:31,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {98154#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {98154#true} is VALID [2022-02-20 19:57:31,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {98154#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {98154#true} is VALID [2022-02-20 19:57:31,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {98154#true} assume { :end_inline_init_threads1 } true; {98154#true} is VALID [2022-02-20 19:57:31,577 INFO L272 TraceCheckUtils]: 12: Hoare triple {98154#true} call fire_delta_events1(); {98195#(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,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {98195#(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); {98154#true} is VALID [2022-02-20 19:57:31,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {98154#true} assume !(0 == ~q_write_ev~0); {98154#true} is VALID [2022-02-20 19:57:31,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {98154#true} assume true; {98154#true} is VALID [2022-02-20 19:57:31,578 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {98154#true} {98154#true} #878#return; {98154#true} is VALID [2022-02-20 19:57:31,578 INFO L272 TraceCheckUtils]: 17: Hoare triple {98154#true} call activate_threads1(); {98196#(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,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {98196#(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; {98154#true} is VALID [2022-02-20 19:57:31,578 INFO L272 TraceCheckUtils]: 19: Hoare triple {98154#true} call #t~ret8 := is_do_write_p_triggered(); {98154#true} is VALID [2022-02-20 19:57:31,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {98154#true} havoc ~__retres1~0; {98154#true} is VALID [2022-02-20 19:57:31,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {98154#true} assume !(1 == ~p_dw_pc~0); {98154#true} is VALID [2022-02-20 19:57:31,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {98154#true} ~__retres1~0 := 0; {98154#true} is VALID [2022-02-20 19:57:31,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {98154#true} #res := ~__retres1~0; {98154#true} is VALID [2022-02-20 19:57:31,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {98154#true} assume true; {98154#true} is VALID [2022-02-20 19:57:31,579 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {98154#true} {98154#true} #872#return; {98154#true} is VALID [2022-02-20 19:57:31,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {98154#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~tmp~1 := #t~ret8;havoc #t~ret8; {98154#true} is VALID [2022-02-20 19:57:31,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {98154#true} assume !(0 != ~tmp~1); {98154#true} is VALID [2022-02-20 19:57:31,579 INFO L272 TraceCheckUtils]: 28: Hoare triple {98154#true} call #t~ret9 := is_do_read_c_triggered(); {98154#true} is VALID [2022-02-20 19:57:31,579 INFO L290 TraceCheckUtils]: 29: Hoare triple {98154#true} havoc ~__retres1~1; {98154#true} is VALID [2022-02-20 19:57:31,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {98154#true} assume !(1 == ~c_dr_pc~0); {98154#true} is VALID [2022-02-20 19:57:31,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {98154#true} ~__retres1~1 := 0; {98154#true} is VALID [2022-02-20 19:57:31,579 INFO L290 TraceCheckUtils]: 32: Hoare triple {98154#true} #res := ~__retres1~1; {98154#true} is VALID [2022-02-20 19:57:31,580 INFO L290 TraceCheckUtils]: 33: Hoare triple {98154#true} assume true; {98154#true} is VALID [2022-02-20 19:57:31,580 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {98154#true} {98154#true} #874#return; {98154#true} is VALID [2022-02-20 19:57:31,580 INFO L290 TraceCheckUtils]: 35: Hoare triple {98154#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~tmp___0~1 := #t~ret9;havoc #t~ret9; {98154#true} is VALID [2022-02-20 19:57:31,580 INFO L290 TraceCheckUtils]: 36: Hoare triple {98154#true} assume !(0 != ~tmp___0~1); {98154#true} is VALID [2022-02-20 19:57:31,580 INFO L290 TraceCheckUtils]: 37: Hoare triple {98154#true} assume true; {98154#true} is VALID [2022-02-20 19:57:31,580 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {98154#true} {98154#true} #880#return; {98154#true} is VALID [2022-02-20 19:57:31,580 INFO L272 TraceCheckUtils]: 39: Hoare triple {98154#true} call reset_delta_events1(); {98195#(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,581 INFO L290 TraceCheckUtils]: 40: Hoare triple {98195#(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); {98154#true} is VALID [2022-02-20 19:57:31,581 INFO L290 TraceCheckUtils]: 41: Hoare triple {98154#true} assume !(1 == ~q_write_ev~0); {98154#true} is VALID [2022-02-20 19:57:31,581 INFO L290 TraceCheckUtils]: 42: Hoare triple {98154#true} assume true; {98154#true} is VALID [2022-02-20 19:57:31,581 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {98154#true} {98154#true} #882#return; {98154#true} is VALID [2022-02-20 19:57:31,581 INFO L290 TraceCheckUtils]: 44: Hoare triple {98154#true} assume !false; {98154#true} is VALID [2022-02-20 19:57:31,581 INFO L290 TraceCheckUtils]: 45: Hoare triple {98154#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; {98154#true} is VALID [2022-02-20 19:57:31,581 INFO L290 TraceCheckUtils]: 46: Hoare triple {98154#true} assume !false; {98154#true} is VALID [2022-02-20 19:57:31,581 INFO L272 TraceCheckUtils]: 47: Hoare triple {98154#true} call eval1_#t~ret10#1 := exists_runnable_thread1(); {98154#true} is VALID [2022-02-20 19:57:31,581 INFO L290 TraceCheckUtils]: 48: Hoare triple {98154#true} havoc ~__retres1~2; {98154#true} is VALID [2022-02-20 19:57:31,581 INFO L290 TraceCheckUtils]: 49: Hoare triple {98154#true} assume 0 == ~p_dw_st~0;~__retres1~2 := 1; {98154#true} is VALID [2022-02-20 19:57:31,582 INFO L290 TraceCheckUtils]: 50: Hoare triple {98154#true} #res := ~__retres1~2; {98154#true} is VALID [2022-02-20 19:57:31,582 INFO L290 TraceCheckUtils]: 51: Hoare triple {98154#true} assume true; {98154#true} is VALID [2022-02-20 19:57:31,582 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {98154#true} {98154#true} #884#return; {98154#true} is VALID [2022-02-20 19:57:31,582 INFO L290 TraceCheckUtils]: 53: Hoare triple {98154#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; {98154#true} is VALID [2022-02-20 19:57:31,582 INFO L290 TraceCheckUtils]: 54: Hoare triple {98154#true} assume 0 != eval1_~tmp___1~0#1; {98154#true} is VALID [2022-02-20 19:57:31,582 INFO L290 TraceCheckUtils]: 55: Hoare triple {98154#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; {98154#true} is VALID [2022-02-20 19:57:31,582 INFO L290 TraceCheckUtils]: 56: Hoare triple {98154#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; {98154#true} is VALID [2022-02-20 19:57:31,582 INFO L290 TraceCheckUtils]: 57: Hoare triple {98154#true} assume 0 == ~p_dw_pc~0; {98154#true} is VALID [2022-02-20 19:57:31,582 INFO L290 TraceCheckUtils]: 58: Hoare triple {98154#true} assume !false; {98154#true} is VALID [2022-02-20 19:57:31,582 INFO L290 TraceCheckUtils]: 59: Hoare triple {98154#true} assume !(0 == ~q_free~0); {98154#true} is VALID [2022-02-20 19:57:31,583 INFO L290 TraceCheckUtils]: 60: Hoare triple {98154#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; {98193#(= ~q_free~0 0)} is VALID [2022-02-20 19:57:31,583 INFO L290 TraceCheckUtils]: 61: Hoare triple {98193#(= ~q_free~0 0)} assume !false; {98193#(= ~q_free~0 0)} is VALID [2022-02-20 19:57:31,583 INFO L290 TraceCheckUtils]: 62: Hoare triple {98193#(= ~q_free~0 0)} assume !(0 == ~q_free~0); {98155#false} is VALID [2022-02-20 19:57:31,583 INFO L290 TraceCheckUtils]: 63: Hoare triple {98155#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; {98155#false} is VALID [2022-02-20 19:57:31,584 INFO L290 TraceCheckUtils]: 64: Hoare triple {98155#false} assume !false; {98155#false} is VALID [2022-02-20 19:57:31,584 INFO L290 TraceCheckUtils]: 65: Hoare triple {98155#false} assume 0 == ~q_free~0;~p_dw_st~0 := 2;~p_dw_pc~0 := 1; {98155#false} is VALID [2022-02-20 19:57:31,584 INFO L290 TraceCheckUtils]: 66: Hoare triple {98155#false} assume { :end_inline_do_write_p } true; {98155#false} is VALID [2022-02-20 19:57:31,584 INFO L290 TraceCheckUtils]: 67: Hoare triple {98155#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; {98155#false} is VALID [2022-02-20 19:57:31,584 INFO L290 TraceCheckUtils]: 68: Hoare triple {98155#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; {98155#false} is VALID [2022-02-20 19:57:31,584 INFO L290 TraceCheckUtils]: 69: Hoare triple {98155#false} assume 0 == ~c_dr_pc~0; {98155#false} is VALID [2022-02-20 19:57:31,584 INFO L290 TraceCheckUtils]: 70: Hoare triple {98155#false} assume !false; {98155#false} is VALID [2022-02-20 19:57:31,584 INFO L290 TraceCheckUtils]: 71: Hoare triple {98155#false} assume !(1 == ~q_free~0); {98155#false} is VALID [2022-02-20 19:57:31,584 INFO L290 TraceCheckUtils]: 72: Hoare triple {98155#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; {98155#false} is VALID [2022-02-20 19:57:31,584 INFO L290 TraceCheckUtils]: 73: Hoare triple {98155#false} assume ~p_last_write~0 == ~c_last_read~0; {98155#false} is VALID [2022-02-20 19:57:31,585 INFO L290 TraceCheckUtils]: 74: Hoare triple {98155#false} assume !(~p_num_write~0 == ~c_num_read~0); {98155#false} is VALID [2022-02-20 19:57:31,585 INFO L272 TraceCheckUtils]: 75: Hoare triple {98155#false} call error1(); {98155#false} is VALID [2022-02-20 19:57:31,585 INFO L290 TraceCheckUtils]: 76: Hoare triple {98155#false} assume !false; {98155#false} is VALID [2022-02-20 19:57:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:57:31,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:31,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056943894] [2022-02-20 19:57:31,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056943894] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:31,585 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:31,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:31,586 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817267965] [2022-02-20 19:57:31,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:31,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2022-02-20 19:57:31,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:31,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:57:31,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:31,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:31,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:31,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:31,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:31,622 INFO L87 Difference]: Start difference. First operand 5017 states and 6336 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:57:35,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:35,997 INFO L93 Difference]: Finished difference Result 7607 states and 9625 transitions. [2022-02-20 19:57:35,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 19:57:35,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2022-02-20 19:57:35,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:35,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:57:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 609 transitions. [2022-02-20 19:57:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:57:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 609 transitions. [2022-02-20 19:57:36,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 609 transitions. [2022-02-20 19:57:36,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:37,000 INFO L225 Difference]: With dead ends: 7607 [2022-02-20 19:57:37,001 INFO L226 Difference]: Without dead ends: 3644 [2022-02-20 19:57:37,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 19:57:37,005 INFO L933 BasicCegarLoop]: 405 mSDtfsCounter, 586 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:37,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [613 Valid, 1000 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 19:57:37,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2022-02-20 19:57:38,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3437. [2022-02-20 19:57:38,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:57:38,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3644 states. Second operand has 3437 states, 2682 states have (on average 1.2580164056674124) internal successors, (3374), 2731 states have internal predecessors, (3374), 372 states have call successors, (372), 301 states have call predecessors, (372), 381 states have return successors, (536), 411 states have call predecessors, (536), 371 states have call successors, (536) [2022-02-20 19:57:38,021 INFO L74 IsIncluded]: Start isIncluded. First operand 3644 states. Second operand has 3437 states, 2682 states have (on average 1.2580164056674124) internal successors, (3374), 2731 states have internal predecessors, (3374), 372 states have call successors, (372), 301 states have call predecessors, (372), 381 states have return successors, (536), 411 states have call predecessors, (536), 371 states have call successors, (536) [2022-02-20 19:57:38,023 INFO L87 Difference]: Start difference. First operand 3644 states. Second operand has 3437 states, 2682 states have (on average 1.2580164056674124) internal successors, (3374), 2731 states have internal predecessors, (3374), 372 states have call successors, (372), 301 states have call predecessors, (372), 381 states have return successors, (536), 411 states have call predecessors, (536), 371 states have call successors, (536) [2022-02-20 19:57:38,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:38,413 INFO L93 Difference]: Finished difference Result 3644 states and 4518 transitions. [2022-02-20 19:57:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3644 states and 4518 transitions. [2022-02-20 19:57:38,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:38,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:38,421 INFO L74 IsIncluded]: Start isIncluded. First operand has 3437 states, 2682 states have (on average 1.2580164056674124) internal successors, (3374), 2731 states have internal predecessors, (3374), 372 states have call successors, (372), 301 states have call predecessors, (372), 381 states have return successors, (536), 411 states have call predecessors, (536), 371 states have call successors, (536) Second operand 3644 states. [2022-02-20 19:57:38,423 INFO L87 Difference]: Start difference. First operand has 3437 states, 2682 states have (on average 1.2580164056674124) internal successors, (3374), 2731 states have internal predecessors, (3374), 372 states have call successors, (372), 301 states have call predecessors, (372), 381 states have return successors, (536), 411 states have call predecessors, (536), 371 states have call successors, (536) Second operand 3644 states. [2022-02-20 19:57:38,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:38,793 INFO L93 Difference]: Finished difference Result 3644 states and 4518 transitions. [2022-02-20 19:57:38,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3644 states and 4518 transitions. [2022-02-20 19:57:38,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:57:38,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:57:38,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:57:38,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:57:38,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3437 states, 2682 states have (on average 1.2580164056674124) internal successors, (3374), 2731 states have internal predecessors, (3374), 372 states have call successors, (372), 301 states have call predecessors, (372), 381 states have return successors, (536), 411 states have call predecessors, (536), 371 states have call successors, (536) [2022-02-20 19:57:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3437 states to 3437 states and 4282 transitions. [2022-02-20 19:57:39,311 INFO L78 Accepts]: Start accepts. Automaton has 3437 states and 4282 transitions. Word has length 77 [2022-02-20 19:57:39,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:57:39,311 INFO L470 AbstractCegarLoop]: Abstraction has 3437 states and 4282 transitions. [2022-02-20 19:57:39,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 19:57:39,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 4282 transitions. [2022-02-20 19:57:39,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 19:57:39,313 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:57:39,313 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, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:57:39,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 19:57:39,313 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:57:39,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:57:39,313 INFO L85 PathProgramCache]: Analyzing trace with hash -360800699, now seen corresponding path program 1 times [2022-02-20 19:57:39,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:57:39,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155682167] [2022-02-20 19:57:39,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:57:39,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:57:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:39,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 19:57:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:39,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {120308#true} assume true; {120308#true} is VALID [2022-02-20 19:57:39,343 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {120308#true} {120310#(= ~M_E~0 2)} #900#return; {120310#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:39,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:57:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:39,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {120364#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {120365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:39,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {120365#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {120365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:39,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {120365#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {120365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:39,362 INFO L290 TraceCheckUtils]: 3: Hoare triple {120365#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {120365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:39,363 INFO L290 TraceCheckUtils]: 4: Hoare triple {120365#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {120365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:39,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {120365#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {120365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:39,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {120365#(= |old(~M_E~0)| 0)} assume !(0 == ~E_2~0); {120365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:39,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {120365#(= |old(~M_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {120365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:39,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {120365#(= |old(~M_E~0)| 0)} assume true; {120365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:39,364 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {120365#(= |old(~M_E~0)| 0)} {120310#(= ~M_E~0 2)} #902#return; {120309#false} is VALID [2022-02-20 19:57:39,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 19:57:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:39,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {120366#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {120308#true} is VALID [2022-02-20 19:57:39,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {120308#true} assume !(1 == ~m_pc~0); {120308#true} is VALID [2022-02-20 19:57:39,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {120308#true} is_master_triggered_~__retres1~4#1 := 0; {120308#true} is VALID [2022-02-20 19:57:39,380 INFO L290 TraceCheckUtils]: 3: Hoare triple {120308#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {120308#true} is VALID [2022-02-20 19:57:39,380 INFO L290 TraceCheckUtils]: 4: Hoare triple {120308#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {120308#true} is VALID [2022-02-20 19:57:39,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {120308#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {120308#true} is VALID [2022-02-20 19:57:39,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {120308#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {120308#true} is VALID [2022-02-20 19:57:39,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {120308#true} assume 1 == ~t1_pc~0; {120308#true} is VALID [2022-02-20 19:57:39,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {120308#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {120308#true} is VALID [2022-02-20 19:57:39,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {120308#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {120308#true} is VALID [2022-02-20 19:57:39,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {120308#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~3#1 := #t~ret26#1;havoc #t~ret26#1; {120308#true} is VALID [2022-02-20 19:57:39,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {120308#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {120308#true} is VALID [2022-02-20 19:57:39,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {120308#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {120308#true} is VALID [2022-02-20 19:57:39,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {120308#true} assume !(1 == ~t2_pc~0); {120308#true} is VALID [2022-02-20 19:57:39,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {120308#true} is_transmit2_triggered_~__retres1~6#1 := 0; {120308#true} is VALID [2022-02-20 19:57:39,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {120308#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {120308#true} is VALID [2022-02-20 19:57:39,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {120308#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {120308#true} is VALID [2022-02-20 19:57:39,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {120308#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {120308#true} is VALID [2022-02-20 19:57:39,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {120308#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {120308#true} is VALID [2022-02-20 19:57:39,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {120308#true} assume 1 == ~t3_pc~0; {120308#true} is VALID [2022-02-20 19:57:39,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {120308#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {120308#true} is VALID [2022-02-20 19:57:39,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {120308#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {120308#true} is VALID [2022-02-20 19:57:39,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {120308#true} #t~ret28#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___2~0#1 := #t~ret28#1;havoc #t~ret28#1; {120308#true} is VALID [2022-02-20 19:57:39,382 INFO L290 TraceCheckUtils]: 23: Hoare triple {120308#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {120308#true} is VALID [2022-02-20 19:57:39,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {120308#true} assume true; {120308#true} is VALID [2022-02-20 19:57:39,382 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {120308#true} {120309#false} #904#return; {120309#false} is VALID [2022-02-20 19:57:39,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 19:57:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:39,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {120364#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {120308#true} is VALID [2022-02-20 19:57:39,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {120308#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {120308#true} is VALID [2022-02-20 19:57:39,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {120308#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {120308#true} is VALID [2022-02-20 19:57:39,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {120308#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {120308#true} is VALID [2022-02-20 19:57:39,388 INFO L290 TraceCheckUtils]: 4: Hoare triple {120308#true} assume !(1 == ~E_M~0); {120308#true} is VALID [2022-02-20 19:57:39,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {120308#true} assume 1 == ~E_1~0;~E_1~0 := 2; {120308#true} is VALID [2022-02-20 19:57:39,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {120308#true} assume 1 == ~E_2~0;~E_2~0 := 2; {120308#true} is VALID [2022-02-20 19:57:39,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {120308#true} assume 1 == ~E_3~0;~E_3~0 := 2; {120308#true} is VALID [2022-02-20 19:57:39,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {120308#true} assume true; {120308#true} is VALID [2022-02-20 19:57:39,389 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {120308#true} {120309#false} #906#return; {120309#false} is VALID [2022-02-20 19:57:39,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 19:57:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:57:39,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {120308#true} havoc ~__retres1~8; {120308#true} is VALID [2022-02-20 19:57:39,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {120308#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {120308#true} is VALID [2022-02-20 19:57:39,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {120308#true} #res := ~__retres1~8; {120308#true} is VALID [2022-02-20 19:57:39,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {120308#true} assume true; {120308#true} is VALID [2022-02-20 19:57:39,396 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {120308#true} {120309#false} #908#return; {120309#false} is VALID [2022-02-20 19:57:39,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {120308#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;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~token~0 := 0;~local~0 := 0; {120310#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:39,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {120310#(= ~M_E~0 2)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1;assume -2147483648 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 2147483647; {120310#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:39,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {120310#(= ~M_E~0 2)} assume !(0 != main_#t~nondet32#1);havoc main_#t~nondet32#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_~__retres1~9#1;havoc main2_~__retres1~9#1;assume { :begin_inline_init_model2 } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1; {120310#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:39,398 INFO L290 TraceCheckUtils]: 3: Hoare triple {120310#(= ~M_E~0 2)} assume { :end_inline_init_model2 } true;assume { :begin_inline_start_simulation2 } true;havoc start_simulation2_#t~ret30#1, start_simulation2_#t~ret31#1, start_simulation2_~kernel_st~1#1, start_simulation2_~tmp~8#1, start_simulation2_~tmp___0~4#1;havoc start_simulation2_~kernel_st~1#1;havoc start_simulation2_~tmp~8#1;havoc start_simulation2_~tmp___0~4#1;start_simulation2_~kernel_st~1#1 := 0; {120310#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:39,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {120310#(= ~M_E~0 2)} call update_channels2(); {120308#true} is VALID [2022-02-20 19:57:39,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {120308#true} assume true; {120308#true} is VALID [2022-02-20 19:57:39,399 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {120308#true} {120310#(= ~M_E~0 2)} #900#return; {120310#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:39,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {120310#(= ~M_E~0 2)} assume { :begin_inline_init_threads2 } true; {120310#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:39,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {120310#(= ~M_E~0 2)} assume 1 == ~m_i~0;~m_st~0 := 0; {120310#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:39,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {120310#(= ~M_E~0 2)} assume 1 == ~t1_i~0;~t1_st~0 := 0; {120310#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:39,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {120310#(= ~M_E~0 2)} assume 1 == ~t2_i~0;~t2_st~0 := 0; {120310#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:39,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {120310#(= ~M_E~0 2)} assume 1 == ~t3_i~0;~t3_st~0 := 0; {120310#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:39,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {120310#(= ~M_E~0 2)} assume { :end_inline_init_threads2 } true; {120310#(= ~M_E~0 2)} is VALID [2022-02-20 19:57:39,401 INFO L272 TraceCheckUtils]: 13: Hoare triple {120310#(= ~M_E~0 2)} call fire_delta_events2(); {120364#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:57:39,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {120364#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 0 == ~M_E~0;~M_E~0 := 1; {120365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:39,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {120365#(= |old(~M_E~0)| 0)} assume 0 == ~T1_E~0;~T1_E~0 := 1; {120365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:39,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {120365#(= |old(~M_E~0)| 0)} assume 0 == ~T2_E~0;~T2_E~0 := 1; {120365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:39,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {120365#(= |old(~M_E~0)| 0)} assume 0 == ~T3_E~0;~T3_E~0 := 1; {120365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:39,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {120365#(= |old(~M_E~0)| 0)} assume 0 == ~E_M~0;~E_M~0 := 1; {120365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:39,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {120365#(= |old(~M_E~0)| 0)} assume 0 == ~E_1~0;~E_1~0 := 1; {120365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:39,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {120365#(= |old(~M_E~0)| 0)} assume !(0 == ~E_2~0); {120365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:39,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {120365#(= |old(~M_E~0)| 0)} assume 0 == ~E_3~0;~E_3~0 := 1; {120365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:39,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {120365#(= |old(~M_E~0)| 0)} assume true; {120365#(= |old(~M_E~0)| 0)} is VALID [2022-02-20 19:57:39,404 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {120365#(= |old(~M_E~0)| 0)} {120310#(= ~M_E~0 2)} #902#return; {120309#false} is VALID [2022-02-20 19:57:39,404 INFO L272 TraceCheckUtils]: 24: Hoare triple {120309#false} call activate_threads2(); {120366#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} is VALID [2022-02-20 19:57:39,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {120366#(and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|) (= |old(~t2_st~0)| ~t2_st~0) (= |old(~t3_st~0)| ~t3_st~0))} havoc ~tmp~6#1;havoc ~tmp___0~3#1;havoc ~tmp___1~1#1;havoc ~tmp___2~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~4#1;havoc is_master_triggered_~__retres1~4#1; {120308#true} is VALID [2022-02-20 19:57:39,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {120308#true} assume !(1 == ~m_pc~0); {120308#true} is VALID [2022-02-20 19:57:39,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {120308#true} is_master_triggered_~__retres1~4#1 := 0; {120308#true} is VALID [2022-02-20 19:57:39,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {120308#true} is_master_triggered_#res#1 := is_master_triggered_~__retres1~4#1; {120308#true} is VALID [2022-02-20 19:57:39,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {120308#true} #t~ret25#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647;~tmp~6#1 := #t~ret25#1;havoc #t~ret25#1; {120308#true} is VALID [2022-02-20 19:57:39,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {120308#true} assume 0 != ~tmp~6#1;~m_st~0 := 0; {120308#true} is VALID [2022-02-20 19:57:39,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {120308#true} assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~5#1;havoc is_transmit1_triggered_~__retres1~5#1; {120308#true} is VALID [2022-02-20 19:57:39,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {120308#true} assume 1 == ~t1_pc~0; {120308#true} is VALID [2022-02-20 19:57:39,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {120308#true} assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~5#1 := 1; {120308#true} is VALID [2022-02-20 19:57:39,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {120308#true} is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~5#1; {120308#true} is VALID [2022-02-20 19:57:39,405 INFO L290 TraceCheckUtils]: 35: Hoare triple {120308#true} #t~ret26#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;assume -2147483648 <= #t~ret26#1 && #t~ret26#1 <= 2147483647;~tmp___0~3#1 := #t~ret26#1;havoc #t~ret26#1; {120308#true} is VALID [2022-02-20 19:57:39,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {120308#true} assume 0 != ~tmp___0~3#1;~t1_st~0 := 0; {120308#true} is VALID [2022-02-20 19:57:39,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {120308#true} assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~6#1;havoc is_transmit2_triggered_~__retres1~6#1; {120308#true} is VALID [2022-02-20 19:57:39,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {120308#true} assume !(1 == ~t2_pc~0); {120308#true} is VALID [2022-02-20 19:57:39,406 INFO L290 TraceCheckUtils]: 39: Hoare triple {120308#true} is_transmit2_triggered_~__retres1~6#1 := 0; {120308#true} is VALID [2022-02-20 19:57:39,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {120308#true} is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~6#1; {120308#true} is VALID [2022-02-20 19:57:39,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {120308#true} #t~ret27#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;assume -2147483648 <= #t~ret27#1 && #t~ret27#1 <= 2147483647;~tmp___1~1#1 := #t~ret27#1;havoc #t~ret27#1; {120308#true} is VALID [2022-02-20 19:57:39,406 INFO L290 TraceCheckUtils]: 42: Hoare triple {120308#true} assume 0 != ~tmp___1~1#1;~t2_st~0 := 0; {120308#true} is VALID [2022-02-20 19:57:39,406 INFO L290 TraceCheckUtils]: 43: Hoare triple {120308#true} assume { :begin_inline_is_transmit3_triggered } true;havoc is_transmit3_triggered_#res#1;havoc is_transmit3_triggered_~__retres1~7#1;havoc is_transmit3_triggered_~__retres1~7#1; {120308#true} is VALID [2022-02-20 19:57:39,406 INFO L290 TraceCheckUtils]: 44: Hoare triple {120308#true} assume 1 == ~t3_pc~0; {120308#true} is VALID [2022-02-20 19:57:39,406 INFO L290 TraceCheckUtils]: 45: Hoare triple {120308#true} assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~7#1 := 1; {120308#true} is VALID [2022-02-20 19:57:39,406 INFO L290 TraceCheckUtils]: 46: Hoare triple {120308#true} is_transmit3_triggered_#res#1 := is_transmit3_triggered_~__retres1~7#1; {120308#true} is VALID [2022-02-20 19:57:39,406 INFO L290 TraceCheckUtils]: 47: Hoare triple {120308#true} #t~ret28#1 := is_transmit3_triggered_#res#1;assume { :end_inline_is_transmit3_triggered } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647;~tmp___2~0#1 := #t~ret28#1;havoc #t~ret28#1; {120308#true} is VALID [2022-02-20 19:57:39,406 INFO L290 TraceCheckUtils]: 48: Hoare triple {120308#true} assume 0 != ~tmp___2~0#1;~t3_st~0 := 0; {120308#true} is VALID [2022-02-20 19:57:39,407 INFO L290 TraceCheckUtils]: 49: Hoare triple {120308#true} assume true; {120308#true} is VALID [2022-02-20 19:57:39,407 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {120308#true} {120309#false} #904#return; {120309#false} is VALID [2022-02-20 19:57:39,407 INFO L272 TraceCheckUtils]: 51: Hoare triple {120309#false} call reset_delta_events2(); {120364#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} is VALID [2022-02-20 19:57:39,407 INFO L290 TraceCheckUtils]: 52: Hoare triple {120364#(and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_3~0 |old(~E_3~0)|) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|) (= |old(~T3_E~0)| ~T3_E~0))} assume 1 == ~M_E~0;~M_E~0 := 2; {120308#true} is VALID [2022-02-20 19:57:39,407 INFO L290 TraceCheckUtils]: 53: Hoare triple {120308#true} assume 1 == ~T1_E~0;~T1_E~0 := 2; {120308#true} is VALID [2022-02-20 19:57:39,407 INFO L290 TraceCheckUtils]: 54: Hoare triple {120308#true} assume 1 == ~T2_E~0;~T2_E~0 := 2; {120308#true} is VALID [2022-02-20 19:57:39,407 INFO L290 TraceCheckUtils]: 55: Hoare triple {120308#true} assume 1 == ~T3_E~0;~T3_E~0 := 2; {120308#true} is VALID [2022-02-20 19:57:39,407 INFO L290 TraceCheckUtils]: 56: Hoare triple {120308#true} assume !(1 == ~E_M~0); {120308#true} is VALID [2022-02-20 19:57:39,407 INFO L290 TraceCheckUtils]: 57: Hoare triple {120308#true} assume 1 == ~E_1~0;~E_1~0 := 2; {120308#true} is VALID [2022-02-20 19:57:39,407 INFO L290 TraceCheckUtils]: 58: Hoare triple {120308#true} assume 1 == ~E_2~0;~E_2~0 := 2; {120308#true} is VALID [2022-02-20 19:57:39,408 INFO L290 TraceCheckUtils]: 59: Hoare triple {120308#true} assume 1 == ~E_3~0;~E_3~0 := 2; {120308#true} is VALID [2022-02-20 19:57:39,408 INFO L290 TraceCheckUtils]: 60: Hoare triple {120308#true} assume true; {120308#true} is VALID [2022-02-20 19:57:39,408 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {120308#true} {120309#false} #906#return; {120309#false} is VALID [2022-02-20 19:57:39,408 INFO L290 TraceCheckUtils]: 62: Hoare triple {120309#false} assume !false; {120309#false} is VALID [2022-02-20 19:57:39,408 INFO L290 TraceCheckUtils]: 63: Hoare triple {120309#false} start_simulation2_~kernel_st~1#1 := 1;assume { :begin_inline_eval2 } true;havoc eval2_#t~ret20#1, eval2_#t~nondet21#1, eval2_~tmp_ndt_1~0#1, eval2_#t~nondet22#1, eval2_~tmp_ndt_2~0#1, eval2_#t~nondet23#1, eval2_~tmp_ndt_3~0#1, eval2_#t~nondet24#1, eval2_~tmp_ndt_4~0#1, eval2_~tmp~5#1;havoc eval2_~tmp~5#1; {120309#false} is VALID [2022-02-20 19:57:39,408 INFO L290 TraceCheckUtils]: 64: Hoare triple {120309#false} assume !false; {120309#false} is VALID [2022-02-20 19:57:39,408 INFO L272 TraceCheckUtils]: 65: Hoare triple {120309#false} call eval2_#t~ret20#1 := exists_runnable_thread2(); {120308#true} is VALID [2022-02-20 19:57:39,408 INFO L290 TraceCheckUtils]: 66: Hoare triple {120308#true} havoc ~__retres1~8; {120308#true} is VALID [2022-02-20 19:57:39,408 INFO L290 TraceCheckUtils]: 67: Hoare triple {120308#true} assume 0 == ~m_st~0;~__retres1~8 := 1; {120308#true} is VALID [2022-02-20 19:57:39,408 INFO L290 TraceCheckUtils]: 68: Hoare triple {120308#true} #res := ~__retres1~8; {120308#true} is VALID [2022-02-20 19:57:39,409 INFO L290 TraceCheckUtils]: 69: Hoare triple {120308#true} assume true; {120308#true} is VALID [2022-02-20 19:57:39,409 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {120308#true} {120309#false} #908#return; {120309#false} is VALID [2022-02-20 19:57:39,409 INFO L290 TraceCheckUtils]: 71: Hoare triple {120309#false} assume -2147483648 <= eval2_#t~ret20#1 && eval2_#t~ret20#1 <= 2147483647;eval2_~tmp~5#1 := eval2_#t~ret20#1;havoc eval2_#t~ret20#1; {120309#false} is VALID [2022-02-20 19:57:39,409 INFO L290 TraceCheckUtils]: 72: Hoare triple {120309#false} assume 0 != eval2_~tmp~5#1; {120309#false} is VALID [2022-02-20 19:57:39,409 INFO L290 TraceCheckUtils]: 73: Hoare triple {120309#false} assume 0 == ~m_st~0;havoc eval2_~tmp_ndt_1~0#1;assume -2147483648 <= eval2_#t~nondet21#1 && eval2_#t~nondet21#1 <= 2147483647;eval2_~tmp_ndt_1~0#1 := eval2_#t~nondet21#1;havoc eval2_#t~nondet21#1; {120309#false} is VALID [2022-02-20 19:57:39,409 INFO L290 TraceCheckUtils]: 74: Hoare triple {120309#false} assume 0 != eval2_~tmp_ndt_1~0#1;~m_st~0 := 1;assume { :begin_inline_master } true;havoc master_#t~nondet19#1; {120309#false} is VALID [2022-02-20 19:57:39,409 INFO L290 TraceCheckUtils]: 75: Hoare triple {120309#false} assume !(0 == ~m_pc~0); {120309#false} is VALID [2022-02-20 19:57:39,409 INFO L290 TraceCheckUtils]: 76: Hoare triple {120309#false} assume 1 == ~m_pc~0; {120309#false} is VALID [2022-02-20 19:57:39,409 INFO L290 TraceCheckUtils]: 77: Hoare triple {120309#false} assume ~token~0 != 3 + ~local~0;assume { :begin_inline_error2 } true; {120309#false} is VALID [2022-02-20 19:57:39,410 INFO L290 TraceCheckUtils]: 78: Hoare triple {120309#false} assume !false; {120309#false} is VALID [2022-02-20 19:57:39,410 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:39,410 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:57:39,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155682167] [2022-02-20 19:57:39,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155682167] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:57:39,410 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:57:39,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 19:57:39,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365222080] [2022-02-20 19:57:39,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:57:39,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:57:39,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:57:39,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:39,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:39,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:57:39,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:57:39,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:57:39,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:57:39,460 INFO L87 Difference]: Start difference. First operand 3437 states and 4282 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:42,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:57:42,924 INFO L93 Difference]: Finished difference Result 3805 states and 4849 transitions. [2022-02-20 19:57:42,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:57:42,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2022-02-20 19:57:42,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:57:42,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:42,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 923 transitions. [2022-02-20 19:57:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 19:57:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 923 transitions. [2022-02-20 19:57:42,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 923 transitions. [2022-02-20 19:57:43,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 923 edges. 923 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:57:44,121 INFO L225 Difference]: With dead ends: 3805 [2022-02-20 19:57:44,121 INFO L226 Difference]: Without dead ends: 3664 [2022-02-20 19:57:44,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 19:57:44,123 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 736 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 19:57:44,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [756 Valid, 918 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-20 19:57:44,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3664 states.